1804 search results - page 330 / 361 » Ranking for data repairs |
103
click to vote
KDD
2007
ACM
16 years 7 days 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
16 years 7 days 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...
111
click to vote
KDD
2004
ACM
16 years 7 days 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
16 years 7 days 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...
115
click to vote
WSDM
2010
ACM
15 years 9 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 ...