In the past few years, there has been much work on incorporating fairness requirements into algorithmic rankers, with contributions coming from data management, algorithms, information retrieval, and recommender systems communities. this survey, we give a systematic overview of work, offering broad perspective that connects formalizations approaches across sub-fields. An important contribution ...

Path Ranking Algorithm (PRA) addresses classification and retrieval tasks using learned combinations of labeled paths through a graph. Unlike most Statistical Relational Learning (SRL) methods, PRA scales to large data sets but uses a limited set of paths in its models—ones that correspond to short first order rules with no constants. We consider extending PRA in two ways—learning paths that co...

We present a filtering method for 2D curvilinear structures, called RORPO (Ranking the Orientation Responses of Path Operators). RORPO is based on path operators, a recently developed family of mathematical morphology filters. Compared with state of the art methods, RORPO is non–local and well adapted to the intrinsic anisotropy of curvilinear structures. Since RORPO does not depend on a linear...

An iterative regularization path with structural sparsity is proposed in this paper based on variable splitting and the Linearized Bregman Iteration, hence called Split LBI. Despite its simplicity, Split LBI outperforms the popular generalized Lasso in both theory and experiments. A theory of path consistency is presented that equipped with a proper early stopping, Split LBI may achieve model s...

Many of the problems with native XML databases relate to query performance and subsequently, it can be difficult to convince traditional database users of the benefits of using semior unstructured databases. Presently, there still lacks an index structure providing efficient support for structural queries and the traditional data-centric and content queries. This paper presents an extended inde...

In this paperwe comparepronoun resolution algorithmsand introduce a centering algorithm(LeftRightCentering) that adheres to the constraints and rules of centering theory and is an alternative to Brennan, Friedman, and Pollard’s (1987) algorithm. We then use the Left-Right Centering algorithm to see if two psycholinguistic claims on Cf-list ranking will actually improve pronoun resolution accura...

This paper describes the approaches and results of our system for the NTCIR-10 INTENT task. We present some methods for Subtopic Mining subtask and Document Ranking subtask. In the Subtopic Mining subtask, we employ a voting method to rank candidate subtopics and semantic resource HowNet was used to merge those candidate subtopics which may impact diversity. In the Document Ranking Subtask, we ...

Correct scheduling of the project is the necessary condition for the project success. In traditional models, the activities duration times are deterministic and known. In real world however, accurate calculation of time for performing each activity is not possible and is always faced with uncertainty. In this paper, the duration of each activity is estimated by the experts as linguistic variabl...

Semantic similarity measures have been used successfully and extensively in the biomedical research with various applications. As the biomedical ontologies, which form the main ground for most of the similarity measures, are growing and progressing towards more completeness and higher accuracy, the results and outcomes of these semantic similarity measures become more acceptable and more reliab...