1541 search results - page 22 / 309 » From Comparing Clusterings to Combining Clusterings |
ICTAI
2006
IEEE
14 years 3 months ago
2006
IEEE
We propose two Euclidean minimum spanning tree based clustering algorithms — one a k-constrained, and the other an unconstrained algorithm. Our k-constrained clustering algorith...
IDA
2005
Springer
14 years 2 months ago
2005
Springer
With the invention of biotechnological high throughput methods like DNA microarrays and the analysis of the resulting huge amounts of biological data, clustering algorithms gain ne...
INCDM
2010
Springer
13 years 7 months ago
2010
Springer
Many real world systems can be modeled as networks or graphs. Clustering algorithms that help us to organize and understand these networks are usually referred to as, graph based c...
IPPS
2010
IEEE
13 years 7 months ago
2010
IEEE
Complex networks capture interactions among entities in various application areas in a graph representation. Analyzing large scale complex networks often answers important question...
ATAL
2006
Springer
14 years 22 days ago
2006
Springer
Numerous domains ranging from distributed data acquisition to knowledge reuse need to solve the cluster ensemble problem of combining multiple clusterings into a single unified cl...