Sequential combination methods for data clustering analysis

Journal of Computer Science and Technology

Volumn 17, Issue 2, 2002, Pages 118-128

  Qian, Yuntao ^a   Suen, Ching Y ^b   Tang, Yuanyan ^c  

^a ZHEJIANG UNIVERSITY   (China)

^b Dept of Electrical and Computer Engineering   (Canada)

^c HONG KONG BAPTIST UNIVERSITY   (Hong Kong)

Author keywords

Clustering combination; Clustering criterion; Linear additive model; Probabilistic relaxation

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; PATTERN RECOGNITION; PROBLEM SOLVING; RELAXATION PROCESSES;

CLUSTERING COMBINATION;

DATA REDUCTION;

EID: 0036501536     PISSN: 10009000     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF02962204     Document Type: Article

References (25)

1. A survey of recent advances in hierarchical clustering algorithms
2. Scale-based approach to hierarchical fuzzy clustering
3. Graph theoretical clustering based on limited neighborhood sets
4. Graph-theoretic methods for detecting and describing gestalt clusters
5. Estimation of generalized mixtures and its application in image segmentation
6. How many clusters? which clustering method? answers via model-based cluster analysis
7. On combining classifiers
8. Optimal combinations of pattern classifiers
9. Nearest neighbor classification from multiple feature subsets
10. Robust clustering based on global data distribution and local connectivity matrix
11. Robust clustering: An approach based on graph theory and objective function
12. J-means: A new local search heuristic for minimum sum of squares clustering
13. Relative neighborhood graphs and their relatives
14. On the foundations of relaxation labeling processes
15. An interpretation for probabilistic relaxation
16. A new probabilistic relaxation scheme
17. Stochastic relaxation, Gibbs distribution, and the Bayesian restoration of image
18. Image segmentation and labeling using the Polya Urn model
19. Relaxation processes for scene labeling convergence, speed and stability