Sciweavers

2190 search results - page 9 / 438
» Learning with the Set Covering Machine
Sort
View
ICTAI
2010
IEEE
13 years 5 months ago
Unsupervised Greedy Learning of Finite Mixture Models
This work deals with a new technique for the estimation of the parameters and number of components in a finite mixture model. The learning procedure is performed by means of a expe...
Nicola Greggio, Alexandre Bernardino, Cecilia Lasc...
ICML
1995
IEEE
13 years 11 months ago
Learning with Rare Cases and Small Disjuncts
Systems that learn from examples often create a disjunctive concept definition. Small disjuncts are those disjuncts which cover only a few training examples. The problem with sma...
Gary M. Weiss
FCT
2009
Springer
14 years 2 months ago
Competitive Group Testing and Learning Hidden Vertex Covers with Minimum Adaptivity
Suppose that we are given a set of n elements d of which are “defective”. A group test can check for any subset, called a pool, whether it contains a defective. It is well know...
Peter Damaschke, Azam Sheikh Muhammad
EMNLP
2008
13 years 9 months ago
Arabic Named Entity Recognition using Optimized Feature Sets
The Named Entity Recognition (NER) task has been garnering significant attention in NLP as it helps improve the performance of many natural language processing applications. In th...
Yassine Benajiba, Mona T. Diab, Paolo Rosso
ML
2007
ACM
144views Machine Learning» more  ML 2007»
13 years 7 months ago
Invariant kernel functions for pattern analysis and machine learning
In many learning problems prior knowledge about pattern variations can be formalized and beneficially incorporated into the analysis system. The corresponding notion of invarianc...
Bernard Haasdonk, Hans Burkhardt