1932 search results - page 207 / 387 » Self-organizing context learning |
143
Voted
ICML
2009
IEEE
16 years 5 months ago
2009
IEEE
This paper addresses feature selection techniques for classification of high dimensional data, such as those produced by microarray experiments. Some prior knowledge may be availa...
142
click to vote
ICML
2002
IEEE
16 years 5 months ago
2002
IEEE
We propose a new statistical approach to extracting personal names from a corpus. One of the key points of our approach is that it can both automatically learn the characteristics...
136
click to vote
ALT
2005
Springer
2005
Springer
PAC-Learnability of Probabilistic Deterministic Finite State Automata in Terms of Variation Distance
16 years 1 months ago
We consider the problem of PAC-learning distributions over strings, represented by probabilistic deterministic finite automata (PDFAs). PDFAs are a probabilistic model for the gen...
116
click to vote
WCRE
2007
IEEE
15 years 11 months ago
2007
IEEE
Dynamic protocol recovery tries to recover a component’s sequencing constraints by means of dynamic analysis. This problem has been tackled by several automaton learning approac...
111
click to vote
HT
2003
ACM
15 years 9 months ago
2003
ACM
In this paper, we explore the differences between the Adaptive Hypermedia and IMS Simple Sequencing approaches. Both approaches provide learning material tailored for the learner...