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.
Subtitle:
Article type: Research Article
Authors: Setyohadi, Djoko Budiyanto* | Bakar, Azuraliza Abu | Othman, Zulaiha Ali
Affiliations: Data Mining and Optimization Research Group, Center for Artificial Intelligence Technology, Faculty of Information Science and Technology, University Kebangsaan Malaysia, Bangi, Selangor Darul Ehsan, Malaysia
Correspondence: [*] Corresponding author: Djoko Budiyanto Setyohadi, Data Mining and Optimization Research Group, Center for Artificial Intelligence Technology, Faculty of Information Science and Technology, University Kebangsaan Malaysia, Bangi, Selangor Darul Ehsan 43000, Malaysia. E-mail:djokobdy@gmail.com
Abstract: Technically, the problem of overlap in a dataset is viewed as an uncertainty problem and is solved using a fuzzy set theoretical approach, specifically, fuzzy clustering. This approach is powerful but has some problems associated with it, of which the design of the membership function is the most serious. There are many different techniques for optimizing fuzzy clustering, including those based on similarity decomposition and centroids of clusters. Furthermore, the problem of overlap clustering is still being studied to improve its performance, especially with respect to the membership optimization. Rough set theory (RST) is the complement of fuzzy set theory and evidence theory, which use different techniques to address the uncertainty problem in overlap clustering. Considering the simplicity of the membership computation in RST, we propose an overlap clustering algorithm, which involves the use of the discernibility concept of RST to improve the overlap clusters as an existing variant of the overlap clustering algorithm. The experiment described here demonstrates that this new method improves the performance and increases the accuracy of clustering while avoiding the time complexity problem. The experiment uses five UCI machine learning datasets. The complexity of the data is measured using the volume of the overlap region and feature efficiency. The experimental results show that the proposed method significantly outperforms the other two methods in terms of the Dunn index, the sum of the squared errors and the silhouette index.
Keywords: Overlap clustering, discernibility, RK-means, uncertain, rough membership
DOI: 10.3233/IDA-150746
Journal: Intelligent Data Analysis, vol. 19, no. 4, pp. 795-823, 2015
IOS Press, Inc.
6751 Tepper Drive
Clifton, VA 20124
USA
Tel: +1 703 830 6300
Fax: +1 703 830 2300
sales@iospress.com
For editorial issues, like the status of your submitted paper or proposals, write to editorial@iospress.nl
IOS Press
Nieuwe Hemweg 6B
1013 BG Amsterdam
The Netherlands
Tel: +31 20 688 3355
Fax: +31 20 687 0091
info@iospress.nl
For editorial issues, permissions, book requests, submissions and proceedings, contact the Amsterdam office info@iospress.nl
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
china@iospress.cn
For editorial issues, like the status of your submitted paper or proposals, write to editorial@iospress.nl
如果您在出版方面需要帮助或有任何建, 件至: editorial@iospress.nl