메뉴 건너뛰기




Volumn 16, Issue 12, 2005, Pages 2099-2105

High-speed heuristic algorithm for mining frequent patterns in data stream

Author keywords

Data mining; Data stream; Frequent pattern; Tilted window

Indexed keywords

DATA FLOW ANALYSIS; DATA PROCESSING; FREQUENCIES; SPEED; WINDOWS;

EID: 33644964686     PISSN: 10009825     EISSN: None     Source Type: Journal    
DOI: 10.1360/jos162099     Document Type: Article
Times cited : (3)

References (7)
  • 1
    • 26944459038 scopus 로고    scopus 로고
    • Mining frequent patterns in data streams at multiple time granularities
    • Giannella C, Han JW, Pei J, Yan XF, Yu PS. Mining frequent patterns in data streams at multiple time granularities. http://maids.ncsa.uiuc.edu/documents/readings/fpstm03.pdf
    • Giannella, C.1    Han, J.W.2    Pei, J.3    Yan, X.F.4    Yu, P.S.5
  • 2
    • 0346354497 scopus 로고    scopus 로고
    • Approximate frequency counts over data streams
    • Bernstein P., Ioannidis Y. and Ramakrishnan R. (ed.), Hong Kong: Morgan Kaufmann Publishers
    • Manku GS, Motwani R. Approximate frequency counts over data streams. In: Bernstein P, Ioannidis Y, Ramakrishnan R, eds. Proc. of the 28th Int'l Conf. on Very Large Data Bases. Hong Kong: Morgan Kaufmann Publishers, 2002. 346-357.
    • (2002) Proc. of the 28th Int'l Conf. on Very Large Data Bases , pp. 346-357
    • Manku, G.S.1    Motwani, R.2
  • 3
    • 0346457324 scopus 로고    scopus 로고
    • Online association rule mining
    • Delis A., Faloutsos C. and Ghandeharizadeh S. (ed.), Philadelphia: ACM Press
    • Hidber C. Online association rule mining. In: Delis A, Faloutsos C, Ghandeharizadeh S, eds. Proc. of the ACM SIGMOD Int'l Conf. on Management of Data (SIGMOD 1999). Philadelphia: ACM Press, 1999. 145-156.
    • (1999) Proc. of the ACM SIGMOD Int'l Conf. on Management of Data (SIGMOD 1999) , pp. 145-156
    • Hidber, C.1
  • 4
    • 77952414052 scopus 로고    scopus 로고
    • Finding recent frequent itemsets adaptively over online data streams
    • Lise G., Ted E.S., Pedro D. and Christos F. (ed.), Washington: ACM Press
    • Chang J, Lee W. Finding recent frequent itemsets adaptively over online data streams. In: Lise G, Ted E. S, Pedro D, Christos F, eds. Proc. of the 9th ACM SIGKDD Int'l Conf. on Knowledge Discovery and Data Mining. Washington: ACM Press, 2003. 226-235.
    • (2003) Proc. of the 9th ACM SIGKDD Int'l Conf. on Knowledge Discovery and Data Mining , pp. 226-235
    • Chang, J.1    Lee, W.2
  • 5
    • 0001882616 scopus 로고
    • Fast algorithms for mining association rules
    • Beeri C. (ed.), Santiago: Morgan Kaufmann Publishers
    • Agrawal R, Srikant R. Fast algorithms for mining association rules. In: Beeri C, et al., eds. Proc. of the 20th Int'l Conf. on Very Large Databases. Santiago: Morgan Kaufmann Publishers, 1994. 487-499.
    • (1994) Proc. of the 20th Int'l Conf. on Very Large Databases , pp. 487-499
    • Agrawal, R.1    Srikant, R.2
  • 7
    • 33644933549 scopus 로고    scopus 로고
    • http://www.almaden.ibm.com/software/quest/Resources/index.shtml


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