252 search results - page 24 / 51 » Mining Frequent Patterns without Candidate Generation |
KDD
2008
ACM
14 years 8 months ago
2008
ACM
Pattern discovery in sequences is an important problem in many applications, especially in computational biology and text mining. However, due to the noisy nature of data, the tra...
SIGMOD
2010
ACM
14 years 22 days ago
2010
ACM
Mining graph patterns in large networks is critical to a variety of applications such as malware detection and biological module discovery. However, frequent subgraphs are often i...
ICDE
2009
IEEE
14 years 9 months ago
2009
IEEE
Graphs are being increasingly used to model a wide range of scientific data. Such widespread usage of graphs has generated considerable interest in mining patterns from graph datab...
SIGMOD
2008
ACM
14 years 8 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...
ISCI
2008
13 years 8 months ago
2008
The use of frequent itemsets has been limited by the high computational cost as well as the large number of resulting itemsets. In many real-world scenarios, however, it is often ...