18 search results - page 2 / 4 » Pruning Relations for Substructure Discovery of Multi-relati... |
CLUSTER
2005
IEEE
13 years 11 months ago
2005
IEEE
The amount of data collected and stored in databases is growing considerably for almost all areas of human activity. Processing this amount of data is very expensive, both humanly...
ESWS
2008
Springer
13 years 7 months ago
2008
Springer
A fundamental problem related to graph structured databases is searching for substructures. One issue with respect to optimizing such searches is the ability to estimate the freque...
DAWAK
2010
Springer
13 years 6 months ago
2010
Springer
Abstract. We present an algorithm for mining frequent queries in arbitrary relational databases, over which functional dependencies are assumed. Building upon previous results, we ...
ISMIS
1999
Springer
13 years 9 months ago
1999
Springer
Knowledge Discovery in Databases (KDD) is a data analysis process which, in contrast to conventional data analysis, automatically generates and evaluates very many hypotheses, deal...
PKDD
2009
Springer
13 years 11 months ago
2009
Springer
Subgroup discovery is a Knowledge Discovery task that aims at finding subgroups of a population with high generality and distributional unusualness. While several subgroup discove...