A Distance-Type-Insensitive Clustering Approach

Gu, Xiaowei and Angelov, Plamen Parvanov and Zhao, Zhijin (2019) A Distance-Type-Insensitive Clustering Approach. Applied Soft Computing, 77. pp. 622-634. ISSN 1568-4946

[thumbnail of ASOC1]
ASOC1.pdf - Accepted Version
Available under License Creative Commons Attribution-NonCommercial-NoDerivs.

Download (2MB)


In this paper, we offer a method aiming to minimise the role of distance metric used in clustering. It is well known that the types of distance metric used in clustering algorithms heavily influence the end results, and also makes the algorithms sensitive to imbalanced attribute scales. To solve these problems, a new clustering algorithm using the per-attribute ranking operating mechanism is proposed in this paper. Ranking is a rarely used discrete, nonlinear operator by other clustering algorithms. However, it also has unique advantages over the dominantly used continuous operators. The proposed algorithm is based on the rankings of the data samples in terms of their spatial separation and is able to provide a more objective clustering result compared with the alternatives. Numerical examples on benchmark datasets prove the validity and effectiveness of the proposed concept and principles.

Item Type:
Journal Article
Journal or Publication Title:
Applied Soft Computing
Additional Information:
This is the author’s version of a work that was acceptedfor publication in Applied Soft Computing. Changes resulting from the publishing process, such as peer review, editing, corrections, structural formatting, and other quality control mechanisms may not be reflected in this document. Changes may have been made to this work since it was submitted for publication. A definitive version was subsequently published in Applied Soft Computing, 77, 2019 DOI: 10.1016/j.asoc.2019.01.028
Uncontrolled Keywords:
?? clusteringdistance metricrankingspatial separationsoftware ??
ID Code:
Deposited By:
Deposited On:
25 Jan 2019 13:45
Last Modified:
25 Apr 2024 01:59