Sciweavers

7623 search results - page 255 / 1525
» Algorithmic Features of Eclat
Sort
View
SIAMJO
2010
125views more  SIAMJO 2010»
15 years 1 months ago
Trading Accuracy for Sparsity in Optimization Problems with Sparsity Constraints
We study the problem of minimizing the expected loss of a linear predictor while constraining its sparsity, i.e., bounding the number of features used by the predictor. While the r...
Shai Shalev-Shwartz, Nathan Srebro, Tong Zhang
JMLR
2012
13 years 9 months ago
On Bisubmodular Maximization
Bisubmodularity extends the concept of submodularity to set functions with two arguments. We show how bisubmodular maximization leads to richer value-of-information problems, usin...
Ajit Singh, Andrew Guillory, Jeff Bilmes
PR
2002
81views more  PR 2002»
15 years 6 months ago
Generalised correlation for multi-feature correspondence
Computing correspondences between pairs of images is fundamental to all structures from motion algorithms. Correlation is a popular method to estimate similarity between patches o...
C. V. Jawahar, P. J. Narayanan
CIKM
2010
Springer
15 years 5 months ago
Rank learning for factoid question answering with linguistic and semantic constraints
This work presents a general rank-learning framework for passage ranking within Question Answering (QA) systems using linguistic and semantic features. The framework enables query...
Matthew W. Bilotti, Jonathan L. Elsas, Jaime G. Ca...
ICAI
2009
15 years 4 months ago
On the Construction of Initial Basis Function for Efficient Value Function Approximation
- We address the issues of improving the feature generation methods for the value-function approximation and the state space approximation. We focus the improvement of feature gene...
Chung-Cheng Chiu, Kuan-Ta Chen