Mining frequent sequences using itemset-based extension
MetadataShow full item record
In this paper, we systematically explore an itemset-based extension approach for generating candidate sequence which contributes to a better and more straightforward search space traversal performance than traditional item-based extension approach. Based on this candidate generation approach, we present FINDER, a novel algorithm for discovering the set of all frequent sequences. FINDER is composed oftwo separated steps. In the first step, all frequent itemsets are discovered and we can get great benefit from existing efficient itemset mining algorithms. In the second step, all frequent sequcnces with at least two frequent itemsets are detected by combining depth-first search and item set-based extension candidate generation together. A vertical bitmap data representation is adopted for rapidly support counting reason. Several pruning strategies are used to reduce the search space and minimize cost of computation. An extensive set ofexperiments demonstrate the effectiveness and the linear scalability of proposed algorithm.
The link to the International MultiConference of Engineers and Computer Scientists (IMECS 2008) is : http://www.iaeng.org/IMECS2008/
Showing items related by title, author, creator and subject.
Shaharanee, I.; Hadzic, Fedja (2014)Real world applications of association rule mining have well-known problems of discovering a large number of rules, many of which are not interesting or useful for the application at hand. The algorithms for closed and ...
Quality and interestingness of association rules derived from data mining of relational and semi-structured dataMohd Shaharanee, Izwan Nizal (2012)Deriving useful and interesting rules from a data mining system are essential and important tasks. Problems such as the discovery of random and coincidental patterns or patterns with no significant values, and the generation ...
Chang, Elizabeth; Tan, H.; Dillon, Tharam S.; Feng, L.; Hadzic, Fedja (2005)An XML enabled framework for representation of association rules in databases was first presented in [Feng03]. In Frequent Structure Mining (FSM), there are techniques proposed to mine frequent patterns from complex trees ...