Efficient Remining of Generalized Association Rules Under Multiple Minimum Support Refinement

Tseng, Ming-Cheng; Lin, Wen-Yang; Jeng, Rong

doi:10.1007/11553939_186

Cited by 4 publications

(2 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We also note that generalized association rules maintenance ( [16] and [18]) is an interesting problem especially as defined taxonomy may be updated by the user. Updating items taxonomy invalidates generalized association rules hence the importance of maintenance [8].…”

Section: Resultsmentioning

confidence: 99%

GUFI: A New Algorithm for General Updating of Frequent Itemsets

Tobji¹,

Abrougui²,

Yaghlane

2008

2008 11th IEEE International Conference on Computational Science and Engineering - Workshops

View full text Add to dashboard Cite

Incremental maintenance of association rules is an interesting problem that has been tackled in several research works. Even though literature abundance in this way, there is still a lack of methods that process the complete maintenance problem, that is, incremental maintenance for any type of update (insertion or deletion of data) and for any new support threshold. In this paper, we develop a new method of general incremental maintenance. The experimentations showed that our algorithm is more efficient than classical maintenance approaches.

show abstract

Section: Resultsmentioning

confidence: 99%

GUFI: A New Algorithm for General Updating of Frequent Itemsets

Tobji¹,

Abrougui²,

Yaghlane

2008

2008 11th IEEE International Conference on Computational Science and Engineering - Workshops

View full text Add to dashboard Cite

show abstract

“…Recent research has developed numerous other mining association rules with multiple minimum supports [7,9,10,13,14]. In this work, the WMS algorithm is also a variant of mining association rules with multiple minimum supports.…”

Section: Related Workmentioning

confidence: 99%

An Algorithm for Mining Association Rules with Weighted Minimum Supports

Chang

Yeh

IFIP — The International Federation for Information Processing

View full text Add to dashboard Cite

Abstract:Most existing algorithms employ a uniform minimum support for mining association rules. Nevertheless, each item in a publication database, even each set of items, is exhibited in an individual period. A reasonable minimum support threshold has to be adjusted according to the exhibition period of each k-itQmsQt Accordingly, this paper proposes a new algorithm, called WMS, for mining association rules with weighted minimum supports in publication databases. WMS discovers all frequent itemsets which satisfy their individual requirement of minimum support thresholds. WMS applies the group closure property to prune futile itemsets, to reduce the number of candidates generated, and thus to generate the candidate sets efficiently.

show abstract

A novel approach for mining cyclically repeated patterns with multiple minimum supports

Tsai

Tai

et al. 2015

Applied Soft Computing

View full text Add to dashboard Cite

Efficient Remining of Generalized Association Rules Under Multiple Minimum Support Refinement

Cited by 4 publications

References 9 publications

GUFI: A New Algorithm for General Updating of Frequent Itemsets

GUFI: A New Algorithm for General Updating of Frequent Itemsets

An Algorithm for Mining Association Rules with Weighted Minimum Supports

A novel approach for mining cyclically repeated patterns with multiple minimum supports

Contact Info

Product

Resources

About