메뉴 건너뛰기




Volumn 5, Issue , 2004, Pages 4129-4134

A probabilistic validation algorithm for web users' clusters

Author keywords

Cluster Validity; Data Mining and Management; Web Data Clustering

Indexed keywords

CLUSTER VALIDITY; CLUSTERING ALGORITHMS; DATA MINING AND MANAGEMENT; WEB DATA CLUSTERING;

EID: 15744389428     PISSN: 1062922X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICSMC.2004.1401178     Document Type: Conference Paper
Times cited : (10)

References (22)
  • 5
    • 3543102721 scopus 로고    scopus 로고
    • Optimal algorithms for finding user access sessions from very large web logs
    • Z. Chen, A. Fu, and F. Tong, "Optimal algorithms for finding user access sessions from very large Web logs", World Wide Web: Internet and Information Systems, Vol. 6, pp. 259-279, 2003.
    • (2003) World Wide Web: Internet and Information Systems , vol.6 , pp. 259-279
    • Chen, Z.1    Fu, A.2    Tong, F.3
  • 6
    • 77952329662 scopus 로고    scopus 로고
    • Data preparation for mining world wide web browsing patterns
    • R. Cooley, B. Mobasher, and J. Srivastava: "Data preparation for mining World Wide Web browsing patterns", Knowledge Information Systems, Vol. 1, pp. 5-32, 1999.
    • (1999) Knowledge Information Systems , vol.1 , pp. 5-32
    • Cooley, R.1    Mobasher, B.2    Srivastava, J.3
  • 8
    • 0002629270 scopus 로고
    • Maximum likelihood from incomplete data via the EM algorithm
    • A. P. Dempster, N. M. Lsird, and D. B. Rubin, "Maximum likelihood from incomplete data via the EM algorithm", Statistics Society B, Vol. 39, pp. 1-22, 1977.
    • (1977) Statistics Society B , vol.39 , pp. 1-22
    • Dempster, A.P.1    Lsird, N.M.2    Rubin, D.B.3
  • 9
    • 0012834533 scopus 로고    scopus 로고
    • Why so many clustering algorithms - A position paper
    • V. Estivill-Castro, "Why so many clustering algorithms - a position paper" Journal of ACM SIGKDD Explorations, Vol. 4, No. 1, pp. 65-75, 2002.
    • (2002) Journal of ACM SIGKDD Explorations , vol.4 , Issue.1 , pp. 65-75
    • Estivill-Castro, V.1
  • 10
    • 0032269108 scopus 로고    scopus 로고
    • How many clusters? Which clustering method? Answers via model-based cluster analysis
    • C. Fraley and A. Raftery, "How many clusters? Which clustering method? Answers via model-based cluster analysis", Computer Journal, Vol. 41, pp. 578588, 1998.
    • (1998) Computer Journal , vol.41 , pp. 578588
    • Fraley, C.1    Raftery, A.2
  • 15
    • 0006544679 scopus 로고    scopus 로고
    • Automatic personalization based on web usage mining
    • B. Mobasher, R. Cooley, and J. Sristava, "Automatic personalization based on Web usage mining", Communications of the ACM, Vol. 43, No.8, pp.142-151, 2000.
    • (2000) Communications of the ACM , vol.43 , Issue.8 , pp. 142-151
    • Mobasher, B.1    Cooley, R.2    Sristava, J.3
  • 16
    • 0033723107 scopus 로고    scopus 로고
    • Link prediction and path analysis using markov chains
    • R. R. Sarukkai, "Link prediction and path analysis using Markov Chains.", Journal of Computer Networks, Vol. 33, pp. 377-386, 2000.
    • (2000) Journal of Computer Networks , vol.33 , pp. 377-386
    • Sarukkai, R.R.1
  • 22
    • 2142687208 scopus 로고    scopus 로고
    • A unified framework for model-based clustering
    • Dec.
    • S. Zhong, and J. Ghosh, "A unified framework for model-based clustering", Journal of Machine Learning Research, Vol. 4, pp. 1001-1037, Dec. 2003.
    • (2003) Journal of Machine Learning Research , vol.4 , pp. 1001-1037
    • Zhong, S.1    Ghosh, J.2


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