메뉴 건너뛰기




Volumn 2005, Issue , 2005, Pages 326-329

DSM-TKP: Mining top-K path traversal patterns over web click-streams

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; DATA STORAGE EQUIPMENT; DATA STRUCTURES; INFORMATION MANAGEMENT; ONLINE SEARCHING; TREES (MATHEMATICS); WORLD WIDE WEB;

EID: 33748870796     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/WI.2005.56     Document Type: Conference Paper
Times cited : (11)

References (13)
  • 4
    • 4544293405 scopus 로고    scopus 로고
    • Mining association rules without support threshold: With and without item constraints
    • September
    • Y.L. Cheung, A. W.-C. Fu, "Mining Association Rules without Support Threshold: with and without Item Constraints", IEEE Transactions on Knowledge and Data Engineering, Vol. 16, No. 9, September, 2004, pp 1052-1069.
    • (2004) IEEE Transactions on Knowledge and Data Engineering , vol.16 , Issue.9 , pp. 1052-1069
    • Cheung, Y.L.1    Fu, A.W.-C.2
  • 7
    • 2442617843 scopus 로고    scopus 로고
    • Issues in data stream management
    • June
    • L. Golab and M. T. Ozsu, "Issues in Data Stream Management," In SIGMOD Record, Vol. 32, No. 2, June 2003, pp. 5-14.
    • (2003) SIGMOD Record , vol.32 , Issue.2 , pp. 5-14
    • Golab, L.1    Ozsu, M.T.2
  • 8
    • 0348252034 scopus 로고    scopus 로고
    • A simple algorithm for finding frequent elements in streams and bags
    • March
    • R. M. Karp, S. Shenker, and C. H. Paradimitriou, "A Simple Algorithm for Finding Frequent Elements in Streams and Bags," ACM Transactions on Database Systems, Vol. 28, No. 1, March 2003, pp. 51-55.
    • (2003) ACM Transactions on Database Systems , vol.28 , Issue.1 , pp. 51-55
    • Karp, R.M.1    Shenker, S.2    Paradimitriou, C.H.3
  • 13
    • 19944376126 scopus 로고    scopus 로고
    • TFP: An efficient algorithm for mining top-k frequent closed itemsets
    • May
    • J. Wang, J. Han, Y. Lu, and P. Tzvetkov, "TFP: An Efficient Algorithm for Mining Top-K Frequent Closed Itemsets", IEEE Trans. on Knowledge and Data Engineering, Vol. 17, No. 5, May 2005, pp. 652-664.
    • (2005) IEEE Trans. on Knowledge and Data Engineering , vol.17 , Issue.5 , pp. 652-664
    • Wang, J.1    Han, J.2    Lu, Y.3    Tzvetkov, P.4


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