49 search results - page 10 / 10 » An Apriori-Based Algorithm for Mining Frequent Substructures... |
ISSTA
2009
ACM
13 years 11 months ago
2009
ACM
Bug localization has attracted a lot of attention recently. Most existing methods focus on pinpointing a single statement or function call which is very likely to contain bugs. Al...
SAC
2005
ACM
13 years 10 months ago
2005
ACM
In this paper, we describe a new approach for mining concept associations from large text collections. The concepts are short sequences of words that occur frequently together acr...
CIKM
2008
Springer
13 years 6 months ago
2008
Springer
In the past, quite a few fast algorithms have been developed to mine frequent patterns over graph data, with the large spectrum covering many variants of the problem. However, the...
IWCIA
2009
Springer
13 years 11 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...