164 search results - page 13 / 33 » Finding Frequent Patterns in a Large Sparse Graph |
110
click to vote
BDA
2000
14 years 10 months ago
2000
In this paper we consider the problem of the incremental mining of sequential patterns when new transactions or new customers are added to an original database. We present a new a...
97
Voted
PAMI
2006
14 years 9 months ago
2006
This paper describes a novel solution to the rigid point pattern matching problem in Euclidean spaces of any dimension. Although we assume rigid motion, jitter is allowed. We pres...
IPPS
2008
IEEE
15 years 3 months ago
2008
IEEE
Graph structure can model the relationships among a set of objects. Mining quasi-clique patterns from large dense graph data makes sense with respect to both statistic and applica...
CORR
2011
Springer
14 years 1 months ago
2011
Springer
Abstract—Set intersection is the core in a variety of problems, e.g. frequent itemset mining and sparse boolean matrix multiplication. It is well-known that large speed gains can...
ICPR
2006
IEEE
15 years 10 months ago
2006
IEEE
Much past research on finding text in natural scenes uses bottom-up grouping processes to detect candidate text features as a first processing step. While such grouping procedures...