Efficient monitoring of patterns in data mining environments

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2798, Issue , 2003, Pages 253-265

  Baron, Steffan ^a   Spiliopoulou, Myra ^b   Günther, Oliver ^a  

^a HUMBOLDT UNIVERSITY   (Germany)

^b OTTO VON GUERICKE UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTERS;

EFFICIENT MONITORING; INTERESTING RULES; INVARIANT PROPERTIES; LOG DATA; MINING ENVIRONMENTS; MONITORING PATTERNS; SECOND PHASE; TEMPORAL REPRESENTATIONS;

DATA MINING;

EID: 33745767871     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-39403-7_20     Document Type: Article

References (16)

1. N. F. Ayan, A. U. Tansel, and E. Arkun. An Efficient Algorithm To Update Large Itemsets With Early Pruning. In Proceedings of the Fifth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pages 287-291, San Diego, CA, USA, August 1999. ACM.
2. S. Baron and M. Spiliopoulou. Monitoring Change in Mining Results. In Proceedings of the 3rd International Conference on Data Warehousing and Knowledge Discovery, Munich, Germany, Sep. 2001. Springer.
3. S. Baron and M. Spiliopoulou. Monitoring the Results of the KDD Process: An Overview of Pattern Evolution. In J. Meij, editor, Dealing with the data flood: mining data, text and multimedia, chapter 6. STT Netherlands Study Center for Technology Trends, The Hague, Netherlands, Apr. 2002.
4. M. J. Berry and G. Linoff. Data Mining Techniques: For Marketing, Sales and Customer Support. John Wiley & Sons, Inc., 1997.
5. Y. M. Bing Liu and R. Lee. Analyzing the interestingness of association rules from the temporal dimension. In IEEE International Conference on Data Mining (ICDM-2001), pages 377-384, Silicon Valley, USA, November 2001.
6. S. Chakrabarti, S. Sarawagi, and B. Dom. Mining Surprising Patterns Using Temporal Description Length. In A. Gupta, O. Shmueli, and J. Widom, editors, VLDB'98, pages 606-617, New York City, NY, Aug. 1998. Morgan Kaufmann.
7. X. Chen and I. Petrounias. Mining Temporal Features in Association Rules. In Proceedings of the 3rd European Conference on Principles of Data Mining and Knowledge Discovery, Lecture Notes in Computer Science, pages 295-300, Prague, Czech Republic, September 1999. Springer.
8. D. W. Cheung, S. Lee, and B. Kao. A General Incremental Technique for Maintaining Discovered Association Rules. In DASFAA'97, Melbourne, Australia, Apr. 1997.
9. M. Ester, H.-P. Kriegel, J. Sander, M. Wimmer, and X. Xu. Incremental Clustering for Mining in a Data Warehousing Environment. In Proceedings of the 24th International Conference on Very Large Data Bases, pages 323-333, New York City, New York, USA, August 1998. Morgan Kaufmann.
10. V. Ganti, J. Gehrke, and R. Ramakrishnan. A Framework for Measuring Changes in Data Characteristics. In Proceedings of the Eighteenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, pages 126-137, Philadelphia, Pennsylvania, May 1999. ACM Press.
11. V. Ganti, J. Gehrke, and R. Ramakrishnan. DEMON: Mining and Monitoring Evolving Data. In Proceedings of the 15th International Conference on Data Engineering, pages 439-448, San Diego, California, USA, February 2000. IEEE Computer Society.
12. S. Jaroszewicz and D. A. Simovici. Pruning redundant association rules using maximum entropy principle. In Advances in Knowledge Discovery and Data Mining, 6th Pacific-Asia Conference, PAKDD'02, pages 135-147, Taipei, Taiwan, May 2002.
13. B. Liu, W. Hsu, and Y. Ma. Discovering the set of fundamental rule changes. In 7th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD-2001), pages 335-340, San Francisco, USA, August 2001.
14. E. Omiecinski and A. Savasere. Efficient Mining of Association Rules in Large Databases. In Proceedings of the British National Conference on Databases, pages 49-63, 1998.
15. S. Thomas, S. Bodagala, K. Alsabti, and S. Ranka. An Efficient Algorithm for the Incremental Updation of Association Rules in Large Databases. In Proceedings of the 3rd International Conference on Knowledge Discovery and Data Mining (KDD-97), pages 263-266, Newport Beach, California, USA, Aug. 1997.
16. K. Wang. Discovering Patterns from Large and Dynamic Sequential Data. Intelligent Information Systems, 9:8-33, 1997.