메뉴 건너뛰기




Volumn , Issue , 2006, Pages 959-960

Online mining of frequent query trees over XML data streams

Author keywords

Data streams; Frequent query trees; Online mining; Web mining; XML

Indexed keywords

ALGORITHMS; DATA MINING; DATA STRUCTURES; INFORMATION ANALYSIS; NUMERICAL METHODS; QUERY LANGUAGES; XML; DATA COMMUNICATION SYSTEMS; MARKUP LANGUAGES; MINING; NUMBER THEORY; WORLD WIDE WEB;

EID: 34250621417     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1135777.1135964     Document Type: Conference Paper
Times cited : (6)

References (10)
  • 3
    • 77952414052 scopus 로고    scopus 로고
    • Finding recent frequent itemsets adaptively over online data streams
    • J. H. Chang and W. S. Lee. Finding recent frequent itemsets adaptively over online data streams. In Proc. ACM SIGKDD, 2003, pp. 487-492.
    • (2003) Proc. ACM SIGKDD , pp. 487-492
    • Chang, J.H.1    Lee, W.S.2
  • 4
    • 34250631287 scopus 로고    scopus 로고
    • C. Giannella, J. Han, J. Pei, X. Van, and P.S. Yu. Mining frequent patterns in data streams at multiple time granularities. In Data Mining: Next Generation Challenges and Future Directions, AAAI/MIT, H. Kargupta, A. Joshi, K. Sivakumar, and Y. Yesha (eds.), 2003.
    • C. Giannella, J. Han, J. Pei, X. Van, and P.S. Yu. Mining frequent patterns in data streams at multiple time granularities. In Data Mining: Next Generation Challenges and Future Directions, AAAI/MIT, H. Kargupta, A. Joshi, K. Sivakumar, and Y. Yesha (eds.), 2003.
  • 5
    • 34147160128 scopus 로고    scopus 로고
    • An efficient algorithm for mining frequent itemsets over the entire history of data streams
    • H.-F. Li, S.-Y. Lee, and M.-K. Shan, An efficient algorithm for mining frequent itemsets over the entire history of data streams. In Proc. IWKDDS, 2004
    • (2004) Proc. IWKDDS
    • Li, H.-F.1    Lee, S.-Y.2    Shan, M.-K.3
  • 6
    • 27144549849 scopus 로고    scopus 로고
    • Online mining (recently) maximal frequent itemsets over data streams
    • H.-F. Li, S.-Y. Lee, and M.-K. Shan, Online mining (recently) maximal frequent itemsets over data streams. In Proc. RIDE, 2005.
    • (2005) Proc. RIDE
    • Li, H.-F.1    Lee, S.-Y.2    Shan, M.-K.3
  • 7
    • 0346354497 scopus 로고    scopus 로고
    • Approximate frequency counts over data streams
    • G. S. Manku and R. Motwani. Approximate frequency counts over data streams. In Proc. VLDB, 2002, pp. 346-357.
    • (2002) Proc. VLDB , pp. 346-357
    • Manku, G.S.1    Motwani, R.2
  • 8
    • 85012188661 scopus 로고    scopus 로고
    • A regression-based temporal pattern mining scheme for data streams
    • W.G. Teng, M.-S. Chen, and P. S. Yu. A regression-based temporal pattern mining scheme for data streams. In Proc. VLDB, 2003, pp. 93-104.
    • (2003) Proc. VLDB , pp. 93-104
    • Teng, W.G.1    Chen, M.-S.2    Yu, P.S.3
  • 9
    • 10644260605 scopus 로고    scopus 로고
    • Finding hot query patterns over an XQuery stream
    • Special Issue on Data Stream Processing
    • L.H. Yang, M.L. Lee, and W. Hsu, Finding hot query patterns over an XQuery stream. VLDB Journal Special Issue on Data Stream Processing, 2004.
    • (2004) VLDB Journal
    • Yang, L.H.1    Lee, M.L.2    Hsu, W.3
  • 10
    • 33645914670 scopus 로고    scopus 로고
    • False Positive or False Negative: Mining frequent itemsets from high speed transactional data streams
    • J.-X. Yu, Z. Chang, H. Lu, and A. Zhou. False Positive or False Negative: Mining frequent itemsets from high speed transactional data streams. In Proc. VLDB, 2004, pp. 204-215.
    • (2004) Proc. VLDB , pp. 204-215
    • Yu, J.-X.1    Chang, Z.2    Lu, H.3    Zhou, A.4


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