732 search results - page 9 / 147 » Efficient Frequent Pattern Mining in Relational Databases |
SIGMOD
2008
ACM
14 years 7 months ago
2008
ACM
Existing temporal pattern mining assumes that events do not have any duration. However, events in many real world applications have durations, and the relationships among these ev...
PAKDD
2009
ACM
14 years 4 months ago
2009
ACM
Since mining frequent patterns from transactional databases involves an exponential mining space and generates a huge number of patterns, efficient discovery of user-interest-based...
ICDE
2006
IEEE
14 years 9 months ago
2006
IEEE
Most previously proposed frequent graph mining algorithms are intended to find the complete set of all frequent, closed subgraphs. However, in many cases only a subset of the freq...
EDBT
2009
ACM
13 years 11 months ago
2009
ACM
The classic Generalized Sequential Patterns (GSP) algorithm returns all frequent sequences present in a database. However, usually a few ones are interesting from a user's po...
SSD
2001
Springer
14 years 1 days 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...