528 search results - page 9 / 106 » Mining Subspace Correlations |
ICDE
2005
IEEE
14 years 1 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...
SIGMOD
1998
ACM
13 years 12 months ago
1998
ACM
Data mining applications place special requirements on clustering algorithms including: the ability to nd clusters embedded in subspaces of high dimensional data, scalability, end...
ICMCS
2008
IEEE
14 years 2 months ago
2008
IEEE
Near-duplicate image detection is a critical task in copyright protection. More challenging than the common similarity search, this task requires not only the retrieval of the top...
CEE
2010
13 years 7 months ago
2010
In this paper, we present a new algorithm for tracking the generalized signal subspace recursively. It is based on an interpretation of the generalized signal subspace as the solu...
CEC
2007
IEEE
14 years 2 months ago
2007
IEEE
— This paper proposes to incorporate bootstrap of data, random feature subspace and evolutionary algorithm with negative correlation learning to automatically design accurate and...