Sciweavers

1393 search results - page 169 / 279
» Machine Learning by Function Decomposition
Sort
View
IRMA
2000
15 years 3 months ago
Recognizing bounds of context change in on-line learning
The on-line algorithms in machine learning are intended to discover unknown function of the domain based on incremental observing of it instance by instance. These algorithms have...
Helen Kaikova, Vagan Y. Terziyan, Borys Omelayenko
IJCNN
2006
IEEE
15 years 7 months ago
Learning to Rank by Maximizing AUC with Linear Programming
— Area Under the ROC Curve (AUC) is often used to evaluate ranking performance in binary classification problems. Several researchers have approached AUC optimization by approxi...
Kaan Ataman, W. Nick Street, Yi Zhang
MICAI
2007
Springer
15 years 7 months ago
Weighted Instance-Based Learning Using Representative Intervals
Instance-based learning algorithms are widely used due to their capacity to approximate complex target functions; however, the performance of this kind of algorithms degrades signi...
Octavio Gómez, Eduardo F. Morales, Jes&uacu...
STOC
2004
ACM
102views Algorithms» more  STOC 2004»
16 years 1 months ago
A simple polynomial-time rescaling algorithm for solving linear programs
The perceptron algorithm, developed mainly in the machine learning literature, is a simple greedy method for finding a feasible solution to a linear program (alternatively, for le...
John Dunagan, Santosh Vempala
ECML
2005
Springer
15 years 7 months ago
On Discriminative Joint Density Modeling
Abstract. We study discriminative joint density models, that is, generative models for the joint density p(c, x) learned by maximizing a discriminative cost function, the condition...
Jarkko Salojärvi, Kai Puolamäki, Samuel ...