ICA Using Spacings Estimates of Entropy
By Eric Learned-Miller, John W. Fisher III. Journal of machine learning research, 2003
299 citations recorded by the source corpus.
View Paper: https://www.semanticscholar.org/paper/c8702cef49d12af66dcd3b3bc2f20b488d96f6e6
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
- Barnab'as P'oczos
- Yoshua Bengio
- Dacheng Tao
- Sergey Levine
- Ruslan Salakhutdinov
- Siwei Lyu
- Quoc V. Le
- Trevor Darrell
Citations in the corpus
- Measure Transformed Independent Component Analysis (2013, methodology): “Data-based techniques (Bell and Sejnowski, 1995; Hyvärinen and Oja, 1997; Lee et al., 1999; Bach and Jordan, 2002; Learned-Miller and Fisher, 2003; Boscolo et al., 2004; Koldovsky et al., 2006; Shen et al., 2009; Li and Adalı, 2010) involve successive linear transformations that are applied to the d”
- Estimation of Renyi Entropy and Mutual Information Based on Generalized Nearest-Neighbor Graphs (2010, methodology): “Both entropy estimators and mutual information estimators have been used for independent component and subspace analysis (Learned-Miller and Fisher, 2003; Póczos and Lőrincz, 2005; Hulle, 2008; Szabó et al., 2007), and image registration (Kybic, 2006; Hero et al.”
- Empirical estimation of entropy functionals with confidence (2010, methodology): “to independent component analysis in signal processing [32].”
- Measuring Statistical Dependence with Hilbert-Schmidt Norms (2005, methodology): “11 The results presented here for the KCC and KGV also improve on those in [16, 3] since they include a polishing step for the KCC and KGV, which was not carried out in these earlier studies.”
- Iterative Gaussianization: From ICA to Random Rotations (2011, unknown): “7]. Since the core of these methods is looking for meaningful projections (usually ICA algorithms), they suffer from a big computational complexity: for example, robust ICA algorithms such as RADICAL [28] would lead to extremely slow Guassanization algorithms whereas relatively more convenient alter”
- Data driven image models through continuous joint alignment (2006, background): “These entropy estimators are discussed at length elsewhere [12].”
- Nonlinear Extraction of Independent Components of Natural Images Using Radial Gaussianization (2009, methodology): “While some ICA algorithms optimize this objective directly ( Learned-Miller & Fisher, 2000 ), most choose instead to optimize”
- Multi-subject Independent Component Analysis of fMRI: A Decade of Intrinsic Networks, Default Mode, and Neurodiagnostic Discovery (2012, unknown): “Robust, accurate , direct ICA algorithm (RADICAL) [28] is a nonparametric ICA algorithm using estimates of entropy based on spacings.”
- Fast Multidimensional Entropy Estimation by $k$-d Partitioning (2009, background): “Indeed, in one dimension this approach leads to estimators such as the " -spacing " estimator of [10] (see also [11]).”
- Efficient multivariate entropy estimation via $k$-nearest neighbour distances (2016, methodology): “…entropy that is of primary interest, for instance in goodness-of-fit tests of normality (Vasicek, 1976) or uniformity (Cressie, 1976), tests of independence (Goria et al., 2005), independent component analysis (Miller and Fisher, 2003) and feature selection in classification (Kwak and Choi, 2002).”