메뉴 건너뛰기




Volumn , Issue , 1999, Pages 440-447

Efficiently computing frequent tree-like topology patterns in a web environment

Author keywords

Data Mining Tools; Topological Access Patterns; WWW

Indexed keywords

DATA MINING;

EID: 85118191312     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (8)

References (10)
  • 6
    • 0032627942 scopus 로고    scopus 로고
    • Capability-Sensitive Query Processing on Internet Sources
    • H. Garcia-Molina, W. Labio, and R. Yemeni, Capability-Sensitive Query Processing on Internet Sources, ICDE '99, 50-59, 1999.
    • (1999) ICDE , vol.99 , pp. 50-59
    • Garcia-Molina, H.1    Labio, W.2    Yemeni, R.3
  • 8
    • 85118172737 scopus 로고    scopus 로고
    • Sitehelper: A localized agent that helps incremental exploration of the world wide web
    • D. Ngu and X. Wu, SiteHelper: A Localized Agent that Helps Incremental Exploration of the World Wide Web, 6th International WWW Conference, 1996.
    • (1996) 6th International WWW Conference
    • Ngu, D.1    Wu, X.2
  • 9
    • 84976830511 scopus 로고
    • An effective hash based algorithm for mining asso-ciation rules
    • J. S. Park, M.-S. Chen, and P. S. Yu, An effective Hash Based Algorithm for Mining Asso-ciation Rules, ACM SIGMOD, 175-186, 1995.
    • (1995) ACM SIGMOD , pp. 175-186
    • Park, J.S.1    Chen, M.-S.2    Yu, P.S.3


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