skip to main content
10.1145/502512.502561acmconferencesArticle/Chapter ViewAbstractPublication PageskddConference Proceedingsconference-collections
Article

Discovering the set of fundamental rule changes

Published: 26 August 2001 Publication History

Abstract

The world around us changes constantly. Knowing what has changed is an important part of our lives. For businesses, recognizing changes is also crucial. It allows businesses to adapt themselves to the changing market needs. In this paper, we study changes of association rules from one time period to another. One approach is to compare the supports and/or confidences of each rule in the two time periods and report the differences. This technique, however, is too simplistic as it tends to report a huge number of rule changes, and many of them are, in fact, simply the snowball effect of a small subset of fundamental changes. Here, we present a technique to highlight the small subset of fundamental changes. A change is fundamental if it cannot be explained by some other changes. The proposed technique has been applied to a number of real-life datasets. Experiments results show that the number of rules whose changes are unexplainable is quite small (about 20% of the total number of changes discovered), and many of these unexplainable changes reflect some fundamental shifts in the application domain.

References

[1]
Agrawal, R. and Psaila, G. "Active data mining." KDD-95.
[2]
Agrawal, R. and Srikant, R. "Fast algorithms for mining association rules." VLDB-94, 1994.
[3]
Bayardo, R., Agrawal, R, and Gunopulos, D. "Constraintbased rule mining in large, dense databases." ICDE-99, 1999.
[4]
Cheung, D. Han, J, V. Ng, and Wong, C.Y. "Maintenance of discovered association rules in large databases: an incremental updating technique." ICDE-96, 1996.
[5]
Dong, G. and J. Li. "Efficient mining of emerging patterns: discovering trends and differences." KDD-99, 1999.
[6]
Ester, M., Frommelt, A., Kriegel, H-P., and Sander, J. "Algorithms for characterization and trend detection in spatial databases." KDD-98, 1998.
[7]
Fayyad, U. M. and Irani, K. B. "Multi-interval discretization of continuous-valued attributes for classification learning." IJCAI-93, 1993.
[8]
Ganti, V., Gehrke, J., and Ramakrishnan, R. "A framework for measuring changes in data characteristics." POPS-99, 1999.
[9]
Ganti, V., Gehrke, J., and Ramakrishnan, R. "DEMON: mining and monitoring evolving data." ICDE-2000, 2000.
[10]
Han, J. and Fu, Y. "Discovery of multiple-level association rules from large databases." VLDB-95, 1995.
[11]
Johnson T. and Dasu, T. "Comparing massive highdimensional data sets," KDD-98, 1998.
[12]
Kohavi, R., John, G., Long, R., Manley, D., and Pfleger, K. "MLC++: a machine learning library in C++." Tools with artificial intelligence, 740-743, 1994.
[13]
Lane, T. and Brodley, C. "Approaches to online learning and concept drift for user identification in computer security." KDD-98, 1998.
[14]
Liu, B., Hsu, W., and Chen, S. "Using general impressions to analyze discovered classification rules." KDD-97, 1997.
[15]
Liu, B., Hsu, W. and Ma, Y. Discovering the set of fundamental rule changes. NUS Technical Report, 2001.
[16]
Liu, B., Hsu, W. and Ma, Y. "Pruning and summarizing the discovered associations." KDD-99, 1999.
[17]
Mann, P. Introductory statistics. John Wiley & Sons, 1998.
[18]
Padmanabhan, B., and Tuzhilin, A. "Small is beautiful: Discovering the minimal set of unexpected patterns." KDD- 2OO0, 2000.
[19]
Silberschatz, A., and Tuzhilin, A. "What makes patterns interesting in knowledge discovery systems." IEEE Trans. on Know. and Data Eng. 8(6), 1996.
[20]
Widmer, G. "Learning in the presence of concept drift and hidden contexts." Machine learning, 23:69-101, 1996.

Cited By

View all

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
KDD '01: Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining
August 2001
493 pages
ISBN:158113391X
DOI:10.1145/502512
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 26 August 2001

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. Change mining
  2. data mining

Qualifiers

  • Article

Conference

KDD01
Sponsor:

Acceptance Rates

KDD '01 Paper Acceptance Rate 31 of 237 submissions, 13%;
Overall Acceptance Rate 1,133 of 8,635 submissions, 13%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)5
  • Downloads (Last 6 weeks)1
Reflects downloads up to 06 Nov 2024

Other Metrics

Citations

Cited By

View all

View Options

Get Access

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media