5829 search results - page 50 / 1166 » The Practice of Cluster Analysis |
ICPR
2008
IEEE
14 years 11 months ago
2008
IEEE
Many existing spectral clustering algorithms share a conventional graph partitioning criterion: normalized cuts (NC). However, one problem with NC is that it poorly captures the g...
GD
2005
Springer
14 years 3 months ago
2005
Springer
A clustered graph has its vertices grouped into clusters in a hierarchical way via subset inclusion, thereby imposing a tree structure on the clustering relationship. The c-planari...
INFORMATICALT
2008
13 years 10 months ago
2008
This paper studies an adaptive clustering problem. We focus on re-clustering an object set, previously clustered, when the feature set characterizing the objects increases. We prop...
ICML
2007
IEEE
14 years 10 months ago
2007
IEEE
We combine linear discriminant analysis (LDA) and K-means clustering into a coherent framework to adaptively select the most discriminative subspace. We use K-means clustering to ...
COCOON
2005
Springer
14 years 3 months ago
2005
Springer
The complexity, approximation and algorithmic issues of several clustering problems are studied. These non-traditional clustering problems arise from recent studies in microarray ...