175 search results - page 7 / 35 » Top-Down Mining of Interesting Patterns from Very High Dimen... |
NIPS
2001
13 years 8 months ago
2001
Drawing on the correspondence between the graph Laplacian, the Laplace-Beltrami operator on a manifold, and the connections to the heat equation, we propose a geometrically motiva...
PAKDD
2010
ACM
14 years 5 days ago
2010
ACM
Abstract. Discovering interesting patterns in long sequences, and finding confident association rules within them, is a popular area in data mining. Most existing methods define...
ICDM
2007
IEEE
13 years 11 months ago
2007
IEEE
Mining frequent patterns in transaction databases has been studied extensively in data mining research. However, most of the existing frequent pattern mining algorithms do not con...
KDD
2008
ACM
14 years 7 months ago
2008
ACM
The success of popular algorithms such as k-means clustering or nearest neighbor searches depend on the assumption that the underlying distance functions reflect domain-specific n...
KDD
2002
ACM
14 years 7 months ago
2002
ACM
This paper studies the problem of categorical data clustering, especially for transactional data characterized by high dimensionality and large volume. Starting from a heuristic m...