{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T23:43:55Z","timestamp":1649115835957},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2017,12,1]],"date-time":"2017-12-01T00:00:00Z","timestamp":1512086400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Nature Science Foundation of China","doi-asserted-by":"crossref","award":["61502475"],"award-info":[{"award-number":["61502475"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Importation and Development of High-Caliber Talents Project of the Beijing Municipal Institutions","award":["CIT & TCD201504039"],"award-info":[{"award-number":["CIT & TCD201504039"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J AUDIO SPEECH MUSIC PROC."],"published-print":{"date-parts":[[2017,12]]},"DOI":"10.1186\/s13636-017-0123-3","type":"journal-article","created":{"date-parts":[[2017,12,4]],"date-time":"2017-12-04T12:19:09Z","timestamp":1512389949000},"update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Clustering algorithm for audio signals based on the sequential Psim matrix and Tabu Search"],"prefix":"10.1186","volume":"2017","author":[{"given":"Wenfa","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gongming","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ke","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,12,4]]},"reference":[{"issue":"4","key":"123_CR1","doi-asserted-by":"crossref","first-page":"1024","DOI":"10.1016\/j.future.2012.05.026","volume":"29","author":"K Ericson","year":"2013","unstructured":"Ericson, K, & Pallickara, S. (2013). On the performance of high dimensional data clustering and classification algorithms. Futur. Gener. Comput. Syst., 29(4), 1024\u20131034.","journal-title":"Futur. Gener. Comput. Syst."},{"issue":"15","key":"123_CR2","first-page":"32","volume":"82","author":"U Ravale","year":"2013","unstructured":"Ravale, U, Marathe, N, Padiya, P. (2013). Attribute reduction based hybrid anomaly intrusion detection using K-means and SVM classifier. Int. J. Comput. Appl., 82(15), 32\u201335.","journal-title":"Int. J. Comput. Appl."},{"issue":"4","key":"123_CR3","doi-asserted-by":"crossref","first-page":"1455","DOI":"10.1016\/j.patcog.2014.11.003","volume":"48","author":"GJ Gan","year":"2015","unstructured":"Gan, GJ, & Ng, MK. (2015). Subspace clustering using affinity propagation. Pattern Recogn., 48(4), 1455\u20131464.","journal-title":"Pattern Recogn."},{"key":"123_CR4","volume-title":"Co-clustering: models, algorithms and applications","author":"G Govaert","year":"2014","unstructured":"Govaert, G, & Nadif, M (2014). Co-clustering: models, algorithms and applications. London: Wiley-ISTE."},{"issue":"1","key":"123_CR5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1497577.1497578","volume":"3","author":"HP Kriegel","year":"2009","unstructured":"Kriegel, HP, Kr\u00f6ger, P, Zimek, A. (2009). Clustering high-dimensional data: a survey on subspace clustering, pattern-based clustering, and correlation clustering. ACM Trans. Knowl. Discov. Data, 3(1), 1\u201358.","journal-title":"ACM Trans. Knowl. Discov. Data"},{"key":"123_CR6","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/j.knosys.2013.02.009","volume":"45","author":"E Rashedi","year":"2013","unstructured":"Rashedi, E, & Mirzaei, A. (2013). A hierarchical clusterer ensemble method based on boosting theory. Knowl.-Based Syst., 45, 83\u201393.","journal-title":"Knowl.-Based Syst."},{"key":"123_CR7","first-page":"598","volume-title":"Proceedings of the 14th international conference on human-computer interaction","author":"R Luo","year":"2011","unstructured":"Luo, R, & Yi, Q (2011). A novel parallel clustering algorithm based on artificial immune network using nVidia CUDA framework. In Proceedings of the 14 th international conference on human-computer interaction, (pp. 598\u2013607). Berlin: Springer-Verlag Press."},{"key":"123_CR8","doi-asserted-by":"crossref","first-page":"645","DOI":"10.1109\/ICSESS.2014.6933651","volume-title":"Proceedings of the IEEE International Conference on Software Engineering and Service Science 2014","author":"ZY Sun","year":"2014","unstructured":"Sun, ZY, Mak, LO, Mao, KZ, Tang, WY, Liu, Y, Xian, KT, Wang, ZM, Sui, Y (2014). A knowledge-driven ART clustering algorithm. In Proceedings of the IEEE International Conference on Software Engineering and Service Science 2014, (pp. 645\u2013648). Birmingham: IEEE Comput Soc."},{"key":"123_CR9","first-page":"257","volume-title":"Encyclopedia of machine learning","author":"E Keogh","year":"2010","unstructured":"Keogh, E, & Mueen, A (2010). Curse of dimensionality. In Encyclopedia of machine learning, (pp. 257\u2013258). Berlin: Springer-Verlag."},{"key":"123_CR10","volume-title":"Research on clustering algorithm for high dimensional data","author":"LH Yi","year":"2011","unstructured":"Yi, LH (2011). Research on clustering algorithm for high dimensional data. Qinhuangdao: Yanshan University."},{"key":"123_CR11","doi-asserted-by":"crossref","first-page":"154","DOI":"10.1016\/j.cor.2016.07.021","volume":"77","author":"O Shahvari","year":"2017","unstructured":"Shahvari, O, & Logendran, R. (2017). An enhanced Tabu search algorithm to minimize a bi-criteria objective in batching and scheduling problems on unrelated-parallel machines with desired lower bounds on batch sizes. Comput. Oper. Res., 77, 154\u2013176.","journal-title":"Comput. Oper. Res."},{"key":"123_CR12","volume-title":"Introduction to data mining","author":"PN Tan","year":"2005","unstructured":"Tan, PN, Steinbach, M, Kumar, V (2005). Introduction to data mining. Boston: Addison-Wesley Publishing Company."},{"issue":"2","key":"123_CR13","first-page":"361","volume":"41","author":"FZ Yang","year":"2004","unstructured":"Yang, FZ, & Zhu, YY. (2004). An efficient method for similarity search on quantitative transaction data. J. Comput. Res. Dev., 41(2), 361\u2013368.","journal-title":"J. Comput. Res. Dev."},{"issue":"9","key":"123_CR14","first-page":"102","volume":"26","author":"SD Huang","year":"2009","unstructured":"Huang, SD, & Chen, QM. (2009). On clustering algorithm of high dimensional data based on similarity measurement. Comput. Appl. Softw., 26(9), 102\u2013105.","journal-title":"Comput. Appl. Softw."},{"issue":"2","key":"123_CR15","first-page":"1","volume":"21","author":"CS Shao","year":"2011","unstructured":"Shao, CS, Lou, W, Yan, LM. (2011). Optimization of algorithm of similarity measurement in high-dimensional data. Comput. Technol. Dev., 21(2), 1\u20134.","journal-title":"Comput. Technol. Dev."},{"issue":"5","key":"123_CR16","first-page":"30","volume":"23","author":"XY Wang","year":"2013","unstructured":"Wang, XY, Zhang, HY, Shen, LZ, Chi, WL. (2013). Research on high dimensional clustering algorithm based on similarity measurement. Comput. Technol. Dev., 23(5), 30\u201333.","journal-title":"Comput. Technol. Dev."},{"issue":"B12","key":"123_CR17","first-page":"176","volume":"25","author":"XY Jia","year":"2005","unstructured":"Jia, XY. (2005). A high dimensional data clustering algorithm based on twice similarity. J. Comput. Appl., 25(B12), 176\u2013177.","journal-title":"J. Comput. Appl."},{"key":"123_CR18","first-page":"612","volume-title":"Proceedings of the international forum on information technology and applications","author":"N Tan","year":"2009","unstructured":"Tan, N, & Shi, YX (2009). Optimization research of multi-dimensional indexing structure of R*-tree. In Proceedings of the international forum on information technology and applications, (pp. 612\u2013615). Berlin: Springer-Verlag Press."},{"key":"123_CR19","doi-asserted-by":"crossref","first-page":"758","DOI":"10.1007\/11596448_112","volume":"3801","author":"HB Chen","year":"2005","unstructured":"Chen, HB, & Wang, ZQ. (2005). CR*-tree: an improved R-tree using cost model. Lect. Notes Comput. Sc., 3801, 758\u2013764.","journal-title":"Lect. Notes Comput. Sc."},{"key":"123_CR20","doi-asserted-by":"crossref","first-page":"878","DOI":"10.1109\/ICME.2009.5202635","volume-title":"Proceedings of the IEEE International Conference on Multimedia and Expo 2009","author":"F Nielsen","year":"2009","unstructured":"Nielsen, F, Piro, P, Barlaud, M (2009). Bregman vantage point trees for efficient nearest neighbor queries. In Proceedings of the IEEE International Conference on Multimedia and Expo 2009, (pp. 878\u2013881). Birmingham: IEEE Comput Soc."},{"key":"123_CR21","doi-asserted-by":"crossref","first-page":"535","DOI":"10.1007\/978-3-642-20511-8_49","volume":"66","author":"M Kunze","year":"2011","unstructured":"Kunze, M, & Weske, M. (2011). Metric trees for efficient similarity search in large process model repositories. Lect. Notes Bus. Info. Proc., 66, 535\u2013546.","journal-title":"Lect. Notes Bus. Info. Proc."},{"issue":"1","key":"123_CR22","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1007\/s007780200060","volume":"11","author":"G Navarro","year":"2002","unstructured":"Navarro, G. (2002). Searching in metric spaces by spatial approximation. VLDB J., 11(1), 28\u201346.","journal-title":"VLDB J."},{"key":"123_CR23","volume-title":"The research and application of key technologies in knowledge discovery of high-dimensional clustering","author":"JB Chen","year":"2011","unstructured":"Chen, JB (2011). The research and application of key technologies in knowledge discovery of high-dimensional clustering. Beijing: Publishing House of Electronics Industry."},{"key":"123_CR24","doi-asserted-by":"crossref","first-page":"3261","DOI":"10.1007\/978-1-4419-7997-1_17","volume-title":"Handbook of combinatorial optimization","author":"F Glover","year":"2013","unstructured":"Glover, F, & Laguna, M (2013). Tabu search*. In Handbook of combinatorial optimization, (pp. 3261\u20133362). Berlin: Springer-Verlag."},{"issue":"3","key":"123_CR25","first-page":"241","volume":"22","author":"WF Li","year":"2016","unstructured":"Li, WF, Wang, GM, Ma, N, Liu, HZ. (2016). A nearest neighbor search algorithm of high-dimensional data based on sequential Npsim matrix. High Technol. Lett., 22(3), 241\u2013247.","journal-title":"High Technol. Lett."},{"key":"123_CR26","first-page":"1002","volume-title":"Proceedings of the 33rd international conference on machine learning","author":"N Tremblay","year":"2016","unstructured":"Tremblay, N, Puy, G, Gribonval, R, Vandergheynst, P (2016). Compressive spectral clustering. In Proceedings of the 33 rd international conference on machine learning, (pp. 1002\u20131011). Birmingham: IEEE Comput Soc."},{"key":"123_CR27","series-title":"Encyclopedia of machine learning","first-page":"564","volume-title":"K-Medoids clustering","author":"X Jin","year":"2010","unstructured":"Jin, X, & Han, JW (2010). K-Medoids clustering, Encyclopedia of machine learning (pp. 564\u2013565). New York: Springer Publishing."},{"issue":"1","key":"123_CR28","doi-asserted-by":"crossref","first-page":"48","DOI":"10.13182\/NSE05-05","volume":"154","author":"TE Booth","year":"2006","unstructured":"Booth, TE. (2006). Power iteration method for the several largest eigenvalues and eigenfunctions. Nucl. Sci. Eng., 154(1), 48\u201362.","journal-title":"Nucl. Sci. Eng."},{"key":"123_CR29","first-page":"144","volume-title":"Proceedings of the VLDB 1994","author":"RT Ng","year":"1994","unstructured":"Ng, RT, & Han, JW (1994). Efficient and effective clustering methods for spatial data mining. In Proceedings of the VLDB 1994, (pp. 144\u2013155). Birmingham: IEEE Comput Soc."},{"key":"123_CR30","series-title":"Classification and regression trees","first-page":"64","volume-title":"Waveform recognition problem","author":"L Breiman","year":"1984","unstructured":"Breiman, L, Friedman, J, Stone, CJ, Olshen, RA (1984). Waveform recognition problem, Classification and regression trees (pp. 64\u201366). Belmont: Wadsworth International Group."},{"key":"123_CR31","first-page":"1217","volume-title":"Proceeding of the IEEE 22nd International Conference on Advanced Information Networking and Applications","author":"LF Chen","year":"2008","unstructured":"Chen, LF, Ye, YF, Jiang, QS (2008). A new centroid-based classifier for text categorization. In Proceeding of the IEEE 22 nd International Conference on Advanced Information Networking and Applications, (pp. 1217\u20131222). Birmingham: IEEE Comput Soc."}],"container-title":["EURASIP Journal on Audio, Speech, and Music Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/s13636-017-0123-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1186\/s13636-017-0123-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/s13636-017-0123-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,23]],"date-time":"2020-10-23T17:37:07Z","timestamp":1603474627000},"score":1,"resource":{"primary":{"URL":"https:\/\/asmp-eurasipjournals.springeropen.com\/articles\/10.1186\/s13636-017-0123-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,12]]},"references-count":31,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2017,12]]}},"alternative-id":["123"],"URL":"https:\/\/doi.org\/10.1186\/s13636-017-0123-3","relation":{},"ISSN":["1687-4722"],"issn-type":[{"value":"1687-4722","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,12]]},"article-number":"26"}}