454 search results - page 31 / 91 » A New Algorithm for Mining Sequential Patterns |
PODS
2001
ACM
14 years 7 months ago
2001
ACM
The need to search for complex and recurring patterns in database sequences is shared by many applications. In this paper, we discuss how to express and support efficiently sophis...
ICDM
2002
IEEE
14 years 15 days ago
2002
IEEE
In this paper, we propose a new mining task: mining top-k frequent closed patterns of length no less than min , where k is the desired number of frequent closed patterns to be min...
CORR
2011
Springer
13 years 2 months ago
2011
Springer
In this paper we present clustering method is very sensitive to the initial center values ,requirements on the data set too high, and cannot handle noisy data the proposal method ...
KDD
2002
ACM
14 years 8 months ago
2002
ACM
Mining frequent trees is very useful in domains like bioinformatics, web mining, mining semi-structured data, and so on. We formulate the problem of mining (embedded) subtrees in ...
SAC
2008
ACM
13 years 7 months ago
2008
ACM
The mining of frequent patterns in databases has been studied for several years. However, the real-world data tends to be dirty and frequent pattern mining which extracts patterns...