164 search results - page 14 / 33 » Finding Frequent Patterns in a Large Sparse Graph |
107
click to vote
KDD
2004
ACM
15 years 10 months ago
2004
ACM
Many real life sequence databases, such as customer shopping sequences, medical treatment sequences, etc., grow incrementally. It is undesirable to mine sequential patterns from s...
100
click to vote
EDBT
2012
ACM
12 years 12 months ago
2012
ACM
Increased availability of large repositories of chemical compounds has created new challenges and opportunities for the application of data-mining and indexing techniques to probl...
ISMAR
2006
IEEE
15 years 3 months ago
2006
IEEE
With tracking setups becoming increasingly complex, it gets more difficult to find suitable algorithms for tracking, calibration and sensor fusion. A large number of solutions e...
174
click to vote
ICDE
2004
IEEE
15 years 10 months ago
2004
IEEE
Frequent structure mining (FSM) aims to discover and extract patterns frequently occurring in structural data, such as trees and graphs. FSM finds many applications in bioinformat...
104
click to vote
IOR
2011
14 years 4 months ago
2011
This paper introduces and studies the maximum k-plex problem, which arises in social network analysis and has wider applicability in several important areas employing graph-based ...