Sciweavers

24 search results - page 4 / 5
» A fast variant of the Gaussian reduction algorithm
Sort
View
ICA
2007
Springer
15 years 3 months ago
Infinite Sparse Factor Analysis and Infinite Independent Components Analysis
Abstract. A nonparametric Bayesian extension of Independent Components Analysis (ICA) is proposed where observed data Y is modelled as a linear superposition, G, of a potentially i...
David Knowles, Zoubin Ghahramani
NIPS
2004
15 years 28 days ago
Neighbourhood Components Analysis
In this paper we propose a novel method for learning a Mahalanobis distance measure to be used in the KNN classification algorithm. The algorithm directly maximizes a stochastic v...
Jacob Goldberger, Sam T. Roweis, Geoffrey E. Hinto...
92
Voted
JMLR
2008
94views more  JMLR 2008»
14 years 11 months ago
Using Markov Blankets for Causal Structure Learning
We show how a generic feature selection algorithm returning strongly relevant variables can be turned into a causal structure learning algorithm. We prove this under the Faithfuln...
Jean-Philippe Pellet, André Elisseeff
DC
2008
14 years 11 months ago
Fast computation by population protocols with a leader
Fast algorithms are presented for performing computations in a probabilistic population model. This is a variant of the standard population protocol model--in which finite-state ag...
Dana Angluin, James Aspnes, David Eisenstat
INFOCOM
2002
IEEE
15 years 4 months ago
Restoration Algorithms for Virtual Private Networks in the Hose Model
—A Virtual Private Network (VPN) aims to emulate the services provided by a private network over the shared Internet. The endpoints of e connected using abstractions such as Virt...
Giuseppe F. Italiano, Rajeev Rastogi, Bülent ...