{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,2]],"date-time":"2025-08-02T17:26:22Z","timestamp":1754155582030,"version":"3.41.2"},"reference-count":23,"publisher":"Emerald","issue":"8","license":[{"start":{"date-parts":[[2016,9,5]],"date-time":"2016-09-05T00:00:00Z","timestamp":1473033600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.emerald.com\/insight\/site-policies"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["K"],"published-print":{"date-parts":[[2016,9,5]]},"abstract":"<jats:sec>\n<jats:title content-type=\"abstract-subheading\">Purpose<\/jats:title>\n<jats:p>The large volume of big data makes it impractical for traditional clustering algorithms which are usually designed for entire data set. The purpose of this paper is to focus on incremental clustering which divides data into series of data chunks and only a small amount of data need to be clustered at each time. Few researches on incremental clustering algorithm address the problem of optimizing cluster center initialization for each data chunk and selecting multiple passing points for each cluster.<\/jats:p>\n<\/jats:sec>\n<jats:sec>\n<jats:title content-type=\"abstract-subheading\">Design\/methodology\/approach<\/jats:title>\n<jats:p>Through optimizing initial cluster centers, quality of clustering results is improved for each data chunk and then quality of final clustering results is enhanced. Moreover, through selecting multiple passing points, more accurate information is passed down to improve the final clustering results. The method has been proposed to solve those two problems and is applied in the proposed algorithm based on streaming kernel fuzzy c-means (stKFCM) algorithm.<\/jats:p>\n<\/jats:sec>\n<jats:sec>\n<jats:title content-type=\"abstract-subheading\">Findings<\/jats:title>\n<jats:p>Experimental results show that the proposed algorithm demonstrates more accuracy and better performance than streaming kernel stKFCM algorithm.<\/jats:p>\n<\/jats:sec>\n<jats:sec>\n<jats:title content-type=\"abstract-subheading\">Originality\/value<\/jats:title>\n<jats:p>This paper addresses the problem of improving the performance of increment clustering through optimizing cluster center initialization and selecting multiple passing points. The paper analyzed the performance of the proposed scheme and proved its effectiveness.<\/jats:p>\n<\/jats:sec>","DOI":"10.1108\/k-08-2015-0209","type":"journal-article","created":{"date-parts":[[2016,10,17]],"date-time":"2016-10-17T09:31:33Z","timestamp":1476696693000},"page":"1273-1291","source":"Crossref","is-referenced-by-count":3,"title":["Incremental kernel fuzzy c-means with optimizing cluster center initialization and delivery"],"prefix":"10.1108","volume":"45","author":[{"given":"Runhai","family":"Jiao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shaolong","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wu","family":"Wen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Biying","family":"Lin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"140","reference":[{"year":"2014","first-page":"308","article-title":"Dynamic incremental K-means clustering","key":"key2020121223391093400_ref001"},{"year":"2014","first-page":"28","article-title":"Dynamic incremental fuzzy c-means clustering","key":"key2020121223391093400_ref003"},{"year":"2011","first-page":"490","article-title":"Fuzzy clustering with multiple kernels","key":"key2020121223391093400_ref002"},{"issue":"3","key":"key2020121223391093400_ref004","first-page":"63","article-title":"Local information-based fast approximate spectral clustering","volume":"38","year":"2014","journal-title":"Pattern Recognition Letters"},{"year":"2011","first-page":"895","article-title":"Approximate kernel k-means: solution to large scale kernel clustering","key":"key2020121223391093400_ref005"},{"year":"2013","first-page":"42","article-title":"How data partitioning strategies and subset size influence the performance of an ensemble","key":"key2020121223391093400_ref006"},{"issue":"3","key":"key2020121223391093400_ref007","doi-asserted-by":"crossref","first-page":"705","DOI":"10.1016\/0022-2836(82)90398-9","article-title":"An improved algorithm for matching biological sequences","volume":"162","year":"1982","journal-title":"Journal of Molecular Biology"},{"issue":"6","key":"key2020121223391093400_ref020","doi-asserted-by":"crossref","first-page":"1130","DOI":"10.1109\/TFUZZ.2012.2201485","article-title":"Fuzzy c-means algorithms for very large data","volume":"20","year":"2012","journal-title":"IEEE Transactions on Fuzzy Systems"},{"year":"2007","first-page":"1","article-title":"Single pass fuzzy c-means","key":"key2020121223391093400_ref008"},{"year":"2008","first-page":"1","article-title":"Online fuzzy C-means","key":"key2020121223391093400_ref009"},{"issue":"10","key":"key2020121223391093400_ref010","doi-asserted-by":"crossref","first-page":"144","DOI":"10.1109\/97.329844","article-title":"A new initialization technique for generalized Lloyd iteration","volume":"1","year":"1994","journal-title":"IEEE Signal Processing Letters"},{"volume-title":"Finding Groups in Data: An Introduction to Cluster Analysis","year":"2005","key":"key2020121223391093400_ref011"},{"issue":"11","key":"key2020121223391093400_ref012","doi-asserted-by":"crossref","first-page":"1293","DOI":"10.1016\/j.patrec.2004.04.007","article-title":"Cluster center initialization algorithm for K-means clustering","volume":"25","year":"2004","journal-title":"Pattern Recognition Letters"},{"year":"1999","first-page":"16","article-title":"Fast and effective text mining using linear time document clustering","key":"key2020121223391093400_ref013"},{"year":"1967","first-page":"281","article-title":"Some methods for classification and analysis of multivariate observations","key":"key2020121223391093400_ref014"},{"issue":"2","key":"key2020121223391093400_ref015","doi-asserted-by":"crossref","first-page":"358","DOI":"10.1109\/TFUZZ.2011.2174366","article-title":"A fuzzy approach for multitype relational data clustering","volume":"20","year":"2012","journal-title":"IEEE Transactions on Fuzzy Systems"},{"year":"1999","first-page":"22","article-title":"Efficient progressive sampling","key":"key2020121223391093400_ref016"},{"issue":"8","key":"key2020121223391093400_ref017","doi-asserted-by":"crossref","first-page":"965","DOI":"10.1016\/j.patrec.2007.01.001","article-title":"A method for initializing the K-means clustering algorithm using kd-trees","volume":"28","year":"2007","journal-title":"Pattern Recognition Letters"},{"issue":"3-4","key":"key2020121223391093400_ref018","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/S0167-8655(97)00168-2","article-title":"A new cluster validity index for the fuzzy c-means","volume":"19","year":"1998","journal-title":"Pattern Recognition Letters"},{"issue":"2","key":"key2020121223391093400_ref019","first-page":"270","article-title":"The pyramid fuzzy c-means algorithm","volume":"2","year":"2010","journal-title":"International Journal of Computational Intelligence in Control"},{"issue":"6","key":"key2020121223391093400_ref021","doi-asserted-by":"crossref","first-page":"1557","DOI":"10.1109\/TFUZZ.2014.2298244","article-title":"Incremental fuzzy clustering with multiple medoids for large data","volume":"22","year":"2014","journal-title":"IEEE Transactions on Fuzzy Systems"},{"issue":"1","key":"key2020121223391093400_ref022","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1109\/TKDE.2013.109","article-title":"Data mining with big data","volume":"26","year":"2014","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"year":"2013","first-page":"161","article-title":"Scalable approximation of kernel fuzzy c-means","key":"key2020121223391093400_ref023"}],"container-title":["Kybernetes"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.emeraldinsight.com\/doi\/full-xml\/10.1108\/K-08-2015-0209","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.emerald.com\/insight\/content\/doi\/10.1108\/K-08-2015-0209\/full\/xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.emerald.com\/insight\/content\/doi\/10.1108\/K-08-2015-0209\/full\/html","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,24]],"date-time":"2025-07-24T21:49:39Z","timestamp":1753393779000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.emerald.com\/k\/article\/45\/8\/1273-1291\/272593"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,9,5]]},"references-count":23,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2016,9,5]]}},"alternative-id":["10.1108\/K-08-2015-0209"],"URL":"https:\/\/doi.org\/10.1108\/k-08-2015-0209","relation":{},"ISSN":["0368-492X"],"issn-type":[{"type":"print","value":"0368-492X"}],"subject":[],"published":{"date-parts":[[2016,9,5]]}}}