Mining optimized association rules for numeric attributes
Published 3 June 1996Open access
Takeshi Fukuda, Yasuhido Morimoto, Shinichi Morishita, Takeshi Tokuyama
Citations215
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
Given a huge database, the problem of finding rules for numeric attributes, such as(Balance # I)O(CardLoan=yes), is addressed, which implies that bank customers whose balances fall in a range I are likely to use card loan with a probability greater than p.
Abstract
96, Montreal Quebec Canada @ 1996 ACM ()-89791 -781 -'2/9 fj/fj6. ,$3.50 1 Recent progress in technologies for data input through such media as bar-coded labels, credit cards, OCRS, and cash dispensers, have made it easier for finance and retail organizations to collect massive amounts of data and to store them on disk at a low cost. Such organizations are interested in extracting from these huge databases unknown information that inspires new marketing strategies.
Keywords
Computer Science
BiometricsClassification and Regression Trees.
23,841 Citations1984Alexander Gordon, Leo Breiman +3 more
C4.5: Programs for Machine Learning
23,665 Citations1992J. R. Quinlan
A complete guide to the C4.5 system as implemented in C for the UNIX environment, which starts from simple core learning methods and shows how they can be elaborated and extended to deal with typical problems such as missing data and over hitting.
Mining association rules between sets of items in large databases
14,720 Citations1993Rakesh Agrawal, Tomasz Imieliński +1 more
An efficient algorithm is presented that generates all significant association rules between items in the database of customer transactions and incorporates buffer management and novel estimation and pruning techniques.
Fast algorithms for mining association rules
10,739 Citations1998Rakesh Agrawal, Ramakrishnan Srikant
Programs for Machine Learning
5,794 Citations1994Steven L. Salzberg, Alberto M. Segre
In his new book, C4.5: Programs for Machine Learning, Quinlan has put together a definitive, much needed description of his complete system, including the latest developments, which will be a welcome addition to the library of many researchers and students.
Mathematics of ComputationComputational Geometry--An Introduction.
4,264 Citations1986Mikhail J. Atallah, Franco P. Preparata +1 more
Cambridge University Press eBooksRandomized Algorithms
4,069 Citations1995Rajeev Motwani, Prabhakar Raghavan
Efficient and Effective Clustering Methods for Spatial Data Mining
1,788 Citations1994Raymond T. Ng, Jiawei Han
The analysis and experiments show that with the assistance of CLAHANS, these two algorithms are very effective and can lead to discoveries that are difficult to find with current spatial data mining algorithms.
MIT Press eBooksKnowledge Discovery in Databases
1,758 Citations1991Gregory Piateski, William Frawley
IEEE Transactions on Knowledge and Data EngineeringDatabase mining: a performance perspective
1,488 Citations1993R. K. Agrawal, Tomasz Imieliński +1 more
The authors' perspective of database mining as the confluence of machine learning techniques and the performance emphasis of database technology is presented and an algorithm for classification obtained by combining the basic rule discovery operations is given.
Mining quantitative association rules in large relational tables
1,484 Citations1996Ramakrishnan Srikant, Rakesh Agrawal
This work deals with quantitative attributes by fine-partitioning the values of the attribute and then combining adjacent partitions as necessary and introduces measures of partial completeness which quantify the information lost due to partitioning.
An effective hash-based algorithm for mining association rules
1,412 Citations1995Jong Soo Park, Ming-Syan Chen⋆ +1 more
The number of candidate 2-itemsets generated by the proposed algorithm is, in orders of magnitude, smaller than that by previous methods, thus resolving the performance bottleneck, and allows us to effectively trim the transaction database size at a much earlier stage of the iterations, thereby reducing the computational cost for later iterations significantly.
Lecture notes in computer scienceSLIQ: A fast scalable classifier for data mining
753 Citations1996Manish Mehta, Rakesh Agrawal +1 more
Issues in building a scalable classifier are discussed and the design of SLIQ, a new classifier that uses a novel pre-sorting technique in the tree-growth phase to enable classification of disk-resident datasets is presented.
Knowledge Discovery in Databases: An Attribute-Oriented Approach
385 Citations1992Jiawei Han, Yandong Cai +1 more
An attribute-oriented induction method has been developed for knowledge discovery in databases that integrates a machine learning paradigm with set-oriented database operations and extracts generalized data from actual data in databases.
Communications of the ACMProgramming pearls
333 Citations1987Jon Bentley, David Gries
This book is about programming pearls whose origins lie beyond solid engineering, in the realm of insight and creativity, and a new theme in this edition is how to evaluate and use software components.
Data mining using two-dimensional optimized association rules
267 Citations1996Takeshi Fukuda, Yasukiko Morimoto +2 more
This work discusses data mining based on association rules for two numeric attributes and one Boolean attribute, which implies that bank customers whose ages and balances fall in a planar region P tend to use card loan with a high probability.
An Interval Classifier for Database Mining Applications
266 Citations1992Rakesh Agrawal, Sakti P. Ghosh +3 more
Preliminary experimental results indicate that IC not only has retrieval and classi cation accuracy advantages, but also compares favorably with current tree classi ers, such as ID3, which were primarily designed for minimizing classiCation errors.
Communications of the ACMProgramming pearls
240 Citations1984Jon Bentley
This column is built around one small problem, with an emphasis on the algorithms that solve it and the techniques used to design them: sophisticated algorithmic methods sometimes lead to dramatic performance improvements.
DBMS Research at a Crossroads: The Vienna Update
63 Citations1993Michael Stonebraker, Rakesh Agrawal +3 more
This paper summarizes the discussion which took place at the IEEE International Conference on Data Engineering in Vienna, Austria on April 23, 1993 and contrasts the recommendations of the Laguna Beach participants with those obtained four years later by a similar group.
Computing optimized rectilinear regions for association rules
55 Citations1997Kunikazu Yoda, Takeshi Fukuda +3 more
Experimental tests confirm that the rectilinear region less overfits a training database and thefore provides a better prediction for unseen test data, and a novel efficient algorithm for computing optimized rectilInear regions is presented.
ConstraintsImplementation and Evaluation of Decision Trees with Range and Region Splitting
24 Citations1997Yasuhiko Morimoto, Takeshi Fukuda +2 more
An extension of an entropy-based heuristic for constructing a decision tree from a large database with many numeric attributes, which can create compact trees whose accuracy is comparable with or better than that of conventional trees.