Sciweavers

1576 search results - page 108 / 316
» Properties of Synthetic Optimization Problems
Sort
View
ESWS
2008
Springer
15 years 5 months ago
Graph Summaries for Subgraph Frequency Estimation
A fundamental problem related to graph structured databases is searching for substructures. One issue with respect to optimizing such searches is the ability to estimate the freque...
Angela Maduko, Kemafor Anyanwu, Amit P. Sheth, Pau...
LWA
2008
15 years 5 months ago
Weighted Voting as Approximate MAP Prediction in Pairwise Classification
Weighted voting is the commonly used strategy for combining predictions in pairwise classification. Even though it shows excellent performance in practice, it is often criticized ...
Eyke Hüllermeier, Stijn Vanderlooy
PR
2007
139views more  PR 2007»
15 years 3 months ago
Learning the kernel matrix by maximizing a KFD-based class separability criterion
The advantage of a kernel method often depends critically on a proper choice of the kernel function. A promising approach is to learn the kernel from data automatically. In this p...
Dit-Yan Yeung, Hong Chang, Guang Dai
CORR
2011
Springer
134views Education» more  CORR 2011»
14 years 11 months ago
Robust Line Planning in case of Multiple Pools and Disruptions
Abstract. We consider the line planning problem in public transportation, under a robustness perspective. We present a mechanism for robust line planning in the case of multiple li...
Apostolos Bessas, Spyros C. Kontogiannis, Christos...
JMLR
2010
163views more  JMLR 2010»
14 years 11 months ago
Dense Message Passing for Sparse Principal Component Analysis
We describe a novel inference algorithm for sparse Bayesian PCA with a zero-norm prior on the model parameters. Bayesian inference is very challenging in probabilistic models of t...
Kevin Sharp, Magnus Rattray