Sciweavers

90 search results - page 13 / 18
» Toward Efficient Agnostic Learning
Sort
View
CIKM
2008
Springer
14 years 11 months ago
Structure feature selection for graph classification
With the development of highly efficient graph data collection technology in many application fields, classification of graph data emerges as an important topic in the data mining...
Hongliang Fei, Jun Huan
CVPR
2008
IEEE
15 years 11 months ago
Boosting ordinal features for accurate and fast iris recognition
In this paper, we present a novel iris recognition method based on learned ordinal features.Firstly, taking full advantages of the properties of iris textures, a new iris represen...
Zhaofeng He, Zhenan Sun, Tieniu Tan, Xianchao Qiu,...
TNN
2010
127views Management» more  TNN 2010»
14 years 4 months ago
RAMOBoost: ranked minority oversampling in boosting
In recent years, learning from imbalanced data has attracted growing attention from both academia and industry due to the explosive growth of applications that use and produce imba...
Sheng Chen, Haibo He, Edwardo A. Garcia
ICCV
2007
IEEE
15 years 11 months ago
Depth Information by Stage Classification
Recently, methods for estimating 3D scene geometry or absolute scene depth information from 2D image content have been proposed. However, general applicability of these methods in...
André Redert, Arnold W. M. Smeulders, Jan-M...
75
Voted
ACL
2010
14 years 7 months ago
Blocked Inference in Bayesian Tree Substitution Grammars
Learning a tree substitution grammar is very challenging due to derivational ambiguity. Our recent approach used a Bayesian non-parametric model to induce good derivations from tr...
Trevor Cohn, Phil Blunsom