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

Mining optimized gain rules for numeric attributes

Published:01 August 1999Publication History
First page image

References

  1. AF92.F.D. Amore and P. G. Franciosa. On the optimal binary plane partition for sets of isothetic rectangles, information Processing Letters, 44(5):255-259, December 1992. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. AIS93.Rakesh Agrawal, Tomasz Imielinski, and Arun Swami. Mining association rules between sets of items in large databases. In Proc. of the A CM $IGMOD Conference on Management of Data, pages 207-216, Washington, D.C., May 1993. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. AS94.Rakesh Agrawal and Ramakrishnan Srikant. Fast algorithms for mining association rules. In Proc. of the VLDB Conference, Santiago, Chile, September 1994. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. FMMT96a.Takeshi Fukuda, Yasuhiko Morimoto, Shinichi Morishita, and Takesh Tokuyama. Data mining using two-dimensional optimized association rules: Scheme, algorithms, and visualization. In Proc. of the A CM $IGMOD Conference on Management of Data, June 1996. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. FMMT96b.Takeshi Fukuda, Yasuhiko Morimoto, Shinichi Morishita, and Takesh Tokuyama. Mining optimized association rules for numeric attributes. In Proc. of the A CM SIGA CT-SiGMOD-SIGART Symposium on Principles of Database Systems, June 1996. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. HF95.J. Han and Y. Fu. Discovery of multiple-level association rules from large databases. In Proc. of the VLDB Conference, Zurich, Switzerland, September 1995. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. KMP98.S. Khanna, S. Muthukrishnan, and M. Paterson. On approximating rectangle tiling and packing. In Proc. 9th Annual Symposium on Discrete Algorithms (SODA), pages 384-393, 1998. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. MTV94.Heikki Mannila, Hannu Toivonen, and A. Inkeri Verkamo. Efficient algorithms for discovering association rules, in KDD- 9~: AAAI Workshop on Knowledge Discovery in Databases, pages 181-192, Seattle, Washington, July 1994.Google ScholarGoogle Scholar
  9. PCY95.Jong Soo Park, Ming-Syan Chen, and Philip S. Yu. An effective hash based algorithm for mining association rules. In Proc. of the A CM-SIGMOD Conference on Management of Data, San Jose, California, May 1995. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. RS98a.R. Rastogi and K. Shim. Mining optimized association rules for categorical and numeric attributes. In Int'l Conference on Data Engineering, Orlando, 1998. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. RS98b.R. Rastogi and K. Shim. Mining optimized gain rules numeric attributes. Technical report, Bell Laboratories, Murray Hill, 1998.Google ScholarGoogle Scholar
  12. RS99.R. Rastogi and K. Shim. Mining optimized support rules for numeric attributes. In Int'l Conference on Data Engineering, Sydney, Austrailia, 1999. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. SA95.Ramakrishnan Srikant and Rakesh Agrawal. Mining generalized association rules. In Proc. of the VLDB Conference, Zurich, Switzerland, September 1995. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. SA96.Ramakrishnan Srikant and Rakesh Agrawal. Mining quantitative association rules in large relational tables. In Proc. of the A CM SIGMOD Conference on Management of Data, June 1996. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. SON95.A. Savasere, E. Omiecinski, and S. Navathe. An efficient algorithm for mining association rules in large databases. In Proc. of the VLDB Conference, Zurich, Switzerland, September 1995. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Mining optimized gain rules for numeric attributes

          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