메뉴 건너뛰기




Volumn 36, Issue 2 PART 1, 2009, Pages 2451-2458

Incremental updates of closed frequent itemsets over continuous data streams

Author keywords

Closed frequent itemsets; Data mining; Data streams; Incremental update; Single pass mining

Indexed keywords

INFORMATION SYSTEMS; MATHEMATICAL MODELS;

EID: 56349168041     PISSN: 09574174     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.eswa.2007.12.054     Document Type: Article
Times cited : (58)

References (19)
  • 1
    • 56349133664 scopus 로고    scopus 로고
    • Agrawal, R., & Srikant, R. (1994). Fast algorithms for mining association rules. In Proceedings of the 20th international conference on very large data bases, (pp. 487-499).
    • Agrawal, R., & Srikant, R. (1994). Fast algorithms for mining association rules. In Proceedings of the 20th international conference on very large data bases, (pp. 487-499).
  • 2
    • 0036042175 scopus 로고    scopus 로고
    • Babcock, B., Babu, S., Datar, M., Motwani, R., & Widom, J. (2002). Models and issues in data stream systems. In Proceedings of the 21th ACM SIGMOD-SIGACT-AIGART symposium on principles of database systems, (pp. 1-16).
    • Babcock, B., Babu, S., Datar, M., Motwani, R., & Widom, J. (2002). Models and issues in data stream systems. In Proceedings of the 21th ACM SIGMOD-SIGACT-AIGART symposium on principles of database systems, (pp. 1-16).
  • 3
    • 3042644650 scopus 로고    scopus 로고
    • Decaying obsolete information in finding recent frequent itemsets over data stream
    • Chang J., and Lee W. Decaying obsolete information in finding recent frequent itemsets over data stream. IEICE Transaction on Information and Systems E87-D 6 (2004)
    • (2004) IEICE Transaction on Information and Systems , vol.E87-D , Issue.6
    • Chang, J.1    Lee, W.2
  • 4
    • 3142639461 scopus 로고    scopus 로고
    • A sliding window method for finding recently frequent itemsets over online data streams
    • Chang J., and Lee W. A sliding window method for finding recently frequent itemsets over online data streams. Journal of Information Science and Engineering 20 4 (2004)
    • (2004) Journal of Information Science and Engineering , vol.20 , Issue.4
    • Chang, J.1    Lee, W.2
  • 5
    • 19544377965 scopus 로고    scopus 로고
    • Chi, Y., Wang, H., Yu, P., & Muntz, R. (2004). MOMENT: Maintaining closed frequent itemsets over a stream sliding window. In Proceedings of the 4th IEEE international conference on data mining, (pp. 59-66).
    • Chi, Y., Wang, H., Yu, P., & Muntz, R. (2004). MOMENT: Maintaining closed frequent itemsets over a stream sliding window. In Proceedings of the 4th IEEE international conference on data mining, (pp. 59-66).
  • 6
    • 16244392017 scopus 로고    scopus 로고
    • Mining frequent patterns in data streams at multiple time granularities
    • Kargupta H., Joshi A., Sivakumar K., and Yesha Y. (Eds), AAAI/MIT
    • Giannella C., Han J., Pei J., Yan X., and Yu P.S. Mining frequent patterns in data streams at multiple time granularities. In: Kargupta H., Joshi A., Sivakumar K., and Yesha Y. (Eds). Data mining: Next generation challenges and future directions (2003), AAAI/MIT
    • (2003) Data mining: Next generation challenges and future directions
    • Giannella, C.1    Han, J.2    Pei, J.3    Yan, X.4    Yu, P.S.5
  • 7
    • 2442617843 scopus 로고    scopus 로고
    • Issues in data stream management
    • Golab L., and Özsu M.T. Issues in data stream management. ACM SIGMOD Record 32 2 (2003) 5-14
    • (2003) ACM SIGMOD Record , vol.32 , Issue.2 , pp. 5-14
    • Golab, L.1    Özsu, M.T.2
  • 8
    • 0039253846 scopus 로고    scopus 로고
    • Han, J., Pei, J., & Yin, Y. (2000). Mining frequent patterns without candidate generation. In Proceedings of the 2000 international conference on management of data, (pp. 1-12).
    • Han, J., Pei, J., & Yin, Y. (2000). Mining frequent patterns without candidate generation. In Proceedings of the 2000 international conference on management of data, (pp. 1-12).
  • 9
    • 33644920942 scopus 로고    scopus 로고
    • Research issues in data stream association rule mining
    • Jiang N., and Gruenwald L. Research issues in data stream association rule mining. ACM SIGMOD Record 35 1 (2006)
    • (2006) ACM SIGMOD Record , vol.35 , Issue.1
    • Jiang, N.1    Gruenwald, L.2
  • 10
    • 34548544986 scopus 로고    scopus 로고
    • Jin, R., & Agrawal, G. (2005). An algorithm for in-core frequent itemset mining on streaming data. In Proceedings of the 5th IEEE international conference on data mining.
    • Jin, R., & Agrawal, G. (2005). An algorithm for in-core frequent itemset mining on streaming data. In Proceedings of the 5th IEEE international conference on data mining.
  • 11
    • 56349153157 scopus 로고    scopus 로고
    • Li, H.-F., Lee, S.-Y., & Shan, M.-K. (2004). An efficient algorithm for mining frequent itemsets over the entire history of data streams. In Proceedings of the first international workshop on knowledge discovery in data streams.
    • Li, H.-F., Lee, S.-Y., & Shan, M.-K. (2004). An efficient algorithm for mining frequent itemsets over the entire history of data streams. In Proceedings of the first international workshop on knowledge discovery in data streams.
  • 12
    • 27144549849 scopus 로고    scopus 로고
    • Li, H.-F., Lee, S.-Y., & Shan, M.-K. (2005). Online mining (recently) maximal frequent itemsets over data streams. In Proceedings of the 15th IEEE international workshop on research issues on data engineering, (pp. 11-18).
    • Li, H.-F., Lee, S.-Y., & Shan, M.-K. (2005). Online mining (recently) maximal frequent itemsets over data streams. In Proceedings of the 15th IEEE international workshop on research issues on data engineering, (pp. 11-18).
  • 13
    • 34548128868 scopus 로고    scopus 로고
    • Li, H.-F., Ho, C.-C., Shan, M.-K., & Lee, S.-Y. (2006). Efficient maintenance and mining of frequent itemsets over online data streams with a sliding window. In Proceedings of the 2006 IEEE international conference on systems, man and cybernetics.
    • Li, H.-F., Ho, C.-C., Shan, M.-K., & Lee, S.-Y. (2006). Efficient maintenance and mining of frequent itemsets over online data streams with a sliding window. In Proceedings of the 2006 IEEE international conference on systems, man and cybernetics.
  • 14
    • 56349164762 scopus 로고    scopus 로고
    • Manku, G.S., & Motwani, R. (2002). Approximate frequency counts over data streams. In Proceedings of the 28th international conference on very large data bases, (pp. 346-357).
    • Manku, G.S., & Motwani, R. (2002). Approximate frequency counts over data streams. In Proceedings of the 28th international conference on very large data bases, (pp. 346-357).
  • 15
    • 85012188661 scopus 로고    scopus 로고
    • Teng, W.-G., Chen, M.-S., & Yu, P.S. (2003). A regression-based temporal pattern mining scheme for data streams. In Proceedings of the 29th international conference on very large data bases, (pp. 93-104).
    • Teng, W.-G., Chen, M.-S., & Yu, P.S. (2003). A regression-based temporal pattern mining scheme for data streams. In Proceedings of the 29th international conference on very large data bases, (pp. 93-104).
  • 16
    • 56349120703 scopus 로고    scopus 로고
    • Teng, W.-G., Chen, M.-S., & Yu, P.S. (2004). Using wavelet-based resource-aware mining to explore temporal and support count granularities in data streams. In Proceedings of the 4th SIAM international conference on data mining, April 22-24.
    • Teng, W.-G., Chen, M.-S., & Yu, P.S. (2004). Using wavelet-based resource-aware mining to explore temporal and support count granularities in data streams. In Proceedings of the 4th SIAM international conference on data mining, April 22-24.
  • 17
    • 84880100631 scopus 로고    scopus 로고
    • Wong, R.C.W., & Fu, A. (2005). Mining top-k itemsets over a sliding window based on Zipfian distribution. In Proceedings of 2005 SIAM international conference on data mining.
    • Wong, R.C.W., & Fu, A. (2005). Mining top-k itemsets over a sliding window based on Zipfian distribution. In Proceedings of 2005 SIAM international conference on data mining.
  • 18
    • 56349108597 scopus 로고    scopus 로고
    • Yu, J.-X., Chong, Z., Lu, H., & Zhou, A. (2004). False positive or false negative: Mining frequent itemsets from high speed transactional data streams. In Proceedings of the 30th international conference on very large data bases, (pp. 204-215).
    • Yu, J.-X., Chong, Z., Lu, H., & Zhou, A. (2004). False positive or false negative: Mining frequent itemsets from high speed transactional data streams. In Proceedings of the 30th international conference on very large data bases, (pp. 204-215).
  • 19
    • 56349145240 scopus 로고    scopus 로고
    • Zhu, Y., & Shasha, D. (2002). StatStream: Statistical monitoring of thousands of data streams in real time. In Proceedings of the 28th international conference on very large data bases, (pp. 358-369).
    • Zhu, Y., & Shasha, D. (2002). StatStream: Statistical monitoring of thousands of data streams in real time. In Proceedings of the 28th international conference on very large data bases, (pp. 358-369).


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