A survey of top-k query processing techniques in relational database systems

IF Ilyas, G Beskales, MA Soliman - ACM Computing Surveys (CSUR), 2008 - dl.acm.org
Efficient processing of top-k queries is a crucial requirement in many interactive
environments that involve massive amounts of data. In particular, efficient top-k processing …

[PDF][PDF] Sentiwordnet 3.0: an enhanced lexical resource for sentiment analysis and opinion mining.

S Baccianella, A Esuli, F Sebastiani - Lrec, 2010 - lrec-conf.org
In this work we present SENTIWORDNET 3.0, a lexical resource explicitly devised for
supporting sentiment classification and opinion mining applications. SENTIWORDNET 3.0 is …

[KİTAP][B] Who's# 1? The science of rating and ranking

AN Langville, CD Meyer - 2012 - degruyter.com
A website's ranking on Google can spell the difference between success and failure for a
new business. NCAA football ratings determine which schools get to play for the big money …

Towards scaling fully personalized pagerank: Algorithms, lower bounds, and experiments

D Fogaras, B Rácz, K Csalogány, T Sarlós - Internet Mathematics, 2005 - Taylor & Francis
Personalized PageRank expresses link-based page quality around userselected pages in a
similar way as PageRank expresses quality over the entire web. Existing personalized …

Link analysis ranking: algorithms, theory, and experiments

A Borodin, GO Roberts, JS Rosenthal… - ACM Transactions on …, 2005 - dl.acm.org
The explosive growth and the widespread accessibility of the Web has led to a surge of
research activity in the area of information retrieval on the World Wide Web. The seminal …

A personalized search engine based on web-snippet hierarchical clustering

P Ferragina, A Gulli - Special interest tracks and posters of the 14th …, 2005 - dl.acm.org
In this paper we propose a hierarchical clustering engine, called snaket, that is able to
organize on-the-fly the search results drawn from 16 commodity search engines into a …

[PDF][PDF] Rank aggregation algorithms for fair consensus

C Kuhlman, E Rundensteiner - Proceedings of the VLDB Endowment, 2020 - par.nsf.gov
Aggregating multiple rankings in a database is an important task well studied by the
database community. High-stakes application domains include hiring, lending, and …

Rank aggregation methods dealing with ordinal uncertain preferences

E Dopazo, ML Martínez-Céspedes - Expert Systems with Applications, 2017 - Elsevier
The problem of rank aggregation, also known as group-ranking, arises in many fields such
as metasearch engines, information retrieval, recommendation systems and multicriteria …

[PDF][PDF] Pageranking wordnet synsets: An application to opinion mining

A Esuli, F Sebastiani - Proceedings of the 45th Annual Meeting of …, 2007 - aclanthology.org
This paper presents an application of PageR-ank, a random-walk model originally devised
for ranking Web search results, to ranking WordNet synsets in terms of how strongly they …

Label ranking algorithms: A survey

S Vembu, T Gärtner - Preference learning, 2010 - Springer
Label ranking is a complex prediction task where the goal is to map instances to a total order
over a finite set of predefined labels. An interesting aspect of this problem is that it subsumes …