Sciweavers

4972 search results - page 78 / 995
» Ranking on graph data
Sort
View
ICDM
2006
IEEE
123views Data Mining» more  ICDM 2006»
15 years 10 months ago
Cluster Ranking with an Application to Mining Mailbox Networks
Ziv Bar-Yossef, Ido Guy, Ronny Lempel, Yoëlle...
WWW
2007
ACM
16 years 4 months ago
Dynamic personalized pagerank in entity-relation graphs
Extractors and taggers turn unstructured text into entityrelation (ER) graphs where nodes are entities (email, paper, person, conference, company) and edges are relations (wrote, ...
Soumen Chakrabarti
KDD
2005
ACM
177views Data Mining» more  KDD 2005»
16 years 4 months ago
Query chains: learning to rank from implicit feedback
This paper presents a novel approach for using clickthrough data to learn ranked retrieval functions for web search results. We observe that users searching the web often perform ...
Filip Radlinski, Thorsten Joachims
AAAI
2008
15 years 6 months ago
Efficient Querying Relaxed Dominant Relationship between Product Items Based on Rank Aggregation
Current search engines cannot effectively rank those relational data, which exists on dynamic websites supported by online databases. In this study, to rank such structured data, ...
Zhenglu Yang, Lin Li, Masaru Kitsuregawa
136
Voted
WWW
2010
ACM
15 years 11 months ago
Sampling high-quality clicks from noisy click data
Click data captures many users’ document preferences for a query and has been shown to help significantly improve search engine ranking. However, most click data is noisy and of...
Adish Singla, Ryen W. White