Sciweavers

384 search results - page 27 / 77
» Learning Markov Network Structure with Decision Trees
Sort
View
EMNLP
2004
13 years 10 months ago
A Boosting Algorithm for Classification of Semi-Structured Text
The focus of research in text classification has expanded from simple topic identification to more challenging tasks such as opinion/modality identification. Unfortunately, the la...
Taku Kudo, Yuji Matsumoto
JMLR
2010
155views more  JMLR 2010»
13 years 7 months ago
Approximate Tree Kernels
Convolution kernels for trees provide simple means for learning with tree-structured data. The computation time of tree kernels is quadratic in the size of the trees, since all pa...
Konrad Rieck, Tammo Krueger, Ulf Brefeld, Klaus-Ro...
ICANN
2010
Springer
13 years 7 months ago
Dynamic Shape Learning and Forgetting
In this paper, we present a system capable of dynamically learning shapes in a way that also allows for the dynamic deletion of shapes already learned. It uses a self-balancing Bin...
Nikolaos Tsapanos, Anastasios Tefas, Ioannis Pitas
VMV
2008
107views Visualization» more  VMV 2008»
13 years 10 months ago
Learning with Few Examples using a Constrained Gaussian Prior on Randomized Trees
Machine learning with few training examples always leads to over-fitting problems, whereas human individuals are often able to recognize difficult object categories from only one ...
Erik Rodner, Joachim Denzler
SAC
2006
ACM
14 years 2 months ago
Facial emotion recognition by adaptive processing of tree structures
We present an emotion recognition system based on a probabilistic approach to adaptive processing of Facial Emotion Tree Structures (FETS). FETS are made up of localized Gabor fea...
Jia-Jun Wong, Siu-Yeung Cho