Searching for just a few words should be enough to get started. If you need to make more complex queries, use the tips below to guide you.
Article type: Research Article
Authors: Li, Guanga | Mahmoudi, Mohammad Rezab; c; * | Qasem, Sultan Nomand; e | Tuan, Bui Anhf | Pho, Kim-Hungg
Affiliations: [a] Institute of Data Science, City University of Macau, Macau | [b] Institute of Research and Development, Duy Tan University, Da Nang, Vietnam | [c] Department of Statistics, Faculty of Science, Fasa University, Fasa, Iran | [d] Department of Computer Science, College of Computer and Information Sciences, AI Imam Mohammad Ibn Saud Islamic University (IMSIU), Riyadh, Saudi Arabia | [e] Department of Computer Science, Faculty of Applied Science, Taiz University, Taiz, Yemen | [f] Department of Mathematics Education, Teachers College, Can Tho University, Can Tho City, Vietnam | [g] Fractional Calculus, Optimization and Algebra Research Group, Faculty of Mathematics and Statistics, Ton Duc Thang University, Ho Chi Minh City, Vietnam
Correspondence: [*] Corresponding author. Mohammad Reza Mahmoudi, E-mail: [email protected].
Abstract: During the last decade, ensemble clustering has been the subject of many researches in data mining. In ensemble clustering, several basic partitions are first generated and then a function is used for the clustering aggregation in order to create a final partition that is similar to all of the basic partitions as much as possible. Ensemble clustering has been proposed to enhance efficiency, strength, reliability, and stability of the clustering. A common slogan concerning the ensemble clustering techniques is that “the model combining several poorer models is better than a stronger model”. Here at this paper, an ensemble clustering method is proposed using the basic k-means clustering method as its base clustering algorithm. Also, this study could raise the diversity of consensus by adopting some measures. Although our clustering ensemble approach has the strengths of kmeans, such as its efficacy and low complexity, it lacks the drawbacks which the kmeans suffers from; such as its problem in detection of clusters that are not uniformly distributed or in the circular shape. In the empirical studies, we test the proposed ensemble clustering algorithm as well as the other up-to-date cluster ensembles on different data-sets. Based on the experimental results, our cluster ensemble method is stronger than the recent competitor cluster ensemble algorithms and is the most up-to-date clustering method available.
Keywords: Graph representation, cluster ensemble, kmeans clustering, small cluster
DOI: 10.3233/JIFS-191530
Journal: Journal of Intelligent & Fuzzy Systems, vol. 39, no. 1, pp. 525-542, 2020
IOS Press, Inc.
6751 Tepper Drive
Clifton, VA 20124
USA
Tel: +1 703 830 6300
Fax: +1 703 830 2300
[email protected]
For editorial issues, like the status of your submitted paper or proposals, write to [email protected]
IOS Press
Nieuwe Hemweg 6B
1013 BG Amsterdam
The Netherlands
Tel: +31 20 688 3355
Fax: +31 20 687 0091
[email protected]
For editorial issues, permissions, book requests, submissions and proceedings, contact the Amsterdam office [email protected]
Inspirees International (China Office)
Ciyunsi Beili 207(CapitaLand), Bld 1, 7-901
100025, Beijing
China
Free service line: 400 661 8717
Fax: +86 10 8446 7947
[email protected]
For editorial issues, like the status of your submitted paper or proposals, write to [email protected]
如果您在出版方面需要帮助或有任何建, 件至: [email protected]