{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,18]],"date-time":"2025-10-18T11:00:29Z","timestamp":1760785229723,"version":"3.40.3"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030050535"},{"type":"electronic","value":"9783030050542"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-030-05054-2_23","type":"book-chapter","created":{"date-parts":[[2018,12,7]],"date-time":"2018-12-07T00:33:21Z","timestamp":1544142801000},"page":"297-307","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Clustering Algorithm of High-Dimensional Data Based on Sequential Psim Matrix and Differential Truncation"],"prefix":"10.1007","author":[{"given":"Gongming","family":"Wang","sequence":"first","affiliation":[]},{"given":"Wenfa","family":"Li","sequence":"additional","affiliation":[]},{"given":"Weizhi","family":"Xu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,12,7]]},"reference":[{"key":"23_CR1","volume-title":"Data Mining: Concepts and Techniques","author":"JW Han","year":"2011","unstructured":"Han, J.W., Kamber, H.L., Pei, J.: Data Mining: Concepts and Techniques, 3rd edn. Morgan Kaufmann, San Francisco (2011)","edition":"3"},{"issue":"4","key":"23_CR2","doi-asserted-by":"publisher","first-page":"1024","DOI":"10.1016\/j.future.2012.05.026","volume":"29","author":"KL Ericson","year":"2013","unstructured":"Ericson, K.L., Pallickara, S.D.: On the performance of high dimensional data clustering and classification algorithms. Future Gener. Comput. Syst. 29(4), 1024\u20131034 (2013)","journal-title":"Future Gener. Comput. Syst."},{"key":"23_CR3","doi-asserted-by":"crossref","unstructured":"Keogh, E., Mueen, A.: Curse of dimensionality. In: Encyclopedia of Machine Learning, pp. 257\u2013258. Springer, Berlin (2010)","DOI":"10.1007\/978-0-387-30164-8_192"},{"issue":"4","key":"23_CR4","doi-asserted-by":"publisher","first-page":"597","DOI":"10.1142\/S0219622006002258","volume":"5","author":"Q Yang","year":"2006","unstructured":"Yang, Q., Wu, X.D.: 10 Challenging problems in data mining research. Int. J. Inf. Technol. Decis. Making 5(4), 597\u2013604 (2006)","journal-title":"Int. J. Inf. Technol. Decis. Making"},{"key":"23_CR5","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/3-540-28349-8_2","volume-title":"Grouping Multidimensional Data","author":"P Berkhin","year":"2006","unstructured":"Berkhin, P.: A survey of clustering data mining techniques. In: Kogan, J., Nicholas, C., Teboulle, M. (eds.) Grouping Multidimensional Data, pp. 25\u201371. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/3-540-28349-8_2"},{"issue":"1","key":"23_CR6","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1145\/1007730.1007731","volume":"6","author":"L Parsons","year":"2004","unstructured":"Parsons, L., Haque, E.S., Liu, H.: Subspace clustering for high dimensional data: a review. ACM SIGKDD Explor. Newsl. 6(1), 90\u2013105 (2004)","journal-title":"ACM SIGKDD Explor. Newsl."},{"key":"23_CR7","doi-asserted-by":"crossref","unstructured":"Dhillon, I.S.: Co-clustering documents and words using bipartite spectral graph partitioning. In: 7th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 269\u2013274. ACM Press, New York (2001)","DOI":"10.1145\/502512.502550"},{"issue":"5","key":"23_CR8","first-page":"79","volume":"23","author":"Q Fu","year":"2006","unstructured":"Fu, Q., Li, Z.F.: The research of clustering algorithm based on CLIQUE. J. East China Jiaotong Univ. 23(5), 79\u201382 (2006)","journal-title":"J. East China Jiaotong Univ."},{"key":"23_CR9","doi-asserted-by":"publisher","first-page":"809","DOI":"10.1016\/j.neucom.2006.10.034","volume":"70","author":"ZH Feng","year":"2007","unstructured":"Feng, Z.H., Zhou, B., Shen, J.Y.: A parallel hierarchical clustering algorithm for PCs cluster system. Neurocomputing 70, 809\u2013818 (2007)","journal-title":"Neurocomputing"},{"key":"23_CR10","doi-asserted-by":"publisher","first-page":"523","DOI":"10.1016\/j.parco.2005.01.001","volume":"31","author":"Z Du","year":"2005","unstructured":"Du, Z., Lin, F.: A novel parallelization approach for hierarchical clustering. Parallel Comput. 31, 523\u2013527 (2005)","journal-title":"Parallel Comput."},{"issue":"1","key":"23_CR11","first-page":"240","volume":"33","author":"HY Wu","year":"2006","unstructured":"Wu, H.Y., Wang, W.T., Wen, J.H., He, G.H.: Research on clustering algorithm of high-dimensional dataset with input knowledge. Comput. Sci. 33(1), 240\u2013242 (2006)","journal-title":"Comput. Sci."},{"key":"23_CR12","unstructured":"Yi, L.H.: Research on clustering algorithm for high dimensional data. Master\u2019s thesis, Yan Shan University, Qinhuangdao Hebei, China (2011)"},{"key":"23_CR13","volume-title":"Introduction to Data Mining","author":"PN Tan","year":"2005","unstructured":"Tan, P.N., Steinbach, M., Kumar, V.: Introduction to Data Mining. Addison-Wesley Publishing Company, Boston (2005)"},{"issue":"2","key":"23_CR14","first-page":"361","volume":"41","author":"FZ Yang","year":"2004","unstructured":"Yang, F.Z., Zhu, Y.Y.: An efficient method for similarity search on quantitative transaction data. J. Comput. Res. Dev. 41(2), 361\u2013368 (2004)","journal-title":"J. Comput. Res. Dev."},{"issue":"9","key":"23_CR15","first-page":"102","volume":"26","author":"SD Huang","year":"2009","unstructured":"Huang, S.D., Chen, Q.M.: On clustering algorithm of high dimensional data based on similarity measurement. Comput. Appl. Softw. 26(9), 102\u2013105 (2009)","journal-title":"Comput. Appl. Softw."},{"issue":"2","key":"23_CR16","first-page":"1","volume":"21","author":"CS Shao","year":"2011","unstructured":"Shao, C.S., Lou, W., Yan, L.M.: Optimization of algorithm of similarity measurement in high-dimensional data. Comput. Technol. Dev. 21(2), 1\u20134 (2011)","journal-title":"Comput. Technol. Dev."},{"issue":"5","key":"23_CR17","first-page":"30","volume":"23","author":"XY Wang","year":"2013","unstructured":"Wang, X.Y., Zhang, H.Y., Shen, L.Z., Chi, W.L.: Research on high dimensional clustering algorithm based on similarity measurement. Comput. Technol. Dev. 23(5), 30\u201333 (2013)","journal-title":"Comput. Technol. Dev."},{"issue":"B12","key":"23_CR18","first-page":"176","volume":"25","author":"XY Jia","year":"2005","unstructured":"Jia, X.Y.: A high dimensional data clustering algorithm based on twice similarity. J. Comput. Appl. 25(B12), 176\u2013177 (2005)","journal-title":"J. Comput. Appl."},{"key":"23_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/3-540-45710-0_13","volume-title":"Advances in Databases and Information Systems","author":"S Brakatsoulas","year":"2002","unstructured":"Brakatsoulas, S., Pfoser, D., Theodoridis, Y.: Revisiting R-tree construction principles. In: Manolopoulos, Y., N\u00e1vrat, P. (eds.) ADBIS 2002. LNCS, vol. 2435, pp. 149\u2013162. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45710-0_13"},{"key":"23_CR20","doi-asserted-by":"crossref","unstructured":"Nielsen, F., Piro, P., Barlaud, M.: Bregman vantage point trees for efficient nearest Neighbor Queries. In: 10th IEEE International Conference on Multimedia and Expo, pp. 878\u2013881. IEEE Computer Society, Birmingham (2009)","DOI":"10.1109\/ICME.2009.5202635"},{"key":"23_CR21","doi-asserted-by":"publisher","first-page":"535","DOI":"10.1007\/978-3-642-20511-8_49","volume":"66","author":"M Kunze","year":"2011","unstructured":"Kunze, M., Weske, M.: Metric trees for efficient similarity search in large process model repositories. Lect. Notes Bus. Inf. Process. 66, 535\u2013546 (2011)","journal-title":"Lect. Notes Bus. Inf. Process."},{"issue":"1","key":"23_CR22","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1007\/s007780200060","volume":"11","author":"GZ Navarro","year":"2002","unstructured":"Navarro, G.Z.: Searching in metric spaces by spatial approximation. VLDB J. 11(1), 28\u201346 (2002)","journal-title":"VLDB J."},{"key":"23_CR23","volume-title":"The Research and Application of Key Technologies in Knowledge Discovery of High-Dimensional Clustering","author":"JB Chen","year":"2011","unstructured":"Chen, J.B.: The Research and Application of Key Technologies in Knowledge Discovery of High-Dimensional Clustering. Publishing House of Electronics Industry, Beijing (2011)"},{"key":"23_CR24","unstructured":"Andrew, Y.N., Jordan, M.I., Weiss, Y.: On spectral clustering: analysis and algorithm. In: Advances in Neural Information Processing Systems, pp. 121\u2013526. MIT Press, Cambridge (2002)"},{"key":"23_CR25","unstructured":"Raymond, T.N., Han, J.W.: Efficient and effective clustering methods for spatial data mining. In: 20th International Conference on Very Large Data Bases, pp. 144\u2013155. IEEE Computer Society, Birmingham (1994)"},{"key":"23_CR26","doi-asserted-by":"crossref","unstructured":"Chen, L.F., Ye, Y.F., Jiang, Q.S.: A new centroid-based classifier for text categorization. In: 22nd IEEE International Conference on Advanced Information Networking and Applications, pp. 1217\u20131222. IEEE Computer Society, Birmingham (2008)","DOI":"10.1109\/WAINA.2008.12"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Architectures for Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-05054-2_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,13]],"date-time":"2024-07-13T03:07:59Z","timestamp":1720840079000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-05054-2_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030050535","9783030050542"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-05054-2_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"7 December 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICA3PP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Algorithms and Architectures for Parallel Processing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Guangzhou","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 November 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 November 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ica3pp2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/nsclab.org\/ica3pp2018\/authors.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"Easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"407","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"141","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"50","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"35% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"2.3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"7.3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}}]}}