Algebraic geometric comparison of probability distributions

Journal of Machine Learning Research

Volumn 13, Issue , 2012, Pages 855-903

  Király, Franz J ^a,b   Von Bünau, Paul ^a   Meinecke, Frank C ^a   Blythe, Duncan A J ^a,c   Müller, Klaus Robert ^a,d  

^a TECHNISCHE UNIVERSITÄT BERLIN   (Germany)

^b FREIE UNIVERSITÄT BERLIN   (Germany)

^c BERNSTEIN CENTER FOR COMPUTATIONAL NEUROSCIENCE   (Germany)

^d Korea University   (South Korea)

Author keywords

Approximate algebra; Computational algebraic geometry; Unsupervised Learning

Indexed keywords

ALGEBRAIC GEOMETRY; ALGORITHMIC FRAMEWORK; COMPUTATIONAL ALGEBRAIC GEOMETRY; COMPUTATIONAL COSTS; CUMULANTS; IDENTIFIABILITY; OBJECTIVE FUNCTIONS; POLYNOMIAL RINGS;

ALGEBRA; COVARIANCE MATRIX; GEOMETRY; UNSUPERVISED LEARNING;

PROBABILITY DISTRIBUTIONS;

EID: 84859464784     PISSN: 15324435     EISSN: 15337928     Source Type: Journal    
DOI: None     Document Type: Review

References (34)

