KDD
1995
ACM
13 years 8 months ago
1995
ACM
Knowledge discovery systemsfor databasesareemployedto provide valuable insights into characteristics and relationshipsthat may exist in the data,but are unknown to the user. This ...
KDD
1995
ACM
13 years 8 months ago
1995
ACM
We report a novel possibility for extracting a small subset of a data base which contains all the information necessary to solve a given classification task: using the Support Vec...
KDD
1995
ACM
13 years 8 months ago
1995
ACM
KDD
1995
ACM
13 years 8 months ago
1995
ACM
KDD
1995
ACM
13 years 8 months ago
1995
ACM
Our work tackles the problem of finding partial determinations in databases and proposes a compressionbased measure to evaluate them. Partial determinations can be viewed as gener...
KDD
1995
ACM
13 years 8 months ago
1995
ACM
The Bayesianclassifier is a simple approachto classification that producesresults that are easy for people to interpret. In many cases, the Bayesianclassifieris at leastasaccurate...
KDD
1995
ACM
13 years 8 months ago
1995
ACM
Mostexisting decision tree systemsuse a greedyapproachto inducetrees -- locally optimalsplits are inducedat every node of the tree. Althoughthe greedy approachis suboptimal,it is ...
KDD
1995
ACM
13 years 8 months ago
1995
ACM
This paper explores the application of the Minimum Description Length principle for pruning decision trees. We present a new algorithm that intuitively captures the primary goal o...
KDD
1995
ACM
13 years 8 months ago
1995
ACM
Todate visualization has not been extensively harnessed in knowledge discovery in databases (KDD). In this paper, we show that a multidimensional visualization (MDV) technique can...
KDD
1995
ACM
13 years 8 months ago
1995
ACM
In the wrapperapproachto feature subset selection, a searchfor an optimalset of features is madeusingthe induction algorithm as a black box. Theestimated future performanceof the ...