An expert search system assists users with their “expertise need” by suggesting people with relevant expertise to their query. Most systems work by ranking documents in response to the query, then ranking the candidates using information from this initial document ranking and known associations between documents and candidates. In this paper, we aim to determine whether we can approximate an ev...

We propose an approach for automatically ranking structured documents applied to patent prior art search. Our model, SVM Patent Ranking (SVMPR) incorporates margin constraints that directly capture the specificities of patent citation ranking. Our approach combines patent domain knowledge features with meta-score features from several different general Information Retrieval methods. The trainin...

A constructive lower bound on the quasi-Ramsey numbers and the tournament ranking function was obtained in [S. Poljak, V. Rödl, and J. Spencer, SIAM J. Discrete Math., (1) 1988, pp. 372–376]. We consider the weighted versions of both problems. Our method yields a polynomial time heuristic with guaranteed lower bound for the linear ordering problem.

We solve the problem of collusion in massive online tournaments (of formal scientific communities) which, surprisingly, has a simple yet rather counterintuitive solution. The solution requires that we collect the participants’ side-choices of whether they want to be proponent or opponent of a given claim, leading to the concept of a forced player or a devil’s advocate. In the presence of side-c...

Abs t r ac t . Showing equivalence of two systems at different levels of abstraction often entails mapping a single step in one system to a sequence of steps in the other, where the relevant state information does not change until the last step. In [BCG 88,dNV 90], bisimulations that take into account such "stuttering" are formulated. These definitions are, however, difficult to use in proofs o...

This paper describes our approaches and results in NTCIR11 IMine task. In 2014, we participate in subtasks for Chinese/English Subtopic Mining and Chinese Document Ranking. In Subtopic Mining subtask, we mine subtopic candidates from various resources and construct the subtopic hierarchy with several different strategies. In Document Ranking subtask, we rerank the result lists with HITS algorit...

We describe a new approach to proving termination with size change graphs. This is the first decision procedure for size change termination (SCT) which makes direct use of global ranking functions. It handles a well-defined and significant subset of SCT instances, designed to be amenable to a SAT-based solution. We have implemented the approach using a state-of-the-art Boolean satisfaction solv...

In system Z, reasoning is done with respect to a unique minimal ranking function obtained from a partitioning of the conditionals in a knowledge base. In this paper, we extend system Z, a recent proposal for a system Z-like approch to firstorder conditionals. We introduce the notion of tolerance pair and show how sceptical Z-inference can be defined and implemented by taking all minimal toleran...

Our research addresses the task of updating legal documents when new information emerges. In this paper, we employ a hierarchical ranking model to the task of updating legal documents. Word clustering features are incorporated to the ranking models to exploit semantic relations between words. Experimental results on legal data built from the United States Code show that the hierarchical ranking...

In our previous study, focusing on a ranking determination, we developed two ranking models. The foundation of these ranking models is derived from either one of the two ranking methods, denoted by Ranking (I) and Ranking (II), that were proposed in our previous papers. The purpose of this paper is to analyze the mathematical structure in the process of generating Ranking (I) and Ranking (II) i...