1863 search results - page 69 / 373 » Multi-valued Pattern Databases |
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...
KDD
2004
ACM
14 years 8 months 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 ...
ICDM
2002
IEEE
14 years 19 days 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
13 years 9 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...
ICDE
2007
IEEE
14 years 2 months ago
2007
IEEE
With the proliferation of multimedia data and evergrowing requests for multimedia applications, new challenges are emerged for efficient and effective managing and accessing large...