1996
DOI: 10.1145/235968.233311
|View full text |Cite
|
Sign up to set email alerts
|

Mining quantitative association rules in large relational tables

Abstract: We introduce the problem of mining association rules in large relational tables containing both quantitative and categorical attributes. An example of such an association might be "10% of married people between age 50 and 60 have at least 2 cars". We deal with quantitative attributes by fine-partitioning the values of the attribute and then combining adjacent partitions as necessary. We introduce measures of partial completeness which quantify the information lost due to partitioning. A direct application of t… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
67
0
4

Year Published

2004
2004
2020
2020

Publication Types

Select...
8
1

Relationship

0
9

Authors

Journals

citations
Cited by 511 publications
(71 citation statements)
references
References 3 publications
0
67
0
4
Order By: Relevance
“…metric distance), while the conventional association rule mining can only deal with categorical (classified) data. A solution to this problem is that we, first classify numeric data into ordinal categories and then mine these ordinal data for association rules (PiatetskyShapiro, 1991;Srikant and Agrawal, 1996). For example, metric distance may be categorized into 'very near', 'near', 'medium, and 'far'.…”
Section: Spatial Association Rule Miningmentioning
confidence: 99%
“…metric distance), while the conventional association rule mining can only deal with categorical (classified) data. A solution to this problem is that we, first classify numeric data into ordinal categories and then mine these ordinal data for association rules (PiatetskyShapiro, 1991;Srikant and Agrawal, 1996). For example, metric distance may be categorized into 'very near', 'near', 'medium, and 'far'.…”
Section: Spatial Association Rule Miningmentioning
confidence: 99%
“…This approach raises several questions, from the choice of the number of buckets to the size of the resulting data. A more elegant approach was provided by Srikant and Agrawal [16], who presented a machinery that solves most of the problems automatically. Their method is still based on a priori bucketing, and moreover, it is very specific to association rule mining, making it hard (or impossible) to apply to redescription mining.…”
Section: Data Discretizationmentioning
confidence: 99%
“…This information is provided by OLAP based on the MP B1 that presents the aspects of physicians characterized by their specialization, age, gender, workload, location where they work, and dispersion (see Figure 1). On the other hand, MP B2 is aimed at discovering interesting relations in physicians' data by an association rules discovery method (Srikant and Agrawal, 1996). In this model these rules show characteristics of physicians in some municipalities.…”
Section: Physiciansmentioning
confidence: 99%