메뉴 건너뛰기




Volumn , Issue , 2008, Pages 941-946

Stream sequential pattern mining with precise error bounds

Author keywords

[No Author keywords available]

Indexed keywords

DATA MINING PROBLEMS; DATA SETS; DATA STREAM; EMERGING APPLICATIONS; ERROR BOUND; EXECUTION TIME; FALSE POSITIVE; MEMORY USAGE; MINING SEQUENTIAL PATTERNS; NEW FORMS; ON-DEMAND; PRUNING STRATEGY; REAL-WORLD APPLICATION; SEQUENTIAL PATTERNS; SEQUENTIAL-PATTERN MINING;

EID: 67049137938     PISSN: 15504786     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDM.2008.154     Document Type: Conference Paper
Times cited : (48)

References (11)
  • 3
    • 34548767855 scopus 로고    scopus 로고
    • SSM: A frequent sequential data stream patterns miner
    • C. I. Ezeife and M. Monwar. SSM: A frequent sequential data stream patterns miner. In CIDM'07.
    • CIDM'07
    • Ezeife, C.I.1    Monwar, M.2
  • 5
    • 0348252034 scopus 로고    scopus 로고
    • A simple algorithm for finding frequent elements in streams and bags
    • March
    • R. M. Karp, C. H. Papadimitriou, and S. Shenker. A simple algorithm for finding frequent elements in streams and bags. In ACM Trans. Database Systems, pages 51-55, March 2003.
    • (2003) ACM Trans. Database Systems , pp. 51-55
    • Karp, R.M.1    Papadimitriou, C.H.2    Shenker, S.3
  • 6
    • 67049149224 scopus 로고    scopus 로고
    • GraSeq : A novel approximate mining approach of sequential patterns over data stream
    • H. Li and H. Chen. GraSeq : A novel approximate mining approach of sequential patterns over data stream. In ADMA'07.
    • ADMA'07
    • Li, H.1    Chen, H.2
  • 7
    • 84873158178 scopus 로고    scopus 로고
    • Approximate frequency counts over data streams
    • G. Manku and R. Motwani. Approximate frequency counts over data streams. In VLDB'02.
    • VLDB'02
    • Manku, G.1    Motwani, R.2
  • 8
    • 67049111441 scopus 로고    scopus 로고
    • Mining sequential patterns from temporal streaming data
    • A. Marascu and F. Masseglia. Mining sequential patterns from temporal streaming data. In MSTD'05.
    • MSTD'05
    • Marascu, A.1    Masseglia, F.2
  • 9
    • 33745440323 scopus 로고    scopus 로고
    • Efficient computation of frequent and top-k elements in data streams
    • A. Metwally, D. Agrawal, and A. E. Abbadi. Efficient computation of frequent and top-k elements in data streams. In ICDT'05.
    • ICDT'05
    • Metwally, A.1    Agrawal, D.2    Abbadi, A.E.3
  • 11
    • 77952415079 scopus 로고    scopus 로고
    • Mining conceptdrifting data streams using ensemble classifiers
    • H. Wang, W. Fan, P. S. Yu, and J. Han. Mining conceptdrifting data streams using ensemble classifiers. In KDD'03.
    • KDD'03
    • Wang, H.1    Fan, W.2    Yu, P.S.3    Han, J.4


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