Sciweavers

1092 search results - page 124 / 219
» Convex Methods for Transduction
Sort
View
NIPS
2004
14 years 11 months ago
Euclidean Embedding of Co-Occurrence Data
Embedding algorithms search for low dimensional structure in complex data, but most algorithms only handle objects of a single type for which pairwise distances are specified. Thi...
Amir Globerson, Gal Chechik, Fernando C. Pereira, ...
INFORMS
2008
241views more  INFORMS 2008»
14 years 10 months ago
Solving the Capacitated Local Access Network Design Problem
We propose an exact solution method for a routing and capacity installation problem in networks. Given an input graph, the problem is to route traffic from a set of source nodes t...
F. Sibel Salman, R. Ravi, John N. Hooker
JMLR
2006
115views more  JMLR 2006»
14 years 9 months ago
Structured Prediction, Dual Extragradient and Bregman Projections
We present a simple and scalable algorithm for maximum-margin estimation of structured output models, including an important class of Markov networks and combinatorial models. We ...
Benjamin Taskar, Simon Lacoste-Julien, Michael I. ...
IGARSS
2009
14 years 7 months ago
Robust Endmember Extraction in the Presence of Anomalies
Most available methods for endmember extraction use the convexity of the data structure and consider the vertices of the data as the purest pixels. Such methods do not consider th...
Olga Duran, Maria Petrou
JMLR
2010
173views more  JMLR 2010»
14 years 4 months ago
Collaborative Filtering via Rating Concentration
While most popular collaborative filtering methods use low-rank matrix factorization and parametric density assumptions, this article proposes an approach based on distribution-fr...
Bert Huang, Tony Jebara