66 search results - page 2 / 14 » Database Transposition for Constrained (Closed) Pattern Mini... |
ICDE
2006
IEEE
14 years 6 months ago
2006
IEEE
Most previously proposed frequent graph mining algorithms are intended to find the complete set of all frequent, closed subgraphs. However, in many cases only a subset of the freq...
DAWAK
2006
Springer
13 years 7 months ago
2006
Springer
Sequential pattern mining aims to find frequent patterns (guarded by a minimum support) in a database of sequences. As the support decreases the number of sequential patterns will...
KDD
2004
ACM
14 years 6 months ago
2004
ACM
In recent years, various constrained frequent pattern mining problem formulations and associated algorithms have been developed that enable the user to specify various itemsetbase...
ICDE
2004
IEEE
14 years 6 months ago
2004
IEEE
Previous studies have presented convincing arguments that a frequent pattern mining algorithm should not mine all frequent patterns but only the closed ones because the latter lea...
KDD
2005
ACM
14 years 6 months ago
2005
ACM
Discovery of sequential patterns is an essential data mining task with broad applications. Among several variations of sequential patterns, closed sequential pattern is the most u...