{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T09:20:35Z","timestamp":1758273635835,"version":"3.37.3"},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2015,6,3]],"date-time":"2015-06-03T00:00:00Z","timestamp":1433289600000},"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 Science and Technology Research and Development Program of Handan","award":["1321103077-3"],"award-info":[{"award-number":["1321103077-3"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Int. J. Mach. Learn. & Cyber."],"published-print":{"date-parts":[[2017,6]]},"DOI":"10.1007\/s13042-015-0381-2","type":"journal-article","created":{"date-parts":[[2015,6,2]],"date-time":"2015-06-02T11:53:12Z","timestamp":1433245992000},"page":"731-738","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Sequence clustering algorithm based on weighted vector identification"],"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"}]}],"member":"297","published-online":{"date-parts":[[2015,6,3]]},"reference":[{"issue":"8","key":"381_CR1","doi-asserted-by":"crossref","first-page":"1078","DOI":"10.1093\/bioinformatics\/bts098","volume":"28","author":"M Vincent","year":"2012","unstructured":"Vincent M, Simon P, Vincent D (2012) High-quality sequence clustering guided by network topology and multiple alignment likelihood. Int J Bioinform 28(8):1078\u20131085","journal-title":"Int J Bioinform"},{"issue":"6","key":"381_CR2","first-page":"109","volume":"5","author":"JJ Ma","year":"2014","unstructured":"Ma JJ, Tian DY, Gong MG (2014) Fuzzy clustering with non-local information for image segmentation. Int J Mach Learn Cybern 5(6):109\u2013118","journal-title":"Int J Mach Learn Cybern"},{"issue":"1","key":"381_CR3","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1007\/s13042-014-0254-0","volume":"6","author":"HL Li","year":"2015","unstructured":"Li HL (2015) On-line and dynamic time warping for time series data mining. Int J Mach Learn Cybern 6(1):145\u2013153","journal-title":"Int J Mach Learn Cybern"},{"issue":"2","key":"381_CR4","first-page":"753","volume":"10","author":"J Yang","year":"2014","unstructured":"Yang J, Hong P, Huang XL, Zhang JR, Shi P (2014) A novel clustering algorithm based on P systems. Int J Innov Comput Inf Control 10(2):753\u2013765","journal-title":"Int J Innov Comput Inf Control"},{"key":"381_CR5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s13042-012-0070-3","volume":"4","author":"S Lipovetsky","year":"2013","unstructured":"Lipovetsky S (2013) Additive and multiplicative mixed normal distributions and finding cluster centers. Int J Mach Learn Cybern 4:1\u201311","journal-title":"Int J Mach Learn Cybern"},{"issue":"1","key":"381_CR6","first-page":"25","volume":"36","author":"K Arai","year":"2007","unstructured":"Arai K, Barakbah AR (2007) Hierarchical K-means: an algorithm for centroids initialization for K-means. J Rep Fac Sci Eng 36(1):25\u201331","journal-title":"J Rep Fac Sci Eng"},{"issue":"2","key":"381_CR7","first-page":"913","volume":"32","author":"YX Li","year":"2011","unstructured":"Li YX, Shi YM, Li GY (2011) Research on K-means algorithm based on concept lattice. Comput Eng Des 32(2):913\u2013916","journal-title":"Comput Eng Des"},{"issue":"3","key":"381_CR8","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(3):888\u2013892","journal-title":"J Appl Res Comput"},{"key":"381_CR9","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1007\/s13042-012-0077-9","volume":"4","author":"N Liu","year":"2013","unstructured":"Liu N, Chen F, Lu MY (2013) Spectral co-clustering documents and words using fuzzy K-harmonic means. Int J Mach Learn Cybern 4:75\u201383","journal-title":"Int J Mach Learn Cybern"},{"issue":"4","key":"381_CR10","first-page":"16","volume":"40","author":"JY Xie","year":"2012","unstructured":"Xie JY, Guo WJ, Xie WX (2012) A neighborhood-based K-medoids clustering algorithm. J Shaanxi Norm Univ (Nat Sci Ed) 40(4):16\u201322","journal-title":"J Shaanxi Norm Univ (Nat Sci Ed)"},{"issue":"2","key":"381_CR11","first-page":"102","volume":"29","author":"XJ Wan","year":"2003","unstructured":"Wan XJ, Yang JW, Chen XO (2003) An improved K-means algorithm for documents clustering. Comput Eng 29(2):102\u2013104","journal-title":"Comput Eng"},{"issue":"23","key":"381_CR12","first-page":"9823","volume":"8","author":"JS Zheng","year":"2012","unstructured":"Zheng JS, Zhang JH, Bai FL, Ma LX (2012) Similarity analysis of DNA sequences based on the MQ-EMD method. Int J Comput Inf Syst 8(23):9823\u20139830","journal-title":"Int J Comput Inf Syst"},{"issue":"1","key":"381_CR13","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/s13042-014-0245-1","volume":"6","author":"S Li","year":"2015","unstructured":"Li S, Mu WS, Qi B, Zhou ZJ (2015) A new privacy-preserving proximal support vector machine for classification of vertically partitioned data. Int J Mach Learn Cybern 6(1):109\u2013118","journal-title":"Int J Mach Learn Cybern"},{"key":"381_CR14","doi-asserted-by":"crossref","unstructured":"Morzy T, Wojciechowski M, Zakrzewicz M (2001) Scalable hierarchical clustering method for sequences of categorical values. In: Proceedings of the 5th Pacific-Asia conference on knowledge discovery and data mining ( PAKDD). Lecture notes in computer science, vol 2035. Springer, pp 282\u2013293","DOI":"10.1007\/3-540-45357-1_31"},{"issue":"14","key":"381_CR15","first-page":"9","volume":"31","author":"XG Hu","year":"2008","unstructured":"Hu XG, Zhang YY (2008) Clustering sequences using sequential patterns. J Hefei Univ Technol 31(14):9\u201312","journal-title":"J Hefei Univ Technol"},{"issue":"12","key":"381_CR16","first-page":"4811","volume":"9","author":"TT Pham","year":"2013","unstructured":"Pham TT, Luo JW, Hong TP, Vo B (2013) An efficient algorithm for mining sequential rules with interestingness measures. Intl J Innov Comput Inf Control 9(12):4811\u20134824","journal-title":"Intl J Innov Comput Inf Control"},{"key":"381_CR17","unstructured":"Yang TX, Wang ZH, Wang H, Wang LY (2010) Research of clustering initial center selection. J Nanjing Norm Univ (Nat Sci Ed) 33(4):161\u2013165"}],"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-0381-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s13042-015-0381-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13042-015-0381-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13042-015-0381-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T10:31:19Z","timestamp":1559471479000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s13042-015-0381-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,6,3]]},"references-count":17,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2017,6]]}},"alternative-id":["381"],"URL":"https:\/\/doi.org\/10.1007\/s13042-015-0381-2","relation":{},"ISSN":["1868-8071","1868-808X"],"issn-type":[{"type":"print","value":"1868-8071"},{"type":"electronic","value":"1868-808X"}],"subject":[],"published":{"date-parts":[[2015,6,3]]}}}