Sciweavers

1845 search results - page 59 / 369
» Machine-Learning Applications of Algorithmic Randomness
Sort
View
VMV
2008
107views Visualization» more  VMV 2008»
13 years 10 months ago
Learning with Few Examples using a Constrained Gaussian Prior on Randomized Trees
Machine learning with few training examples always leads to over-fitting problems, whereas human individuals are often able to recognize difficult object categories from only one ...
Erik Rodner, Joachim Denzler
ICCPOL
2009
Springer
13 years 7 months ago
A Simple and Efficient Model Pruning Method for Conditional Random Fields
Conditional random fields (CRFs) have been quite successful in various machine learning tasks. However, as larger and larger data become acceptable for the current computational ma...
Hai Zhao, Chunyu Kit
COLT
1991
Springer
14 years 22 days ago
Learning Probabilistic Read-Once Formulas on Product Distributions
Abstract. This paper presents a polynomial-time algorithm for inferring a probabilistic generalization of the class of read-once Boolean formulas over the usual basis {AND,OR,NOT}....
Robert E. Schapire
ICML
2008
IEEE
14 years 10 months ago
Fast incremental proximity search in large graphs
In this paper we investigate two aspects of ranking problems on large graphs. First, we augment the deterministic pruning algorithm in Sarkar and Moore (2007) with sampling techni...
Purnamrita Sarkar, Andrew W. Moore, Amit Prakash
ALT
2007
Springer
14 years 6 months ago
Learning and Verifying Graphs Using Queries with a Focus on Edge Counting
We consider the problem of learning and verifying hidden graphs and their properties given query access to the graphs. We analyze various queries (edge detection, edge counting, sh...
Lev Reyzin, Nikhil Srivastava