메뉴 건너뛰기




Volumn , Issue , 2007, Pages 486-491

Mining frequent itemsets over data streams with multiple time-sensitive sliding windows

Author keywords

[No Author keywords available]

Indexed keywords

DATA ELEMENTS; DATA MINING TECHNIQUES; DATA STREAMING; FREQUENT PATTERNS; INTERNATIONAL CONFERENCES; LANGUAGE PROCESSING; MEMORY SPACES; MINING FREQUENT ITEMSETS; RAPID RATE; SLIDING WINDOWS; WEB INFORMATION;

EID: 50149117077     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ALPIT.2007.39     Document Type: Conference Paper
Times cited : (3)

References (17)
  • 1
    • 50149096758 scopus 로고    scopus 로고
    • R. Agrawal and R. Srikant, Fast algorithms for mining association rules, In Proceedings of the International Conference on VLDB, 1994.
    • R. Agrawal and R. Srikant, "Fast algorithms for mining association rules", In Proceedings of the International Conference on VLDB, 1994.
  • 2
    • 1142293244 scopus 로고    scopus 로고
    • B. Babcock, M. Datar, R. Motwani, and L. O'Callaghan, Maintaining variance and k-Medians over data stream windows, In Proceedings of the Symposium on ACMPODS, 2003.
    • B. Babcock, M. Datar, R. Motwani, and L. O'Callaghan, "Maintaining variance and k-Medians over data stream windows", In Proceedings of the Symposium on ACMPODS, 2003.
  • 3
    • 77952414052 scopus 로고    scopus 로고
    • J.H. Chang and W.S. Lee, Finding recent frequent itemsets adaptively over online data streams, In Proceedings of the International Conference on ACM SIGKDD, 2003.
    • J.H. Chang and W.S. Lee, "Finding recent frequent itemsets adaptively over online data streams", In Proceedings of the International Conference on ACM SIGKDD, 2003.
  • 4
    • 50149085239 scopus 로고    scopus 로고
    • M. Charikar, K. Chen, and M. Farach-Colton, Finding frequent items in data streams, In Proceedings of the International Conference on ICALP, 2002.
    • M. Charikar, K. Chen, and M. Farach-Colton, "Finding frequent items in data streams", In Proceedings of the International Conference on ICALP, 2002.
  • 5
    • 50149097698 scopus 로고    scopus 로고
    • E. Cohen and M. Strauss, Maintaining time decaying stream aggregates, In Proceedings of PODS Symposium, 2003.
    • E. Cohen and M. Strauss, "Maintaining time decaying stream aggregates", In Proceedings of PODS Symposium, 2003.
  • 6
    • 1142305378 scopus 로고    scopus 로고
    • G. Cormode and S. Muthukrishnan, What's hot and what's not: tracking most frequent items dynamically, In Proceedings of ACM PODS Symposium, 2003.
    • G. Cormode and S. Muthukrishnan, "What's hot and what's not: tracking most frequent items dynamically", In Proceedings of ACM PODS Symposium, 2003.
  • 7
    • 50149111275 scopus 로고    scopus 로고
    • E. Dmaine, A. Lopez-Ortiz, and J.I. Munro, Frequency estimation of internet packet streams with limited space, In Proceedings of European Symposium On Algorithms (ESA), 2002.
    • E. Dmaine, A. Lopez-Ortiz, and J.I. Munro, "Frequency estimation of internet packet streams with limited space", In Proceedings of European Symposium On Algorithms (ESA), 2002.
  • 8
    • 50149085467 scopus 로고    scopus 로고
    • M. Garofalakis, J. Gehrke and R. Rastogi, Querying and mining data streams: you only get one look, In the tutorial notes of the 28th International Conference on VLDB, 2002.
    • M. Garofalakis, J. Gehrke and R. Rastogi, "Querying and mining data streams: you only get one look", In the tutorial notes of the 28th International Conference on VLDB, 2002.
  • 10
    • 2442449952 scopus 로고    scopus 로고
    • J. Han, J. Pei, Y. Yin, and R. Mao, Mining frequent patterns without candidate generation: a frequent-pattern tree approach, In Proceedings of Data Mining and Knowledge Discovery, 2004.
    • J. Han, J. Pei, Y. Yin, and R. Mao, "Mining frequent patterns without candidate generation: a frequent-pattern tree approach", In Proceedings of Data Mining and Knowledge Discovery, 2004.
  • 11
    • 8644256210 scopus 로고    scopus 로고
    • C. Jin, W. Qian, C. Sha, J.X. Yu, and A. Zhou, Dynamically maintaining frequent items over a data stream, In Proceedings of ACM CIKM Conference, 2003.
    • C. Jin, W. Qian, C. Sha, J.X. Yu, and A. Zhou, "Dynamically maintaining frequent items over a data stream", In Proceedings of ACM CIKM Conference, 2003.
  • 13
    • 78650364804 scopus 로고    scopus 로고
    • C.H. Lin, D.Y. Chiu, Y.H Wu, and Arbee L.P. Chen, Mining frequent itemsets from data streams with a time sensitive sliding-window, In Proceedings of SIAM International Conference on Data Mining, 2005.
    • C.H. Lin, D.Y. Chiu, Y.H Wu, and Arbee L.P. Chen, "Mining frequent itemsets from data streams with a time sensitive sliding-window", In Proceedings of SIAM International Conference on Data Mining, 2005.
  • 14
    • 50149117693 scopus 로고    scopus 로고
    • G. Manku and R. Motwani, Approximate frequency counts over data streams, In Proceedings of the International Conference on VLDB, 2002.
    • G. Manku and R. Motwani, "Approximate frequency counts over data streams", In Proceedings of the International Conference on VLDB, 2002.
  • 15
    • 50149096097 scopus 로고    scopus 로고
    • Sungbo Seo, Long Jin, Jun Wook Lee, and Keun Ho Ryu, Similarity Pattern Discovery using Calendar Concept Hierarchy in Time Series Data, In Proceedings of Asia Pacific Web (APWeb), 2004.
    • Sungbo Seo, Long Jin, Jun Wook Lee, and Keun Ho Ryu, "Similarity Pattern Discovery using Calendar Concept Hierarchy in Time Series Data," In Proceedings of Asia Pacific Web (APWeb), 2004.
  • 16
    • 50149101472 scopus 로고    scopus 로고
    • Long Jin, Yongmi Lee, Sungbo Seo, and Keun Ho Ryu, Discovery of Temporal Frequent Patterns using TFP-tree, In Proceedings of Web-Age Information Management (WAIM), 2006.
    • Long Jin, Yongmi Lee, Sungbo Seo, and Keun Ho Ryu, "Discovery of Temporal Frequent Patterns using TFP-tree," In Proceedings of Web-Age Information Management (WAIM), 2006.
  • 17
    • 50149110155 scopus 로고    scopus 로고
    • Long Jin, Duck Jin Chai, Jun Wook Lee, and Keun Ho Ryu, Mining Recent Frequent Itemsets over Data Streams with a Time-Sensitive Sliding Window, In Proceedings of DataBase Management and Application over Network (DBMAN), 2007.
    • Long Jin, Duck Jin Chai, Jun Wook Lee, and Keun Ho Ryu, "Mining Recent Frequent Itemsets over Data Streams with a Time-Sensitive Sliding Window," In Proceedings of DataBase Management and Application over Network (DBMAN), 2007.


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