Sciweavers

11488 search results - page 15 / 2298
» Robust optimization - methodology and applications
Sort
View
ICML
2006
IEEE
14 years 8 months ago
Robust Euclidean embedding
We derive a robust Euclidean embedding procedure based on semidefinite programming that may be used in place of the popular classical multidimensional scaling (cMDS) algorithm. We...
Lawrence Cayton, Sanjoy Dasgupta
AAAI
1996
13 years 9 months ago
Discovering Robust Knowledge from Dynamic Closed World Data
Many applications of knowledge discovery require the knowledge to be consistent with data. Examples include discovering rules for query optimization, database integration, decisio...
Chun-Nan Hsu, Craig A. Knoblock
DATAMINE
1998
106views more  DATAMINE 1998»
13 years 7 months ago
Discovering Robust Knowledge from Databases that Change
Many applications of knowledge discovery and data mining such as rule discovery for semantic query optimization, database integration and decision support, require the knowledge t...
Chun-Nan Hsu, Craig A. Knoblock
4OR
2005
104views more  4OR 2005»
13 years 7 months ago
The robust shortest path problem with interval data via Benders decomposition
Many real problems can be modelled as robust shortest path problems on digraphs with interval costs, where intervals represent uncertainty about real costs and a robust path is not...
Roberto Montemanni, Luca Maria Gambardella
ICCV
2007
IEEE
14 years 9 months ago
pLSA for Sparse Arrays With Tsallis Pseudo-Additive Divergence: Noise Robustness and Algorithm
We introduce the Tsallis divergence error measure in the context of pLSA matrix and tensor decompositions showing much improved performance in the presence of noise. The focus of ...
Tamir Hazan, Roee Hardoon, Amnon Shashua