2010
DOI: 10.1007/978-1-4419-1570-2
|View full text |Cite
|
Sign up to set email alerts
|

Information Theoretic Learning

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
170
0

Year Published

2013
2013
2024
2024

Publication Types

Select...
4
3

Relationship

0
7

Authors

Journals

citations
Cited by 758 publications
(174 citation statements)
references
References 198 publications
0
170
0
Order By: Relevance
“…Notice the argument of the Gaussian kernel which considers all possible pairs of samples. The idea of regarding the samples as information particles was first introduced by Príncipe et al and collaborators [12], [13] upon realizing that these samples interact with each other through laws that resembled the potential fields and their associated forces in physics.…”
Section: Information Theoretic Learning (Itl)mentioning
confidence: 99%
See 3 more Smart Citations
“…Notice the argument of the Gaussian kernel which considers all possible pairs of samples. The idea of regarding the samples as information particles was first introduced by Príncipe et al and collaborators [12], [13] upon realizing that these samples interact with each other through laws that resembled the potential fields and their associated forces in physics.…”
Section: Information Theoretic Learning (Itl)mentioning
confidence: 99%
“…The information potential and force experienced by particle x i ∈ X due to all particles of dataset Y is shown in (12) where F (x i | y j ) is the "cross" information force exerted by particle y j on particle x i . Similarly, one can easily derive the potential and force experienced by y i ∈ Y due to all particles of dataset X by simply interchanging M ↔ N and x ↔ y in (12).…”
Section: Information Theoretic Learning (Itl)mentioning
confidence: 99%
See 2 more Smart Citations
“…One alternation is to derive methods that are adaptive to the unknown source distributions. The representatives of such class of methods are kernel density methods (Xue et al, 2008;Principe and Xu, 1999;Principe et al, 2000). Main disadvantage of the kernel density based ICA methods is their computational complexity that is O(T 2 N 2 ) where T represents number of samples.…”
Section: Wx S mentioning
confidence: 99%