메뉴 건너뛰기




Volumn , Issue , 2009, Pages 413-417

A mining maximal frequent itemsets over the entire history of data streams

Author keywords

Data mining; Data streams; Maximal frequent itemsets

Indexed keywords

DATA STREAM; DATA STREAMS; HIGH-SPEED; MAXIMAL FREQUENT ITEMSETS; REAL TIME; STREAMING DATA;

EID: 70449378903     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/DBTA.2009.125     Document Type: Conference Paper
Times cited : (1)

References (12)
  • 1
    • 2442629149 scopus 로고    scopus 로고
    • CHARM: An efficient algorithm for closed itemset mining
    • April
    • M. Zaki and C. Hsiao. CHARM: An efficient algorithm for closed itemset mining. In SDM'02, April 2002.
    • (2002) SDM'02
    • Zaki, M.1    Hsiao, C.2
  • 2
    • 0035007850 scopus 로고    scopus 로고
    • MAFIA: A maximal frequent itemset algorithm for transactional databases
    • April
    • D. Burdick, M. Calimlim, and J. Gehrke. MAFIA: A maximal frequent itemset algorithm for transactional databases. In ICDFOl, April 2001.
    • (2001) ICDFOl
    • Burdick, D.1    Calimlim, M.2    Gehrke, J.3
  • 3
    • 0035007850 scopus 로고    scopus 로고
    • MAFIA: A maximal frequent itemset algorithm for transactional databases
    • April
    • D. Burdick, M. Calimlim, and J. Gehrke. MAFIA: A maximal frequent itemset algorithm for transactional databases. In ICDE'01, April 2001.
    • (2001) ICDE'01
    • Burdick, D.1    Calimlim, M.2    Gehrke, J.3
  • 4
    • 14744283215 scopus 로고    scopus 로고
    • Fast updating maximum frequent itemsets
    • Ji Genlin,Yangmin Fast Updating Maximum Frequent Itemsets. Chinese Journal of Computer, 2005, 28(1):128-135
    • (2005) Chinese Journal of Computer , vol.28 , Issue.1 , pp. 128-135
    • Ji Genlin, Y.1
  • 8
    • 3042644650 scopus 로고    scopus 로고
    • Decaying obsolete information in finding recent frequent itemsets over data stream
    • June
    • J. Chang and W. Lee. Decaying Obsolete Information in Finding Recent Frequent Itemsets over Data Stream. IEICE Transaction on Information and Systems, Vol.E87-D, No.6, June, 2004.
    • (2004) IEICE Transaction on Information and Systems , vol.E87-D , Issue.6
    • Chang, J.1    Lee, W.2
  • 9
    • 0039253846 scopus 로고    scopus 로고
    • Mining frequent patterns without candidate generation
    • J. Han, J. Pei, and Y. Yin. Mining Frequent Patterns without Candidate Generation. In Proc. of 2000 ACM SIGMOD, pages 1-12, 2000.
    • (2000) Proc. of 2000 ACM SIGMOD , pp. 1-12
    • Han, J.1    Pei, J.2    Yin, Y.3
  • 10
    • 3142639461 scopus 로고    scopus 로고
    • A sliding window method for finding recently frequent itemsets over online data streams
    • July
    • J. Chang and W. Lee. A Sliding Window Method for Finding Recently Frequent Itemsets over Online Data Streams. Journal of Information Science and Engineering, Vol.20, No.4, July, 2004.
    • (2004) Journal of Information Science and Engineering , vol.20 , Issue.4
    • Chang, J.1    Lee, W.2
  • 12


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