Sciweavers

1393 search results - page 174 / 279
» Machine Learning by Function Decomposition
Sort
View
ICML
2002
IEEE
16 years 2 months ago
Learning the Kernel Matrix with Semi-Definite Programming
Kernel-based learning algorithms work by embedding the data into a Euclidean space, and then searching for linear relations among the embedded data points. The embedding is perfor...
Gert R. G. Lanckriet, Nello Cristianini, Peter L. ...
117
Voted
ML
2008
ACM
15 years 1 months ago
Incremental exemplar learning schemes for classification on embedded devices
Although memory-based classifiers offer robust classification performance, their widespread usage on embedded devices is hindered due to the device's limited memory resources...
Ankur Jain, Daniel Nikovski
COLT
2010
Springer
14 years 11 months ago
Toward Learning Gaussian Mixtures with Arbitrary Separation
In recent years analysis of complexity of learning Gaussian mixture models from sampled data has received significant attention in computational machine learning and theory commun...
Mikhail Belkin, Kaushik Sinha
130
Voted
JMLR
2006
134views more  JMLR 2006»
15 years 1 months ago
Considering Cost Asymmetry in Learning Classifiers
Receiver Operating Characteristic (ROC) curves are a standard way to display the performance of a set of binary classifiers for all feasible ratios of the costs associated with fa...
Francis R. Bach, David Heckerman, Eric Horvitz
ICML
2009
IEEE
16 years 2 months ago
Bayesian clustering for email campaign detection
We discuss the problem of clustering elements according to the sources that have generated them. For elements that are characterized by independent binary attributes, a closedform...
Peter Haider, Tobias Scheffer