5829 search results - page 50 / 1166 » The Practice of Cluster Analysis |
131
click to vote
ICPR
2008
IEEE
16 years 3 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...
112
click to vote
GD
2005
Springer
15 years 7 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...
118
click to vote
INFORMATICALT
2008
15 years 2 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...
108
click to vote
ICML
2007
IEEE
16 years 2 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 ...
111
click to vote
COCOON
2005
Springer
15 years 7 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 ...