Sciweavers

251 search results - page 29 / 51
» On the Complexity of Learning Lexicographic Strategies
Sort
View
ACE
2004
204views Education» more  ACE 2004»
13 years 9 months ago
Object-Oriented Analysis, Criterion-Referencing and Bloom
Lister and Leaney (Lister and Leaney, 2003b) presented a "coherent, explicit grading philosophy based on Bloom's taxonomy". I applied this philosophy to a second ye...
Ilona Box
GRC
2010
IEEE
13 years 8 months ago
Learning Multiple Latent Variables with Self-Organizing Maps
Inference of latent variables from complicated data is one important problem in data mining. The high dimensionality and high complexity of real world data often make accurate infe...
Lili Zhang, Erzsébet Merényi
BMCBI
2006
150views more  BMCBI 2006»
13 years 7 months ago
Instance-based concept learning from multiclass DNA microarray data
Background: Various statistical and machine learning methods have been successfully applied to the classification of DNA microarray data. Simple instance-based classifiers such as...
Daniel P. Berrar, Ian Bradbury, Werner Dubitzky
IJCAI
1997
13 years 9 months ago
Is Nonparametric Learning Practical in Very High Dimensional Spaces?
Many of the challenges faced by the £eld of Computational Intelligence in building intelligent agents, involve determining mappings between numerous and varied sensor inputs and ...
Gregory Z. Grudic, Peter D. Lawrence
ICCV
2007
IEEE
14 years 9 months ago
High Detection-rate Cascades for Real-Time Object Detection
A new strategy is proposed for the design of cascaded object detectors of high detection-rate. The problem of jointly minimizing the false-positive rate and classification complex...
Hamed Masnadi-Shirazi, Nuno Vasconcelos