1541 search results - page 22 / 309 » From Comparing Clusterings to Combining Clusterings |
153
click to vote
ICTAI
2006
IEEE
16 years 3 days 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...
164
click to vote
IDA
2005
Springer
15 years 11 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...
168
click to vote
INCDM
2010
Springer
15 years 4 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...
185
Voted
IPPS
2010
IEEE
15 years 4 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...
160
Voted
ATAL
2006
Springer
15 years 9 months 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...