Back to Search
Start Over
An Algorithm to Mine General Association Rules from Tabular Data.
- Source :
- Intelligent Data Engineering & Automated Learning - IDEAL 2007; 2007, p705-717, 13p
- Publication Year :
- 2007
-
Abstract
- Mining association rules is a major technique within data mining and has many applications. Most methods for mining association rules from tabular data mine simple rules which only represent equality in their items. Limiting the operator only to "=" results in many interesting frequent patterns that may exist not being identified. It is obvious that where there is an order between objects, greater than or less than a value is as important as equality. This motivates extension, from simple equality, to a more general set of operators. We address the problem of mining general association rules in tabular data where rules can have all operators { ≤ , ≥ , ≠ , = } in their antecedent part. The proposed algorithm, Mining General Rules (MGR), is applicable to datasets with discrete-ordered attributes and on quantitative discretized attributes. The proposed algorithm stores candidate general itemsets in a tree structure in such a way that supports of complex itemsets can be recursively computed from supports of simpler itemsets. The algorithm is shown to have benefits in terms of time complexity, memory management and has great potential for parallelization. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISBNs :
- 9783540772255
- Database :
- Complementary Index
- Journal :
- Intelligent Data Engineering & Automated Learning - IDEAL 2007
- Publication Type :
- Book
- Accession number :
- 34018213
- Full Text :
- https://doi.org/10.1007/978-3-540-77226-2_71