Sciweavers

1454 search results - page 74 / 291
» Learning and Extending Sublanguages
Sort
View
UAI
1998
15 years 4 months ago
Learning the Structure of Dynamic Probabilistic Networks
Dynamic probabilistic networks are a compact representation of complex stochastic processes. In this paper we examine how to learn the structure of a DPN from data. We extend stru...
Nir Friedman, Kevin P. Murphy, Stuart J. Russell
CLEF
2010
Springer
15 years 4 months ago
Wikipedia Vandalism Detection Through Machine Learning: Feature Review and New Proposals - Lab Report for PAN at CLEF 2010
Wikipedia is an online encyclopedia that anyone can edit. In this open model, some people edits with the intent of harming the integrity of Wikipedia. This is known as vandalism. W...
Santiago Moisés Mola-Velasco
124
Voted
CORR
2010
Springer
128views Education» more  CORR 2010»
15 years 3 months ago
Sublinear Optimization for Machine Learning
Abstract--We give sublinear-time approximation algorithms for some optimization problems arising in machine learning, such as training linear classifiers and finding minimum enclos...
Kenneth L. Clarkson, Elad Hazan, David P. Woodruff
124
Voted
FUIN
2008
76views more  FUIN 2008»
15 years 3 months ago
Prescribed Learning of Indexed Families
Abstract. This work extends studies of Angluin, Lange and Zeugmann on how learnability of a language class depends on the hypothesis space used by the learner. While previous studi...
Sanjay Jain, Frank Stephan, Nan Ye
118
Voted
JALC
2007
95views more  JALC 2007»
15 years 3 months ago
Learning Regular Tree Languages from Correction and Equivalence Queries
Inspired by the results obtained in the string case, we present in this paper the extension of the correction queries to regular tree languages. Relying on Angluin’s and Sakakib...
Catalin Ionut Tîrnauca, Cristina Tîrna...