30 search results - page 3 / 6 » An extended version of the k-means method for overlapping cl... |
CSB
2005
IEEE
14 years 29 days 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...
ASC
2008
13 years 7 months ago
2008
: Discovering interesting patterns or substructures in data streams is an important challenge in data mining. Clustering algorithms are very often applied to identify single substr...
IV
2008
IEEE
14 years 1 months ago
2008
IEEE
Given a group of overlapping sets, it is not always possible to represent it with Euler diagrams. Euler diagram characteristics might collide with the sets relationships to depict...
SPAA
2012
ACM
11 years 9 months ago
2012
ACM
GPU-based heterogeneous clusters continue to draw attention from vendors and HPC users due to their high energy efficiency and much improved single-node computational performance...
EUROPAR
2004
Springer
13 years 11 months ago
2004
Springer
Hierarchical agglomerative clustering (HAC) is a common clustering method that outputs a dendrogram showing all N levels of agglomerations where N is the number of objects in the d...