Sciweavers

1683 search results - page 149 / 337
» Learning with Mixtures of Trees
Sort
View
COLT
1992
Springer
14 years 1 months ago
Polynomial Time Inference of a Subclass of Context-Free Transformations
This paper deals with a class of Prolog programs, called context-free term transformations (CFT). We present a polynomial time algorithm to identify a subclass of CFT, whose progr...
Hiroki Arimura, Hiroki Ishizaka, Takeshi Shinohara
ICMLA
2010
13 years 7 months ago
Classification Models with Global Constraints for Ordinal Data
Ordinal classification is a form of multi-class classification where there is an inherent ordering between the classes, but not a meaningful numeric difference between them. Althou...
Jaime S. Cardoso, Ricardo Sousa
AIED
2009
Springer
14 years 4 months ago
Intelligent Support for Inquiry Learning from Images: A Learning Scenario and Tool
Inquiry learning involves the learner acquiring new concepts and skills by means of carrying out an investigation. Some previous studies have looked into how these learning activit...
Paul Mulholland, Zdenek Zdráhal, Jan Abraha...
MM
1993
ACM
126views Multimedia» more  MM 1993»
14 years 1 months ago
CMIFed: A Presentation Environment for Portable Hypermedia Documents
as a tree which specifies the presentation in an abstract, machineindependent way. This specification is created and edited using an authoring system; it is mapped to a particula...
Guido van Rossum, Jack Jansen, K. Sjoerd Mullender...
CVPR
2008
IEEE
14 years 11 months ago
Semi-supervised SVM batch mode active learning for image retrieval
Active learning has been shown as a key technique for improving content-based image retrieval (CBIR) performance. Among various methods, support vector machine (SVM) active learni...
Steven C. H. Hoi, Rong Jin, Jianke Zhu, Michael R....