1217 search results - page 38 / 244 » On compressing frequent patterns |
130
click to vote
ICDM
2008
IEEE
15 years 10 months ago
2008
IEEE
In this paper we study the problem of mining frequent sequences satisfying a given regular expression. Previous approaches to solve this problem were focusing on its search space,...
149
click to vote
VLDB
2007
ACM
15 years 9 months ago
2007
ACM
Multi-core processors are proliferated across different domains in recent years. In this paper, we study the performance of frequent pattern mining on a modern multi-core machine....
146
Voted
PKDD
2000
Springer
15 years 7 months ago
2000
Springer
Abstract. This paper proposes a novel approach named AGM to eciently mine the association rules among the frequently appearing substructures in a given graph data set. A graph tran...
405
click to vote
CPM
2011
Springer
14 years 7 months ago
2011
Springer
Combinatorial maps are nice data structures for modeling the topology of nD objects subdivided in cells (e.g., vertices, edges, faces, volumes, ...) by means of incidence and adjac...
159
Voted
IISWC
2008
IEEE
15 years 10 months ago
2008
IEEE
—High-speed content inspection of network traffic is an important new application area for programmable networking systems, and has recently led to several proposals for high-per...