Sciweavers

385 search results - page 37 / 77
» On higher-order perceptron algorithms
Sort
View
DCC
2011
IEEE
14 years 4 months ago
Color Image Compression Using a Learned Dictionary of Pairs of Orthonormal Bases
We present a new color image compression algorithm for RGB images. In our previous work [6], we presented a machine learning technique to derive a dictionary of orthonormal basis ...
Xin Hou, Karthik S. Gurumoorthy, Ajit Rajwade
MP
2008
129views more  MP 2008»
14 years 9 months ago
Corrector-predictor methods for monotone linear complementarity problems in a wide neighborhood of the central path
Abstract. Two corrector-predictor interior point algorithms are proposed for solving monotone linear complementarity problems. The algorithms produce a sequence of iterates in the ...
Florian A. Potra
ICML
2003
IEEE
15 years 10 months ago
Using Linear-threshold Algorithms to Combine Multi-class Sub-experts
We present a new type of multi-class learning algorithm called a linear-max algorithm. Linearmax algorithms learn with a special type of attribute called a sub-expert. A sub-exper...
Chris Mesterharm
AAAI
1997
14 years 11 months ago
Worst-Case Absolute Loss Bounds for Linear Learning Algorithms
The absolute loss is the absolute difference between the desired and predicted outcome. I demonstrateworst-case upper bounds on the absolute loss for the perceptron algorithm and ...
Tom Bylander
AAAI
1996
14 years 11 months ago
Generation of Attributes for Learning Algorithms
Inductive algorithms rely strongly on their representational biases, Constructive induction can mitigate representational inadequacies. This paper introduces the notion of a relat...
Yuh-Jyh Hu, Dennis F. Kibler