1217 search results - page 11 / 244 » On compressing frequent patterns |
158
Voted
ADMA
2010
Springer
15 years 1 months ago
2010
Springer
Abstract. This paper describes an approach to identifying and comparing frequent pattern trends in social networks. A frequent pattern trend is defined as a sequence of time-stampe...
141
click to vote
IDA
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. This paper introduces a new algorithm for approximate mining of frequent patterns from streams of transactions using a limited amount of memory. The proposed algorithm co...
147
click to vote
ICDM
2006
IEEE
15 years 9 months ago
2006
IEEE
Existing studies for mining frequent XML query patterns mainly introduce a straightforward candidate generate-and-test strategy and compute frequencies of candidate query patterns...
127
click to vote
DAWAK
2009
Springer
15 years 7 months ago
2009
Springer
Since transaction identifiers (ids) are unique and would not usually be frequent, mining frequent patterns with transaction ids, showing records they occurred in, provides an effic...
129
click to vote
ICDM
2002
IEEE
15 years 8 months 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...