ACM Computing Surveys (CSUR)
An introduction to support Vector Machines: and other kernel-based learning methods
An introduction to support Vector Machines: and other kernel-based learning methods
Normalized Cuts and Image Segmentation
IEEE Transactions on Pattern Analysis and Machine Intelligence
Cure: an efficient clustering algorithm for large databases
Information Systems
Fuzzy Models and Algorithms for Pattern Recognition and Image Processing
Fuzzy Models and Algorithms for Pattern Recognition and Image Processing
A Tutorial on Support Vector Machines for Pattern Recognition
Data Mining and Knowledge Discovery
CLARANS: A Method for Clustering Objects for Spatial Data Mining
IEEE Transactions on Knowledge and Data Engineering
IEEE Intelligent Systems
Kernel k-means: spectral clustering and normalized cuts
Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining
An introduction to kernel-based learning algorithms
IEEE Transactions on Neural Networks
Mercer kernel-based clustering in feature space
IEEE Transactions on Neural Networks
Hi-index | 0.00 |
In this paper, non-Euclidean metrics, such as kernel metric, Mahalanobis distance and the metric based on the shortest weighted path, are introduced into PAM and CURE clustering algorithms. The purpose is to have a detailed research on non-Euclidean metrics based clustering. Firstly, modified algorithms are established by replacing Euclidean metric with non-Euclidean metrics. Then these modified algorithms are applied on various data sets including UCI data sets as well as artificial data sets. Detailed evaluations and analysis have been made about the performances of different metrics. Experimental results demonstrate that the application scope of these clustering algorithms has been extended by adopting non-Euclidean metrics. As a result, we can conclude that the application of non-Euclidean metrics is of great importance.