1106 search results - page 40 / 222 » On regularization algorithms in learning theory |
169
Voted
CIKM
2010
Springer
15 years 2 months ago
2010
Springer
In the standard formalization of supervised learning problems, a datum is represented as a vector of features without prior knowledge about relationships among features. However, ...
108
click to vote
COLING
2002
15 years 4 months ago
2002
We present an algorithm, Nomen, for learning generalized names in text. Examples of these are names of diseases and infectious agents, such as bacteria and viruses. These names ex...
189
Voted
IDA
2008
Springer
15 years 4 months ago
2008
Springer
Currently statistical and artificial neural network methods dominate in data mining applications. Alternative relational (symbolic) data mining methods have shown their effectivene...
117
click to vote
ISSAC
2007
Springer
15 years 10 months ago
2007
Springer
Constructing some regular graph with a given girth, a given degree and the fewest possible vertices is a hard problem. This problem is called the cage graph problem and has some l...
132
click to vote
CAV
1999
Springer
15 years 8 months ago
1999
Springer
BDDs and their algorithms implement a decision procedure for Quanti ed Propositional Logic. BDDs are a kind of acyclic automata. Unrestricted automata (recognizing unbounded string...