164 search results - page 15 / 33 » Finding Frequent Patterns in a Large Sparse Graph |
105
click to vote
IWCIA
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. In this paper, we address the problem of computing a canonical representation of an n-dimensional combinatorial map. To do so, we define two combinatorial map signatures...
119
click to vote
SSD
2001
Springer
15 years 1 months ago
2001
Springer
The problem of mining spatiotemporal patterns is finding sequences of events that occur frequently in spatiotemporal datasets. Spatiotemporal datasets store the evolution of object...
EUROSYS
2010
ACM
15 years 1 months ago
2010
ACM
Effective use of CPU data caches is critical to good performance, but poor cache use patterns are often hard to spot using existing execution profiling tools. Typical profilers at...
ALMOB
2006
14 years 9 months ago
2006
Background: Discovering approximately repeated patterns, or motifs, in biological sequences is an important and widely-studied problem in computational molecular biology. Most fre...
AUSDM
2007
Springer
15 years 3 months ago
2007
Springer
Mining High Utility Itemsets from a transaction database is to find itemsests that have utility above a user-specified threshold. This problem is an extension of Frequent Itemset ...