Sciweavers

1768 search results - page 39 / 354
» Mining Very Large Databases
Sort
View
ADBIS
2007
Springer
143views Database» more  ADBIS 2007»
14 years 4 months ago
Aggregating Multiple Instances in Relational Database Using Semi-Supervised Genetic Algorithm-based Clustering Technique
In solving the classification problem in relational data mining, traditional methods, for example, the C4.5 and its variants, usually require data transformations from datasets sto...
Rayner Alfred, Dimitar Kazakov
CINQ
2004
Springer
125views Database» more  CINQ 2004»
14 years 3 months ago
Deducing Bounds on the Support of Itemsets
Mining Frequent Itemsets is the core operation of many data mining algorithms. This operation however, is very data intensive and sometimes produces a prohibitively large output. I...
Toon Calders
ICDE
2010
IEEE
290views Database» more  ICDE 2010»
14 years 2 months ago
The Model-Summary Problem and a Solution for Trees
Modern science is collecting massive amounts of data from sensors, instruments, and through computer simulation. It is widely believed that analysis of this data will hold the key ...
Biswanath Panda, Mirek Riedewald, Daniel Fink
EDBT
2000
ACM
14 years 1 months ago
Mining Classification Rules from Datasets with Large Number of Many-Valued Attributes
Decision tree induction algorithms scale well to large datasets for their univariate and divide-and-conquer approach. However, they may fail in discovering effective knowledge when...
Giovanni Giuffrida, Wesley W. Chu, Dominique M. Ha...
SIGMOD
1996
ACM
110views Database» more  SIGMOD 1996»
14 years 2 months ago
Mining Quantitative Association Rules in Large Relational Tables
We introduce the problem of mining association rules in large relational tables containing both quantitative and categorical attributes. An example of such an association might be...
Ramakrishnan Srikant, Rakesh Agrawal