Zoltan Szabo avatar Zoltan Szabo committed e9e40a2

minimum spanning tree, geodesic spanning forest: references updated (doc+comments); For the latter, see 'HRenyi_MST_estimation', 'HRenyi_GSF_estimation.m'.

Comments (0)

Files changed (5)

+-minimum spanning tree, geodesic spanning forest: reference updated (doc+comments); For the latter, see 'HRenyi_MST_estimation', 'HRenyi_GSF_estimation.m'.
 -A note on a built-in helping automatism of meta estimators: added (comments); see 'HTsallis_HRenyi_initialization.m', 'IRenyi_DRenyi_initialization.m', 'IRenyi_HRenyi_initialization.m', 'ITsallis_DTsallis_initialization.m'.
 -some 'co.mul=mult' -> 'co.mult=mult' typo corrected (to be precise, the computations were OK); see 'ITsallis_DTsallis_initialization.m', 'IShannon_HShannon_initialization.m', 'IRenyi_HRenyi_initialization.m', 'IRenyi_DRenyi_initialization.m', 'IL2_DL2_initialization.m', 'Icomplex_initialization.m', 'HRPensemble_initialization.m', 'Hensemble_initialization.m', 'Hcomplex_initialization.m'.
 
 
 Note: 
 
+- the evolution of the ITE code is briefly summarized in CHANGELOG.txt.
 - become a [Follower](https://bitbucket.org/szzoli/ite/follow) to be always up-to-date with ITE.
-- the evolution of the ITE code is briefly summarized in CHANGELOG.txt.
-- if you have an entropy, mutual information, divergence estimator/subtask solver/application idea with a GPLv3(>=)-compatible license that you would like to be embedded into ITE, feel free to contact me.
+- if you have an entropy, mutual information, divergence estimator/subtask solver with a GPLv3(>=)-compatible license that you would like to be embedded into ITE, feel free to contact me.
 

code/H_I_D/base_estimators/HRenyi_GSF_estimation.m

 %We make use of the naming convention 'H<name>_estimation', to ease embedding new entropy estimation methods.
 %
 %REFERENCE: 
-%   Barnabas Poczos, Andras Lorincz. Independent Subspace Analysis Using Geodesic Spanning Trees. ICML-2005, pages 673-680.
+%     Jose A. Costa, Alfred O. Hero. Geodesic entropic graphs for dimension and entropy estimation in manifold learning. IEEE Transactions on Signal Processing 52(8):2210-2221, 2004.
 %
 %Copyright (C) 2012 Zoltan Szabo ("http://nipg.inf.elte.hu/szzoli", "szzoli (at) cs (dot) elte (dot) hu")
 %

code/H_I_D/base_estimators/HRenyi_MST_estimation.m

 %We make use of the naming convention 'H<name>_estimation', to ease embedding new entropy estimation methods.
 %
 %REFERENCE: 
-%   Barnabas Poczos, Andras Lorincz: Independent Subspace Analysis Using Geodesic Spanning Trees. ICML-2005, pages 673-680. (application in ISA)
 %   Joseph E. Yukich. Probability Theory of Classical Euclidean Optimization Problems, Lecture Notes in Mathematics, 1998, vol. 1675.
 %
 %Copyright (C) 2012 Zoltan Szabo ("http://nipg.inf.elte.hu/szzoli", "szzoli (at) cs (dot) elte (dot) hu")
Add a comment to this file

doc/ITE_documentation.pdf

Binary file modified.

Tip: Filter by directory path e.g. /media app.js to search for public/media/app.js.
Tip: Use camelCasing e.g. ProjME to search for ProjectModifiedEvent.java.
Tip: Filter by extension type e.g. /repo .js to search for all .js files in the /repo directory.
Tip: Separate your search with spaces e.g. /ssh pom.xml to search for src/ssh/pom.xml.
Tip: Use ↑ and ↓ arrow keys to navigate and return to view the file.
Tip: You can also navigate files with Ctrl+j (next) and Ctrl+k (previous) and view the file with Ctrl+o.
Tip: You can also navigate files with Alt+j (next) and Alt+k (previous) and view the file with Alt+o.