Summarizing evolving data streams using dynamic prefix trees

Proceedings of the IEEE/WIC/ACM International Conference on Web Intelligence, WI 2007

Volumn , Issue , 2007, Pages 221-227

  Rojas, Carlos ^a   Nasraoui, Olfa ^a  

^a University of Louisville   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DATA MINING; DATA STRUCTURES; DECISION SUPPORT SYSTEMS; FILE ORGANIZATION; INFORMATION MANAGEMENT; RIVERS; SEARCH ENGINES; TERMINOLOGY;

ACTIVITY TIME; ATTRIBUTE FREQUENCY; DATA SETS; DATA STREAMING; EMPIRICAL EVALUATIONS; INTERNATIONAL CONFERENCES; NEWSGROUPS; ONE-PASS; PATTERN DISCOVERY; PREFIX TREES; STREAM DATA MINING; TEXT STREAMS; TREE PRUNING; WEB INTELLIGENCE; WEB LOGS;

TREES (MATHEMATICS);

EID: 48349098673     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/WI.2007.97     Document Type: Conference Paper

References (14)

1. B. Babcock, S. Babu, M. Datar, R. Motwani, and J. Widom. Models and issues in data stream systems. In PODS, pages 1-16, 2002.
2. D. M. Blei and J. D. Lafferty. Dynamic topic models. In ICML '06, pages 113-120. ACM Press, 2006.
3. W. Cheung and O. R. Zaïane. Incremental mining of frequent patterns without candidate generation or support constraint. In IDEAS, pages 111-116, 2003.
4. Y. Chi, H. Wang, Philip S. Yu, and Richard R. Muntz. Moment: Maintaining closed frequent itemsets over a stream sliding window. In ICDM '04, pages 59-66, 2004.
5. M. M. Gaber, S. Krishnaswamy, and A. Zaslavsky. Costefficient mining techniques for data streams. In ACSW Frontiers '04, pages 109-114, 2004.
6. C. Giannella, J. Han, J. Pei, X. Yan, and P. S. Yu. Mining frequent patterns in data streams at multiple time granularities. In Next Generation Data Mining, 2003.
7. T. L. Griffiths and M. Steyvers. Finding scientific topics. PNAS, 101 Suppl 1:5228-5235, April 2004.
8. J. Han, J. Pei, Y. Yin, and R. Mao. Mining frequent patterns without candidate generation: A frequent-pattern tree approach. Data Mining and Knowledge Discovery, 8(1):53-87, 2004.
9. G. Hulten, L. Spencer, and P. Domingos. Mining time-changing data streams. In KDD '01, pages 97-106, 2001.
10. D. Kifer, S. Ben-David, and J. Gehrke. Detecting change in data streams. In VLDB, pages 180-191, 2004.
11. J. Koh and S. Shieh. An efficient approach for maintaining association rules based on adjusting FP-Tree structures. In DASFAA, pages 417-424, 2004.
12. C. K. Leung and Q. I. Khan. DSTree: A tree structure for the mining of frequent sets from data streams. In ICDM '06, pages 928-932, 2006.
13. S. Della Pietra, V. Della Pietra, and J. Lafferty. Inducing features of random fields. IEEE Trans. Pattern Analysis and Machine Intelligence, 19(4):380-393, 1997.
14. M. Stonebraker, U. Çetintemel, and S. Zdonik. The 8 requirements of real-time stream processing. ACM SIGMOD Record, 34(4):42-47, 2005.