{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:20:27Z","timestamp":1740108027017,"version":"3.37.3"},"reference-count":48,"publisher":"Springer Science and Business Media LLC","issue":"11","license":[{"start":{"date-parts":[[2018,7,5]],"date-time":"2018-07-05T00:00:00Z","timestamp":1530748800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["Project No.61702240"],"award-info":[{"award-number":["Project No.61702240"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Fundamental Research Founds for the Central Universities","award":["lzujbky-2017-191"],"award-info":[{"award-number":["lzujbky-2017-191"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Neural Comput & Applic"],"published-print":{"date-parts":[[2019,11]]},"DOI":"10.1007\/s00521-018-3607-x","type":"journal-article","created":{"date-parts":[[2018,7,5]],"date-time":"2018-07-05T05:46:42Z","timestamp":1530769602000},"page":"7769-7780","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A novel clustering algorithm based on PageRank and minimax similarity"],"prefix":"10.1007","volume":"31","author":[{"given":"Qidong","family":"Liu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ruisheng","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xin","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yunyun","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhili","family":"Zhao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rongjing","family":"Hu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,7,5]]},"reference":[{"issue":"7","key":"3607_CR1","doi-asserted-by":"publisher","first-page":"1695","DOI":"10.1007\/s00521-015-2145-z","volume":"28","author":"M Kashyap","year":"2017","unstructured":"Kashyap M, Bhattacharya M (2017) A density invariant approach to clustering. Neural Comput Appl 28(7):1695\u20131713","journal-title":"Neural Comput Appl"},{"issue":"1","key":"3607_CR2","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1186\/s40537-015-0027-y","volume":"2","author":"A Kaur","year":"2015","unstructured":"Kaur A, Datta A (2015) A novel algorithm for fast and scalable subspace clustering of high-dimensional data. J Big Data 2(1):17","journal-title":"J Big Data"},{"issue":"2","key":"3607_CR3","doi-asserted-by":"publisher","first-page":"641","DOI":"10.1007\/s13042-015-0451-5","volume":"8","author":"D Wu","year":"2017","unstructured":"Wu D, Ren J, Sheng L (2017) Representative points clustering algorithm based on density factor and relevant degree. Int J Mach Learn Cybernet 8(2):641\u2013649","journal-title":"Int J Mach Learn Cybernet"},{"issue":"7","key":"3607_CR4","doi-asserted-by":"publisher","first-page":"759","DOI":"10.1007\/s00521-009-0281-z","volume":"18","author":"XL Yang","year":"2009","unstructured":"Yang XL, Song Q, Wu YL, Cao AZ (2009) A novel pruning approach for robust data clustering. Neural Comput Appl 18(7):759\u2013768","journal-title":"Neural Comput Appl"},{"issue":"11","key":"3607_CR5","doi-asserted-by":"publisher","first-page":"3317","DOI":"10.1007\/s00521-016-2256-1","volume":"28","author":"VA Gromov","year":"2017","unstructured":"Gromov VA, Konev AS (2017) Precocious identification of popular topics on Twitter with the employment of predictive clustering. Neural Comput Appl 28(11):3317\u20133322","journal-title":"Neural Comput Appl"},{"issue":"2","key":"3607_CR6","doi-asserted-by":"publisher","first-page":"593","DOI":"10.1007\/s00521-017-3119-0","volume":"29","author":"R Azimi","year":"2018","unstructured":"Azimi R, Sajedi H (2018) Peer sampling gossip-based distributed clustering algorithm for unstructured P2P networks. Neural Comput Appl 29(2):593\u2013612","journal-title":"Neural Comput Appl"},{"key":"3607_CR7","unstructured":"MacQueen J (1967). Some methods for classification and analysis of multivariate observations. In: Proceedings of the fifth Berkeley symposium on mathematical statistics and probability vol 1, no 14, pp 281\u2013297"},{"issue":"8","key":"3607_CR8","doi-asserted-by":"publisher","first-page":"1433","DOI":"10.1109\/TNNLS.2013.2293795","volume":"25","author":"X Huang","year":"2014","unstructured":"Huang X, Ye Y, Zhang H (2014) Extensions of kmeans-type algorithms: a new clustering framework by integrating intracluster compactness and intercluster separation. IEEE Trans Neural Netw Learn Syst 25(8):1433\u20131446","journal-title":"IEEE Trans Neural Netw Learn Syst"},{"issue":"5814","key":"3607_CR9","doi-asserted-by":"publisher","first-page":"972","DOI":"10.1126\/science.1136800","volume":"315","author":"BJ Frey","year":"2007","unstructured":"Frey BJ, Dueck D (2007) Clustering by passing messages between data points. Science 315(5814):972\u2013976","journal-title":"Science"},{"key":"3607_CR10","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/j.patcog.2016.03.008","volume":"58","author":"KM Kumar","year":"2016","unstructured":"Kumar KM, Reddy ARM (2016) A fast DBSCAN clustering algorithm by accelerating neighbor searching using Groups method. Pattern Recogn 58:39\u201348","journal-title":"Pattern Recogn"},{"key":"3607_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/TPAMI.1980.4766964","volume":"1","author":"JC Bezdek","year":"1980","unstructured":"Bezdek JC (1980) A convergence theorem for the fuzzy ISODATA clustering algorithms. IEEE Trans Pattern Anal Mach Intell 1:1\u20138","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"3607_CR12","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/j.neucom.2015.10.020","volume":"175","author":"L Liu","year":"2016","unstructured":"Liu L, Sun L, Chen S, Liu M, Zhong J (2016) K-PRSCAN: a clustering method based on PageRank. Neurocomputing 175:65\u201380","journal-title":"Neurocomputing"},{"issue":"5","key":"3607_CR13","doi-asserted-by":"publisher","first-page":"1299","DOI":"10.1162\/089976698300017467","volume":"10","author":"B Sch\u00f6lkopf","year":"1998","unstructured":"Sch\u00f6lkopf B, Smola A, M\u00fcller KR (1998) Nonlinear component analysis as a kernel eigenvalue problem. Neural Comput 10(5):1299\u20131319","journal-title":"Neural Comput"},{"issue":"11","key":"3607_CR14","doi-asserted-by":"publisher","first-page":"1944","DOI":"10.1109\/TPAMI.2007.1115","volume":"29","author":"IS Dhillon","year":"2007","unstructured":"Dhillon IS, Guan Y, Kulis B (2007) Weighted graph cuts without eigenvectors a multilevel approach. IEEE Trans Pattern Anal Mach Intell 29(11):1944\u20131957","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"3607_CR15","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/j.neucom.2014.05.067","volume":"143","author":"E Tu","year":"2014","unstructured":"Tu E, Cao L, Yang J, Kasabov N (2014) A novel graph-based k-means for nonlinear manifold clustering and representative selection. Neurocomputing 143:109\u2013122","journal-title":"Neurocomputing"},{"key":"3607_CR16","doi-asserted-by":"publisher","first-page":"334","DOI":"10.1016\/j.patcog.2016.05.008","volume":"60","author":"D Chang","year":"2016","unstructured":"Chang D, Zhao Y, Liu L, Zheng C (2016) A dynamic niching clustering algorithm based on individual-connectedness and its application to color image segmentation. Pattern Recogn 60:334\u2013347","journal-title":"Pattern Recogn"},{"key":"3607_CR17","doi-asserted-by":"crossref","unstructured":"Tzortzis G, Likas A (2008, June). The global kernel k-means clustering algorithm. In: IEEE international joint conference on neural networks, 2008. IJCNN 2008 (IEEE World Congress on Computational Intelligence). IEEE, pp 1977\u20131984","DOI":"10.1109\/IJCNN.2008.4634069"},{"key":"3607_CR18","doi-asserted-by":"crossref","unstructured":"Dhillon I, Guan Y, Kulis B (2005) A fast kernel-based multilevel algorithm for graph clustering. In: Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining. ACM, pp 629\u2013634","DOI":"10.1145\/1081870.1081948"},{"key":"3607_CR19","doi-asserted-by":"publisher","DOI":"10.1007\/s00521-017-3036-2","author":"Y Nataliani","year":"2017","unstructured":"Nataliani Y, Yang MS (2017) Powered Gaussian kernel spectral clustering. Neural Comput Appl. \n                    https:\/\/doi.org\/10.1007\/s00521-017-3036-2","journal-title":"Neural Comput Appl"},{"issue":"9","key":"3607_CR20","doi-asserted-by":"publisher","first-page":"1074","DOI":"10.1109\/43.159993","volume":"11","author":"L Hagen","year":"1992","unstructured":"Hagen L, Kahng AB (1992) New spectral methods for ratio cut partitioning and clustering. IEEE Trans Comput Aided Des Integr Circuits Syst 11(9):1074\u20131085","journal-title":"IEEE Trans Comput Aided Des Integr Circuits Syst"},{"issue":"8","key":"3607_CR21","doi-asserted-by":"publisher","first-page":"888","DOI":"10.1109\/34.868688","volume":"22","author":"J Shi","year":"2000","unstructured":"Shi J, Malik J (2000) Normalized cuts and image segmentation. IEEE Trans Pattern Anal Mach Intell 22(8):888\u2013905","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"3607_CR22","doi-asserted-by":"crossref","unstructured":"Ding C H, He X, Zha H, Gu M, Simon HD (2001) A min-max cut algorithm for graph partitioning and data clustering. In: Proceedings IEEE international conference on data mining, 2001, ICDM 2001. IEEE, pp 107\u2013114","DOI":"10.1109\/ICDM.2001.989507"},{"key":"3607_CR23","unstructured":"Ester M, Kriegel HP, Sander J, Xu X (1996) A density-based algorithm for discovering clusters in large spatial databases with noise. In Kdd, vol 96, no. 34, pp 226\u2013231"},{"key":"3607_CR24","doi-asserted-by":"publisher","first-page":"486","DOI":"10.1016\/j.patcog.2016.04.018","volume":"60","author":"M Chen","year":"2016","unstructured":"Chen M, Li L, Wang B, Cheng J, Pan L, Chen X (2016) Effectively clustering by finding density backbone based-on kNN. Pattern Recogn 60:486\u2013498","journal-title":"Pattern Recogn"},{"issue":"6191","key":"3607_CR25","doi-asserted-by":"publisher","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"},{"key":"3607_CR26","doi-asserted-by":"crossref","unstructured":"Du H (2015). Robust local outlier detection. In Data Mining Workshop (ICDMW). In: 2015 IEEE international conference on IEEE, pp 116\u2013123","DOI":"10.1109\/ICDMW.2015.114"},{"issue":"1","key":"3607_CR27","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/s00521-016-2300-1","volume":"28","author":"Y Shi","year":"2017","unstructured":"Shi Y, Chen Z, Qi Z, Meng F, Cui L (2017) A novel clustering-based image segmentation via density peaks algorithm with mid-level feature. Neural Comput Appl 28(1):29\u201339","journal-title":"Neural Comput Appl"},{"issue":"7","key":"3607_CR28","doi-asserted-by":"publisher","first-page":"1131","DOI":"10.1007\/s13042-017-0636-1","volume":"9","author":"M Du","year":"2018","unstructured":"Du M, Ding S, Xue Y (2018) A robust density peaks clustering algorithm using fuzzy neighborhood. Int J Mach Learn Cybern 9(7):1131\u20131140","journal-title":"Int J Mach Learn Cybern"},{"key":"3607_CR29","doi-asserted-by":"publisher","DOI":"10.1007\/s13042-017-0648-x","author":"M Du","year":"2017","unstructured":"Du M, Ding S, Xu X, Xue Y (2017) Density peaks clustering using geodesic distances. Int J Mach Learn Cybern. \n                    https:\/\/doi.org\/10.1007\/s13042-017-0648-x","journal-title":"Int J Mach Learn Cybern"},{"key":"3607_CR30","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1016\/j.patcog.2017.06.023","volume":"71","author":"L Bai","year":"2017","unstructured":"Bai L, Cheng X, Liang J, Shen H, Guo Y (2017) Fast density clustering strategies based on the k-means algorithm. Pattern Recogn 71:375\u2013386","journal-title":"Pattern Recogn"},{"issue":"18","key":"3607_CR31","doi-asserted-by":"publisher","first-page":"3825","DOI":"10.1016\/j.comnet.2012.10.007","volume":"56","author":"S Brin","year":"2012","unstructured":"Brin S, Page L (2012) The anatomy of a large-scale hypertextual web search engine. Comput Netw 56(18):3825\u20133833","journal-title":"Comput Netw"},{"issue":"4","key":"3607_CR32","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1109\/TPAMI.2003.1190577","volume":"25","author":"B Fischer","year":"2003","unstructured":"Fischer B, Buhmann JM (2003) Path-based clustering for grouping of smooth curves and texture segmentation. IEEE Trans Pattern Anal Mach Intell 25(4):513\u2013518","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"issue":"1","key":"3607_CR33","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1109\/T-C.1971.223083","volume":"100","author":"CT Zahn","year":"1971","unstructured":"Zahn CT (1971) Graph-theoretical methods for detecting and describing gestalt clusters. IEEE Trans Comput 100(1):68\u201386","journal-title":"IEEE Trans Comput"},{"issue":"6","key":"3607_CR34","doi-asserted-by":"publisher","first-page":"1389","DOI":"10.1002\/j.1538-7305.1957.tb01515.x","volume":"36","author":"RC Prim","year":"1957","unstructured":"Prim RC (1957) Shortest connection networks and some generalizations. Bell Labs Tech J 36(6):1389\u20131401","journal-title":"Bell Labs Tech J"},{"issue":"6","key":"3607_CR35","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1145\/367766.368168","volume":"5","author":"RW Floyd","year":"1962","unstructured":"Floyd RW (1962) Algorithm 97: shortest path. Commun ACM 5(6):345","journal-title":"Commun ACM"},{"issue":"4","key":"3607_CR36","doi-asserted-by":"publisher","first-page":"791","DOI":"10.1109\/TFUZZ.2015.2486806","volume":"24","author":"SD Xenaki","year":"2016","unstructured":"Xenaki SD, Koutroumbas KD, Rontogiannis AA (2016) A novel adaptive possibilistic clustering algorithm. IEEE Trans Fuzzy Syst 24(4):791\u2013810","journal-title":"IEEE Trans Fuzzy Syst"},{"issue":"1","key":"3607_CR37","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/j.patcog.2007.04.010","volume":"41","author":"H Chang","year":"2008","unstructured":"Chang H, Yeung DY (2008) Robust path-based spectral clustering. Pattern Recogn 41(1):191\u2013203","journal-title":"Pattern Recogn"},{"issue":"2","key":"3607_CR38","doi-asserted-by":"publisher","first-page":"021130","DOI":"10.1103\/PhysRevE.81.021130","volume":"81","author":"TS Jackson","year":"2010","unstructured":"Jackson TS, Read N (2010) Theory of minimum spanning trees. I. Mean-field theory and strongly disordered spin-glass model. Phys Rev E 81(2):021130","journal-title":"Phys Rev E"},{"issue":"3","key":"3607_CR39","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1080\/15427951.2005.10129108","volume":"2","author":"GM Corso Del","year":"2005","unstructured":"Del Corso GM, Gulli A, Romani F (2005) Fast PageRank computation via a sparse linear system. Internet Math 2(3):251\u2013273","journal-title":"Internet Math"},{"key":"3607_CR40","doi-asserted-by":"crossref","unstructured":"Rungsawang A, Manaskasemsak B (2012, February). Fast pagerank computation on a gpu cluster. In: 2012 20th Euromicro international conference on parallel, distributed and network-based processing (PDP). IEEE, pp 450\u2013456","DOI":"10.1109\/PDP.2012.78"},{"issue":"1","key":"3607_CR41","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1145\/1217299.1217303","volume":"1","author":"A Gionis","year":"2007","unstructured":"Gionis A, Mannila H, Tsaparas P (2007) Clustering aggregation. ACM Trans Knowl Discov Data (TKDD) 1(1):4","journal-title":"ACM Trans Knowl Discov Data (TKDD)"},{"key":"3607_CR42","unstructured":"Zelnik-Manor L, Perona P (2005) Self-tuning spectral clustering. In: Advances in neural information processing systems, pp 1601\u20131608"},{"key":"3607_CR43","doi-asserted-by":"crossref","unstructured":"Hadsell R, Chopra S, LeCun Y (2006) Dimensionality reduction by learning an invariant mapping. In: 2006 IEEE computer society conference on computer vision and pattern recognition, vol 2. IEEE, pp 1735\u20131742","DOI":"10.1109\/CVPR.2006.100"},{"issue":"6","key":"3607_CR44","doi-asserted-by":"publisher","first-page":"1624","DOI":"10.1162\/neco_a_01081","volume":"30","author":"Q Liu","year":"2018","unstructured":"Liu Q, Zhang R, Zhao Z, Wang Z, Jiao M, Wang G (2018) Robust MST-based clustering algorithm. Neural Comput 30(6):1624\u20131646","journal-title":"Neural Comput"},{"key":"3607_CR45","unstructured":"Zhang S, You Z, Wu X (2017) Plant disease leaf image segmentation based on superpixel clustering and EM algorithm. Neural Comput Appl PP:1\u20138"},{"issue":"2","key":"3607_CR46","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1007\/s00521-016-2468-4","volume":"29","author":"R Khemchandani","year":"2018","unstructured":"Khemchandani R, Pal A, Chandra S (2018) Fuzzy least squares twin support vector clustering. Neural Comput Appl 29(2):553\u2013563","journal-title":"Neural Comput Appl"},{"issue":"7\u20138","key":"3607_CR47","doi-asserted-by":"publisher","first-page":"1917","DOI":"10.1007\/s00521-013-1437-4","volume":"24","author":"HM Moftah","year":"2014","unstructured":"Moftah HM, Azar AT, Al-Shammari ET, Ghali NI, Hassanien AE, Shoman M (2014) Adaptive k-means clustering algorithm for MR breast image segmentation. Neural Comput Appl 24(7\u20138):1917\u20131928","journal-title":"Neural Comput Appl"},{"key":"3607_CR48","doi-asserted-by":"publisher","first-page":"3045","DOI":"10.1109\/TNNLS.2016.2607757","volume":"28","author":"H Zhang","year":"2018","unstructured":"Zhang H, Wang S, Xu X, Chow TW, Wu QJ (2018) Tree2Vector: learning a vectorial representation for tree-structured data. IEEE Trans Neural Netw Learn Syst 28:3045\u20133060","journal-title":"IEEE Trans Neural Netw Learn Syst"}],"container-title":["Neural Computing and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-018-3607-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00521-018-3607-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-018-3607-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,24]],"date-time":"2019-10-24T21:51:02Z","timestamp":1571953862000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00521-018-3607-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,7,5]]},"references-count":48,"journal-issue":{"issue":"11","published-print":{"date-parts":[[2019,11]]}},"alternative-id":["3607"],"URL":"https:\/\/doi.org\/10.1007\/s00521-018-3607-x","relation":{},"ISSN":["0941-0643","1433-3058"],"issn-type":[{"type":"print","value":"0941-0643"},{"type":"electronic","value":"1433-3058"}],"subject":[],"published":{"date-parts":[[2018,7,5]]},"assertion":[{"value":"17 February 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 June 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 July 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Compliance with ethical standards"}},{"value":"No conflict of interest exists in the submission of this manuscript.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}