4263 search results - page 380 / 853 » Learning without Coding |
188
Voted
ICML
2003
IEEE
16 years 7 months ago
2003
IEEE
We present a novel approach to embedding data represented by a network into a lowdimensional Euclidean space. Unlike existing methods, the proposed method attempts to minimize an ...
193
click to vote
ICML
2000
IEEE
16 years 7 months ago
2000
IEEE
Clustering algorithms conduct a search through the space of possible organizations of a data set. In this paper, we propose two types of instance-level clustering constraints ? mu...
212
click to vote
ICML
1999
IEEE
16 years 7 months ago
1999
IEEE
AdaCost, a variant of AdaBoost, is a misclassification cost-sensitive boosting method. It uses the cost of misclassifications to update the training distribution on successive boo...
167
click to vote
KDD
2006
ACM
16 years 7 months ago
2006
ACM
Often the best performing supervised learning models are ensembles of hundreds or thousands of base-level classifiers. Unfortunately, the space required to store this many classif...
296
click to vote
VLDB
2006
ACM
16 years 7 months ago
2006
ACM
We focus on the problem of efficient learning of dependency trees. Once grown, they can be used as a special case of a Bayesian network, for PDF approximation, and for many other u...