Sciweavers

1403 search results - page 61 / 281
» Set cover algorithms for very large datasets
Sort
View
NPL
2006
130views more  NPL 2006»
14 years 9 months ago
A Fast Feature-based Dimension Reduction Algorithm for Kernel Classifiers
This paper presents a novel dimension reduction algorithm for kernel based classification. In the feature space, the proposed algorithm maximizes the ratio of the squared between-c...
Senjian An, Wanquan Liu, Svetha Venkatesh, Ronny T...
ICML
2009
IEEE
15 years 10 months ago
Convex variational Bayesian inference for large scale generalized linear models
We show how variational Bayesian inference can be implemented for very large generalized linear models. Our relaxation is proven to be a convex problem for any log-concave model. ...
Hannes Nickisch, Matthias W. Seeger
SIGMOD
2000
ACM
212views Database» more  SIGMOD 2000»
15 years 2 months ago
SQLEM: Fast Clustering in SQL using the EM Algorithm
Clustering is one of the most important tasks performed in Data Mining applications. This paper presents an e cient SQL implementation of the EM algorithm to perform clustering in...
Carlos Ordonez, Paul Cereghini
BMCBI
2006
152views more  BMCBI 2006»
14 years 9 months ago
Amplification of the Gene Ontology annotation of Affymetrix probe sets
Background: The annotations of Affymetrix DNA microarray probe sets with Gene Ontology terms are carefully selected for correctness. This results in very accurate but incomplete a...
Enrique M. Muro, Carolina Perez-Iratxeta, Miguel A...
ICASSP
2011
IEEE
14 years 1 months ago
A knowledge-based algorithm to remove blocking artifacts in skin images for forensic analysis
Identifying criminals and victims in evidence images, where their faces are covered or obstructed, is a challenging task. In the legal case, United States v. Michael Joseph Pepe (...
Chaoying Tang, Adams Wai-Kin Kong, Noah Craft