Sciweavers

120 search results - page 9 / 24
» On an Interval-Valued Solution of the Marginal Problem
Sort
View
DIS
2010
Springer
13 years 5 months ago
Sparse Substring Pattern Set Discovery Using Linear Programming Boosting
In this paper, we consider finding a small set of substring patterns which classifies the given documents well. We formulate the problem as 1 norm soft margin optimization problem ...
Kazuaki Kashihara, Kohei Hatano, Hideo Bannai, Mas...
PCM
2001
Springer
183views Multimedia» more  PCM 2001»
13 years 12 months ago
An Adaptive Index Structure for High-Dimensional Similarity Search
A practical method for creating a high dimensional index structure that adapts to the data distribution and scales well with the database size, is presented. Typical media descrip...
Peng Wu, B. S. Manjunath, Shivkumar Chandrasekaran
ATMOS
2007
129views Optimization» more  ATMOS 2007»
13 years 9 months ago
Solving a Real-World Train Unit Assignment Problem
We face a real-world train unit assignment problem for an operator running trains in a regional area. Given a set of timetabled train trips, each with a required number of passenge...
Valentina Cacchiani, Alberto Caprara, Paolo Toth
TNN
2010
154views Management» more  TNN 2010»
13 years 2 months ago
Discriminative semi-supervised feature selection via manifold regularization
We consider the problem of semi-supervised feature selection, where we are given a small amount of labeled examples and a large amount of unlabeled examples. Since a small number ...
Zenglin Xu, Irwin King, Michael R. Lyu, Rong Jin
COLT
2001
Springer
14 years 1 days ago
Ultraconservative Online Algorithms for Multiclass Problems
In this paper we study a paradigm to generalize online classification algorithms for binary classification problems to multiclass problems. The particular hypotheses we investig...
Koby Crammer, Yoram Singer