Sciweavers

78 search results - page 14 / 16
» A Pitfall in Determining the Optimal Feature Subset Size
Sort
View
ICONIP
2007
13 years 8 months ago
Using Generalization Error Bounds to Train the Set Covering Machine
In this paper we eliminate the need for parameter estimation associated with the set covering machine (SCM) by directly minimizing generalization error bounds. Firstly, we consider...
Zakria Hussain, John Shawe-Taylor
BMCBI
2006
119views more  BMCBI 2006»
13 years 7 months ago
LS-NMF: A modified non-negative matrix factorization algorithm utilizing uncertainty estimates
Background: Non-negative matrix factorisation (NMF), a machine learning algorithm, has been applied to the analysis of microarray data. A key feature of NMF is the ability to iden...
Guoli Wang, Andrew V. Kossenkov, Michael F. Ochs
HPDC
2010
IEEE
13 years 8 months ago
Reshaping text data for efficient processing on Amazon EC2
Text analysis tools are nowadays required to process increasingly large corpora which are often organized as small files (abstracts, news articles, etc). Cloud computing offers a ...
Gabriela Turcu, Ian T. Foster, Svetlozar Nestorov
CORR
2011
Springer
205views Education» more  CORR 2011»
12 years 11 months ago
Algorithms for Implicit Hitting Set Problems
A hitting set for a collection of sets is a set that has a nonempty intersection with each set in the collection; the hitting set problem is to find a hitting set of minimum card...
Karthekeyan Chandrasekaran, Richard Karp, Erick Mo...
IROS
2009
IEEE
214views Robotics» more  IROS 2009»
14 years 2 months ago
1-point RANSAC for EKF-based Structure from Motion
Abstract— Recently, classical pairwise Structure From Motion (SfM) techniques have been combined with non-linear global optimization (Bundle Adjustment, BA) over a sliding window...
Javier Civera, Oscar G. Grasa, Andrew J. Davison, ...