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

Breaking the barrier of transactions: mining inter-transaction association rules

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

References

  1. AIS93.R. Agrawal, T. Imielinski, and A. Swami. Mining association rules between sets of items in large databases. in Proc. 1993 ACM-SIGMOD Int. Conf. Management of Data, pages 207-216, Washington, D.C., May 1993. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. AS94.R. Agrawal and R. Srikant. Fast algorithms for mining association rules, in Proc. 199.~ Int. Conf. Very Large Data Bases, pages 487-499, Santiago, Chile, September 1994. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. AS95.R. Agrawal and R. Srikant. Mining sequential patterns. In Proc. 1995 Int. Conf. Data Engineering, pages 3-14, Taipei, Taiwan, March 1995. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. KHC97.M. Kamber, J. Han, and J. Y. Chiang. Metarule-guided mining of multi-dimensional association rules using data cubes. In Proc. 3rd Int. Conf. Knowledge Discovery and Data Mining (KDD'97), pages 207-210, Newport Beach, California, August 1997.Google ScholarGoogle Scholar
  5. KMR+94.M. Klemettinen, H. Mannila, P. Ronkainen, H. Toivonen, and A.I. Verkamo. Finding interesting rules from large sets of discovered association rules. In Proc. 3rd Int. Conf. Information and Knowledge Management, pages 401-408, Gaithersburg, Maryland, Nov. 1994. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. LHF98.H. Lu, J. Han, and L. Feng. Stock movement and ndimensional inter-transaction association rules. In Proc. 1998 SIGMOD Workshop on Research Issues on Data Mining and Knowledge Discovery (DMKD'98), pages 12:1-12:7, Seattle, Washington, June 1998.Google ScholarGoogle Scholar
  7. LNHP99.L. V. S. Lakshmanan, R. Ng, J. Han, and A. Pang. Optimization of constrained frequent set queries with 2- variable constraints. In Proc. 1999 ACM.$IGMOD Int. Conf. Management of Data, pages 157-168, Philadelphia, PA, June 1999. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. MPC96.R. Meo, G. Psaila, and S. Ceri. A new SQL-like operator for mining association rules. In Proc. 1996 Int. Conf. Very Large Data Bases, pages 122-133, Bombay, India, Sept. 1996. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. MTV97.H. Mannila, H Toivonen, and A. I. Verkamo. Discovery of frequent episodes in event sequences. Data Mining and lx'nowledge Discovery, 1:259-289, 1997. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. NLHP98.R. Ng, L. V. S. Lakshmanan, J. Han, and A. Pang. Exploratory mining and pruning optimizations of constrained associations rules. In Proc. 1998 ACM- $IGMOD Int. Conf. Management of Data, pages 13-24, Seattle, Washington, June 1998. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. PCY95.J.S. Park, M.S. Chen, and P.S. Yu. An effective hashbased algorithm for mining association rules. In Proc. 1995 ACM-SIGMOD Int. Conf. Management of Data, pages 175-186, San Jose, CA, May 1995. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. SA95.R. Srikant and R. Agrawal. Mining generalized association rules. In Proc. 1995 Int. Conf. Very Large Data Bases, pages 407-419, Zurich, Switzerland, Sept. 1995. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. SA96.R. Srikant and R. Agrawal. Mining quantitative association rules in large relational tables. In Proc. 1996 A CM- SIGMOD Int. Conf. Management of Data, pages 1-12, Montreal, Canada, June 1996. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. SVA97.R. Srikant, Q. Vu, and R. Agrawal. Mining association rules with item constraints. In Proc. 3rd Int. Conf. Knowledge Discovery and Data Mining (KDD'97), pages 67-73, Newport Beach, California, August 1997.Google ScholarGoogle Scholar
  15. Toi96.H. Toivonen. Sampling large databases for association rules. In Proc. 1996 Int. Conf. Very Large Data Bases, pages 134-145, Bombay, India, Sept. 1996. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Breaking the barrier of transactions: mining inter-transaction association rules

      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 '99: Proceedings of the fifth ACM SIGKDD international conference on Knowledge discovery and data mining
        August 1999
        439 pages
        ISBN:1581131437
        DOI:10.1145/312129

        Copyright © 1999 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 1999

        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