A novel construction of connectivity graphs for clustering and visualization

WSEAS Transactions on Computers

Volumn 7, Issue 5, 2008, Pages 424-434

  Barbakh, Wesam ^a   Fyfe, Colin ^a  

^a UNIVERSITY OF THE WEST OF SCOTLAND   (United Kingdom)

Author keywords

Clustering; Connectivity graph; K means; Similarity function; Topographic mapping; Visualisation

Indexed keywords

ALGORITHMS; CANNING; CLUSTER ANALYSIS; FLOW OF SOLIDS; GRAPH THEORY;

CLUSTERING; CLUSTERING PROBLEMS; CONNECTIVITY GRAPH; CONNECTIVITY GRAPHS; K-MEANS; LOCAL OPTIMUM; NEW ALGORITHM; NOVEL CONSTRUCTION; OPTIMAL CLUSTERING; REAL DATA; SIMILARITY FUNCTION; SIMILARITY FUNCTIONS; TOPOGRAPHIC MAPPING; TOPOLOGY PRESERVING; VISUALISATION;

CLUSTERING ALGORITHMS;

EID: 48749129217     PISSN: 11092750     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (32)

1. E. Anderson. The irises of the gaspe peninsula. Bulletin of the American Iris Society, 59:2-5, 1935.
2. D. Arthur and S. Vassilvitskii. K-means++: The advantages of careful seeding. In Bay Area Theory Symposium, BATS 06, 2006. http:// www.stanford.edu/~sergeiv/papers/kMeansPP-soda.pdf.
3. W. Barbakh. The family of inverse exponential k-means algorithms. Computing and Information Systems, 11(1):1-10, February 2007.
4. W. Barbakh. Local versus Global Interactions in Clustering Algorithms. PhD thesis, School of Computing, University of the West of Scotland, UK, 2008.
5. W. Barbakh, M. Crowe, and C. Fyfe. A family of novel clustering algorithms. In 7th international conference on intelligent data engineering and automated learning, IDEAL2006, pages 283-290, University of Burgos, Spain, September 2006. Springer.
6. W. Barbakh and C. Fyfe. Clustering with reinforcement learning. In International Conference on Intelligent Data Engineering and Automated Learning IDEAL'07, pages 507-516, University of Birmingham, UK, December 2007. Springer. LNCS 4881.
7. W. Barbakh and C. Fyfe. Inverse weighted clustering algorithm. Computing and Information Systems, 11(2):10-18, May 2007.
8. W. Barbakh and C. Fyfe. Tailoring local and global interactions in clustering algorithms. Technical Report 40, School of Computing, University of the West of Scotland, University of Paisley, UK, March 2007.
9. W. Barbakh and C. Fyfe. Clustering and visualization with alternative similarity functions. In The 7th WSEAS international conference on artificial intelligence, knowledge, engineering and data bases, AIKED'08, pages 238-244, University of Cambridge, UK, February 2008.
10. C. M. Bishop, M. Svensen, and C. K. I. Williams. Gtm: The generative topographic mapping. Neural Computation, 10(1):215-234, 1997.
11. C. M. Bishop, M. Svensen, and C. K. I. Williams. Magnification factors for the gtm algorithm. In Proceeding of the IEE 5th International Conference on Artificial Neural Networks, Cambridge, UK, pages 64-69, 1997.
12. C. M. Bishop, M. Svensen, and C. K. I. Williams. Developments of the generative topographic mapping. Neurocomputing, 21(1):203-224, 1998.
13. R.A. Fisher. The use of multiple measurements in taxonomic problems. Annals of Eugenics 7, pages 179-188, 1936.
14. B. Flury and H. Riedwyl. Multivariate Statistics: A practical approach. Cambridge University Press, 1988.
15. C. Fyfe. Two topographic maps for data visualization. Data Mining and Knowledge Discovery, 14:207-224, 2007.
16. J. Hartigan and M. Wang. A k-means clustering algorithm. Applied Statistics, 28:100-108, 1979.
17. T. Kohonen. Self-Organization and Associative Memory. Springer-Verlag, 1984.
18. T. Kohonen. Self-Organising Maps. Springer, 1995.
19. A. Likas, N. Vlassis, and J. J. Verbeek. The global k-means clustering algorithm. Pattern Recognition 36, pages 451-461, 2003.
20. S. P. Lloyd. Least squares quantization in pcm. Technical note Bell Laboratories, 1957. Published in 1982 in IEEE Transactions on Information Theory 28, 128-137.
21. U. V. Luxburg. A tutorial on spectral clustering. Technical Report TR-149, Max Planck Institute for Biological Cybernetics, March 2007.
22. D. J. MacKay. Information Theory, Inference, and Learning Algorithms. Cambridge University Press., 2003.
23. J. MacQueen. Some methods for classification and analysis of multivariate observations. Proceedings of the fifth Berkeley symposium on mathematical statistics and probability, pages 281-297, 1967.
24. S. McGlinchey and M. Pena. Quantization errors in the harmonic topographic mapping. In The 9th WSEAS International Conference on applied mathematics, MATH 06, pages 105-110, May 2006.
25. A. Y. Ng, M. Jordan, and Y. Weiss. On spectral clustering: Analysis and an algorithm. In Proc. of NIPS-14, pages 849-856, 2001. http:// ai.stanford.edu/~ang/papers/nips01-spectral.ps.
26. M. Pena, W. Barbakh, and C. Fyfe. Principal Manifolds for Data Visualization and Dimension Reduction, chapter Topology-Preserving Mappings for Data Visualisation, pages 132-152. Springer, 2007.
27. M. Pena and C. Fyfe. The harmonic topographic map. Technical Report 35, School of Computing, University of Paisley, 2005.
28. J. Shi and J. Malik. Normalized cuts and image segmentation. IEEE Transactions on Pattern Analysis and Machine Intelligence, 22(8):888-905, 2000.
29. M. Svensen. GTM: The Generative Topographic Mapping. PhD thesis, Aston University, Birmingham, UK, 1998.
30. P. Tino and I. Nabney. Hierarchical gtm: constructing localized non-linear projection manifolds in a principled way. (IEEE) Transaction on Pattern Analysis and Machine Intelligence, 24(5):639-656, 2001.
31. B. Zhang. Generalized k-harmonic means - boosting in unsupervised learning. Technical report, HP Laboratories, Palo Alto, October 2000.
32. B. Zhang, M. Hsu, and U. Dayal. K-harmonic means - a data clustering algorithm. Technical report, HP Laboratories, Palo Alto, October 1999.