skip to main content
10.1145/347090.347103acmconferencesArticle/Chapter ViewAbstractPublication PageskddConference Proceedingsconference-collections
Article
Free Access

Small is beautiful: discovering the minimal set of unexpected patterns

Authors Info & Claims
Published:01 August 2000Publication History
First page image

References

  1. 1.Agrawal, R., Mannila, H., Srikant, R., Toivonen, H. and Verkamo,A.I., 1995. Fast Discovery of Association Rules. In Fayyad, U.M., Piatetsky-Shapiro, G., Smyth, P., and Uthurusamy, R. eds., Advances in Knowledge Discovery and Data Mining. AAAI Press. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. 2.Bayardo, R. and Agrawal, R., 1999. Mining the Most Interesting Rules. In Proc. of the Fifth ACM-SIGKDD International Conference on Knowledge Discovery and Data Mining. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. 3.Bayardo, R., Agrawal, R. and Gunopulos, D., 1999. Constraint-Based Rule Mining in Large, Dense Databases. In Proceedings of ICDE, 1999. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. 4.Berger, G. and Tuzhilin, A., 1998. Discovering Unexpected Patterns in Temporal Data Using Temporal Logic. In Etzion, O., Jajodia, S. and Sripada, S. eds, Temporal Databases: Research and Practice. Springer, 1998.Google ScholarGoogle Scholar
  5. 5.Chakrabarti, S., Sarawagi, S. and Dom, B. Mining Surprising Patterns Using Temporal Description Length. In International Conference on Very Large Databases, 1998. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. 6.Liu, B. and Hsu, W., 1996. Post-Analysis of Learned Rules. In Proc. of the Thirteenth National Conference on Artificial Intelligence (AAAI '96), pp. 828-834. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. 7.Liu, B., Hsu, W. and Chen, S, 1997. Using General Impressions to Analyze Discovered Classification Rules. In Proc. of the Third International Conference on Knowledge Discovery and Data Mining (KDD 97), pp. 31-36.Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. 8.Liu, B., Hsu, W., and Ma, Y., 1999. Pruning and Summarizing the Discovered Rules. In Proc. of the Fifth ACM-SIGKDD Int'l Conference on Knowledge Discovery and Data Mining. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. 9.Mitchell, T., 1982. Generalization as Search. Artificial Intelligence, pp. 203-226.Google ScholarGoogle Scholar
  10. 10.Padmanabhan, B., 1999. Discovering Unexpected Patterns in Data Mining Applications. Doctoral Dissertation, New York University, May 1999. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. 11.Padmanabhan, B. and Tuzhilin, A., 1998. "A Belief-Driven Method for Discovering Unexpected Patterns." In Proc. 4th Int'l Conf. on Know. Discovery and Data Mining, 1998.Google ScholarGoogle Scholar
  12. 12.Padmanabhan, B. and Tuzhilin, A., 1999. Unexpectedness as a Measure of Interestingness in Knowledge Discovery. In Decision Support Systems, (27)3 (1999) pp. 303-318 Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. 13.Suzuki, E., 1997. Autonomous Discovery of Reliable Exception Rules. In Proceedings of the Third International Conference on Knowledge Discovery and Data Mining, pp. 259-262.Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. 14.Subramonian, R. Defining diff as a data mining primitive. In Proceedings of the Fourth International Conference on Knowledge Discovery and Data Mining, 1998.Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. 15.Srikant, R. and Agrawal, R., 1996. Mining Quantitative Association Rules in Large Relational Tables. In Proc. of the ACM SIGMOD Conference on Management of Data, 1996. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. 16.Shah, D., Lakshmanan, L.V.S, Ramamritham, K., and Sudarshan, S., 1999. Interestingness and Pruning of Mined Patterns. In Proceedings of the 1999 ACM SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery (DMKD), Philadelphia, 1999.Google ScholarGoogle Scholar
  17. 17.Silberschatz, A. and Tuzhilin, A., 1995. On Subjective Measures of Interestingness in Knowledge Discovery. In Proc. of the First International Conference on Knowledge Discovery and Data Mining, pp. 275-281.Google ScholarGoogle Scholar
  18. 18.Silberschatz, A. and Tuzhilin, A., 1996. What Makes Patterns Interesting in Knowledge Discovery Systems. IEEE Transactions on Knowledge and Data Engineering. Special Issue on Data Mining, vol. 5, no. 6, pp. 970-974. Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. 19.Srikant, R., Vu, Q. and Agrawal, R. Mining Association Rules with Item Constraints. In Proceedings of the Third International Conference on Knowledge Discovery and Data Mining (KDD 97), pp. 67-73.Google ScholarGoogle Scholar
  20. 20.Toivonen, H., Klemetinen, M., Ronkainen, P., Hatonen, K. and Mannila, H., 1995. Pruning and Grouping Discovered Association Rules. In MLNet Workshop on Statistics, Machine Learning and Discovery in Databases, pp. 47-52.Google ScholarGoogle Scholar

Index Terms

  1. Small is beautiful: discovering the minimal set of unexpected 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 '00: Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining
        August 2000
        537 pages
        ISBN:1581132336
        DOI:10.1145/347090

        Copyright © 2000 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: 1 August 2000

        Permissions

        Request permissions about this article.

        Request Permissions

        Check for updates

        Qualifiers

        • Article

        Acceptance Rates

        Overall Acceptance Rate1,133of8,635submissions,13%

        Upcoming Conference

        KDD '24

      PDF Format

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader