메뉴 건너뛰기




Volumn 13, Issue 4, 2002, Pages 497-520

Clustering web visitors by bast, robust and convergent algorithms

Author keywords

Clustering; Dissimilarity; Visitation paths; Web User Mining

Indexed keywords


EID: 71949121170     PISSN: 01290541     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0129054102001242     Document Type: Article
Times cited : (4)

References (51)
  • 1
    • 0029212693 scopus 로고
    • Mining sequential patterns
    • In RS. Yu and A.L.P. Chen, editors, Taipei, March. IEEE, IEEE Computer Society.
    • R. Agrawal and R. Strikant. Mining sequential patterns. In RS. Yu and A.L.P. Chen, editors, Proceedings of the International Conference on Data Engineering, pages 3-14, Taipei, March 1995. IEEE, IEEE Computer Society.
    • (1995) Proceedings of the International Conference on Data Engineering , pp. 3-14
    • Agrawal, R.1    Strikant, R.2
  • 3
    • 3543120775 scopus 로고
    • Proving geometric algorithm non-solvability: An application of factoring polynomials
    • C. Bajaj. Proving geometric algorithm non-solvability: An application of factoring polynomials. Journal of Symbolic Computation, 2:99-102, 1986.
    • (1986) Journal of Symbolic Computation , vol.2 , pp. 99-102
    • Bajaj, C.1
  • 4
    • 84892843988 scopus 로고    scopus 로고
    • Sams.net, Indianapolis, IN 46290
    • R. L. Berlin et al. CGI Programming. Sams.net, Indianapolis, IN 46290, 1996.
    • (1996) CGI Programming
    • Berlin, R.L.1
  • 12
    • 0002982230 scopus 로고
    • A more efficient heuristic for solving large p-median problems
    • P. Densham and G. Rushton. A more efficient heuristic for solving large p-median problems. Papers in Regional Science, 71:307-329, 1992.
    • (1992) Papers in Regional Science , vol.71 , pp. 307-329
    • Densham, P.1    Rushton, G.2
  • 13
    • 85170282443 scopus 로고    scopus 로고
    • A density-based algorithm for discovering clusters in large spatial databases with noise
    • In E. Simoudis, J. Han, and U. Fayyad, editors, Menlo Park, CA,. AAAI, AAAI Press.
    • M. Ester, H.P. Kriegel, S. Sander, and X. Xu. A density-based algorithm for discovering clusters in large spatial databases with noise. In E. Simoudis, J. Han, and U. Fayyad, editors, Proceedings of the 2nd International Conference on Knowledge Discovery and Data Mining (KDD-96), pages 226-231, Menlo Park, CA, 1996. AAAI, AAAI Press.
    • (1996) Proceedings of the 2nd International Conference on Knowledge Discovery and Data Mining (KDD-96) , pp. 226-231
    • Ester, M.1    Kriegel, H.P.2    Sander, S.3    Xu, X.4
  • 17
    • 79957944034 scopus 로고    scopus 로고
    • Discovering associations in spatial data-an efficient medoid based approach
    • In X. Wu, R. Kotagiri, and K.K. Korb, editors, Melbourne, Australia, 1998. Springer-Verlag Lecture Notes in Artificial Intelligence 1394.
    • V. Estivill-Castro and A.T. Murray. Discovering associations in spatial data-an efficient medoid based approach. In X. Wu, R. Kotagiri, and K.K. Korb, editors, Proceedings of the 2nd Pacific-Asia Conference on Knowledge Discovery and Data Mining (PAKDD-98), pages 110-121, Melbourne, Australia, 1998. Springer-Verlag Lecture Notes in Artificial Intelligence 1394.
    • Proceedings of the 2nd Pacific-Asia Conference on Knowledge Discovery and Data Mining (PAKDD-98) , pp. 110-121
    • Estivill-Castro, V.1    Murray, A.T.2
  • 18
    • 84867815153 scopus 로고    scopus 로고
    • A fast and robust general purpose clustering algorithm
    • In R. Mizoguchi and J. Slaney, editors, Melbourne, Australia,. Springer-Verlag Lecture Notes in Artificial Intelli gence 1886.
    • V. Estivill-Castro and J. Yang. A fast and robust general purpose clustering algorithm. In R. Mizoguchi and J. Slaney, editors, Proceedings Sixth Pacific Rim International Conference on Artificial Intelligence PRICAI 2000, pages 208-218, Melbourne, Australia, 2000. Springer-Verlag Lecture Notes in Artificial Intelli gence 1886.
    • (2000) Proceedings Sixth Pacific Rim International Conference on Artificial Intelligence PRICAI 2000 , pp. 208-218
    • Estivill-Castro, V.1    Yang, J.2
  • 19
    • 0002161595 scopus 로고    scopus 로고
    • Cactus-clustering categorical data using summaries
    • In S. Chaudhuri and D. Madigan, editors, San Diego, CA, August. ACM, Association for Computing Machinery;.
    • V. Ganti, J. Gehrke, and R. Ramakrishnan. Cactus-clustering categorical data using summaries. In S. Chaudhuri and D. Madigan, editors, ACM SIGKDD International Conference on Knowledge Discovery and Data Mining; KDD, pages 73-83, San Diego, CA, August 1999. ACM, Association for Computing Machinery;.
    • (1999) ACM SIGKDD International Conference on Knowledge Discovery and Data Mining; KDD , pp. 73-83
    • Ganti, V.1    Gehrke, J.2    Ramakrishnan, R.3
  • 20
    • 0002318328 scopus 로고    scopus 로고
    • Clustering categorical data: An approach based on dynamical systems
    • In A. Gupta, O Schmueli, and J. Widom, editors, San Mateo, CA,. Morgan Kaufmann Publishers.
    • D. Gibson, J. Kleinberg, and P. Raghavan. Clustering categorical data: An approach based on dynamical systems. In A. Gupta, O Schmueli, and J. Widom, editors, Proceedings of the 24th VLDB, pages 311-322, San Mateo, CA, 1998. Morgan Kaufmann Publishers.
    • (1998) Proceedings of the 24th VLDB , pp. 311-322
    • Gibson, D.1    Kleinberg, J.2    Raghavan, P.3
  • 21
    • 0032652570 scopus 로고    scopus 로고
    • ROCK: A robust clustering algorithm for categorical attributes
    • In M. Kitsuregawa, L. Maciaszek, K. Papazoglou, and C. Pu, editors, Los Alamitos, CA, March. IEEE Computer Society. Sydney, Australia.
    • S. Guha, R. Rastogi, and K. Shim. ROCK: A robust clustering algorithm for categorical attributes. In M. Kitsuregawa, L. Maciaszek, K. Papazoglou, and C. Pu, editors, Proceedings of the Fifteenth International Conference on Data Engineering, pages 512-521, Los Alamitos, CA, March 1999. IEEE Computer Society. Sydney, Australia.
    • (1999) Proceedings of the Fifteenth International Conference on Data Engineering , pp. 512-521
    • Guha, S.1    Rastogi, R.2    Shim, K.3
  • 23
    • 0030425502 scopus 로고    scopus 로고
    • Analysis and computation schemes for p-median heuristics
    • M. Horn. Analysis and computation schemes for p-median heuristics. Environment and Planning A, 28:1699-1708, 1996.
    • (1996) Environment and Planning A , vol.28 , pp. 1699-1708
    • Horn, M.1
  • 24
    • 84892854056 scopus 로고    scopus 로고
    • Navigation analysis tool based on the correlation between contents and access patterns
    • 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.
    • Manuscript
    • Kato, T.1    Nakyama, H.2    Yamane, Y.3
  • 25
    • 84883670348 scopus 로고    scopus 로고
    • Clustering sequences of complex objects
    • In D. Heckerman, editor, Newport Beach, CA, August. AAAI, Menlo Park, CA; AAAI Press.
    • A. Ketterlin. Clustering sequences of complex objects. In D. Heckerman, editor, Proceedings of the International Conference on Knowledge Discovery and Data Mining, pages 215-218, Newport Beach, CA, August 1997. AAAI, Menlo Park, CA; AAAI Press.
    • (1997) Proceedings of the International Conference on Knowledge Discovery and Data Mining , pp. 215-218
    • Ketterlin, A.1
  • 26
    • 23044521957 scopus 로고    scopus 로고
    • Applications of data mining to electronic commerce
    • January/April
    • R. Kohavi and F. Provost. Applications of data mining to electronic commerce. Data Mining and Knowledge Discovery, 5(l/2):5-10, January/April 2001.
    • (2001) Data Mining and Knowledge Discovery , vol.5 , Issue.1-2 , pp. 5-10
    • Kohavi, R.1    Provost, F.2
  • 28
    • 0001457509 scopus 로고
    • Some methods for classification and analysis of multivariate observations
    • In L. Le Cam and J. Neyman, editors
    • J. MacQueen. Some methods for classification and analysis of multivariate observations. In L. Le Cam and J. Neyman, editors, 5th Berkley Symposium on Mathematical Statistics and Probability, pages 281-297, 1967. Volume 1.
    • (1967) 5th Berkley Symposium on Mathematical Statistics and Probability , vol.1 , pp. 281-297
    • Macqueen, J.1
  • 30
    • 33749048210 scopus 로고    scopus 로고
    • Scalable hierarchical clustering methods for sequences of categorical values
    • In D. Cheung, G.J. Williams, and Q. Li, editors, Hong Kong, April 2001. Springer-Verlag Lecture Notes in Artificial Intelligence 2035. Advances in Knowledge Discovery and Data Mining.
    • T. Morzy, M. Wojciechowski, and Zakrzewicz. Scalable hierarchical clustering methods for sequences of categorical values. In D. Cheung, G.J. Williams, and Q. Li, editors, Proceedings of the 5th Pacific-Asia Conference PAKDD 2001, pages 282-293, Hong Kong, April 2001. Springer-Verlag Lecture Notes in Artificial Intelligence 2035. Advances in Knowledge Discovery and Data Mining.
    • Proceedings of the 5th Pacific-Asia Conference PAKDD 2001 , pp. 282-293
    • Morzy, T.1    Wojciechowski, M.2    Zakrzewicz3
  • 31
    • 0034093011 scopus 로고    scopus 로고
    • Spatial characteristics and comparisons of interaction and median clustering models
    • A.T. Murray. Spatial characteristics and comparisons of interaction and median clustering models. Geographical Analysis, 32(1):1-, 2000.
    • (2000) Geographical Analysis , vol.32 , Issue.1 , pp. 1
    • Murray, A.T.1
  • 32
    • 0030157505 scopus 로고    scopus 로고
    • Applying simulated annealing to location-planning models
    • A.T. Murray and R.L. Church. Applying simulated annealing to location-planning models. Journal of Heuristics, 2:31-53, 1996.
    • (1996) Journal of Heuristics , vol.2 , pp. 31-53
    • Murray, A.T.1    Church, R.L.2
  • 33
    • 0026938525 scopus 로고
    • Comments of "Parallel algorithms for hierarchical clustering and cluster validity
    • F. Murtagh. Comments of "Parallel algorithms for hierarchical clustering and cluster validity". IEEE Transactions on Pattern Analysis and Machine Intelligence, 14(10):1056-1057, 1992.
    • (1992) IEEE Transactions on Pattern Analysis and Machine Intelligence , vol.14 , Issue.10 , pp. 1056-1057
    • Murtagh, F.1
  • 34
    • 0003136237 scopus 로고    scopus 로고
    • Efficient and effective clustering methods for spatial data mining
    • In J. Bocca, M. Jarke, and C. Zaniolo, editors, San Francisco, CA, 1994. Santiago, Chile, Morgan Kaufmann Publishers.
    • R.T. Ng and J. Han. Efficient and effective clustering methods for spatial data mining. In J. Bocca, M. Jarke, and C. Zaniolo, editors, Proceedings of the 20th Conference on Very Large Data Bases (VLDB), pages 144-155, San Francisco, CA, 1994. Santiago, Chile, Morgan Kaufmann Publishers.
    • Proceedings of the 20th Conference on Very Large Data Bases (VLDB) , pp. 144-155
    • Ng, R.T.1    Han, J.2
  • 35
    • 0012073383 scopus 로고    scopus 로고
    • Clustering the users of large web sites into communities
    • In P. Langley, editor, San Mateo, CA, July 2000. Morgan Kaufmann Publishers. Stanford, CA.
    • G. Paliouras, C. Papatheodorou, V. Karkaletsis, and C. Spyropoulos. Clustering the users of large web sites into communities. In P. Langley, editor, 17th International Conference on Machine Learning, pages 719-726, San Mateo, CA, July 2000. Morgan Kaufmann Publishers. Stanford, CA.
    • 17th International Conference on Machine Learning , pp. 719-726
    • Paliouras, G.1    Papatheodorou, C.2    Karkaletsis, V.3    Spyropoulos, C.4
  • 36
    • 77957967271 scopus 로고    scopus 로고
    • Mining access patterns efficiently from web logs
    • In T. Terano, H. Liu, and A.L.P. Chen, editors, Kyoto, Japan, April 4th. Springer-Verlag Lecture Notes in Computer Science 1805.
    • J. Pei, J. Han, B. Mortazavi-asl, and H. Zhu. Mining access patterns efficiently from web logs. In T. Terano, H. Liu, and A.L.P. Chen, editors, Proceedings of the Pacific-Asia conference on knowledge discovery and data mining, pages 396-407, Kyoto, Japan, April 4th 2000. Springer-Verlag Lecture Notes in Computer Science 1805.
    • (2000) Proceedings of the Pacific-Asia Conference on Knowledge Discovery and Data Mining , pp. 396-407
    • Pei, J.1    Han, J.2    Mortazavi-Asl, B.3    Zhu, H.4
  • 37
    • 0001820920 scopus 로고    scopus 로고
    • X-means: Extending iif-means with efficient estimation of the number of clusters
    • In P. Langley, editor, San Mateo, CA, July. Morgan Kaufmann Publishers. Stanford, CA.
    • D. Pelleg and A. Moore. X-means: Extending iif-means with efficient estimation of the number of clusters. In P. Langley, editor, 17th International Conference on Machine Learning, pages 727-734, San Mateo, CA, July 2000. Morgan Kaufmann Publishers. Stanford, CA.
    • (2000) 17th International Conference on Machine Learning , pp. 727-734
    • Pelleg, D.1    Moore, A.2
  • 40
    • 0031645666 scopus 로고    scopus 로고
    • Adaptive web sites: Automatically synthesizing web pages
    • Madison, WI, July. American Association for Artificial Intelligence, AAAI Press
    • M Perkowitz and O. Etzioni. Adaptive web sites: Automatically synthesizing web pages. In Proceedings of the 15th National Conference on Artificial Intelligence, pages 727-732, Madison, WI, July 1998. American Association for Artificial Intelligence, AAAI Press.
    • (1998) Proceedings of the 15th National Conference on Artificial Intelligence , pp. 727-732
    • Perkowitz, M.1    Etzioni, O.2
  • 43
    • 0000008126 scopus 로고    scopus 로고
    • Web usage mining for Web site evaluation
    • M. Spiliopoulou. Web usage mining for Web site evaluation. Communications of the ACM, 43(8):127-134, 2000.
    • (2000) Communications of the ACM , vol.43 , Issue.8 , pp. 127-134
    • Spiliopoulou, M.1
  • 44
    • 0002000090 scopus 로고    scopus 로고
    • Web usage mining: Discovery and applications of usage patterns from web data
    • January
    • J. Srivastava, R. Cooley, M. Deshpande, and P.-N. Tan. Web usage mining: Discovery and applications of usage patterns from web data. SIGKDD Explorations, 1(2): 12-23, January 2000.
    • (2000) SIGKDD Explorations , vol.1 , Issue.2 , pp. 12-23
    • Srivastava, J.1    Cooley, R.2    Deshpande, M.3    Tan, P.-N.4
  • 45
    • 0000191523 scopus 로고
    • Heuristic methods for estimating the generalized vertex median of a weighted graph
    • M.B. Teitz and P. Bart. Heuristic methods for estimating the generalized vertex median of a weighted graph. Operations Research, 16:955-961, 1968.
    • (1968) Operations Research , vol.16 , pp. 955-961
    • Teitz, M.B.1    Bart, P.2
  • 46
    • 84994158589 scopus 로고    scopus 로고
    • STING: A statistical information grid approach to spatial data mining
    • In M. Jarke, editor, Athens, Greece, August. VLDB, Morgan Kaufmann Publishers.
    • W. Wang, J. Yang, and R. Muntz. STING: A statistical information grid approach to spatial data mining. In M. Jarke, editor, Proceedings of the 23rd International Conference on Very Large Data Bases, pages 186-195, Athens, Greece, August 1997. VLDB, Morgan Kaufmann Publishers.
    • (1997) Proceedings of the 23rd International Conference on Very Large Data Bases , pp. 186-195
    • Wang, W.1    Yang, J.2    Muntz, R.3
  • 47
    • 84964495090 scopus 로고    scopus 로고
    • Measuring similarity of interests for clustering web-users
    • In M.E. Orlowska and J.F. Roddick, editors, Gold Coast, Queensland, Australia,. IEEE Computer Society.
    • J. Xiao, Y. Zhang, X. Jia, and T. Li. Measuring similarity of interests for clustering web-users. In M.E. Orlowska and J.F. Roddick, editors, Proceedings of the 12th Australian Database Conference ADC 2001, pages 107-114, Gold Coast, Queensland, Australia, 2001. IEEE Computer Society.
    • (2001) Proceedings of the 12th Australian Database Conference ADC 2001 , pp. 107-114
    • Xiao, J.1    Zhang, Y.2    Jia, X.3    Li, T.4
  • 51
    • 0030157145 scopus 로고    scopus 로고
    • BIRCH: An efficient data clustering method for very large databases
    • June. Proceedings of the 1996 ACM SIGMOD International Conference on Management of Data.
    • T. Zhang, R. Ramakrishnan, and M. Livny. BIRCH: An efficient data clustering method for very large databases. SIGMOD Record, 25(2):103-114, June 1996. Proceedings of the 1996 ACM SIGMOD International Conference on Management of Data.
    • (1996) SIGMOD Record , vol.25 , Issue.2 , pp. 103-114
    • Zhang, T.1    Ramakrishnan, R.2    Livny, M.3


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.