{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T07:29:08Z","timestamp":1758266948822,"version":"3.37.3"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2015,11,18]],"date-time":"2015-11-18T00:00:00Z","timestamp":1447804800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"the National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["61170190"],"award-info":[{"award-number":["61170190"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"name":"the Nature Science Foundation of Hebei Province","award":["F2015402114"],"award-info":[{"award-number":["F2015402114"]}]},{"name":"The Nature Science Foundation of Hebei Province","award":["F2015402070"],"award-info":[{"award-number":["F2015402070"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Int. J. Mach. Learn. & Cyber."],"published-print":{"date-parts":[[2017,4]]},"DOI":"10.1007\/s13042-015-0451-5","type":"journal-article","created":{"date-parts":[[2015,11,18]],"date-time":"2015-11-18T02:00:38Z","timestamp":1447812038000},"page":"641-649","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Representative points clustering algorithm based on density factor and relevant degree"],"prefix":"10.1007","volume":"8","author":[{"given":"Di","family":"Wu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jiadong","family":"Ren","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Long","family":"Sheng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,11,18]]},"reference":[{"key":"451_CR1","doi-asserted-by":"crossref","unstructured":"Hou SZ, Zhang XF (2008) Analysis and research for network management alarms correlation based on sequence clustering algorithm. In: Proceedings of the 2008 international conference on intelligent computation technology and automation, pp 982\u2013986","DOI":"10.1109\/ICICTA.2008.263"},{"key":"451_CR2","doi-asserted-by":"crossref","first-page":"137","DOI":"10.3233\/IDA-140634","volume":"18","author":"R Mishra","year":"2014","unstructured":"Mishra R, Kumar P, Bhasker B (2014) An alternative approach for clustering web user sessions considering sequential information. J Intell Data Anal 18:137\u2013156","journal-title":"J Intell Data Anal"},{"key":"451_CR3","doi-asserted-by":"crossref","unstructured":"Sharif MA, Raghavan VV (2014) A clustering based scalable hybrid approach for web page recommendation. In: Proceedings of 2014 IEEE international conference on big data, pp 80\u201387","DOI":"10.1109\/BigData.2014.7004360"},{"key":"451_CR4","first-page":"213","volume":"30","author":"TL Sheu","year":"2014","unstructured":"Sheu TL, Lin YH (2014) A cluster-based TDMA system for inter-vehicle communications. J Inf Sci Eng 30:213\u2013231","journal-title":"J Inf Sci Eng"},{"key":"451_CR5","doi-asserted-by":"crossref","first-page":"151","DOI":"10.3233\/IDA-2010-0461","volume":"15","author":"K Pichara","year":"2011","unstructured":"Pichara K, Soto A (2011) Active learning and subspace clustering for anomaly detection. J Intell Data Anal 15:151\u2013171","journal-title":"J Intell Data Anal"},{"key":"451_CR6","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/S0306-4379(01)00008-4","volume":"26","author":"S Guha","year":"2001","unstructured":"Guha S, Rastogi R, Shim K (2001) CURE: an efficient clustering algorithm for large databases. J Inf Syst 26:35\u201358","journal-title":"J Inf Syst"},{"key":"451_CR7","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/j.csda.2012.09.017","volume":"59","author":"JJ Zhang","year":"2013","unstructured":"Zhang JJ, Peng YW, Li HF (2013) A new semiparametric estimation method for accelerated hazards mixture cure model. J Comput Stat Data Anal 59:95\u2013102","journal-title":"J Comput Stat Data Anal"},{"key":"451_CR8","doi-asserted-by":"crossref","unstructured":"Wang XJ, Shen H (2009) Clustering high dimensional data streams with representative points. In: Proceedings of the 6th international conference on fuzzy systems and knowledge discovery, pp 449\u2013453","DOI":"10.1109\/FSKD.2009.341"},{"key":"451_CR9","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1016\/j.datak.2012.03.005","volume":"75","author":"B DelibasiC","year":"2012","unstructured":"DelibasiC B, VukiCeviC M, JovanoviC M, Kirchner K (2012) An architecture for component-based design of representative-based blustering algorithms. J Data Knowl Eng 75:78\u201398","journal-title":"J Data Knowl Eng"},{"key":"451_CR10","doi-asserted-by":"crossref","first-page":"3827","DOI":"10.1080\/01431160902777183","volume":"30","author":"D Cesmeci","year":"2009","unstructured":"Cesmeci D, Gullu MK (2009) Phase-correlation-based hyperspectral image classification using multiple class representatives obtained with K-means clustering. Int J Remote Sens 30:3827\u20133834","journal-title":"Int J Remote Sens"},{"key":"451_CR11","doi-asserted-by":"crossref","first-page":"958","DOI":"10.4028\/www.scientific.net\/AMR.121-122.958","volume":"121\u2013122","author":"YJ Pang","year":"2010","unstructured":"Pang YJ, Pan W, Liu KD (2010) A supervised clustering algorithm based on representative points and its application to fault diagnosis of diesel engine. J Adv Mater Res 121\u2013122:958\u2013963","journal-title":"J Adv Mater Res"},{"key":"451_CR12","first-page":"417","volume":"14","author":"EH Chen","year":"2001","unstructured":"Chen EH, Wang SF, Yan N, Wang XF (2001) The design and implementation of clustering algorithm using representative data. J Pattern Recognit Artif Intell 14:417\u2013422","journal-title":"J Pattern Recognit Artif Intell"},{"key":"451_CR13","first-page":"189","volume":"33","author":"TQ Huang","year":"2006","unstructured":"Huang TQ, Qin XL, Wang JD (2006) Multi-representation feature tree and spatial clustering algorithm. J Comput Sci 33:189\u2013195","journal-title":"J Comput Sci"},{"key":"451_CR14","first-page":"121","volume":"46","author":"RY Jia","year":"2010","unstructured":"Jia RY, Geng JW, Ning ZZ, He CG (2010) Fast clustering algorithm based on representative points. J Comput Eng Appl 46:121\u2013126","journal-title":"J Comput Eng Appl"},{"key":"451_CR15","doi-asserted-by":"crossref","first-page":"4190","DOI":"10.1016\/j.eswa.2013.01.027","volume":"40","author":"D Arajo","year":"2013","unstructured":"Arajo D, Neto AD (2013) Information-theoretic clustering: a representative and evolutionary approach. J Expert Syst Appl 40:4190\u20134205","journal-title":"J Expert Syst Appl"},{"key":"451_CR16","doi-asserted-by":"crossref","first-page":"326","DOI":"10.1007\/3-540-44681-8_46","volume":"2150","author":"A Domenica","year":"2001","unstructured":"Domenica A, Massimo C (2001) Experiments in parallel clustering with DBSCAN. Lect Notes Comput Sci 2150:326\u2013331","journal-title":"Lect Notes Comput Sci"},{"key":"451_CR17","doi-asserted-by":"crossref","first-page":"1123","DOI":"10.1016\/j.patrec.2004.03.008","volume":"25","author":"XZ Wang","year":"2004","unstructured":"Wang XZ, Wang YD, Wang LJ (2004) Improving fuzzy C-means clustering based on feature-weight learning. Pattern Recognit Lett 25:1123\u20131132","journal-title":"Pattern Recognit Lett"},{"key":"451_CR18","first-page":"504","volume":"48","author":"XX Li","year":"2012","unstructured":"Li XX, Meng FR, Zhou Y (2012) The fast clustering algorithm based representative points. J Nanjing Univ (Natl Sci) 48:504\u2013512","journal-title":"J Nanjing Univ (Natl Sci)"},{"key":"451_CR19","doi-asserted-by":"crossref","first-page":"556","DOI":"10.1109\/34.993562","volume":"24","author":"D Yeung","year":"2002","unstructured":"Yeung D, Wang XZ (2002) Improving performance of similarity-based clustering by feature weight learning. IEEE Trans Pattern Anal Mach Intell 24:556\u2013561","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"451_CR20","first-page":"4811","volume":"9","author":"TT Pham","year":"2013","unstructured":"Pham TT, Luo JW, Hong TP, Vo B (2013) Efficient algorithm for mining sequential rules with interestingness measures. Int J Innov Comput Inf Control 9:4811\u20134824","journal-title":"Int J Innov Comput Inf Control"},{"key":"451_CR21","unstructured":"IBM Almaden Research Center, Quest Data Mining Project[DB\/OL] (1996-03-12) [2007-05-26]. http:\/\/www.almaden.ibm.com\/cs\/quest\/syndata.html"},{"key":"451_CR22","first-page":"888","volume":"29","author":"JY Xie","year":"2012","unstructured":"Xie JY, Guo WJ, Xie WX, Gao XB (2012) K-means clustering algorithm based on optimal initial centers related to pattern distribution of samples in space. J Appl Res Comput 29:888\u2013892","journal-title":"J Appl Res Comput"},{"key":"451_CR23","first-page":"405","volume":"4","author":"D Wu","year":"2012","unstructured":"Wu D, Ren JD (2012) K-means sequence clustering algorithm based on top-K maximal frequent sequence patterns. Int J Adv Comput Technol 4:405\u2013413","journal-title":"Int J Adv Comput Technol"},{"key":"451_CR24","first-page":"2365","volume":"31","author":"SY Wang","year":"2010","unstructured":"Wang SY, Hu YF, Fan YJ, Xu HX (2010) Cluster of data streams with mixed numeric and categorical values based on entropy and distance. J Comput Syst 31:2365\u20132371","journal-title":"J Comput Syst"}],"container-title":["International Journal of Machine Learning and Cybernetics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13042-015-0451-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s13042-015-0451-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13042-015-0451-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13042-015-0451-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,1]],"date-time":"2019-09-01T13:01:34Z","timestamp":1567342894000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s13042-015-0451-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,11,18]]},"references-count":24,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2017,4]]}},"alternative-id":["451"],"URL":"https:\/\/doi.org\/10.1007\/s13042-015-0451-5","relation":{},"ISSN":["1868-8071","1868-808X"],"issn-type":[{"type":"print","value":"1868-8071"},{"type":"electronic","value":"1868-808X"}],"subject":[],"published":{"date-parts":[[2015,11,18]]}}}