{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,19]],"date-time":"2025-01-19T21:10:23Z","timestamp":1737321023452,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":30,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540427308"},{"type":"electronic","value":"9783540454908"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45490-x_64","type":"book-chapter","created":{"date-parts":[[2007,7,20]],"date-time":"2007-07-20T20:48:06Z","timestamp":1184964486000},"page":"498-507","source":"Crossref","is-referenced-by-count":5,"title":["Categorizing Visitors Dynamically by Fast and Robust Clustering of Access Logs"],"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,10,19]]},"reference":[{"key":"64_CR1","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. Journal of Symbolic Computation, 2:99\u2013102, 1986.","journal-title":"Journal of Symbolic Computation"},{"key":"64_CR2","unstructured":"J. Borges and M. Levene. Mining assocaition rules in hypertext databases. R. Agrawal, ed., 4th Int. Conf. on KDD, 149\u2013153, NY, August 27\u201331 1998."},{"key":"64_CR3","unstructured":"C. R. Cunha and C. F. B. Jaccound. Determining WWW user\u2019s next access and its application to prefetching. Int. Symp. on Computers and Communication\u201997, Alexandria, Egypt, July, 1997."},{"key":"64_CR4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1111\/j.2517-6161.1977.tb01600.x","volume":"39","author":"A.P. Dempster","year":"1977","unstructured":"A.P. Dempster, N.M. Laird, and D.B. Rubin. Maximum likehood from incomplete data via the EM algorithm. J. Royal Statistical Society B, 39:1\u201338, 1977.","journal-title":"J. Royal Statistical Society B"},{"key":"64_CR5","volume-title":"2nd Int. Conf. KDD, 226-231","author":"M. Ester","year":"1996","unstructured":"M. Ester, H.P. Kriegel, S. Sander, and X. Xu. A density-based algorithm for discovering clusters in large spatial databases with noise. E. Simoudis, et al eds., 2nd Int. Conf. KDD, 226-231, Menlo Park, CA, 1996. AAAI Press."},{"key":"64_CR6","doi-asserted-by":"crossref","unstructured":"V. Estivill-Castro and M.E. Houle. Roboust clustering of large geo-referenced data sets. N. Zhong & L. Zhow, eds., 3rd PAKDD-99, 327\u2013337. LNAI 1574, 1999.","DOI":"10.1007\/3-540-48912-6_44"},{"key":"64_CR7","unstructured":"V. Estivill-Castro and M.E. Houle. Fast randomized algorithms for robust estimation of location. TSDM2000, 74\u201385, Lyon, 2000. LNAI 2007."},{"key":"64_CR8","doi-asserted-by":"crossref","unstructured":"V. Estivill-Castro and A.T. Murray. Discovering associations in spatial data-an efficient medoid based approach. X. Wu, et al, eds., 2nd PAKDD-98, 110\u2013121, Melbourne, Australia, 1998. LNAI 1394.","DOI":"10.1007\/3-540-64383-4_10"},{"issue":"2","key":"64_CR9","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1109\/4235.771164","volume":"3","author":"I.B. Hall","year":"1999","unstructured":"I.B. Hall, L.O. \u00d6zyurt and J.C. Bezdek. Clustering with a genetically optimized approach. IEEE T. on Evolutionary Computation, 3(2):103\u2013112, 1999.","journal-title":"IEEE T. on Evolutionary Computation"},{"key":"64_CR10","unstructured":"T. Kato, H. Nakyama and Y. Yamane. Navigation analysis tool based on the correlation between contents and access patterns. Manuscript. http:\/\/www.citeseer.nj.nec.com\/354234.html ."},{"key":"64_CR11","unstructured":"J. MacQueen. Some methods for classification and analysis of multivariate observations. L. Le Cam and J. Neyman eds., 5th Berkley Symp. on Mathematical Statistics and Probability, 281\u2013297, 1967. Volume 1."},{"key":"64_CR12","unstructured":"B. Mobasher, H. Dai, T. Luo, M. Nakagawa, Y. Sun, and J. Wilshire. Discovery of aggregate usage profiles for web personalization. WEB Mining for E-Commerce Workshop Web KDD-2000, Boston, August 2000."},{"key":"64_CR13","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"},{"issue":"10","key":"64_CR14","doi-asserted-by":"publisher","first-page":"1056","DOI":"10.1109\/34.159908","volume":"14","author":"F. Murtagh","year":"1992","unstructured":"F. Murtagh. Comments of \u201cParallel algorithms for hierarchical clustering and cluster validity\u201d. IEEE T. on Pattern Analysis and Machine Intelligence, 14(10):1056\u20131057, 1992.","journal-title":"IEEE T. on Pattern Analysis and Machine Intelligence"},{"key":"64_CR15","first-page":"144","volume-title":"20th VLDB","author":"R.T. Ng","year":"1994","unstructured":"R.T. Ng and J. Han. Efficient and effective clustering methods for spatial data mining. 20th VLDB, 144\u2013155, 1994. Santiago, Chile, Morgan Kaufmann."},{"key":"64_CR16","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":"64_CR17","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. T. Terano, et al, eds., 4th PAKDD, 396\u2013407, Kyoto, 2000. LNCS 1805."},{"key":"64_CR18","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":"64_CR19","unstructured":"M Perkowitz and O. Etzioni. Adaptive web sites: an AI challenge. IJCAI, 16\u201323, Nagoya, Japan, 1998."},{"key":"64_CR20","unstructured":"M Perkowitz and O. Etzioni. Adaptive web sites: Automatically synthesizing web pages. 15th National Conf. on Artificial Intelligence, 727\u2013732, 1998. AAAI Press."},{"key":"64_CR21","doi-asserted-by":"crossref","DOI":"10.1002\/0471725382","volume-title":"Robust regression and outlier detection","author":"P.J. Rousseeuw","year":"1987","unstructured":"P.J. Rousseeuw and A.M. Leroy. Robust regression and outlier detection. Wiley, NY, 1987."},{"key":"64_CR22","doi-asserted-by":"crossref","unstructured":"C. Shahabi, A. M. Zarkesh, J. Adibi, and V. Shah. Knowledge discovery from users web page navigation. P. Schevemann, ed., Int. Workshop on Research Issues in Data Engineering IEEE RIDE\u201997, 20\u201331, 1997.","DOI":"10.1109\/RIDE.1997.583692"},{"issue":"8","key":"64_CR23","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. Communication of the ACM, 43(8):127\u2013134, 2000.","journal-title":"Communication of the ACM"},{"issue":"2","key":"64_CR24","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":"64_CR25","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":"64_CR26","unstructured":"W. Wang, J. Yang, and R. Muntz. STING: A statistical information grid approach to spatial data mining. 23rd VLDB, 186\u2013195, Athens, 1997. Morgan Kaufmann."},{"key":"64_CR27","doi-asserted-by":"crossref","unstructured":"J. Xiao, Y. Zhang, X. Jia, and T. Li. Measuring similarity of interests for clustering web-users. In M.E. Orlowsak & J.F. Roddick, eds., 12th Australian Database Conf. ADC 2001, 107\u2013114, Gold Coast, 2001. IEEE Computer Society.","DOI":"10.1109\/ADC.2001.904471"},{"key":"64_CR28","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. In K. Golshani, F.; Makki, editor, 6th ACM CIKM, 254\u2013261, Las Vegas, 1997.","DOI":"10.1145\/266714.266906"},{"key":"64_CR29","doi-asserted-by":"crossref","unstructured":"B. Zhang, M. Hsu, and U. Dayal. K-harmonic means-a spatial clustering algorithm with boosting. TSDM2000, 31\u201342, Lyon, 2000. LNAI 2007.","DOI":"10.1007\/3-540-45244-3_4"},{"issue":"2","key":"64_CR30","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1145\/235968.233324","volume":"25","author":"T. Zhang","year":"1996","unstructured":"T. Zhang, R. Ramakrishnan, and M. Livny. BIRCH: An efficient data clustering method for very large databases. SIGMOD Record, 25(2):103\u2013114, June 1996.","journal-title":"SIGMOD Record"}],"container-title":["Lecture Notes in Computer Science","Web Intelligence: Research and Development"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45490-X_64","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,19]],"date-time":"2025-01-19T20:57:21Z","timestamp":1737320241000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45490-X_64"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540427308","9783540454908"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/3-540-45490-x_64","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}