A Novel Path-Based Clustering Algorithm Using Multi-dimensional Scaling

Authors:
Uyen T. Nguyen;Laurence A. Park;Liang Wang;Kotagiri Ramamohanarao
Affiliations:
Department of Computer Science and Software Engineering, The University of Melbourne, Victoria, Australia 3010;Department of Computer Science and Software Engineering, The University of Melbourne, Victoria, Australia 3010;Department of Computer Science and Software Engineering, The University of Melbourne, Victoria, Australia 3010;Department of Computer Science and Software Engineering, The University of Melbourne, Victoria, Australia 3010
Venue:
AI '09 Proceedings of the 22nd Australasian Joint Conference on Advances in Artificial Intelligence
Year:
2009

Citing 12
Cited 0

Introduction to algorithms

Introduction to algorithms
Nonlinear component analysis as a kernel eigenvalue problem

Neural Computation
Normalized Cuts and Image Segmentation

IEEE Transactions on Pattern Analysis and Machine Intelligence
Path Based Pairwise Data Clustering with Application to Texture Segmentation

EMMCVPR '01 Proceedings of the Third International Workshop on Energy Minimization Methods in Computer Vision and Pattern Recognition
Path-Based Clustering for Grouping of Smooth Curves and Texture Segmentation

IEEE Transactions on Pattern Analysis and Machine Intelligence
Bagging for Path-Based Clustering

IEEE Transactions on Pattern Analysis and Machine Intelligence
Kernel k-means: spectral clustering and normalized cuts

Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining
Document Clustering Using Locality Preserving Indexing

IEEE Transactions on Knowledge and Data Engineering
Robust path-based spectral clustering

Pattern Recognition
A tutorial on spectral clustering

Statistics and Computing
Data Clustering: User's Dilemma

MLDM '07 Proceedings of the 5th international conference on Machine Learning and Data Mining in Pattern Recognition
Data Clustering: 50 Years Beyond K-means

ECML PKDD '08 Proceedings of the 2008 European Conference on Machine Learning and Knowledge Discovery in Databases - Part I

Quantified Score

Hi-index	0.00

Visualization

Abstract

Data clustering is a difficult and challenging task, especially when the hidden clusters are of different shapes and non-linearly separable in the input space. This paper addresses this problem by proposing a new method that combines a path-based dissimilarity measure and multi-dimensional scaling to effectively identify these complex separable structures. We show that our algorithm is able to identify clearly separable clusters of any shape or structure. Thus showing that our algorithm produces model clusters; that follow the definition of a cluster.