메뉴 건너뛰기




Volumn 68, Issue 5, 2009, Pages 481-498

Mining non-derivable frequent itemsets over data stream

Author keywords

Data mining; Non derivable frequent itemsets; Stream

Indexed keywords

DATA STRUCTURES; INFORMATION MANAGEMENT;

EID: 62849127337     PISSN: 0169023X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.datak.2009.01.002     Document Type: Article
Times cited : (31)

References (42)
  • 5
    • 0037243046 scopus 로고    scopus 로고
    • Free-sets: a condensed representation of boolean data for the approximation of frequency queries
    • Boulicaut J., Bykowski A., and Rigotti C. Free-sets: a condensed representation of boolean data for the approximation of frequency queries. Data Mining and Knowledge Discovery 7 (2003) 5-22
    • (2003) Data Mining and Knowledge Discovery , vol.7 , pp. 5-22
    • Boulicaut, J.1    Bykowski, A.2    Rigotti, C.3
  • 12
    • 3042644650 scopus 로고    scopus 로고
    • Decaying obsolete information in finding recent frequent itemsets over data stream
    • Chang J.H., and Lee W.S. Decaying obsolete information in finding recent frequent itemsets over data stream. IEICE Transaction on Information and Systems 87 6 (2004) 1588-1592
    • (2004) IEICE Transaction on Information and Systems , vol.87 , Issue.6 , pp. 1588-1592
    • Chang, J.H.1    Lee, W.S.2
  • 13
    • 3142639461 scopus 로고    scopus 로고
    • A sliding window method for finding recently frequent itemsets over online data streams
    • Chang J.H., and Lee W.S. A sliding window method for finding recently frequent itemsets over online data streams. Journal of Information Science and Engineering 20 4 (2004) 753-762
    • (2004) Journal of Information Science and Engineering , vol.20 , Issue.4 , pp. 753-762
    • Chang, J.H.1    Lee, W.S.2
  • 14
    • 77952414052 scopus 로고    scopus 로고
    • Finding recent frequent itemsets adaptively over online data streams
    • J.H. Chang, W.S. Lee, Finding recent frequent itemsets adaptively over online data streams, in: Proceedings of the SIGKDD'2003.
    • (2003) Proceedings of the SIGKDD
    • Chang, J.H.1    Lee, W.S.2
  • 16
    • 47249155714 scopus 로고    scopus 로고
    • A survey on algorithms for mining frequent itemsets over data streams
    • Cheng J., Ke Y., and Ng W. A survey on algorithms for mining frequent itemsets over data streams. Knowledge and Information Systems 16 1 (2006) 1-27
    • (2006) Knowledge and Information Systems , vol.16 , Issue.1 , pp. 1-27
    • Cheng, J.1    Ke, Y.2    Ng, W.3
  • 17
    • 24644517133 scopus 로고    scopus 로고
    • What's hot and what's not: Tracking most frequent items dynamically
    • G. Cormode, S. Muthukrishnan, What's hot and what's not: tracking most frequent items dynamically, in: Proceedings of the PODS'2003.
    • (2003) Proceedings of the PODS
    • Cormode, G.1    Muthukrishnan, S.2
  • 18
    • 19544377965 scopus 로고    scopus 로고
    • Moment: Maintaining closed frequent itemsets over a stream sliding window
    • Y. Chi, H. Wang, P.S. Yu, R.R. Muntz, Moment: maintaining closed frequent itemsets over a stream sliding window, in: Proceedings of the ICDM'2004.
    • (2004) Proceedings of the ICDM
    • Chi, Y.1    Wang, H.2    Yu, P.S.3    Muntz, R.R.4
  • 23
    • 0003372359 scopus 로고    scopus 로고
    • Mining frequent patterns by pattern-growth: Methodology and implications
    • J. Han, J. Pei, Mining frequent patterns by pattern-growth: methodology and implications, in: Proceedings of the SIGKDD'2000.
    • (2000) Proceedings of the SIGKDD
    • Han, J.1    Pei, J.2
  • 24
    • 34548544986 scopus 로고    scopus 로고
    • An algorithm for in-core frequent itemset mining on streaming data
    • R. Jin, G. Agrawal, An algorithm for in-core frequent itemset mining on streaming data, in: Proceedings of the ICDM'2005.
    • (2005) Proceedings of the ICDM
    • Jin, R.1    Agrawal, G.2
  • 25
    • 33749554404 scopus 로고    scopus 로고
    • CFI-stream: Mining closed frequent itemsets in data streams
    • N. Jiang, L. Gruenwald, CFI-stream: mining closed frequent itemsets in data streams, in: Proceedings of the SIGKDD'2006.
    • (2006) Proceedings of the SIGKDD
    • Jiang, N.1    Gruenwald, L.2
  • 28
    • 62849106661 scopus 로고    scopus 로고
    • An approximate approach for mining recently frequent itemsets from data streams
    • J. Koh, S. Shin, An approximate approach for mining recently frequent itemsets from data streams, in: Proceedings of the DaWak'2006.
    • (2006) Proceedings of the DaWak
    • Koh, J.1    Shin, S.2
  • 29
    • 84878048755 scopus 로고    scopus 로고
    • DSTree: A tree structure for the mining of frequent sets from data streams
    • C.K. Leung, Q.I. Khan, DSTree: a tree structure for the mining of frequent sets from data streams, in: Proceedings of the ICDM'2006.
    • (2006) Proceedings of the ICDM
    • Leung, C.K.1    Khan, Q.I.2
  • 30
    • 33748463833 scopus 로고    scopus 로고
    • Finding maximal frequent itemsets over online data streams adaptively
    • D. Lee, W. Lee, Finding maximal frequent itemsets over online data streams adaptively, in: Proceedings of the ICDM'2005.
    • (2005) Proceedings of the ICDM
    • Lee, D.1    Lee, W.2
  • 31
    • 22944460628 scopus 로고    scopus 로고
    • AFOPT: An efficient implementation of pattern growth approach
    • G. Liu, H. Lu, J.X. Yu, W. Wang, X. Xiao, AFOPT: an efficient implementation of pattern growth approach, in: Workshop on FIMI'2003.
    • (2003) Workshop on FIMI
    • Liu, G.1    Lu, H.2    Yu, J.X.3    Wang, W.4    Xiao, X.5
  • 35
    • 52649129706 scopus 로고    scopus 로고
    • Verifying and mining frequent patterns from large windows over data streams
    • B. Mozafari, H. Thakkar, C. Zaniolo, Verifying and mining frequent patterns from large windows over data streams, in: Proceedings of the ICDE'2008.
    • (2008) Proceedings of the ICDE
    • Mozafari, B.1    Thakkar, H.2    Zaniolo, C.3
  • 36
    • 34248150950 scopus 로고    scopus 로고
    • Mining maximal frequent itemsets from data streams
    • Mao G., Wu X., Zhu X., and Chen G. Mining maximal frequent itemsets from data streams. Journal of Information Science 33 3 (2007) 251-262
    • (2007) Journal of Information Science , vol.33 , Issue.3 , pp. 251-262
    • Mao, G.1    Wu, X.2    Zhu, X.3    Chen, G.4
  • 38
    • 33244463289 scopus 로고    scopus 로고
    • On characterization and discovery of minimal unexpected patterns in rule discovery
    • Padmanabhan B., and Tuzhilin A. On characterization and discovery of minimal unexpected patterns in rule discovery. IEEE Transactions on Knowledge and Data Engineering 18 2 (2006) 202-216
    • (2006) IEEE Transactions on Knowledge and Data Engineering , vol.18 , Issue.2 , pp. 202-216
    • Padmanabhan, B.1    Tuzhilin, A.2
  • 39
    • 85012188661 scopus 로고    scopus 로고
    • A regression-based temporal pattern mining scheme for data streams
    • W. Teng, M. Chen, P.S.Yu, A regression-based temporal pattern mining scheme for data streams, in: Proceedings of the VLDB'2003.
    • (2003) Proceedings of the VLDB
    • Teng, W.1    Chen, M.2    Yu, P.S.3
  • 40
    • 77952367550 scopus 로고    scopus 로고
    • Weighted association rule mining using weighted support and significance framework
    • F. Tao, F. Murtagh, M. Farid, Weighted association rule mining using weighted support and significance framework, in: Proceedings of the SIGKDD'2003.
    • (2003) Proceedings of the SIGKDD
    • Tao, F.1    Murtagh, F.2    Farid, M.3
  • 41
    • 49749089668 scopus 로고    scopus 로고
    • H.J. Woo, W.S. Lee, estMax: tracing maximal frequent itemsets over online data streams, in: Proceedings of the ICDM'2007.
    • H.J. Woo, W.S. Lee, estMax: tracing maximal frequent itemsets over online data streams, in: Proceedings of the ICDM'2007.


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