Sciweavers

899 search results - page 166 / 180
» Is an ordinal class structure useful in classifier learning
Sort
View
ICAI
2008
13 years 9 months ago
Nonrestrictive Concept-Acquisition by Representational Redescription
coarse procedures or very abstract frames from the point of view of algorithm, because some crucial issues like the representation, evolution, storage, and learning process of conc...
Hui Wei, Yan Chen
UAI
2003
13 years 8 months ago
On the Convergence of Bound Optimization Algorithms
Many practitioners who use EM and related algorithms complain that they are sometimes slow. When does this happen, and what can be done about it? In this paper, we study the gener...
Ruslan Salakhutdinov, Sam T. Roweis, Zoubin Ghahra...
ICSE
1999
IEEE-ACM
13 years 11 months ago
Exploiting Smalltalk Modules in a Customizable Programming Environment
This paper describes how we have extended a module structure of the Smalltalk LearningWorks to provide a programming environment deigned for very large scale technology transfer. ...
Mark Woodman, Robert Griffiths, Malcolm Macgregor,...
ACML
2009
Springer
14 years 2 months ago
Robust Discriminant Analysis Based on Nonparametric Maximum Entropy
In this paper, we propose a Robust Discriminant Analysis based on maximum entropy (MaxEnt) criterion (MaxEnt-RDA), which is derived from a nonparametric estimate of Renyi’s quadr...
Ran He, Bao-Gang Hu, Xiaotong Yuan
CSCLP
2006
Springer
13 years 11 months ago
Efficient Recognition of Acyclic Clustered Constraint Satisfaction Problems
Abstract. In this paper we present a novel approach to solving Constraint Satisfaction Problems whose constraint graphs are highly clustered and the graph of clusters is close to b...
Igor Razgon, Barry O'Sullivan