2033 search results - page 376 / 407 » Ranking on Data Manifolds |
KDD
2007
ACM
15 years 10 months ago
2007
ACM
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...
KDD
2006
ACM
15 years 10 months ago
2006
ACM
Abstract. In this paper we present static and dynamic studies of duplicate and near-duplicate documents in the Web. The static and dynamic studies involve the analysis of similar c...
KDD
2004
ACM
15 years 10 months ago
2004
ACM
We propose a new unsupervised learning technique for extracting information from large text collections. We model documents as if they were generated by a two-stage stochastic pro...
KDD
2001
ACM
15 years 10 months ago
2001
ACM
This paper considers the framework of the so-called "market basket problem", in which a database of transactions is mined for the occurrence of unusually frequent item s...
102
Voted
WSDM
2010
ACM
15 years 7 months ago
2010
ACM
Although Web search engines are targeted towards helping people find new information, people regularly use them to re-find Web pages they have seen before. Researchers have noted ...