Sciweavers

6095 search results - page 1130 / 1219
» Learning in Local Search
Sort
View
KDD
2007
ACM
177views Data Mining» more  KDD 2007»
16 years 4 months ago
Mining optimal decision trees from itemset lattices
We present DL8, an exact algorithm for finding a decision tree that optimizes a ranking function under size, depth, accuracy and leaf constraints. Because the discovery of optimal...
Élisa Fromont, Siegfried Nijssen
IUI
2010
ACM
16 years 1 months ago
Tell me more, not just "more of the same"
The Web makes it possible for news readers to learn more about virtually any story that interests them. Media outlets and search engines typically augment their information with l...
Francisco Iacobelli, Larry Birnbaum, Kristian J. H...
WSDM
2009
ACM
191views Data Mining» more  WSDM 2009»
15 years 11 months ago
Generating labels from clicks
The ranking function used by search engines to order results is learned from labeled training data. Each training point is a (query, URL) pair that is labeled by a human judge who...
Rakesh Agrawal, Alan Halverson, Krishnaram Kenthap...
AIRWEB
2009
Springer
15 years 11 months ago
Tag spam creates large non-giant connected components
Spammers in social bookmarking systems try to mimick bookmarking behaviour of real users to gain the attention of other users or search engines. Several methods have been proposed...
Nicolas Neubauer, Robert Wetzker, Klaus Obermayer
JCDL
2009
ACM
179views Education» more  JCDL 2009»
15 years 10 months ago
Disambiguating authors in academic publications using random forests
Users of digital libraries usually want to know the exact author or authors of an article. But different authors may share the same names, either as full names or as initials and...
Pucktada Treeratpituk, C. Lee Giles
« Prev « First page 1130 / 1219 Last » Next »