Sciweavers

701 search results - page 26 / 141
» Self Bounding Learning Algorithms
Sort
View
APPROX
2010
Springer
148views Algorithms» more  APPROX 2010»
13 years 11 months ago
Learning and Lower Bounds for AC0 with Threshold Gates
In 2002 Jackson et al. [JKS02] asked whether AC0 circuits augmented with a threshold gate at the output can be efficiently learned from uniform random examples. We answer this ques...
Parikshit Gopalan, Rocco A. Servedio
ICML
2008
IEEE
14 years 10 months ago
The projectron: a bounded kernel-based Perceptron
We present a discriminative online algorithm with a bounded memory growth, which is based on the kernel-based Perceptron. Generally, the required memory of the kernelbased Percept...
Francesco Orabona, Joseph Keshet, Barbara Caputo
SODA
2001
ACM
79views Algorithms» more  SODA 2001»
13 years 11 months ago
Learning Markov networks: maximum bounded tree-width graphs
Markov networks are a common class of graphical models used in machine learning. Such models use an undirected graph to capture dependency information among random variables in a ...
David R. Karger, Nathan Srebro
ICDM
2006
IEEE
89views Data Mining» more  ICDM 2006»
14 years 3 months ago
On the Lower Bound of Local Optimums in K-Means Algorithm
The k-means algorithm is a popular clustering method used in many different fields of computer science, such as data mining, machine learning and information retrieval. However, ...
Zhenjie Zhang, Bing Tian Dai, Anthony K. H. Tung
JCO
2010
75views more  JCO 2010»
13 years 8 months ago
A quadratic lower bound for Rocchio's similarity-based relevance feedback algorithm with a fixed query updating factor
Rocchio’s similarity-based relevance feedback algorithm, one of the most important query reformation methods in information retrieval, is essentially an adaptive supervised lear...
Zhixiang Chen, Bin Fu, John Abraham