|
| << previous | next >> |
Journal description
All volumes of the corresponding journal
All issues of the corresponding volume
All articles of the corresponding issues
Details for article 5 of 6 found articles
| Title: |
Optimization of association rule mining queries |
| Author: |
Baptiste Jeudy Jean-François Boulicaut |
| Appeared in: |
Intelligent data analysis |
| Paging: | Volume 6 (2002) nr. 4 pages 341-357 |
| Year: |
2002-10-21 |
| Contents: |
Levelwise algorithms (e.g., the APRIORI algorithm) have been proved effective for association rule mining from sparse data. However, in many practical applications, the computation turns to be intractable for the user-given frequency threshold and the lack of focus leads to huge collections of frequent itemsets. To tackle these problems, two promising issues have been investigated during the last four years: the efficient use of user defined constraints and the computation of condensed representations for frequent itemsets, e.g., the frequent closed sets. We show that the benefits of these two approaches can be combined into a levelwise algorithm. It can be used for the discovery of association rules in difficult cases (dense and highly-correlated data). For instance, we report an experimental validation related to the discovery of association rules with negations. |
| Publisher: |
IOS Press |
| Source file: |
Elektronische Wetenschappelijke Tijdschriften |
Details for article 5 of 6 found articles
| << previous | next >> |