Sciweavers

66 search results - page 7 / 14
» Mining Classification Rules from Datasets with Large Number ...
Sort
View
KDD
2001
ACM
124views Data Mining» more  KDD 2001»
14 years 8 months ago
Tri-plots: scalable tools for multidimensional data mining
We focus on the problem of finding patterns across two large, multidimensional datasets. For example, given feature vectors of healthy and of non-healthy patients, we want to answ...
Agma J. M. Traina, Caetano Traina Jr., Spiros Papa...
KBS
2002
141views more  KBS 2002»
13 years 8 months ago
Using J-pruning to reduce overfitting in classification trees
The automatic induction of classification rules from examples in the form of a decision tree is an important technique used in data mining. One of the problems encountered is the o...
Max Bramer
VLDB
2007
ACM
137views Database» more  VLDB 2007»
14 years 2 months ago
Detecting Attribute Dependencies from Query Feedback
Real-world datasets exhibit a complex dependency structure among the data attributes. Learning this structure is a key task in automatic statistics configuration for query optimi...
Peter J. Haas, Fabian Hueske, Volker Markl
SBACPAD
2003
IEEE
180views Hardware» more  SBACPAD 2003»
14 years 1 months ago
New Parallel Algorithms for Frequent Itemset Mining in Very Large Databases
Frequent itemset mining is a classic problem in data mining. It is a non-supervised process which concerns in finding frequent patterns (or itemsets) hidden in large volumes of d...
Adriano Veloso, Wagner Meira Jr., Srinivasan Parth...
VLDB
1998
ACM
127views Database» more  VLDB 1998»
14 years 19 days ago
Algorithms for Mining Association Rules for Binary Segmentations of Huge Categorical Databases
We consider the problem of finding association rules that make nearly optimal binary segmentations of huge categorical databases. The optimality of segmentation is defined by an o...
Yasuhiko Morimoto, Takeshi Fukuda, Hirofumi Matsuz...