1. Shun'ichi Amari and Hiroshi Nagaoka. Methods of Information Geometry, volume 191 of Translations of mathematical monographs. American Mathematical Society, 2000. ISBN 9780821805312.
2. Duncan A. J. Blythe, Paul von Bünau, Frank C. Meinecke, and Klaus-Robert Müller. Feature extraction for change-point detection using stationary subspace analysis. IEEE Transactions on Neural Networks and Learning Systems, 23(4):631-643, 2012. doi: 10.1109/TNNLS.2012.2185811.
3. Massimo Caboara, Pasqualina Conti, and Carlo Traverse. Yet another ideal decomposition algorithm. In Teo Mora and Harold Mattson, editors, Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, volume 1255 of Lecture Notes in Computer Science, pages 39-54. Springer Berlin/Heidelberg, 1997. (Pubitemid 127088908)
4. Robert M. Corless, Patrizia M. Gianni, Barry M. Trager, and Steven M. Watt. The singular value decomposition for polynomial systems. Proc. ISSAC '95, pages 195-207, 1995.
5. David A. Cox, John Little, and Donal O'Shea. Ideals, Varieties, and Algorithms : An Introduction to Computational Algebraic Geometry and Commutative Algebra, 3/e (Undergraduate Texts in Mathematics). Springer-Verlag New York, Inc., Secaucus, NJ, USA, 2007. ISBN 0387356509.
6. Mathias Drton, Bernd Sturmfels, and Seth Sullivant. Lectures on Algebraic Statistics. Oberwolfach Seminars. Birkhauser Basel, 2010. ISBN 9783764389048.
7. David Eisenbud, Craig Huneke, and Wolmer Vasconcelos. Direct methods for primary decomposition. InventionesMathematicae, 110:207-235, 1992. ISSN 0020-9910.
8. Ronald A. Fisher. The use of multiple measurements in taxonomic problems. Annals Eugen., 7: 179-188, 1936.
9. Jerome H. Friedman and John W. Tukey. A projection pursuit algorithm for exploratory data analysis. Computers, IEEE Transactions on, C-23(9):881-890, 9 1974. ISSN 0018-9340. doi: 10.1109/T-C.1974.224051.
10. Ralf Fröberg and Joachim Hollman. Hilbert series for ideals generated by generic forms. Journal of Symbolic Computation, 17(2):149-157, 1994. ISSN 0747-7171. doi: DOI:10.1006/jsco.1994. 1008.
11. Patrizia Gianni, Barry Trager, and Gail Zacharias. Groebner bases and primary decomposition of polynomial ideals. Journal of Symbolic Computation, 6(2-3):149-167, 1988. ISSN 0747-7171. doi: DOI:10.1016/S0747-7171(88)80040-3.
12. Paolo Gibilisco, Eva Riccomagno, Maria Piera Rogantin, and Henry P. Wynn. Algebraic and Geometric Methods in Statistics. Cambridge University Press, 2010. ISBN 9780521896191.
13. Arthur Gretton, Karsten Borgwardt, Malte Rasch, Bernhard Schölkopf, and Alexander Smola. A kernel method for the two sample problem. In Advances in Neural Information Processing Systems 19, pages 513-520. MIT Press, 2007.
14. Satoshi Hara, Yoshinobu Kawahara, Takashi Washio, and Paul von Bünau. Stationary subspace analysis as a generalized eigenvalue problem. In Proceedings of the 17th international conference on Neural information processing: theory and algorithms-Volume Part I, ICONIP'10, pages 422-429, Berlin, Heidelberg, 2010. Springer-Verlag.
15. Daniel Heldt, Martin Kreuzer, Sebastian Pokutta, and Hennie Poulisse. Approximate computation of zero-dimensional polynomial ideals. Journal of Symbolic Computation, 44(11):1566-1591, 2009. ISSN 0747-7171. doi: DOI:10.1016/j.jsc.2008.11.010. In Memoriam Karin Gatermann.
16. Grete Hermann. Die Frage der endlich vielen Schritte in der Theorie der Polynomideale-unter Benutzung nachgelassener Sätze von K. Hentzelt. Mathematische Annalen, 95(1):736-788, 1926. ISSN 0747-7171. doi: DOI:10.1007/BF01206635.
17. Harold Hotelling. The generalization of student's ratio. Annals of Mathematical Statistics, 2(3): 360-378, 1932.
18. Anthony Iarrobino. Compressed algebras: Artin algebras having given socle degrees and maximal length. Transactions of the American Mathematical Society, 285(1):337-378, 1984.
19. Franz J. Király, Paul von Bünau, Frank Meinecke, Duncan Blythe, and Klaus-Robert Müller. Algebraic geometric comparison of probability distributions, 2011. Oberwolfach Preprint 2011-30.
20. Risi Kondor. The skew spectrum of functions on finite groups and their homogeneous spaces, 2007. Eprint arXiv:0712.4259.
21. Risi Kondor and Karsten M. Borgwardt. The skew spectrum of graphs. In Proceedings of the 25th international conference on Machine learning, ICML '08, pages 496-503, New York, NY, USA, 2008. ACM. ISBN 978-1-60558-205-4. doi: http://doi.acm.org/10.1145/1390156.1390219.
22. Martin Kreuzer, Hennie Poulisse, and Lorenzo Robbiano. Approximate Commutative Algebra, chapter From Oil Fields to Hilbert Schemes. Springer-Verlag Berlin Heidelberg, 2009.
23. Teresa Krick and Alessandro Logar. An algorithm for the computation of the radical of an ideal in the ring of polynomials. In Harold Mattson, Teo Mora, and T. Rao, editors, Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, volume 539 of Lecture Notes in Computer Science, pages 195-205. Springer Berlin/Heidelberg, 1991.
24. Santiago Laplagne. An algorithm for the computation of the radical of an ideal. In Proceedings of the 2006 international symposium on Symbolic and algebraic computation. ACM, 2006.
25. Frank C. Meinecke, Paul von Bünau, Motoaki Kawanabe, and Klaus-Robert Müller. Learning invariances with stationary subspace analysis. In Computer Vision Workshops (ICCV Workshops), 2009 IEEE 12th International Conference on, pages 87-92, 2009. doi: 10.1109/ICCVW.2009. 5457715.
26. Jan S. Müller, Paul von Bünau, Frank C. Meinecke, Frank J. Király, and Klaus-Robert Müller. The stationary subspace analysis toolbox. Journal of Machine Learning Research, 12:3065-3069, 2011.
27. Keith Pardue. Generic sequences of polynomials. Journal of Algebra, 324(4):579-590, 2010. ISSN 0021-8693. doi: DOI:10.1016/j.jalgebra.2010.04.018.
28. Hans J. Stetter. Numerical polynomial algebra. Society for Industrial and Applied Mathematics, 2004. ISBN 0898715571.
29. Bernd Sturmfels. Solving Systems of Polynomial Equations, volume 97 of CBMS Regional Conferences Series. Amer. Math. Soc., Providence, Rhode Island, 2002.
30. Kari Torkkola. Feature extraction by non parametric mutual information maximization. J. Mach. Learn. Res., 3:1415-1438, March 2003. ISSN 1532-4435. URL http://portal.acm.org/citation.cfm?id=944919.944981.
31. René Vidal, Yi Ma, and Sastry Shankar. Generalized principal component analysis (GPCA). IEEE Transactions on Pattern Analysis and Machine Intelligence, 27(12), 2005.
32. Paul von Bünau, Frank C. Meinecke, Franz J. Király, and Klaus-Robert Müller. Finding stationary subspaces in multivariate time series. Phys. Rev. Lett., 103(21):214101, Nov 2009. doi: 10.1103/PhysRevLett. 103.214101.
33. Paul von Bünau, Frank C. Meinecke, Simon Scholler, and Klaus-Robert Müller. Finding stationary brain sources in EEG data. In Proceedings of the 32nd Annual Conference of the IEEE EMBS, pages 2810-2813, 2010.
34. Sumio Watanabe. Algebraic Geometry and Statistical Learning Theory. Cambridge Monographs on Applied and Computational Mathematics. Cambridge University Press, United Kingdom, 2009. ISBN 9780521864671.