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

Infominer: mining surprising periodic patterns

Published:26 August 2001Publication History

ABSTRACT

In this paper, we focus on mining surprising periodic patterns in a sequence of events. In many applications, e.g., computational biology, an infrequent pattern is still considered very significant if its actual occurrence frequency exceeds the prior expectation by a large margin. The traditional metric, such as support, is not necessarily the ideal model to measure this kind of surprising patterns because it treats all patterns equally in the sense that every occurrence carries the same weight towards the assessment of the significance of a pattern regardless of the probability of occurrence. A more suitable measurement, information, is introduced to naturally value the degree of surprise of each occurrence of a pattern as a continuous and monotonically decreasing function of its probability of occurrence. This would allow patterns with vastly different occurrence probabilities to be handled seamlessly. As the accumulated degree of surprise of all repetitions of a pattern, the concept of information gain is proposed to measure the overall degree of surprise of the pattern within a data sequence. The bounded information gain property is identified to tackle the predicament caused by the violation of the downward closure property by the information gain measure and in turn provides an efficient solution to this problem. Empirical tests demonstrate the efficiency and the usefulness of the proposed model.

References

  1. 1.G. Berger and A. Tuzhilin. Discovering unexpected patterns in temporal data using temporal logic. Temporal Databases - Research and Practice, Lecture Notes on Computer Sciences, (1399) 281-309, 1998.Google ScholarGoogle ScholarCross RefCross Ref
  2. 2.R. Blahut. Principles and Practice of Information Theory, Addison-Wesley Publishing Company, 1987. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. 3.S. Brin, R. Motwani, C. Silverstein. Beyond market baskets: generalizing association rules to correlations. Proc. ACM SIGMOD Conf. on Management of Data, 265-276, 1997. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. 4.J. Han, G. Dong, and Y. Yin. Efficient mining partial periodic patterns in time series database. Proc. Int. Conf. on Data Engineering, 106-115, 1999. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. 5.M. Klemetinen, H. Mannila, P. Ronkainen, H. Toivonen, and A. Verkamo. Finding interesting rules from large sets of discovered association rules. Proe. CIKM, 1994. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. 6.B. Liu, W. Hsu, and Y. Ma. Mining association Rules with multiple minimum supports. Proc. ACM SIGKDD, 337-341, 1999. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. 7.S. Ma and J. Hellerstein. Mining partially periodic event patterns with unknown periods. Proe. Int. Conf. on Data Engineering, 205-214, 2001. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. 8.H. Mannila, D. Pavlov, and P. Smyth. Prediction with local patterns using cross-entropy. Proe. ACId SIGKDD, 357-361, 1999. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. 9.T. Oates, M. D. Schmill, P. R. Cohen. Efficient mining of statistical dependencies. Proc. 16th Int. Joint Conf. on Artificial Intelligence, 794-799, 1999. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. 10.B. Padmanabhan and A. Tuzhilin. Small is beautiful: discovering the minimal set of unexpected patterns. Proc. ACM KDD, 54-63, 2000. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. 11.A. Silberschatz and A. Tuzhilin. What makes patterns interesting in knowledge discover systems. IEEE Transactions on Knowledge and Data Engineerin 9 (TKDE) vol. 8 no. 6, pp. 970-974, 1996. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. 12.K. Wang, Y. He, and J. Han. Mining frequent itemsets using support constraints. Proe. Int. Conf. on Very Large Data Bases, 2000. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. 13.J. Yang, W. Wang, and P. Yu. Mining asynchronous periodic patterns in time series data. Proe. ACM SIGKDD Int. Conf. on Knowled9 e Discovery and Data Mining (SIGKDD), pp. 275-279, 2000. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. 14.J. Yang, W. Wang, and P. Yu. InfoMiner: mining surprising periodic patterns. IBM Research Report, 2001.Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. 15.M. J. Zaki. Generating non-redundant association rules. Proe. ACM SIGKDD, 34-43, 2000. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Infominer: mining surprising periodic patterns

        Recommendations

        Comments

        Login options

        Check if you have access through your login credentials or your institution to get full access on this article.

        Sign in
        • 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

          Copyright © 2001 ACM

          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]

          Publisher

          Association for Computing Machinery

          New York, NY, United States

          Publication History

          • Published: 26 August 2001

          Permissions

          Request permissions about this article.

          Request Permissions

          Check for updates

          Qualifiers

          • Article

          Acceptance Rates

          KDD '01 Paper Acceptance Rate31of237submissions,13%Overall Acceptance Rate1,133of8,635submissions,13%

          Upcoming Conference

        PDF Format

        View or Download as a PDF file.

        PDF

        eReader

        View online with eReader.

        eReader