Sciweavers

394 search results - page 38 / 79
» A Study of Empirical Learning for an Involved Problem
Sort
View
CVPR
2009
IEEE
16 years 7 months ago
Learning a Distance Metric from Multi-instance Multi-label Data
Multi-instance multi-label learning (MIML) refers to the learning problems where each example is represented by a bag/collection of instances and is labeled by multiple labels. ...
Rong Jin (Michigan State University), Shijun Wang...
ICML
2009
IEEE
16 years 19 days ago
SimpleNPKL: simple non-parametric kernel learning
Previous studies of Non-Parametric Kernel (NPK) learning usually reduce to solving some Semi-Definite Programming (SDP) problem by a standard SDP solver. However, time complexity ...
Jinfeng Zhuang, Ivor W. Tsang, Steven C. H. Hoi
ICML
2005
IEEE
16 years 19 days ago
Discriminative versus generative parameter and structure learning of Bayesian network classifiers
In this paper, we compare both discriminative and generative parameter learning on both discriminatively and generatively structured Bayesian network classifiers. We use either ma...
Franz Pernkopf, Jeff A. Bilmes
IJON
2006
146views more  IJON 2006»
14 years 11 months ago
Feature selection and classification using flexible neural tree
The purpose of this research is to develop effective machine learning or data mining techniques based on flexible neural tree FNT. Based on the pre-defined instruction/operator se...
Yuehui Chen, Ajith Abraham, Bo Yang
JMLR
2002
135views more  JMLR 2002»
14 years 11 months ago
Covering Number Bounds of Certain Regularized Linear Function Classes
Recently, sample complexity bounds have been derived for problems involving linear functions such as neural networks and support vector machines. In many of these theoretical stud...
Tong Zhang