Abstract
Studies the problem of efficiently computing correlated item sets satisfying given constraints. We call them valid correlated item sets. It turns out that constraints can have subtle interactions with correlated item sets, depending on their underlying properties. We show that, in general, the set of minimal valid correlated item sets does not coincide with that of minimal correlated item sets that are valid, and we characterize classes of constraints for which these sets coincide. We delineate the meaning of these two spaces and give algorithms for computing them. We also give an analytical evaluation of their performance and validate our analysis with a detailed experimental evaluation.
Keywords
Set (abstract data type)Computer scienceMeaning (existential)Data miningMathematicsAlgorithmTheoretical computer scienceProgramming language
Affiliated Institutions
Related Publications
Mining association rules with item constraints
The problem of discovering association rules has re-ceived considerable research attention and several fast algorithms for mining association rules have been de-veloped. In prac...
Efficient mining of emerging patterns
We introduce a new kind of patterns, called emerging patterns (EPs), for knowledge discovery from databases. EPs are defined as itemsets whose supports increase significantly fr...
Finding interesting rules from large sets of discovered association rules
Association rules, introduced by Agrawal, Imielinski, and Swami, are rules of the form “for 90% of the rows of the relation, if the row has value 1 in the columns in set W, then...
Beyond market baskets
One of the most well-studied problems in data mining is mining for association rules in market basket data. Association rules, whose significance is measured via support and con...
Set-oriented mining for association rules in relational databases
Describe set-oriented algorithms for mining association rules. Such algorithms imply performing multiple joins and may appear to be inherently less efficient than special-purpos...
Publication Info
- Year
- 2002
- Type
- article
- Pages
- 512-521
- Citations
- 160
- Access
- Closed
External Links
Social Impact
Altmetric
PlumX Metrics
Social media, news, blog, policy document mentions
Citation Metrics
160
OpenAlex
Cite This
Gösta Grahne,
Laks V. S. Lakshmanan,
X. Wang
(2002).
Efficient mining of constrained correlated sets.
, 512-521.
https://doi.org/10.1109/icde.2000.839450
Identifiers
- DOI
- 10.1109/icde.2000.839450