Please use this identifier to cite or link to this item:
|Title:||Incremental fuzzy clustering with multiple medoids for large data||Authors:||Wang, Yangtao
|Keywords:||DRNTU::Engineering::Computer science and engineering::Data||Issue Date:||2014||Source:||Wang, Y., Chen, L., & Mei, J.-P. (2014). Incremental fuzzy clustering with multiple medoids for large data. IEEE transactions on fuzzy systems, 22(6), 1557-1568.||Series/Report no.:||IEEE transactions on fuzzy systems||Abstract:||As an important technique of data analysis, clustering plays an important role in finding the underlying pattern structure embedded in the unlabelled data. Clustering algorithms that need to store the entire data into the memory for analysis become infeasible when the data set is too large to be stored. To handle such kind of large data, incremental clustering approaches are proposed. The key idea of these approaches is to find representatives (centroids or medoids) to represent each cluster in each data chunk, which is a packet of the data, and final data analysis is carried out based on those identified representatives from all the chunks. In this paper we propose a new incremental clustering approach called incremental multiple medoids based fuzzy clustering(IMMFC) to handle complex patterns that are not compact and well separated. We would like to investigate if IMMFC is a good alternative to capture the underlying data structure more accurately. IMMFC not only facilitates the selection of multiple medoids for each cluster in a data chunk, but also has the mechanism to make use of relationships among those identified medoids as side information to help the final data clustering process. The detailed problem formulation, updating rules derivation, and the in-depth analysis of the proposed IMMFC are provided. Experimental studies on several large data sets including real world malware data sets have been conducted. IMMFC outperforms existing incremental fuzzy clustering approaches in terms of clustering accuracy and robustness to the order of data. These results demonstrate the great potential of IMMFC for large data analysis.||URI:||https://hdl.handle.net/10356/106736
|ISSN:||1063-6706||DOI:||10.1109/TFUZZ.2014.2298244||Rights:||© 2014 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works. The published version is available at: [http://dx.doi.org/10.1109/TFUZZ.2014.2298244].||Fulltext Permission:||open||Fulltext Availability:||With Fulltext|
|Appears in Collections:||EEE Journal Articles|
Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.