12519 search results - page 2273 / 2504 » Approximation Problems Categories |
139
click to vote
KDD
2007
ACM
16 years 5 months ago
2007
ACM
We present a document routing and index partitioning scheme for scalable similarity-based search of documents in a large corpus. We consider the case when similarity-based search ...
181
click to vote
KDD
2007
ACM
16 years 5 months ago
2007
ACM
A good distance metric is crucial for many data mining tasks. To learn a metric in the unsupervised setting, most metric learning algorithms project observed data to a lowdimensio...
171
click to vote
KDD
2007
ACM
16 years 5 months ago
2007
ACM
The discovery of subsets with special properties from binary data has been one of the key themes in pattern discovery. Pattern classes such as frequent itemsets stress the co-occu...
172
click to vote
KDD
2007
ACM
16 years 5 months ago
2007
ACM
In some applications such as filling in a customer information form on the web, some missing values may not be explicitly represented as such, but instead appear as potentially va...
135
Voted
KDD
2007
ACM
16 years 5 months ago
2007
ACM
In this paper we address the problem of detecting topics in large-scale linked document collections. Recently, topic detection has become a very active area of research due to its...