Sciweavers

5580 search results - page 939 / 1116
» Randomized priority algorithms
Sort
View
KDD
2009
ACM
156views Data Mining» more  KDD 2009»
14 years 10 months ago
Collusion-resistant anonymous data collection method
The availability and the accuracy of the data dictate the success of a data mining application. Increasingly, there is a need to resort to on-line data collection to address the p...
Mafruz Zaman Ashrafi, See-Kiong Ng
KDD
2008
ACM
128views Data Mining» more  KDD 2008»
14 years 10 months ago
Bypass rates: reducing query abandonment using negative inferences
We introduce a new approach to analyzing click logs by examining both the documents that are clicked and those that are bypassed--documents returned higher in the ordering of the ...
Atish Das Sarma, Sreenivas Gollapudi, Samuel Ieong
KDD
2007
ACM
192views Data Mining» more  KDD 2007»
14 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
2006
ACM
162views Data Mining» more  KDD 2006»
14 years 10 months ago
Simultaneous record detection and attribute labeling in web data extraction
Recent work has shown the feasibility and promise of templateindependent Web data extraction. However, existing approaches use decoupled strategies ? attempting to do data record ...
Jun Zhu, Zaiqing Nie, Ji-Rong Wen, Bo Zhang, Wei-Y...
KDD
2003
ACM
122views Data Mining» more  KDD 2003»
14 years 10 months ago
Natural communities in large linked networks
We are interested in finding natural communities in largescale linked networks. Our ultimate goal is to track changes over time in such communities. For such temporal tracking, we...
John E. Hopcroft, Omar Khan, Brian Kulis, Bart Sel...