72 search results - page 7 / 15 » Learning Arbiter and Combiner Trees from Partitioned Data fo... |
NIPS
2004
13 years 9 months ago
2004
Many machine learning algorithms for clustering or dimensionality reduction take as input a cloud of points in Euclidean space, and construct a graph with the input data points as...
ECML
2004
Springer
14 years 29 days ago
2004
Springer
This paper 3 proposes a new method to qualify the result given by a decision tree when it is used as a decision aid system. When the data are numerical, we compute the distance of ...
ICML
2004
IEEE
14 years 8 months ago
2004
IEEE
The performance of graph based clustering methods critically depends on the quality of the distance function, used to compute similarities between pairs of neighboring nodes. In t...
ICML
2006
IEEE
14 years 8 months ago
2006
IEEE
When given a small sample, we show that classification with SVM can be considerably enhanced by using a kernel function learned from the training data prior to discrimination. Thi...
MLDM
2009
Springer
14 years 2 months ago
2009
Springer
In a world where massive amounts of data are recorded on a large scale we need data mining technologies to gain knowledge from the data in a reasonable time. The Top Down Induction...