Sciweavers

1308 search results - page 190 / 262
» Competitor Mining with the Web
Sort
View
KDD
2007
ACM
192views Data Mining» more  KDD 2007»
15 years 10 months ago
Active exploration for learning rankings from clickthrough data
We address the task of learning rankings of documents from search engine logs of user behavior. Previous work on this problem has relied on passively collected clickthrough data. ...
Filip Radlinski, Thorsten Joachims
KDD
2005
ACM
177views Data Mining» more  KDD 2005»
15 years 10 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
KDD
2003
ACM
217views Data Mining» more  KDD 2003»
15 years 10 months ago
Algorithms for estimating relative importance in networks
Large and complex graphs representing relationships among sets of entities are an increasingly common focus of interest in data analysis--examples include social networks, Web gra...
Scott White, Padhraic Smyth
WSDM
2010
ACM
210views Data Mining» more  WSDM 2010»
15 years 7 months ago
Leveraging Temporal Dynamics of Document Content in Relevance Ranking
Many web documents are dynamic, with content changing in varying amounts at varying frequencies. However, current document search algorithms have a static view of the document con...
Jonathan L. Elsas, Susan T. Dumais
ICWS
2009
IEEE
15 years 7 months ago
Service-Oriented Architecture for Privacy-Preserving Data Mashup
Mashup is a web technology that combines information from more than one source into a single web application. This technique provides a new platform for different data providers t...
Thomas Trojer, Benjamin C. M. Fung, Patrick C. K. ...