11 search results - page 1 / 3 » CLICKS: an effective algorithm for mining subspace clusters ... |
KDD
2005
ACM
14 years 5 months ago
2005
ACM
We present a novel algorithm called Clicks, that finds clusters in categorical datasets based on a search for k-partite maximal cliques. Unlike previous methods, Clicks mines subs...
ICDE
2005
IEEE
13 years 10 months ago
2005
IEEE
We present a novel algorithm called CLICKS, that finds clusters in categorical datasets based on a search for kpartite maximal cliques. Unlike previous methods, CLICKS mines subs...
KDD
2002
ACM
14 years 5 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...
ICDM
2008
IEEE
13 years 11 months ago
2008
IEEE
In the past few years there has been increased research interest in detecting previously unidentified events from Web resources. Our focus in this paper is to detect events from ...
PAKDD
2010
ACM
13 years 6 months ago
2010
ACM
Abstract. Finding correlation clusters in the arbitrary subspaces of highdimensional data is an important and a challenging research problem. The current state-of-the-art correlati...