{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,30]],"date-time":"2026-09-30T21:58:48Z","timestamp":1790805528055,"version":"4.1.0"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2015,3,26]],"date-time":"2015-03-26T00:00:00Z","timestamp":1427328000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Wireless Pers Commun"],"published-print":{"date-parts":[[2015,10]]},"DOI":"10.1007\/s11277-015-2517-9","type":"journal-article","created":{"date-parts":[[2015,3,25]],"date-time":"2015-03-25T11:58:26Z","timestamp":1427284706000},"page":"2151-2170","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":14,"title":["ICA: An Incremental Clustering Algorithm Based on OPTICS"],"prefix":"10.1007","volume":"84","author":[{"given":"Jun-Song","family":"Fu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yun","family":"Liu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Han-Chieh","family":"Chao","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2015,3,26]]},"reference":[{"issue":"4","key":"2517_CR1","doi-asserted-by":"crossref","first-page":"2661","DOI":"10.1109\/TCE.2010.5681154","volume":"56","author":"SN Sulaiman","year":"2010","unstructured":"Sulaiman, S. N., & Isa, N. A. M. (2010). Adaptive fuzzy-K-means clustering algorithm for image segmentation. IEEE Transactions on Consumer Electronics, 56(4), 2661\u20132668.","journal-title":"IEEE Transactions on Consumer Electronics"},{"key":"2517_CR2","unstructured":"A fast clustering-based feature subset selection algorithm for high-dimensional data."},{"issue":"5","key":"2517_CR3","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1109\/MIC.2013.100","volume":"17","author":"W Tan","year":"2013","unstructured":"Tan, W., Blake, M. B., Saleh, I., et al. (2013). Social-network-sourced big data analytics. IEEE Internet Computing, 17(5), 62\u201369.","journal-title":"IEEE Internet Computing"},{"key":"2517_CR4","doi-asserted-by":"crossref","unstructured":"Guha, S., Mishra, N., Motwani, R., et al. (2000). Clustering data streams. In Proceedings of the 41st annual symposium on foundations of computer science, 2000 (pp. 359\u2013366), IEEE.","DOI":"10.1109\/SFCS.2000.892124"},{"issue":"2","key":"2517_CR5","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1145\/304181.304187","volume":"28","author":"M Ankerst","year":"1999","unstructured":"Ankerst, M., Breunig, M. M., Kriegel, H. P., et al. (1999). Optics: Ordering points to identify the clustering structure. ACM SIGMOD Record, 28(2), 49\u201360.","journal-title":"ACM SIGMOD Record"},{"key":"2517_CR6","doi-asserted-by":"crossref","unstructured":"Guha, S., Mishra, N., Motwani, R., et al. (2000). Clustering data streams. In 41st annual symposium on foundations of computer science, 2000 proceedings (pp. 359\u2013366), IEEE.","DOI":"10.1109\/SFCS.2000.892124"},{"issue":"3","key":"2517_CR7","doi-asserted-by":"crossref","first-page":"515","DOI":"10.1109\/TKDE.2003.1198387","volume":"15","author":"S Guha","year":"2003","unstructured":"Guha, S., Meyerson, A., Mishra, N., et al. (2003). Clustering data streams: Theory and practice. IEEE Transactions on Knowledge and Data Engineering, 15(3), 515\u2013528.","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"2517_CR8","doi-asserted-by":"crossref","unstructured":"Aggarwal, C. C., Han, J., Wang, J., et al. (2003). A framework for clustering evolving data streams. In Proceedings of the 29th international conference on very large data bases-volume 29 (VLDB endowment) (pp. 81\u201392).","DOI":"10.1016\/B978-012722442-8\/50016-1"},{"key":"2517_CR9","doi-asserted-by":"crossref","unstructured":"Cao, F., Ester, M., Qian, W., et al. (2006). Density-based clustering over an evolving data stream with noise. In SDM (vol. 6, pp. 326\u2013337).","DOI":"10.1137\/1.9781611972764.29"},{"key":"2517_CR10","doi-asserted-by":"crossref","unstructured":"O\u2019callaghan, L., Meyerson, A., Motwani, R., et al. (2002). Streaming-data algorithms for high-quality clustering. In 2013 IEEE 29th international conference on data engineering (ICDE) (pp. 0685\u20130685), IEEE Computer Society.","DOI":"10.1109\/ICDE.2002.994785"},{"issue":"1","key":"2517_CR11","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1093\/comjnl\/16.1.30","volume":"16","author":"R Sibson","year":"1973","unstructured":"Sibson, R. (1973). SLINK: An optimally efficient algorithm for the single-link cluster method. The Computer Journal, 16(1), 30\u201334.","journal-title":"The Computer Journal"},{"key":"2517_CR12","doi-asserted-by":"crossref","unstructured":"Schikuta, E. (1996). Grid-clustering: An efficient hierarchical clustering method for very large data sets. In Proceedings of the 13th international conference on pattern recognition, 1996 (vol. 2, pp. 101\u2013105), IEEE.","DOI":"10.1109\/ICPR.1996.546732"},{"key":"2517_CR13","doi-asserted-by":"crossref","first-page":"513","DOI":"10.1007\/BFb0052867","volume-title":"The BANG-clustering system: Grid-based data analysis. Advances in intelligent data analysis reasoning about data","author":"E Schikuta","year":"1997","unstructured":"Schikuta, E., & Erhart, M. (1997). The BANG-clustering system: Grid-based data analysis. Advances in intelligent data analysis reasoning about data (pp. 513\u2013524). Berlin: Springer."},{"issue":"2","key":"2517_CR14","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1145\/235968.233324","volume":"25","author":"T Zhang","year":"1996","unstructured":"Zhang, T., Ramakrishnan, R., & Livny, M. (1996). BIRCH: An efficient data clustering method for very large databases. ACM SIGMOD Record, 25(2), 103\u2013114.","journal-title":"ACM SIGMOD Record"},{"issue":"2","key":"2517_CR15","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1145\/276305.276312","volume":"27","author":"S Guha","year":"1998","unstructured":"Guha, S., Rastogi, R., & Shim, K. (1998). CURE: An efficient clustering algorithm for large databases. ACM SIGMOD Record, 27(2), 73\u201384.","journal-title":"ACM SIGMOD Record"},{"key":"2517_CR16","unstructured":"Huang, Z. (1997). A fast clustering algorithm to cluster very large categorical data sets in data mining. In DMKD."},{"issue":"5","key":"2517_CR17","doi-asserted-by":"crossref","first-page":"1003","DOI":"10.1109\/TKDE.2002.1033770","volume":"14","author":"RT Ng","year":"2002","unstructured":"Ng, R. T., & Han, J. (2002). CLARANS: A method for clustering objects for spatial data mining. IEEE Transactions on Knowledge and Data Engineering, 14(5), 1003\u20131016.","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"2517_CR18","volume-title":"Finding groups in data: An introduction to cluster analysis","author":"L Kaufman","year":"2009","unstructured":"Kaufman, L., & Rousseeuw, P. J. (2009). Finding groups in data: An introduction to cluster analysis. New York: Wiley."},{"issue":"5814","key":"2517_CR19","doi-asserted-by":"crossref","first-page":"972","DOI":"10.1126\/science.1136800","volume":"315","author":"BJ Frey","year":"2007","unstructured":"Frey, B. J., & Dueck, D. (2007). Clustering by passing messages between data points. Science, 315(5814), 972\u2013976.","journal-title":"Science"},{"key":"2517_CR20","doi-asserted-by":"crossref","unstructured":"Sun, L., & Guo, C. (2014). Incremental affinity propagation clustering based on message passing.","DOI":"10.1109\/TKDE.2014.2310215"},{"key":"2517_CR21","unstructured":"Ester, M., Kriegel, H. P., Sander, J., et al. (1996). A density-based algorithm for discovering clusters in large spatial databases with noise. In KDD (vol. 96, pp. 226\u2013231)."},{"issue":"9","key":"2517_CR22","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1145\/361002.361007","volume":"18","author":"JL Bentley","year":"1975","unstructured":"Bentley, J. L. (1975). Multidimensional binary search trees used for associative searching. Communications of the ACM, 18(9), 509\u2013517.","journal-title":"Communications of the ACM"},{"key":"2517_CR23","doi-asserted-by":"crossref","unstructured":"Beckmann, N., Kriegel, H. P., Schneider, R., et al. (1990). The R*-tree: An efficient and robust access method for points and rectangles. In ACM.","DOI":"10.1145\/93597.98741"},{"key":"2517_CR24","unstructured":"Berchtold, S., Keim, D. A., & Kriegel, H. P. (2001). The X-tree: An index structure for high-dimensional data. Readings in Multimedia Computing and Networking, 451."}],"container-title":["Wireless Personal Communications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11277-015-2517-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11277-015-2517-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11277-015-2517-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,22]],"date-time":"2019-08-22T11:22:08Z","timestamp":1566472928000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11277-015-2517-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,3,26]]},"references-count":24,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2015,10]]}},"alternative-id":["2517"],"URL":"https:\/\/doi.org\/10.1007\/s11277-015-2517-9","relation":{},"ISSN":["0929-6212","1572-834X"],"issn-type":[{"value":"0929-6212","type":"print"},{"value":"1572-834X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,3,26]]}}}