5046 search results - page 150 / 1010 » Non-redundant data clustering |
168
click to vote
ICCS
2004
Springer
15 years 12 months ago
2004
Springer
This paper gives a theoretical framework for clustering a set of conceptual graphs characterized by sparse descriptions. The formed clusters are named in an intelligible manner thr...
190
click to vote
ICDM
2002
IEEE
15 years 11 months ago
2002
IEEE
It is well-known that for high dimensional data clustering, standard algorithms such as EM and the K-means are often trapped in local minimum. Many initialization methods were pro...
144
click to vote
ICPR
2010
IEEE
15 years 4 months ago
2010
IEEE
Although many methods of refining initialization have appeared, the sensitivity of K-Means to initial centers is still an obstacle in applications. In this paper, we investigate a...
176
click to vote
PODS
2008
ACM
16 years 6 months ago
2008
ACM
There is an increasing quantity of data with uncertainty arising from applications such as sensor network measurements, record linkage, and as output of mining algorithms. This un...
193
click to vote
BMCBI
2008
15 years 6 months ago
2008
Background: Microarray gene expression data are often analyzed together with corresponding physiological response and clinical metadata of biological subjects, e.g. patients'...