메뉴 건너뛰기




Volumn 21, Issue 10, 2009, Pages 1418-1431

EstMax: Tracing maximal frequent item sets instantly over online transactional data streams

Author keywords

Data mining; Maximal frequent item sets; Transactional data streams

Indexed keywords

DATA STREAM; FREQUENT ITEMSETS; ITEM SETS; MAXIMAL FREQUENT ITEM SETS; ONLINE DATA; PREFIX TREES; TRANSACTIONAL DATA STREAMS;

EID: 70349312375     PISSN: 10414347     EISSN: None     Source Type: Journal    
DOI: 10.1109/TKDE.2008.233     Document Type: Article
Times cited : (23)

References (23)
  • 6
    • 30344444271 scopus 로고    scopus 로고
    • EstWin: Online data stream mining of recent frequent itemsets by sliding window method
    • J.H. Chang and W.S. Lee, "estWin: Online Data Stream Mining of Recent Frequent Itemsets by Sliding Window Method," J. Information Science, vol.31, no.2, pp. 76-90, 2005.
    • (2005) J. Information Science , vol.31 , Issue.2 , pp. 76-90
    • Chang, J.H.1    Lee, W.S.2
  • 10
    • 34248150950 scopus 로고    scopus 로고
    • Mining maximal frequent itemsets from data streams
    • G. Mao, X. Wu, X. Zhu, and G. Chen, "Mining Maximal Frequent Itemsets from Data Streams," J. Information Science, vol.33, no.3, pp. 251-262, 2007.
    • (2007) J. Information Science , vol.33 , Issue.3 , pp. 251-262
    • Mao, G.1    Wu, X.2    Zhu, X.3    Chen, G.4
  • 11
    • 49749089668 scopus 로고    scopus 로고
    • EstMax: Tracing maximal frequent itemsets over online data streams
    • H.J. Woo and W.S. Lee, "estMax: Tracing Maximal Frequent Itemsets over Online Data Streams," Proc. Seventh IEEE Int'l Conf. Data Mining, pp. 709-714, 2007.
    • (2007) Proc. Seventh IEEE Int'l Conf. Data Mining , pp. 709-714
    • Woo, H.J.1    Lee, W.S.2
  • 17
    • 0347709684 scopus 로고    scopus 로고
    • Charm: An Efficient Algorithm for Closed Itemset Mining
    • M. Zaki and C. Hsiao, "Charm: An Efficient Algorithm for Closed Itemset Mining," Proc. SIAM Conf. Data Mining, pp. 457-473, 2002.
    • (2002) Proc. SIAM Conf. Data Mining , pp. 457-473
    • Zaki, M.1    Hsiao, C.2
  • 18
    • 0035007850 scopus 로고    scopus 로고
    • MAFIA: A maximal frequent itemset algorithm for transactional databases
    • D. Burdick, M. Calimlim, and J. Gehrke, "MAFIA: A Maximal Frequent Itemset Algorithm for Transactional Databases," Proc. 17th Int'l Conf. Data Eng., pp. 443-452, 2001.
    • (2001) Proc. 17th Int'l Conf. Data Eng. , pp. 443-452
    • Burdick, D.1    Calimlim, M.2    Gehrke, J.3
  • 20
    • 0036565197 scopus 로고    scopus 로고
    • Pincer-Search: An efficient algorithm for discovering the maximum frequent set
    • May/June
    • D. Lin and Z.M. Kedem, "Pincer-Search: An Efficient Algorithm for Discovering the Maximum Frequent Set," IEEE Trans. Knowledge and Data Eng., vol.14, no.3, pp. 553-566, May/June 2002.
    • (2002) IEEE Trans. Knowledge and Data Eng. , vol.14 , Issue.3 , pp. 553-566
    • Lin, D.1    Kedem, Z.M.2
  • 23
    • 0004118981 scopus 로고
    • The NIDES statistical component description and justification
    • H. Javitz and A. Valdes, "The NIDES Statistical Component Description and Justification," Ann. Report A010, SRI Int'l, 1994.
    • (1994) Ann. Report A010 SRI Int'l
    • Javitz, H.1    Valdes, A.2


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