2463 search results - page 137 / 493 » Compressing Pattern Databases |
111
Voted
HPCC
2007
Springer
15 years 6 months ago
2007
Springer
Data missing is a common problem in database query processing, which can cause bias or lead to inefficient analyses, and this problem happens more often in sensor databases. The re...
208
click to vote
ICDE
2006
IEEE
16 years 1 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...
126
click to vote
KDD
2004
ACM
16 years 29 days ago
2004
ACM
One fundamental challenge for mining recurring subgraphs from semi-structured data sets is the overwhelming abundance of such patterns. In large graph databases, the total number ...
88
Voted
ICDM
2002
IEEE
15 years 5 months ago
2002
IEEE
Mining frequent patterns with an FP-tree avoids costly candidate generation and repeatedly occurrence frequency checking against the support threshold. It therefore achieves bette...
IIS
2003
15 years 1 months ago
2003
Current research on the VINLEN inductive database system is briefly reviewed and illustrated by selected results. The goal of research on VINLEN is to develop a methodology for de...