Efficient discover of association rules in large databases is a we 1 studied problem and several ap-1y proaches have been proposed. However, it is non trivial to maintain the asso...
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 ...
Recently, the cyclic association rules have been introduced in order to discover rules from items characterized by their regular variation over time. In real life situations, temp...
We present an efficient algorithm (UWEP) for updating large itemsets when new transactions are added to the set of old transactions. UWEP employs a dynamic lookahead strategy in u...
Necip Fazil Ayan, Abdullah Uz Tansel, M. Erol Arku...
The process of knowledge discovery from databases is a knowledge intensive, highly user-oriented practice, thus has recently heralded the development of ontology-incorporated data ...