{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:08:49Z","timestamp":1725491329491},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540754435"},{"type":"electronic","value":"9783540754442"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-75444-2_15","type":"book-chapter","created":{"date-parts":[[2007,9,7]],"date-time":"2007-09-07T15:48:35Z","timestamp":1189180115000},"page":"97-107","source":"Crossref","is-referenced-by-count":6,"title":["An Adaptive Parallel Hierarchical Clustering Algorithm"],"prefix":"10.1007","author":[{"given":"Zhaopeng","family":"Li","sequence":"first","affiliation":[]},{"given":"Kenli","family":"Li","sequence":"additional","affiliation":[]},{"given":"Degui","family":"Xiao","sequence":"additional","affiliation":[]},{"given":"Lei","family":"Yang","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"15_CR1","volume-title":"Data Mining: Concepts and Techniques","author":"J. Han","year":"2000","unstructured":"Han, J., Kamber, M.: Data Mining: Concepts and Techniques. Morgan Kaufmann Publishers, San Francisco (2000)"},{"key":"15_CR2","doi-asserted-by":"publisher","first-page":"1313","DOI":"10.1016\/0167-8191(95)00017-I","volume":"21","author":"C.F. Olson","year":"1995","unstructured":"Olson, C.F.: Parallel Algorithms for Hierarchical Clustering. Parallel Computing\u00a021, 1313\u20131325 (1995)","journal-title":"Parallel Computing"},{"key":"15_CR3","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1006\/jagm.2000.1090","volume":"36","author":"E. Dahlhaus","year":"2000","unstructured":"Dahlhaus, E.: Parallel Algorithms for Hierarchical Clustering and Applications to Split Decomposition and Parity Graph Recognition. Journal of Algorithms\u00a036, 205\u2013240 (2000)","journal-title":"Journal of Algorithms"},{"issue":"6","key":"15_CR4","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1109\/TPDS.2005.72","volume":"16","author":"S. Rajasekaran","year":"2005","unstructured":"Rajasekaran, S.: Efficient Parallel Hierarchical Clustering Algorithms. IEEE transactions on parallel and distributed systems\u00a016(6), 497\u2013502 (2005)","journal-title":"IEEE transactions on parallel and distributed systems"},{"key":"15_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1108\/eb026836","volume":"45","author":"E.M. Rasmussen","year":"1989","unstructured":"Rasmussen, E.M., Willett, P.: Efficiency of hierarchic agglomerative clustering using the ICL Distributed Array Processor. Journal of Documentation\u00a045, 1\u201324 (1989)","journal-title":"Journal of Documentation"},{"key":"15_CR6","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1016\/0167-8191(89)90036-7","volume":"11","author":"X. Li","year":"1989","unstructured":"Li, X., Fang, Z.: Parallel Clustering Algorithms. Parallel Computing\u00a011, 275\u2013290 (1989)","journal-title":"Parallel Computing"},{"key":"15_CR7","doi-asserted-by":"publisher","first-page":"1088","DOI":"10.1109\/34.61708","volume":"12","author":"X. Li","year":"1990","unstructured":"Li, X.: Parallel Algorithms for Hierarchical Clustering and Clustering Validity. IEEE Trans. Pattern Analysis and Machine Intelligence\u00a012, 1088\u20131092 (1990)","journal-title":"IEEE Trans. Pattern Analysis and Machine Intelligence"},{"key":"15_CR8","doi-asserted-by":"publisher","first-page":"801","DOI":"10.1016\/S0031-3203(96)00119-7","volume":"30","author":"H.R. Tsai","year":"1997","unstructured":"Tsai, H.R., Horng, S.J., Lee, S.S., Tsai, S.S., Kao, T.W.: Parallel Hierarchical Clustering Algorithms on Processor Arrays with a Reconfigurable Bus System. Pattern Recognition\u00a030, 801\u2013815 (1997)","journal-title":"Pattern Recognition"},{"issue":"11","key":"15_CR9","doi-asserted-by":"crossref","first-page":"1367","DOI":"10.1109\/TC.1987.5009478","volume":"36","author":"S.G. Akl","year":"1987","unstructured":"Akl, S G.: Optimal parallel merging and sorting without memory conflicts. IEEE Trans. Comput.\u00a036(11), 1367\u20131369 (1987)","journal-title":"IEEE Trans. Comput."},{"key":"15_CR10","volume-title":"Design and analysis of parallel algorithm","author":"G. Chen","year":"2002","unstructured":"Chen, G.: Design and analysis of parallel algorithm. Higher education press, Beijing (2002)"},{"issue":"5","key":"15_CR11","doi-asserted-by":"crossref","first-page":"429","DOI":"10.1109\/TSMCA.2003.809173","volume":"33","author":"A. Datta","year":"2003","unstructured":"Datta, A., Soundaralakshmi, S.: Fast Parallel Algorithm for Distance Transform. IEEE Transactions on Systems, Man, and Cybernetics\u00a033(5), 429\u2013434 (2003)","journal-title":"IEEE Transactions on Systems, Man, and Cybernetics"},{"key":"15_CR12","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/BF02240073","volume":"3","author":"S.G. Akl","year":"1986","unstructured":"Akl, S.G.: An adaptive and cost-optimal parallel algorithm for minimum spanning trees. Computing\u00a03, 271\u2013277 (1986)","journal-title":"Computing"},{"issue":"6","key":"15_CR13","doi-asserted-by":"publisher","first-page":"760","DOI":"10.1007\/BF02973436","volume":"19","author":"K.L. Li","year":"2004","unstructured":"Li, K.L., Li, Q.H., Li, R.F.: Optimal parallel algorithm for the knapsack problem without memory conflicts. Journal of Computer Science and Technology\u00a019(6), 760\u2013768 (2004)","journal-title":"Journal of Computer Science and Technology"},{"issue":"4","key":"15_CR14","doi-asserted-by":"publisher","first-page":"362","DOI":"10.1007\/BF02939544","volume":"8","author":"M. Jun","year":"1993","unstructured":"Jun, M., Shaohan, M.: Effcient Parallel Algorithm s for Some Graph Theory Problems. J. of Comput. Sci. Technol.\u00a08(4), 362\u2013366 (1993)","journal-title":"J. of Comput. Sci. Technol."},{"issue":"1","key":"15_CR15","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1016\/0020-0190(82)90131-4","volume":"14","author":"D. Nath","year":"1982","unstructured":"Nath, D., Maheshwari, S.N.: Parallel algorithms for the connected components and minimal spanning tree problems. Inf: Proc. Lett.\u00a014(1), 7\u201311 (1982)","journal-title":"Inf: Proc. Lett."},{"issue":"2","key":"15_CR16","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1145\/375827.375847","volume":"48","author":"K.W. Chong","year":"2001","unstructured":"Chong, K.W., Han, Y.J.: Concurrent Threads and Optimal Parallel MinimumSpanning Trees Algorithm. Journal of the ACM\u00a048(2), 297\u2013323 (2001)","journal-title":"Journal of the ACM"},{"issue":"3","key":"15_CR17","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1016\/j.datak.2006.07.004","volume":"61","author":"M. Dash","year":"2007","unstructured":"Dash, M., Petrutiu, S., Scheuermann, P.: pPOP: Fast yet accurate parallel hierarchical clustering using partitioning. Data & Knowledge Engineering\u00a061(3), 563\u2013578 (2007)","journal-title":"Data & Knowledge Engineering"}],"container-title":["Lecture Notes in Computer Science","High Performance Computing and Communications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-75444-2_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,23]],"date-time":"2019-02-23T12:09:50Z","timestamp":1550923790000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-75444-2_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540754435","9783540754442"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-75444-2_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}