{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T03:28:37Z","timestamp":1725506917733},"publisher-location":"Berlin, Heidelberg","reference-count":32,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540789451"},{"type":"electronic","value":"9783540789468"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-78946-8_8","type":"book-chapter","created":{"date-parts":[[2008,4,10]],"date-time":"2008-04-10T07:57:02Z","timestamp":1207814222000},"page":"135-157","source":"Crossref","is-referenced-by-count":3,"title":["A Geospatial Implementation of a Novel Delineation Clustering Algorithm Employing the K-means"],"prefix":"10.1007","author":[{"given":"Tonny J.","family":"Oyana","sequence":"first","affiliation":[]},{"given":"Kara E.","family":"Scott","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"8_CR1","unstructured":"Alsabti, K., S. Ranka, V. Singh. (1998). An efficient k-means clustering algorithm. Proceedings in IPPS: 11th International Parallel Processing Symposium Workshop on High Performance Data Mining, IEEE, Computer Society Press."},{"key":"8_CR2","unstructured":"Bac\u0107 \u00b4o, F., Lobo, V., and M. Painho. (2004) Geo-Self-Organizing Map (Geo-SOM) for Building and Exploring Homogeneous Regions. In Egenhofer, M.J., Freskes, C. and Miller, H.J., (eds.) Geographical Information Science. Proceedings of Third International Conference, GIScience. Adelphi, MD, USA. October 20\u201323, 2004. Springer-Verlay Berlin Heidelberg."},{"issue":"2","key":"8_CR3","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1002\/bs.3830120210","volume":"12","author":"G.H. Ball","year":"1967","unstructured":"Ball, G. H., and D. J. Hall. (1967) A clustering technique for summarizing multivariate data. Behavioral Sciences. 12(2):153\u201355.","journal-title":"Behavioral Sciences"},{"issue":"1","key":"8_CR4","first-page":"208","volume":"601","author":"D. Birant","year":"2007","unstructured":"Birant, D. and A. Kut. (2007) ST-DBSCAN: An algorithm for clustering spatial-temporal data. Data & Knowledge Engineering. Elsevier. 601(1): 208\u2013221.","journal-title":"Elsevier"},{"issue":"1","key":"8_CR5","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1109\/72.363440","volume":"6","author":"C. Chinrungrueng","year":"1995","unstructured":"Chinrungrueng C., and C. H. Sequin. (1995) Optimal adaptive k-means algorithm with dynamic adjustment of learning rate. IEEE Transactions on neural networks. 6(1): 157\u201369.","journal-title":"IEEE Transactions on neural networks"},{"key":"8_CR6","unstructured":"Ester, M., H.P. Kriegel, J. Sander, and X. Xu. (1996). A density based algorithm for discovering clusters in large geospatial databases with noise. In Proceedings of the Second International Conference on Knowledge Discovery and Data Mining, Portland, Oregon."},{"key":"8_CR7","doi-asserted-by":"crossref","unstructured":"Guha, S., R. Rastogi, and K. Shim. (1998) Cure: An efficient clustering algorithm for large databases. In Proceedings of the ACM SIGMOD Conference on Management of Data (SIGMOD, Seattle, WA, June). ACM Press, New York, NY.","DOI":"10.1145\/276304.276312"},{"issue":"3","key":"8_CR8","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1145\/331499.331504","volume":"31","author":"A.K. Jain","year":"1999","unstructured":"Jain, A.K., M.N. Murty, and P.J. Flynn. (1999). Data clustering: a review. ACM Computing Surveys. 31(3): 264\u2013323.","journal-title":"ACM Computing Surveys"},{"issue":"7","key":"8_CR9","doi-asserted-by":"publisher","first-page":"881","DOI":"10.1109\/TPAMI.2002.1017616","volume":"24","author":"T. Kanungo","year":"2002","unstructured":"Kanungo, T., D.M. Mount, N. S. Netanyahu, et al. (2002). An efficient k-means clustering algorithm: analysis and implementation. IEEE Transactions on pattern analysis and machine intelligence. 24(7): 881\u201392.","journal-title":"IEEE Transactions on pattern analysis and machine intelligence"},{"issue":"8","key":"8_CR10","first-page":"68","volume":"32","author":"G. Karypis","year":"1999","unstructured":"Karypis, G., E.H Han, V. Kumar. (1999) Chameleon: Hierarchical clustering using dynamic modeling. IEEE Computer Special Issue on Data Analysis and Mining. 32(8): 68\u201375.","journal-title":"IEEE Computer Special Issue on Data Analysis and Mining"},{"issue":"1","key":"8_CR11","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1002\/atr.5670410106","volume":"41","author":"K. Kim","year":"2007","unstructured":"Kim, K. and E. Yamashita (2007)Using a k-means clustering algorithm to examine patterns of pedestrian involved crashes in Honolulu, Hawaii. Journal of Advanced Transportation. 41(1): 60\u201389.","journal-title":"Journal of Advanced Transportation"},{"key":"8_CR12","doi-asserted-by":"crossref","unstructured":"Kohonen, T. (1990) The self-organizing map. Proceedings of the IEEE. 78(9): 1464\u201380.p","DOI":"10.1109\/5.58325"},{"issue":"3","key":"8_CR13","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1109\/3477.764879","volume":"29","author":"K. Krishna","year":"1999","unstructured":"Krishna, K. and M. Narasimha. (1999) Genetic k-means algorithm. IEEE Transactions on Systems, Man and Cybernetics, Part B. 29(3): 433\u2013439.","journal-title":"IEEE Transactions on Systems, Man and Cybernetics, Part B"},{"key":"8_CR14","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/BF02289694","volume":"29","author":"J.B. Kruskal","year":"1964","unstructured":"Kruskal, J.B. (1964) Non-metric multidimensional scaling: a numerical method. Psychometrika 29: 115\u201329.","journal-title":"Psychometrika"},{"key":"8_CR15","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1016\/S0031-3203(02)00060-2","volume":"36","author":"A. Likas","year":"2003","unstructured":"Likas A., N. Vlassis, and J.J. Verbeek. (2003) The global k-means clustering algorithm. Pattern Recognition. 36: 451\u201361.","journal-title":"Pattern Recognition"},{"key":"8_CR16","unstructured":"MacQueen, J.B. (1967) Some methods for classification and analysis of multivariate observations. Proceedings of the Fifth Berkeley Symposium on Mathematical Statistics and Probability, Statistical Laboratory, University of California. 282\u201397."},{"key":"8_CR17","unstructured":"Mashor, M.Y. (1998) Improving the performance of k-means clustering algorithm to position the centers of RBF network. International Journal of the Computer, The Internet and Management. 6(2)."},{"key":"8_CR18","unstructured":"Ng, R. and J. Han. (1994) Efficient and Effective Clustering methods for spatial data mining. In Proceedings of the 20th International Conference of ery Large Data Bases (VLDB), September 1994, Santiago, Chile. 144\u201355."},{"key":"8_CR19","first-page":"847","volume-title":"Advance in Engineering and Technology","author":"TJ Oyana","year":"2006","unstructured":"Oyana TJ, Achenie LEK, Cuadros-Vargas E, Rivers PA, and Scott KE. (2006) A Mathematical Improvement of the Self-Organizing Map Algorithm. Chapter 8: ICT and Mathematical Modelling (pp 522\u2013531). In Mwakali J.A. and Taban-Wani G. (eds.): Advance in Engineering and Technology, London: Elsevier Ltd. 847."},{"issue":"C","key":"8_CR20","doi-asserted-by":"crossref","first-page":"1269","DOI":"10.1243\/0954406042369008","volume":"218","author":"D.T. Pham","year":"2004","unstructured":"Pham D.T., S.S. Dimov, C.D. Nguyen. (2004) A two-phase k-means algorithm for large datasets. Proc. Instn Mech. Engrs, Part C: Journal Mechanical Engineering Science. 218(C). 1269\u201373.","journal-title":"Journal Mechanical Engineering Science"},{"key":"8_CR21","doi-asserted-by":"crossref","unstructured":"Roussopoulos N., S. Kelley, F. Vincent. (1995) Nearest Neighbor Queries. In Proceedings of Special Interest Group on Management of data (SIGMOD), San Jose, CA, USA. 71\u201379.","DOI":"10.1145\/223784.223794"},{"issue":"5","key":"8_CR22","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1109\/T-C.1969.222678","volume":"18","author":"J.W. Sammon","year":"1969","unstructured":"Sammon, J. W. (1969) A nonlinear mapping for data structure analysis. IEEE Transactions on Computers. 18(5): 401\u201309.","journal-title":"IEEE Transactions on Computers"},{"key":"8_CR23","unstructured":"Song, M. and S. Rajasekaran. (2005) Finding frequent item sets by transaction mapping. Symposium on Applied Computing. 488\u2013492."},{"key":"8_CR24","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1348\/000711005X48266","volume":"59","author":"D. Steinley","year":"2006","unstructured":"Steinley, D. (2006) K-means clustering: A half-century synthesis. British Journal of Mathematical and Statistical Psychology. 59: 1\u201334.","journal-title":"British Journal of Mathematical and Statistical Psychology"},{"issue":"3","key":"8_CR25","doi-asserted-by":"publisher","first-page":"721","DOI":"10.1109\/72.846743","volume":"11","author":"M. Su","year":"2000","unstructured":"Su, M. and H. T. Chang. (2000) Fast self-organizing feature map algorithm. IEEE transactions on neural network. 11(3): 721\u201333.","journal-title":"IEEE transactions on neural network"},{"key":"8_CR26","first-page":"431","volume-title":"Pattern Recognition (2ed)","author":"S. Theodoridis","year":"2003","unstructured":"Theodoridis, S. and K. Koutroumbas. (2003) Pattern Recognition (2ed). Elsevier Science (USA). China machine press. 431\u2013535."},{"issue":"1","key":"8_CR27","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/S0164-1212(03)00216-4","volume":"73","author":"C.F. Tsai","year":"2004","unstructured":"Tsai, C.F., C.W. Tsai, H.C. Wu, and T. Yang.(2004) ACODF: a novel data clustering approach for data mining in large databases. Journal of Systems and Software. 73(1): 133\u2013145.","journal-title":"Journal of Systems and Software"},{"issue":"3","key":"8_CR28","doi-asserted-by":"publisher","first-page":"586","DOI":"10.1109\/72.846731","volume":"11","author":"J. Vesanto","year":"2000","unstructured":"Vesanto, J. and E. Alhoniemi. (2000) Clustering of the Self-Organizing Map. IEEE Transactions on Neural Networks. 11(3): 586\u2013600.","journal-title":"IEEE Transactions on Neural Networks"},{"key":"8_CR29","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1006\/jcom.2001.0633","volume":"18","author":"M.N. Vrahatis","year":"2002","unstructured":"Vrahatis, M. N., B. Boutsinas, P. Alevizos, and G. Pavlides. (2002) The new k-windows algorithm for improving the k-means clustering algorithm. Journal of Complexity. 18. 375\u201391.","journal-title":"Journal of Complexity"},{"key":"8_CR30","first-page":"544","volume-title":"A modified k-means clustering with a density-sensitive distance metric. Lecture notes in Computer Science","author":"L. Wang","year":"2006","unstructured":"Wang, L., L. Bo, L. Jiao. (2006) A modified k-means clustering with a density-sensitive distance metric. Lecture notes in Computer Science. Springer Berlin , Heidelber. 4062: 544\u2013551."},{"issue":"3","key":"8_CR31","doi-asserted-by":"publisher","first-page":"645","DOI":"10.1109\/TNN.2005.845141","volume":"16","author":"R Xu","year":"2005","unstructured":"Xu, R and D. Wunsch II. (2005) Survey of Clustering Algorithms. IEEE Transactions on Neural Networks. 16(3): 645\u201378.","journal-title":"IEEE Transactions on Neural Networks"},{"key":"8_CR32","doi-asserted-by":"crossref","unstructured":"Zhang T., R. Ramakrishnan, M. Livny. (1996) BIRCH: An efficient data clustering method for very large databases. Proc. ACM SIGMOD Conf. Management of Data. 103\u201314.","DOI":"10.1145\/233269.233324"}],"container-title":["Lecture Notes in Geoinformation and Cartography","The European Information Society"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-78946-8_8.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T11:05:05Z","timestamp":1619521505000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-78946-8_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540789451","9783540789468"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-78946-8_8","relation":{},"subject":[]}}