Sciweavers

221 search results - page 17 / 45
» Discriminative training by iterative linear programming opti...
Sort
View
ICML
2004
IEEE
14 years 8 months ago
Training conditional random fields via gradient tree boosting
Conditional Random Fields (CRFs; Lafferty, McCallum, & Pereira, 2001) provide a flexible and powerful model for learning to assign labels to elements of sequences in such appl...
Thomas G. Dietterich, Adam Ashenfelter, Yaroslav B...
SDM
2008
SIAM
144views Data Mining» more  SDM 2008»
13 years 9 months ago
Active Learning with Model Selection in Linear Regression
Optimally designing the location of training input points (active learning) and choosing the best model (model selection) are two important components of supervised learning and h...
Masashi Sugiyama, Neil Rubens
JMLR
2006
89views more  JMLR 2006»
13 years 7 months ago
Maximum-Gain Working Set Selection for SVMs
Support vector machines are trained by solving constrained quadratic optimization problems. This is usually done with an iterative decomposition algorithm operating on a small wor...
Tobias Glasmachers, Christian Igel
SODA
2010
ACM
216views Algorithms» more  SODA 2010»
14 years 5 months ago
On linear and semidefinite programming relaxations for hypergraph matching
The hypergraph matching problem is to find a largest collection of disjoint hyperedges in a hypergraph. This is a well-studied problem in combinatorial optimization and graph theo...
Yuk Hei Chan, Lap Chi Lau
IEEEMM
2007
146views more  IEEEMM 2007»
13 years 7 months ago
Learning Microarray Gene Expression Data by Hybrid Discriminant Analysis
— Microarray technology offers a high throughput means to study expression networks and gene regulatory networks in cells. The intrinsic nature of high dimensionality and small s...
Yijuan Lu, Qi Tian, Maribel Sanchez, Jennifer L. N...