Sciweavers

997 search results - page 17 / 200
» Completely Lazy Learning
Sort
View
ESWA
2008
134views more  ESWA 2008»
13 years 8 months ago
Neighborhood classifiers
K nearest neighbor classifier (K-NN) is widely discussed and applied in pattern recognition and machine learning, however, as a similar lazy classifier using local information for...
Qinghua Hu, Daren Yu, Zongxia Xie
IFL
2007
Springer
141views Formal Methods» more  IFL 2007»
14 years 4 months ago
Partial Parsing: Combining Choice with Commitment
Abstract. Parser combinators, often monadic, are a venerable and widelyused solution to read data from some external format. However, the capability to return a partial parse has, ...
Malcolm Wallace
ANLP
2000
86views more  ANLP 2000»
13 years 11 months ago
A Finite State and Data-Oriented Method for Grapheme to Phoneme Conversion
A finite-state method, based on leftmost longestmatch replacement, is presented for segmenting words into graphemes, and for converting graphemes into phonemes. A small set of han...
Gosse Bouma
ICML
2000
IEEE
14 years 10 months ago
Complete Cross-Validation for Nearest Neighbor Classifiers
Cross-validation is an established technique for estimating the accuracy of a classifier and is normally performed either using a number of random test/train partitions of the dat...
Matthew D. Mullin, Rahul Sukthankar
AAAI
2006
13 years 11 months ago
Disco - Novo - GoGo: Integrating Local Search and Complete Search with Restarts
A hybrid algorithm is devised to boost the performance of complete search on under-constrained problems. We suggest to use random variable selection in combination with restarts, ...
Meinolf Sellmann, Carlos Ansótegui