5046 search results - page 86 / 1010 » Non-redundant data clustering |
148
click to vote
CSB
2005
IEEE
15 years 12 months ago
2005
IEEE
With hierarchical clustering methods, divisions or fusions, once made, are irrevocable. As a result, when two elements in a bottom-up algorithm are assigned to one cluster, they c...
172
click to vote
ACMSE
2010
ACM
15 years 4 months ago
2010
ACM
This paper defines and discusses a new problem in the area of subspace clustering. It defines the problem of mining closed subspace clusters. This new concept allows for the culli...
148
click to vote
ICDM
2005
IEEE
15 years 12 months ago
2005
IEEE
Adaptive clustering uses external feedback to improve cluster quality; past experience serves to speed up execution time. An adaptive clustering environment is proposed that uses ...
183
click to vote
WG
2010
Springer
15 years 4 months ago
2010
Springer
Cluster Editing is a classical graph theoretic approach to tackle the problem of data set clustering: it consists of modifying a similarity graph into a disjoint union of cliques,...
169
click to vote
WAIM
2007
Springer
16 years 13 days ago
2007
Springer
We propose DHCS, a method of distributed, hierarchical clustering and summarization for online data analysis and mining in sensor networks. Different from the acquisition and aggre...