Sciweavers

195 search results - page 25 / 39
» On the use of linear programming for unsupervised text class...
Sort
View
JMLR
2008
168views more  JMLR 2008»
13 years 7 months ago
Max-margin Classification of Data with Absent Features
We consider the problem of learning classifiers in structured domains, where some objects have a subset of features that are inherently absent due to complex relationships between...
Gal Chechik, Geremy Heitz, Gal Elidan, Pieter Abbe...
IOR
2008
109views more  IOR 2008»
13 years 7 months ago
Polynomial-Time Algorithms for Stochastic Uncapacitated Lot-Sizing Problems
In 1958, Wagner and Whitin published a seminal paper on the deterministic uncapacitated lot-sizing problem, a fundamental model that is embedded in many practical production plann...
Yongpei Guan, Andrew J. Miller
NIPS
1997
13 years 9 months ago
Learning Human-like Knowledge by Singular Value Decomposition: A Progress Report
Singular value decomposition (SVD) can be viewed as a method for unsupervised training of a network that associates two classes of events reciprocally by linear connections throug...
Thomas K. Landauer, Darrell Laham, Peter W. Foltz
ICDM
2010
IEEE
226views Data Mining» more  ICDM 2010»
13 years 5 months ago
Edge Weight Regularization over Multiple Graphs for Similarity Learning
The growth of the web has directly influenced the increase in the availability of relational data. One of the key problems in mining such data is computing the similarity between o...
Pradeep Muthukrishnan, Dragomir R. Radev, Qiaozhu ...
MP
2008
117views more  MP 2008»
13 years 7 months ago
Multiplier convergence in trust-region methods with application to convergence of decomposition methods for MPECs
Abstract. We study piecewise decomposition methods for mathematical programs with equilibrium constraints (MPECs) for which all constraint functions are linear. At each iteration o...
Giovanni Giallombardo, Daniel Ralph