{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,24]],"date-time":"2026-01-24T16:45:16Z","timestamp":1769273116172,"version":"3.49.0"},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2017,1,11]],"date-time":"2017-01-11T00:00:00Z","timestamp":1484092800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Nature Science Foundation of China","doi-asserted-by":"crossref","award":["61272194"],"award-info":[{"award-number":["61272194"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Mach Learn"],"published-print":{"date-parts":[[2017,3]]},"DOI":"10.1007\/s10994-016-5608-2","type":"journal-article","created":{"date-parts":[[2017,1,11]],"date-time":"2017-01-11T15:03:42Z","timestamp":1484147022000},"page":"337-357","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":38,"title":["QCC: a novel clustering algorithm based on Quasi-Cluster Centers"],"prefix":"10.1007","volume":"106","author":[{"given":"Jinlong","family":"Huang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qingsheng","family":"Zhu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lijun","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dongdong","family":"Cheng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Quanwang","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,1,11]]},"reference":[{"key":"5608_CR1","doi-asserted-by":"crossref","unstructured":"Agrawal, R., et\u00a0al. (1998). Automatic subspace clustering of high dimensional data for data mining applications. In ACM (Vol. 27).","DOI":"10.1145\/276304.276314"},{"key":"5608_CR2","doi-asserted-by":"crossref","unstructured":"Ankerst, M., et al. (1999). OPTICS: Ordering points to identify the clustering structure. In ACM Sigmod record. ACM.","DOI":"10.1145\/304182.304187"},{"issue":"3","key":"5608_CR3","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1016\/j.is.2012.09.001","volume":"38","author":"C Cassisi","year":"2013","unstructured":"Cassisi, C., et al. (2013). Enhancing density-based clustering: Parameter reduction and outlier detection. Information Systems, 38(3), 317\u2013330.","journal-title":"Information Systems"},{"issue":"5","key":"5608_CR4","doi-asserted-by":"crossref","first-page":"420","DOI":"10.1147\/rd.175.0420","volume":"17","author":"WE Donath","year":"1973","unstructured":"Donath, W. E., & Hoffman, A. J. (1973). Lower bounds for the partitioning of graphs. IBM Journal of Research and Development, 17(5), 420\u2013425.","journal-title":"IBM Journal of Research and Development"},{"key":"5608_CR5","unstructured":"Ester, M., et\u00a0al. (1996). A density-based algorithm for discovering clusters in large spatial databases with noise. In Kdd."},{"issue":"5814","key":"5608_CR6","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":"5608_CR7","doi-asserted-by":"crossref","unstructured":"Guha, S., Rastogi, R., & Shim, K. (1998). CURE: An efficient clustering algorithm for large databases. In ACM SIGMOD record. ACM.","DOI":"10.1145\/276304.276312"},{"key":"5608_CR8","doi-asserted-by":"crossref","unstructured":"Guha, S., Rastogi, R., & Shim, K. (1999). ROCK: A robust clustering algorithm for categorical attributes. In Data engineering, 1999. Proceedings of the 15th international conference on. IEEE.","DOI":"10.1109\/ICDE.1999.754967"},{"key":"5608_CR9","volume-title":"Data mining: Concepts and techniques","author":"J Han","year":"2001","unstructured":"Han, J., & Kamber, M. (2001). Data mining: Concepts and techniques. San Francisco, CA: Morgan Kaufmann."},{"issue":"9","key":"5608_CR10","doi-asserted-by":"crossref","first-page":"1074","DOI":"10.1109\/43.159993","volume":"11","author":"L Hagen","year":"1992","unstructured":"Hagen, L., & Kahng, A. B. (1992). New spectral methods for ratio cut partitioning and clustering. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 11(9), 1074\u20131085.","journal-title":"IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems"},{"key":"5608_CR11","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1016\/j.knosys.2014.03.001","volume":"63","author":"J Ha","year":"2014","unstructured":"Ha, J., Seok, S., & Lee, J.-S. (2014). Robust outlier detection using the instability factor. Knowledge-Based Systems, 63, 15\u201323.","journal-title":"Knowledge-Based Systems"},{"key":"5608_CR12","unstructured":"Hinneburg, A. & Keim, D.A. (1998). An efficient approach to clustering in large multimedia databases with noise. In KDD."},{"issue":"8","key":"5608_CR13","doi-asserted-by":"crossref","first-page":"651","DOI":"10.1016\/j.patrec.2009.09.011","volume":"31","author":"AK Jain","year":"2010","unstructured":"Jain, A. K. (2010). Data clustering: 50 years beyond K-means. Pattern Recognition Letters, 31(8), 651\u2013666.","journal-title":"Pattern Recognition Letters"},{"issue":"7\u20138","key":"5608_CR14","doi-asserted-by":"crossref","first-page":"1557","DOI":"10.1007\/s00521-014-1628-7","volume":"25","author":"H Jia","year":"2014","unstructured":"Jia, H., et al. (2014). A density-adaptive affinity propagation clustering algorithm based on spectral dimension reduction. Neural Computing and Applications, 25(7\u20138), 1557\u20131567.","journal-title":"Neural Computing and Applications"},{"key":"5608_CR15","doi-asserted-by":"crossref","unstructured":"Jin, W., et al. (2006). Ranking outliers using symmetric neighborhood relationship. In Advances in knowledge discovery and data mining (pp. 577\u2013593). Berlin: Springer.","DOI":"10.1007\/11731139_68"},{"key":"5608_CR16","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":"8","key":"5608_CR17","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1109\/2.781637","volume":"32","author":"G Karypis","year":"1999","unstructured":"Karypis, G., Han, E.-H., & Kumar, V. (1999). Chameleon: Hierarchical clustering using dynamic modeling. Computer, 32(8), 68\u201375.","journal-title":"Computer"},{"key":"5608_CR18","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1080\/01621459.1967.10482890","volume":"62","author":"B King","year":"1967","unstructured":"King, B. (1967). Step-wise clustering procedures. Journal of the American Statistical Association, 62, 86\u2013101.","journal-title":"Journal of the American Statistical Association"},{"key":"5608_CR19","doi-asserted-by":"crossref","unstructured":"Li, T., Ma, S., & Ogihara, M. (2004). Document clustering via adaptive subspace iteration. In Proceedings of the 27th annual international ACM SIGIR conference on research and development in information retrieval (pp. 218\u2013225).","DOI":"10.1145\/1008992.1009031"},{"key":"5608_CR20","first-page":"10","volume":"1","author":"H Ling","year":"2007","unstructured":"Ling, H., Lingda, W., & Yi-chao, C. (2007). Survey of clustering algorithms in data mining. Application Research of Computers, 1, 10\u201313.","journal-title":"Application Research of Computers"},{"key":"5608_CR21","unstructured":"Moore, A. W. (1999). Very fast EM-based mixture model clustering using multiresolution kd-trees. Advances in Neural Information Processing Systems, 543\u2013549."},{"issue":"1","key":"5608_CR22","first-page":"154","volume":"15","author":"G Mclanchan","year":"1997","unstructured":"Mclanchan, G., & Krishan, T. (1997). The em algorithm and extensions. Series in Probability and Statistics, 15(1), 154\u2013156.","journal-title":"Series in Probability and Statistics"},{"issue":"5","key":"5608_CR23","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":"5608_CR24","doi-asserted-by":"crossref","unstructured":"Ordonez, C. & Omiecinski, E. (2002). FREM: Fast and robust EM clustering for large data sets. In Proceedings of the eleventh international conference on Information and knowledge management. ACM.","DOI":"10.1145\/584792.584889"},{"issue":"6191","key":"5608_CR25","doi-asserted-by":"crossref","first-page":"1492","DOI":"10.1126\/science.1242072","volume":"344","author":"A Rodriguez","year":"2014","unstructured":"Rodriguez, A., & Laio, A. (2014). Clustering by fast search and find of density peaks. Science, 344(6191), 1492\u20131496.","journal-title":"Science"},{"issue":"2","key":"5608_CR26","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1109\/34.908968","volume":"23","author":"MBH Rhouma","year":"2001","unstructured":"Rhouma, M. B. H., & Frigui, H. (2001). Self-organization of pulse-coupled oscillators with application to clustering. IEEE Transactions on Pattern Analysis and Machine Intelligence, 23(2), 180\u2013195.","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"5608_CR27","doi-asserted-by":"crossref","unstructured":"Samaria, F. S., & Harter, A. C. (1994). Parameterisation of a stochastic model for human face identification. In Applications of computer vision. Proceedings of the second IEEE workshop on. IEEE.","DOI":"10.1109\/ACV.1994.341300"},{"key":"5608_CR28","volume-title":"Sequential Monte Carlo methods in practice","author":"A Smith","year":"2013","unstructured":"Smith, A., et al. (2013). Sequential Monte Carlo methods in practice. Berlin: Springer."},{"key":"5608_CR29","doi-asserted-by":"crossref","first-page":"855","DOI":"10.1038\/193855a0","volume":"193","author":"PHA Sneath","year":"1962","unstructured":"Sneath, P. H. A., & Sokal, R. R. (1962). Numerical taxonomy. Nature, 193, 855\u2013860.","journal-title":"Nature"},{"issue":"4","key":"5608_CR30","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1007\/s11222-007-9033-z","volume":"17","author":"U Luxburg Von","year":"2007","unstructured":"Von Luxburg, U. (2007). A tutorial on spectral clustering. Statistics and Computing, 17(4), 395\u2013416.","journal-title":"Statistics and Computing"},{"key":"5608_CR31","doi-asserted-by":"crossref","unstructured":"Wang, G. & Song, Q. (2016). Automatic clustering via outward statistical testing on density metrics.","DOI":"10.1109\/TKDE.2016.2535209"},{"key":"5608_CR32","unstructured":"Wang, W., Yang, J., & Muntz, R. (1997). STING: A statistical information grid approach to spatial data mining. In VLDB."},{"key":"5608_CR33","doi-asserted-by":"crossref","unstructured":"Wang, W., Yang, J., & Muntz, R. (1999). STING+: An approach to active spatial data mining. In Data engineering, 1999. Proceedings of the 15th international conference on. IEEE.","DOI":"10.1109\/ICDE.1999.754914"},{"issue":"301","key":"5608_CR34","doi-asserted-by":"crossref","first-page":"236","DOI":"10.1080\/01621459.1963.10500845","volume":"58","author":"JH Ward Jr","year":"1963","unstructured":"Ward, J. H, Jr. (1963). Hierarchical grouping to optimize an objective function. Journal of the American statistical Association, 58(301), 236\u2013244.","journal-title":"Journal of the American statistical Association"},{"issue":"3","key":"5608_CR35","doi-asserted-by":"crossref","first-page":"645","DOI":"10.1109\/TNN.2005.845141","volume":"16","author":"R Xu","year":"2005","unstructured":"Xu, R., & Wunsch, D. (2005). Survey of clustering algorithms. IEEE Transactions on Neural Networks, 16(3), 645\u2013678.","journal-title":"IEEE Transactions on Neural Networks"},{"key":"5608_CR36","doi-asserted-by":"crossref","unstructured":"Zhang, X., et\u00a0al. (2010). K-AP: Generating specified K clusters by efficient affinity propagation. In Data mining (ICDM), 2010 IEEE 10th international conference on. IEEE.","DOI":"10.1109\/ICDM.2010.107"},{"key":"5608_CR37","doi-asserted-by":"crossref","unstructured":"Zhang, T., Ramakrishnan, R., & Livny, M. (1996). BIRCH: An efficient data clustering method for very large databases. In ACM SIGMOD record. ACM.","DOI":"10.1145\/233269.233324"},{"issue":"13","key":"5608_CR38","first-page":"5473","volume":"10","author":"Q Zhu","year":"2014","unstructured":"Zhu, Q., et al. (2014). A clustering algorithm based on natural nearest neighbor. Journal of Computational Information Systems, 10(13), 5473\u20135480.","journal-title":"Journal of Computational Information Systems"}],"container-title":["Machine Learning"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-016-5608-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10994-016-5608-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-016-5608-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,17]],"date-time":"2019-09-17T08:01:56Z","timestamp":1568707316000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10994-016-5608-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,1,11]]},"references-count":38,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2017,3]]}},"alternative-id":["5608"],"URL":"https:\/\/doi.org\/10.1007\/s10994-016-5608-2","relation":{},"ISSN":["0885-6125","1573-0565"],"issn-type":[{"value":"0885-6125","type":"print"},{"value":"1573-0565","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,1,11]]}}}