438 search results - page 20 / 88 » Data Structure and Algorithm in Data Mining: Granular Comput... |
ICDE
2006
IEEE
14 years 8 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...
CCGRID
2009
IEEE
14 years 2 months ago
2009
IEEE
—The ever increasing scale and complexity of large computational systems ask for sophisticated management tools, paving the way toward Autonomic Computing. A first step toward A...
SDM
2003
SIAM
13 years 8 months ago
2003
SIAM
We present two extensions of the algorithm by Broomhead et al [2] which is based on the idea that singular values that scale linearly with the radius of the data ball can be explo...
DAWAK
2003
Springer
14 years 21 days ago
2003
Springer
View materialization is recognized to be one of the most effective ways to increase the Data Warehouse performance; nevertheless, due to the computational complexity of the techniq...
FIMI
2003
13 years 8 months ago
2003
This paper presents the implementation of kDCI, an enhancement of DCI [10], a scalable algorithm for discovering frequent sets in large databases. The main contribution of kDCI re...