Title: Hierarchical clustering on metric lattice
Authors: Xiangyan Meng; Muyan Liu; Jingyi Wu; Huiqiu Zhou; Fei Xu; Qiufeng Wu
Addresses: College of Science, Northeast Agricultural University, Harbin 150030, China ' College of Engineering, Northeast Agricultural University, Harbin 150030, China ' College of Science, Northeast Agricultural University, Harbin 150030, China ' College of Economics and Management, Northeast Agricultural University, Harbin 150030, China ' College of Science, Northeast Agricultural University, Harbin 150030, China ' College of Science, Northeast Agricultural University, Harbin 150030, China
Abstract: This work proposes a new clustering algorithm named 'fuzzy interval number hierarchical clustering' (FINHC) by converting original data into fuzzy interval number (FIN) firstly, then it proves F that denotes the collection of FINs is a lattice and introduces a novel metric distance based on the results from lattice theory, as well as combining them with hierarchical clustering. The relevant mathematical background about lattice theory and the specific algorithm which is used to construct FIN have been presented in this paper. Three evaluation indexes including compactness, recall and F1-measure are applied to evaluate the performance of FINHC, hierarchical clustering (HC) k-means, k-medoids, density-based spatial clustering of applications with noise (DBSCAN) in six experiments used UCI public datasets and one experiment used KEEL public dataset. The FINHC algorithm shows better clustering performance compared to other traditional clustering algorithms and the results are also discussed specifically.
Keywords: fuzzy interval number; FIN; hierarchical clustering; metric lattice; public datasets; compactness; recall; F1-measure.
DOI: 10.1504/IJIIDS.2020.108214
International Journal of Intelligent Information and Database Systems, 2020 Vol.13 No.1, pp.1 - 16
Received: 04 Mar 2019
Accepted: 03 Oct 2019
Published online: 06 Jul 2020 *