317 search results - page 29 / 64 » A hybrid approach to mining frequent sequential patterns |
DAWAK
2010
Springer
14 years 10 months ago
2010
Springer
Frequent sub-graph mining entails two significant overheads. The first is concerned with candidate set generation. The second with isomorphism checking. These are also issues with ...
COMPUTE
2010
ACM
15 years 2 months ago
2010
ACM
The single minimum support (minsup) based frequent pattern mining approaches like Apriori and FP-growth suffer from“rare item problem”while extracting frequent patterns. That...
192
click to vote
ICDE
2009
IEEE
15 years 11 months ago
2009
IEEE
Graphs are being increasingly used to model a wide range of scientific data. Such widespread usage of graphs has generated considerable interest in mining patterns from graph datab...
KDD
2009
ACM
15 years 4 months ago
2009
ACM
In this paper, we consider a novel scheme referred to as Cartesian contour to concisely represent the collection of frequent itemsets. Different from the existing works, this sche...
96
Voted
CORR
2010
Springer
14 years 9 months ago
2010
Springer
There is a considerable body of work on sequence mining of Web Log Data We are using One Pass frequent Episode discovery (or FED) algorithm, takes a different approach than the tr...