Rights statement: 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
Accepted author manuscript, 2.83 MB, PDF document
Available under license: CC BY-NC-ND: Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License
Final published version
Research output: Contribution to Journal/Magazine › Journal article › peer-review
Research output: Contribution to Journal/Magazine › Journal article › peer-review
}
TY - JOUR
T1 - A Distance-Type-Insensitive Clustering Approach
AU - Gu, Xiaowei
AU - Angelov, Plamen Parvanov
AU - Zhao, Zhijin
N1 - 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
PY - 2019/4/1
Y1 - 2019/4/1
N2 - 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.
AB - 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.
KW - clustering
KW - distance metric
KW - ranking
KW - spatial separation
U2 - 10.1016/j.asoc.2019.01.028
DO - 10.1016/j.asoc.2019.01.028
M3 - Journal article
VL - 77
SP - 622
EP - 634
JO - Applied Soft Computing
JF - Applied Soft Computing
SN - 1568-4946
ER -