Sciweavers

2252 search results - page 264 / 451
» A distributed machine learning framework
Sort
View
94
Voted
NIPS
2007
15 years 2 months ago
Stability Bounds for Non-i.i.d. Processes
The notion of algorithmic stability has been used effectively in the past to derive tight generalization bounds. A key advantage of these bounds is that they are designed for spec...
Mehryar Mohri, Afshin Rostamizadeh
ALT
2009
Springer
15 years 9 months ago
Average-Case Active Learning with Costs
Abstract. We analyze the expected cost of a greedy active learning algorithm. Our analysis extends previous work to a more general setting in which different queries have differe...
Andrew Guillory, Jeff A. Bilmes
205
Voted
COMPGEOM
2011
ACM
14 years 4 months ago
Comparing distributions and shapes using the kernel distance
Starting with a similarity function between objects, it is possible to define a distance metric (the kernel distance) on pairs of objects, and more generally on probability distr...
Sarang C. Joshi, Raj Varma Kommaraju, Jeff M. Phil...
CIKM
2008
Springer
15 years 2 months ago
Learning a two-stage SVM/CRF sequence classifier
Learning a sequence classifier means learning to predict a sequence of output tags based on a set of input data items. For example, recognizing that a handwritten word is "ca...
Guilherme Hoefel, Charles Elkan
ICML
2005
IEEE
16 years 1 months ago
Learning first-order probabilistic models with combining rules
Many real-world domains exhibit rich relational structure and stochasticity and motivate the development of models that combine predicate logic with probabilities. These models de...
Sriraam Natarajan, Prasad Tadepalli, Eric Altendor...