165 search results - page 7 / 33 » Discovering Frequent Closed Itemsets for Association Rules |
IDA
2009
Springer
13 years 5 months ago
2009
Springer
Abstract. The effective construction of many association rule bases requires the computation of both frequent closed and frequent generator itemsets (FCIs/FGs). However, only few m...
PKDD
2007
Springer
14 years 1 months ago
2007
Springer
Frequent itemset mining assists the data mining practitioner in searching for strongly associated items (and transactions) in large transaction databases. Since the number of frequ...
JCST
2008
13 years 7 months ago
2008
This paper presents some new algorithms to efficiently mine max frequent generalized itemsets (g-itemsets) and essential generalized association rules (g-rules). These are compact ...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
In general frequent itemsets are generated from large data sets by applying association rule mining algorithms like Apriori, Partition, Pincer-Search, Incremental, Border algorithm...
AI
2001
Springer
14 years 4 days ago
2001
Springer
As new transactions update data sources and subsequently the data warehouse, the previously discovered association rules in the old database may no longer be interesting rules in ...