메뉴 건너뛰기




Volumn , Issue , 2007, Pages 213-220

Web personalisation through incremental individual profiling and support-based user segmentation

Author keywords

Clustering; Incremental web mining; User profiling

Indexed keywords

CUSTOMER SATISFACTION; FINANCE; INVESTMENTS;

EID: 48349121672     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/WI.2007.111     Document Type: Conference Paper
Times cited : (15)

References (13)
  • 1
    • 48349084137 scopus 로고    scopus 로고
    • A. Baneijee and J. Ghosh. Clickstream clustering using weighted longest, common subsequences. In In Proceedings of the Web Mining Workshop at the 1st SIAM Conference on Data Mining, 2001.
    • A. Baneijee and J. Ghosh. Clickstream clustering using weighted longest, common subsequences. In In Proceedings of the Web Mining Workshop at the 1st SIAM Conference on Data Mining, 2001.
  • 2
    • 0035789293 scopus 로고    scopus 로고
    • I. V. Cadez, P. Smyth., and II. Mannila. Probabilistic modeling of transaction, data with applications to profiling, visualization, and prediction. In SIGKDD, pages 37-46, New York, NY, USA, 2001. ACM Press.
    • I. V. Cadez, P. Smyth., and II. Mannila. Probabilistic modeling of transaction, data with applications to profiling, visualization, and prediction. In SIGKDD, pages 37-46, New York, NY, USA, 2001. ACM Press.
  • 3
    • 84879079572 scopus 로고    scopus 로고
    • Incremental mining of frequent patterns without candidate generation or support constraint
    • W. Cheung and O. R. Zaïane. Incremental mining of frequent patterns without candidate generation or support constraint. In IDEAS, pages 111-116, 2003.
    • (2003) IDEAS , pp. 111-116
    • Cheung, W.1    Zaïane, O.R.2
  • 4
    • 3042731750 scopus 로고    scopus 로고
    • M. Eirinaki and M. Vazirgiannis. Web mining for web personalization. ACM Trans. Internet Techn., 3(1):1-27, 2003.
    • M. Eirinaki and M. Vazirgiannis. Web mining for web personalization. ACM Trans. Internet Techn., 3(1):1-27, 2003.
  • 5
    • 0039253846 scopus 로고    scopus 로고
    • J. Han, J. Pei, and Y. Yin. Mining frequent patterns without candidate generation. In W. Chen, J. Naughton, and P. A. Bernstein, editors, Proceedings of the 2000 ACM SIGMOD International Conference on Management of Data, pages 1-12. ACM Press, 05 2000.
    • J. Han, J. Pei, and Y. Yin. Mining frequent patterns without candidate generation. In W. Chen, J. Naughton, and P. A. Bernstein, editors, Proceedings of the 2000 ACM SIGMOD International Conference on Management of Data, pages 1-12. ACM Press, 05 2000.
  • 6
    • 0042208210 scopus 로고    scopus 로고
    • Segmentation of visiting patterns on websites using a sequence alignment method
    • B. Hay, G. Wets, and K. Vanhoof. Segmentation of visiting patterns on websites using a sequence alignment method. Journal of Retailing and Consumer Services, 10(3):145-153, 2003.
    • (2003) Journal of Retailing and Consumer Services , vol.10 , Issue.3 , pp. 145-153
    • Hay, B.1    Wets, G.2    Vanhoof, K.3
  • 7
    • 35048834898 scopus 로고    scopus 로고
    • An efficient approach for maintaining association rules based on adjusting FP-Tree structures
    • J.-L. Koh and S.-F. Shieh. An efficient approach for maintaining association rules based on adjusting FP-Tree structures. In DASFAA, pages 417-424, 2004.
    • (2004) DASFAA , pp. 417-424
    • Koh, J.-L.1    Shieh, S.-F.2
  • 8
    • 84878048755 scopus 로고    scopus 로고
    • C. K.-S. Leung and Q. I. Khan. DSTree: A tree structure for the mining of frequent sets from data streams. In ICDM, pages 928-932, Los Alamitos, CA, USA, 2006. IEEE Computer Society.
    • C. K.-S. Leung and Q. I. Khan. DSTree: A tree structure for the mining of frequent sets from data streams. In ICDM, pages 928-932, Los Alamitos, CA, USA, 2006. IEEE Computer Society.
  • 9
    • 33746682304 scopus 로고    scopus 로고
    • C. K.-S. Leung, Q. I. Khan, and T. Hoque. CanTree: A tree structure for efficient, incremental mining of frequent patterns. In ICDM, pages 274-281, Los Alamitos, CA, USA, 2005. IEEE Computer Society.
    • C. K.-S. Leung, Q. I. Khan, and T. Hoque. CanTree: A tree structure for efficient, incremental mining of frequent patterns. In ICDM, pages 274-281, Los Alamitos, CA, USA, 2005. IEEE Computer Society.
  • 10
    • 0006544679 scopus 로고    scopus 로고
    • Automatic personalization based on web usage mining
    • B. Mobasher, R. Cooley, and. J. Srivastava. Automatic personalization based on web usage mining. Commun. ACM, 43(8):142-151, 2000.
    • (2000) Commun. ACM , vol.43 , Issue.8 , pp. 142-151
    • Mobasher, B.1    Cooley, R.2    Srivastava, J.3
  • 12
    • 77957967271 scopus 로고    scopus 로고
    • Mining access patterns efficiently from web logs
    • J. Pei, J. Han, B. Mortazavi-Asl, and H. Zhu. Mining access patterns efficiently from web logs. In PAKDD, pages 396-407, 2000.
    • (2000) PAKDD , pp. 396-407
    • Pei, J.1    Han, J.2    Mortazavi-Asl, B.3    Zhu, H.4


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