Sciweavers

536 search results - page 32 / 108
» Learning to cluster web search results
Sort
View
WWW
2003
ACM
14 years 8 months ago
Super-peer-based routing and clustering strategies for RDF-based peer-to-peer networks
RDF-based P2P networks have a number of advantages compared with simpler P2P networks such as Napster, Gnutella or with approaches based on distributed indices such as CAN and CHO...
Alexander Löser, Christoph Schmitz, Ingo Brun...
IUI
2003
ACM
14 years 28 days ago
Adapting to the user's internet search strategy on small devices
World Wide Web search engines typically return thousands of results to the users. To avoid users browsing through the whole list of results, search engines use ranking algorithms ...
Jean-David Ruvini
JCDL
2005
ACM
116views Education» more  JCDL 2005»
14 years 1 months ago
Name disambiguation in author citations using a K-way spectral clustering method
An author may have multiple names and multiple authors may share the same name simply due to name abbreviations, identical names, or name misspellings in publications or bibliogra...
Hui Han, Hongyuan Zha, C. Lee Giles
KDD
2005
ACM
177views Data Mining» more  KDD 2005»
14 years 8 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
ICML
2005
IEEE
14 years 8 months ago
Learning from labeled and unlabeled data on a directed graph
We propose a general framework for learning from labeled and unlabeled data on a directed graph in which the structure of the graph including the directionality of the edges is co...
Bernhard Schölkopf, Dengyong Zhou, Jiayuan Hu...