106 search results - page 7 / 22 » kdd 2002 |
KDD
2002
ACM
14 years 10 months ago
2002
ACM
The goal of clustering is to identify distinct groups in a dataset. Compared to non-parametric clustering methods like complete linkage, hierarchical model-based clustering has th...
KDD
2002
ACM
14 years 10 months ago
2002
ACM
Part of the process of data integration is determining which sets of identifiers refer to the same real-world entities. In integrating databases found on the Web or obtained by us...
KDD
2002
ACM
14 years 10 months ago
2002
ACM
Privacy considerations often constrain data mining projects. This paper addresses the problem of association rule mining where transactions are distributed across sources. Each si...
KDD
2002
ACM
14 years 10 months ago
2002
ACM
Class membership probability estimates are important for many applications of data mining in which classification outputs are combined with other sources of information for decisi...
KDD
2002
ACM
14 years 10 months ago
2002
ACM
We introduce a new algorithm for mining sequential patterns. Our algorithm is especially efficient when the sequential patterns in the database are very long. We introduce a novel...