Fuzzy magnetic optimization clustering algorithm with its application to health care

被引:6
作者
Kushwaha N. [1 ]
Pant M. [1 ]
机构
[1] Department of ASE, Indian Institute of Technology Roorkee, Roorkee
关键词
Data clustering; Fuzzy C-means; Magnetic field; Meta-heuristic; Optimization;
D O I
10.1007/s12652-018-0941-x
中图分类号
学科分类号
摘要
Clustering is an important tool for data mining and knowledge discovery that helps in revealing hidden structures and “clusters” found in large data sets. Fuzzy C-means (FCM) is considered to be popular data clustering method due to its capability of clustering the datasets that are uncertain, vague and/or are otherwise difficult to cluster. Although, noted both for its simplicity of implementation and its output validity, performance of FCM usually gets affected in case of poor initialization resulting in the algorithm getting trapped into a local optimum. To overcome this shortcoming, the present study proposes a novel clustering algorithm called fuzzy magnetic optimization clustering (Fuzzy-MOC) which embeds the concept of fuzzy clustering into magnetic optimization algorithm. In Fuzzy-MOC, the data points apply force directly to the magnetic particles due to which the particles change their positions in the feature space. Magnetic particles are attracted by their neighbours assumed to be in a lattice like structure. The proposed algorithm is evaluated on a set of 16 benchmark datasets taken from the UCI Machine Learning Repository including high dimensional gene expression dataset. Experimental results demonstrate that Fuzzy-MOC outperforms the other state-of-the-art algorithms in terms of different performance metrics like F1, accuracy, purity and RI measure. © Springer-Verlag GmbH Germany, part of Springer Nature 2018.
引用
收藏
页码:1053 / 1062
页数:9
相关论文
共 24 条
  • [1] Arzeno N.M., Vikalo H., Semi-supervised affinity propagation with soft instance-level constraints, IEEE Trans Pattern Anal Mach Intell, 37, pp. 1041-1052, (2015)
  • [2] Babu G.P., Murty M.N., Clustering with evolution strategies, Pattern Recognit, 27, pp. 321-329, (1994)
  • [3] Bandyopadhyay S., Maulik U., An evolutionary technique based on K-means algorithm for optimal clustering in RN, Inf Sci (N Y), 146, pp. 221-237, (2002)
  • [4] Barabasi A.-L., Albert R., Jeong H., Scale-free characteristics of random networks: the topology of the world-wide web, Phys A Stat Mech its Appl, 281, pp. 69-77, (2000)
  • [5] Bezdek J.C., Ehrlich R., Full W., FCM: the fuzzy c-means clustering algorithm, Comput Geosci, 10, pp. 191-203, (1984)
  • [6] Everitt B.S., Landau S., Leese M., Stahl D., Cluster analysis, (2011)
  • [7] Gionis A., Mannila H., Tsaparas P., Clustering aggregation, ACM Trans Knowl Disc Data (TKDD), 1, 1, (2007)
  • [8] Guha S., Rastogi R., Shim K., Rock: a robust clustering algorithm for categorical attributes, Inf Syst, 25, pp. 345-366, (2000)
  • [9] Han J., Pei J., Kamber M., Data mining: concepts and techniques, (2011)
  • [10] Holme P., Kim B.J., Growing scale-free networks with tunable clustering, Phys Rev E Stat Phys Plasmas Fluids Relat Interdiscip Top, 65, pp. 2-5, (2002)