{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T14:54:37Z","timestamp":1742396077858,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":34,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540425342"},{"type":"electronic","value":"9783540447948"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44794-6_9","type":"book-chapter","created":{"date-parts":[[2007,7,16]],"date-time":"2007-07-16T16:37:34Z","timestamp":1184603854000},"page":"103-114","source":"Crossref","is-referenced-by-count":1,"title":["Non-crisp Clustering by Fast, Convergent, and Robust Algorithms"],"prefix":"10.1007","author":[{"given":"Vladimir","family":"Estivill-Castro","sequence":"first","affiliation":[]},{"given":"Jianhua","family":"Yang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,8,28]]},"reference":[{"key":"9_CR1","unstructured":"K. Alsabti, S. Ranka, and V. Singh. An efficient k-means clustering algorithm. IPPS 11th Int. Parallel Processing Symp., 1998."},{"key":"9_CR2","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/S0747-7171(86)80015-3","volume":"2","author":"C. Bajaj","year":"1986","unstructured":"C. Bajaj. Proving geometric algorithm non-solvability: An application of factoring polynomials. J. of Symbolic Computation, 2:99\u2013102, 1986.","journal-title":"J. of Symbolic Computation"},{"key":"9_CR3","volume-title":"Data Mining Techniques \u2014 for Marketing, Sales and Customer Support","author":"M.J.A. Berry","year":"1997","unstructured":"M.J.A. Berry and G. Linoff. Data Mining Techniques \u2014 for Marketing, Sales and Customer Support. Wiley, NY, 1997."},{"key":"9_CR4","volume-title":"Data Mining with Neural Networks: Solving Business Problems from Applciation Development to Decision Support","author":"J.P. Bigus","year":"1996","unstructured":"J.P. Bigus. Data Mining with Neural Networks: Solving Business Problems from Applciation Development to Decision Support. McGraw-Hill, NY, 1996."},{"key":"9_CR5","unstructured":"J. Borges and M. Levene. Mining assocaition rules in hypertext databases. 4th KDD, 149\u2013153, NY, 1998."},{"key":"9_CR6","volume-title":"Learning from Data","author":"V. Cherkassky","year":"1998","unstructured":"V. Cherkassky and F. Muller. Learning from Data. Wiley, NY, 1998."},{"key":"9_CR7","unstructured":"C. R. Cunha & C. F. B. Jaccound. Determining www user\u2019s next access and its application to prefetching. Int. Symp. Computers & Communication\u201997, 1997."},{"key":"9_CR8","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/BF01434270","volume":"71","author":"P. Densham","year":"1992","unstructured":"P. Densham and G. Rushton. A more efficient heuristic for solving large p-median problems. Papers in Regional Science, 71:307\u2013329, 1992.","journal-title":"Papers in Regional Science"},{"key":"9_CR9","doi-asserted-by":"crossref","unstructured":"V. Estivill-Castro & M.E. Houle. Roboust clustering of large geo-referenced data sets. 3rd PAKDD-99, 327\u2013337. Springer-Verlag LNAI 1574, 1999.","DOI":"10.1007\/3-540-48912-6_44"},{"key":"9_CR10","unstructured":"V. Estivill-Castro and M.E. Houle. Fast randomized algorithms for robust estimation of location. Int. Workshop on Temporal, Spatial and Spatio-Temporal Data Mining-TSDM2000, witht 4th PKDD, 74\u201385, Lyon, 2000. LNAI 2007."},{"key":"9_CR11","doi-asserted-by":"crossref","unstructured":"V. Estivill-Castro and A.T. Murray. Discovering associations in spatial data-an efficient medoid based approach. 2nd PAKDD-98, 110\u2013121, Melbourne, 1998. Springer-Verlag LNAI 1394.","DOI":"10.1007\/3-540-64383-4_10"},{"key":"9_CR12","doi-asserted-by":"crossref","unstructured":"V. Estivill-Castro and J. Yang. A fast and robust generl purpose clustering algorithm. 6th PRICAI-2000, 208\u2013218, Melbourne, 2000. Springer-Verlag LNAI 1886.","DOI":"10.1007\/3-540-44533-1_24"},{"key":"9_CR13","doi-asserted-by":"crossref","unstructured":"V. Estivill-Castro and J. Yang. Categorizing Visitors Dynamically by Fast and Robust Clustering of Access Logs Asia-Pacific Conference on Web Intelligence WI-2001. Maebashi City, Japan. 2001. N. Zhong and Y. Yao (eds) LNAI In press.","DOI":"10.1007\/3-540-45490-X_64"},{"key":"9_CR14","unstructured":"V. Estivill-Castro and J. Yang. Non-crisp clustering Web visitors by vast, convergent and robust algorithms on access logs. Tech. R. 2001-07, Dep. CS & SE, U. of Newcastle, http:\/\/www.cs.newcastle.edu.au\/Dept\/techrep.html\/ ."},{"key":"9_CR15","doi-asserted-by":"publisher","first-page":"1699","DOI":"10.1068\/a281699","volume":"28","author":"M. Horn","year":"1996","unstructured":"M. Horn. Analysis and computation schemes for p-median heuristics. Environment and Planning A, 28:1699\u20131708, 1996.","journal-title":"Environment and Planning A"},{"key":"9_CR16","unstructured":"T. Kato, H. Nakyama and Y. Yamane. Navigation analysis tool based on the correlation between contents and access patterns. Manuscript. http:\/\/citeseer.nj.nec.com\/354234.html ."},{"key":"9_CR17","volume-title":"Cluster Analysis for Social Scientists","author":"M. Lorr","year":"1983","unstructured":"M Lorr. Cluster Analysis for Social Scientists. Jossey-Bass, San Francisco, 1983."},{"key":"9_CR18","doi-asserted-by":"crossref","unstructured":"T. Morzy, M. Wojciechowski, and Zakrzewicz. Scalabale hierarchical clustering methods for sequences of categorical values. D. Cheung, et al eds., 5th PAKDD, 282\u2013293, Hong Kong, 2001. LNAI 2035.","DOI":"10.1007\/3-540-45357-1_31"},{"key":"9_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1111\/j.1538-4632.2000.tb00412.x","volume":"32","author":"A.T. Murray","year":"2000","unstructured":"A.T. Murray. Spatial characteristics and comparisons of interaction and median clustering models. Geographical Analysis, 32:1-, 2000.","journal-title":"Geographical Analysis"},{"key":"9_CR20","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/BF00226292","volume":"2","author":"A.T. Murray","year":"1996","unstructured":"A.T. Murray and R.L. Church. Applying simulated annealing to location-planning models. J. of Heuristics, 2:31\u201353, 1996.","journal-title":"J. of Heuristics"},{"key":"9_CR21","unstructured":"R.T. Ng and J. Han. Efficient and effective clustering methods for spatial data mining. 20th VLDB, 144\u2013155, 1994. Morgan Kaufmann."},{"key":"9_CR22","unstructured":"G. Paliouras, C. Papatheodorou, V. Karkaletsis, and C. Spyropoulos. Clustering the users of large web sites into communities. P. Langley, ed., 17th Int. Conf. on Machine Learning, 719\u2013726, 2000. Morgan Kaufmann."},{"key":"9_CR23","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"396","DOI":"10.1007\/3-540-45571-X_47","volume-title":"4th PAKDD","author":"J. Pei","year":"2000","unstructured":"J. Pei, J. Han, B. Mortazavi-asl, and H. Zhu. Mining access patterns efficiently from web logas. 4th PAKDD, 396\u2013407, 2000. Springer-Verlag LNCS 1805."},{"key":"9_CR24","doi-asserted-by":"crossref","unstructured":"D. Pelleg and A. Moore. X-means: Extending K-means with efficient estimation of the number of clusters. In P. Langley, ed., 17th Int. Conf. Machine Learning, 727\u2013734, CA, 2000. Morgan Kaufmann.","DOI":"10.1007\/3-540-44491-2_3"},{"key":"9_CR25","unstructured":"D.M. Pennock, E. Horvitz, S. Lawrence, and C.L. Giles. Collaborative filtering by personality diagnosis: A hybrid memory-and model-based approach. 16th Conf. on Uncertanity in Artificial Intelligence, 473\u2013840, 2000. Morgan Kaufmann."},{"key":"9_CR26","unstructured":"M Perkowitz and O. Etzioni. Adaptive web sites: an AI challenge. IJCAI, 16\u201323, Nagoya, 1998."},{"key":"9_CR27","unstructured":"M Perkowitz and O. Etzioni. Adaptive web sites: Automatically synthesizing web pages. 15th National C. on AI, 727\u2013732, Madison, July 1998. AAAI Press."},{"key":"9_CR28","doi-asserted-by":"crossref","unstructured":"C. Shahabi, A. M. Zarkesh, J. Adibi, and V. Shah. Knowledge discovery from users web page navigation. IEEE RIDE\u201997, 20\u201331, 1997.","DOI":"10.1109\/RIDE.1997.583692"},{"key":"9_CR29","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1145\/345124.345167","volume":"43","author":"M. Spiliopoulou","year":"2000","unstructured":"M. Spiliopoulou. Web usage mining for web site evaluation. C. of the ACM, 43:127\u2013134, 2000.","journal-title":"C. of the ACM"},{"issue":"2","key":"9_CR30","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1145\/846183.846188","volume":"1","author":"J. Srivastava","year":"2000","unstructured":"J. Srivastava, R. Cooley, M. Deshpande, and P.-N. Tan. Web usage mining: Discovery and applications of usage patterns from web data. SIGKDD Esplorations, 1(2):12\u201323, January 2000.","journal-title":"SIGKDD Esplorations"},{"key":"9_CR31","doi-asserted-by":"publisher","first-page":"955","DOI":"10.1287\/opre.16.5.955","volume":"16","author":"M.B. Teitz","year":"1968","unstructured":"M.B. Teitz and P. Bart. Heuristic methods for estimating the generalized vertex median of a weighted graph. Operations Research, 16:955\u2013961, 1968.","journal-title":"Operations Research"},{"key":"9_CR32","unstructured":"J. Xiao, Y. Zhang, X. Jia, and T. Li. Measuring similarity of interests for clustering web-users. 12th ADC 2001, 107\u2013114, Gold Coast, IEEE Computer Society."},{"key":"9_CR33","doi-asserted-by":"crossref","unstructured":"A.M. Zarkesh, J. Adibi, C. Shahabi, R. Sadri, and V. Shah. Analysis and design of server informative WWW-sites. 6th CIKM, 254\u2013261, Las Vegas, 1997. ACM Press.","DOI":"10.1145\/266714.266906"},{"key":"9_CR34","doi-asserted-by":"crossref","unstructured":"B. Zhang, M. Hsu, and U. Dayal. K-harmonic means \u2014 a spatial clustering algorithm with boosting. Int. Workshop on Temporal, Spatial and Spatio-Temporal Data Mining-TSDM2000, with 4th PKDD, 31\u201342, Lyon, 2000. LNAI 2007.","DOI":"10.1007\/3-540-45244-3_4"}],"container-title":["Lecture Notes in Computer Science","Principles of Data Mining and Knowledge Discovery"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44794-6_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,19]],"date-time":"2025-01-19T12:02:46Z","timestamp":1737288166000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44794-6_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540425342","9783540447948"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/3-540-44794-6_9","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}