Sciweavers

1382 search results - page 166 / 277
» Term ordering problem on MDG
Sort
View
KDD
2008
ACM
128views Data Mining» more  KDD 2008»
16 years 1 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
148views Data Mining» more  KDD 2007»
16 years 1 months ago
Scalable look-ahead linear regression trees
Most decision tree algorithms base their splitting decisions on a piecewise constant model. Often these splitting algorithms are extrapolated to trees with non-constant models at ...
David S. Vogel, Ognian Asparouhov, Tobias Scheffer
102
Voted
KDD
2006
ACM
142views Data Mining» more  KDD 2006»
16 years 1 months ago
Mining distance-based outliers from large databases in any metric space
Let R be a set of objects. An object o R is an outlier, if there exist less than k objects in R whose distances to o are at most r. The values of k, r, and the distance metric ar...
Yufei Tao, Xiaokui Xiao, Shuigeng Zhou
197
Voted
SIGMOD
2009
ACM
192views Database» more  SIGMOD 2009»
16 years 1 months ago
Scalable join processing on very large RDF graphs
With the proliferation of the RDF data format, engines for RDF query processing are faced with very large graphs that contain hundreds of millions of RDF triples. This paper addre...
Thomas Neumann, Gerhard Weikum
185
Voted
SIGMOD
2008
ACM
150views Database» more  SIGMOD 2008»
16 years 29 days ago
Query biased snippet generation in XML search
Snippets are used by almost every text search engine to complement ranking scheme in order to effectively handle user searches, which are inherently ambiguous and whose relevance ...
Yu Huang, Ziyang Liu, Yi Chen