Sciweavers

696 search results - page 4 / 140
» Maximum Margin Ranking Algorithms for Information Retrieval
Sort
View
WWW
2008
ACM
14 years 8 months ago
Ranking refinement and its application to information retrieval
We consider the problem of ranking refinement, i.e., to improve the accuracy of an existing ranking function with a small set of labeled instances. We are, particularly, intereste...
Rong Jin, Hamed Valizadegan, Hang Li
DATAMINE
2010
133views more  DATAMINE 2010»
13 years 7 months ago
Using background knowledge to rank itemsets
Assessing the quality of discovered results is an important open problem in data mining. Such assessment is particularly vital when mining itemsets, since commonly many of the disc...
Nikolaj Tatti, Michael Mampaey
NIPS
2008
13 years 9 months ago
Inferring rankings under constrained sensing
Motivated by applications like elections, web-page ranking, revenue maximization etc., we consider the question of inferring popular rankings using constrained data. More specific...
Srikanth Jagabathula, Devavrat Shah
APWEB
2003
Springer
14 years 23 days ago
A Framework for Decentralized Ranking in Web Information Retrieval
Search engines are among the most important applications or services on the web. Most existing successful search engines use global ranking algorithms to generate the ranking of do...
Karl Aberer, Jie Wu
CIKM
2009
Springer
14 years 2 months ago
Learning to rank graphs for online similar graph search
Many applications in structure matching require the ability to search for graphs that are similar to a query graph, i.e., similarity graph queries. Prior works, especially in chem...
Bingjun Sun, Prasenjit Mitra, C. Lee Giles