메뉴 건너뛰기




Volumn 17, Issue 4, 2008, Pages 827-845

Efficient algorithms for incremental Web log mining with dynamic thresholds

Author keywords

Dynamic support threshold; Web mining path traversal pattern

Indexed keywords


EID: 45749088035     PISSN: 10668888     EISSN: 0949877X     Source Type: Journal    
DOI: 10.1007/s00778-006-0043-9     Document Type: Article
Times cited : (13)

References (42)
  • 1
    • 0027621699 scopus 로고
    • Mining association rules between sets of items in large databases
    • Agrawal, R., Imielinski, T., Swami, A.: Mining association rules between sets of items in large databases. In: Proceedings of ACM SIGMOD, pp. 207-216, (1993)
    • (1993) Proceedings of ACM SIGMOD , pp. 207-216
    • Agrawal, R.1    Imielinski, T.2    Swami, A.3
  • 7
    • 0030387631 scopus 로고    scopus 로고
    • Data mining: An overview from database perspective
    • 6
    • Chen M.-S., Han J. and Yu P.S. (1996). Data mining: an overview from database perspective. IEEE Trans. Knowl. Data Eng. 8(6): 866-883
    • (1996) IEEE Trans. Knowl. Data Eng. , vol.8 , pp. 866-883
    • Chen, M.-S.1    Han, J.2    Yu, P.S.3
  • 8
  • 29
    • 0031220368 scopus 로고    scopus 로고
    • Using a Hash-based method with transaction trimming for mining association rules
    • 5
    • Park J.-S., Chen M.-S. and Yu P.S. (1997). Using a Hash-based method with transaction trimming for mining association rules. IEEE Trans. on Knowl. Data Eng. 9(5): 813-825
    • (1997) IEEE Trans. on Knowl. Data Eng. , vol.9 , pp. 813-825
    • Park, J.-S.1    Chen, M.-S.2    Yu, P.S.3


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