1036 search results - page 104 / 208 » Algorithms for Learning Regular Expressions |
115
click to vote
CONCUR
2006
Springer
15 years 3 months ago
2006
Springer
In regular inference, the problem is to infer a regular language, typically represented by a deterministic finite automaton (DFA) from answers to a finite set of membership querie...
DOCENG
2009
ACM
15 years 8 months ago
2009
ACM
We study the analysis problem of XPath expressions with counting constraints. Such expressions are commonly used in document transformations or programs in which they select porti...
ECML
2006
Springer
15 years 5 months ago
2006
Springer
Abstract. In some learning settings, the cost of acquiring features for classification must be paid up front, before the classifier is evaluated. In this paper, we introduce the fo...
110
Voted
ICDM
2009
IEEE
15 years 8 months ago
2009
IEEE
—Many real world learning problems can be recast as multi-task learning problems which utilize correlations among different tasks to obtain better generalization performance than...
131
click to vote
AAAI
2008
15 years 3 months ago
2008
Recent study has shown that canonical algorithms such as Principal Component Analysis (PCA) and Linear Discriminant Analysis (LDA) can be obtained from graph based dimensionality ...