Regression for sets of polynomial equations

Journal of Machine Learning Research

Volumn 22, Issue , 2012, Pages 628-637

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

^a TECHNISCHE UNIVERSITÄT BERLIN   (Germany)

^b FREIE UNIVERSITÄT BERLIN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTATIONAL GEOMETRY; OPTIMIZATION; REGRESSION ANALYSIS; SOURCE SEPARATION;

ARBITRARY SYSTEMS; COMPUTATIONAL ALGEBRAIC GEOMETRY; CONSISTENT ESTIMATORS; NUMERICAL OPTIMIZATIONS; POLYNOMIAL EQUATION; SEPARATION PROBLEMS; SUBSPACE ANALYSIS; SYSTEM OF POLYNOMIAL EQUATIONS;

POLYNOMIALS;

EID: 84918835489     PISSN: 15324435     EISSN: 15337928     Source Type: Journal    
DOI: None     Document Type: Conference Paper

References (26)

1. Shun'ichi Amari and Hiroshi Nagaoka. Methods of Information Geometry, volume 191 of Translations of mathematical monographs. American Mathematical Society, 2000.
2. D.A.J. Blythe, P. von Bünau, F.C Meinecke, and K.R. Müller. Feature extraction for high dimensional change point detection using stationary subspace analysis. Online Pre-Print (Submitted to IEEE Transactions on Neural Networks), 2011. arXiv: 1108.2486.
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.
4. R.M. Corless, Patrizia M. Gianni, Barry M. Trager, and S.M. Watt. The singular value decomposition for polynomial systems. Proc. ISSAC '95, pages 195-207, 1995.
5. Mathias Drton, Bernd Sturmfels, and Seth Sullivant. Lectures on Algebraic Statistics. Oberwolfach Seminars. Birkhauser Basel, 2010.
6. David Eisenbud, Craig Huneke, and Wolmer Vasconcelos. Direct methods for primary decomposition. Inventiones Mathematicae, 110: 207-235, 1992.
7. Ralf Fröberg and Joachim Hollman. Hilbert series for ideals generated by generic forms. Journal of Symbolic Computation, 17 (2): 149-157, 1994.
8. 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.
9. Paolo Gibilisco, Eva Riccomagno, Maria Piera Rogantin, and Henry P. Wynn. Algebraic and Geometric Methods in Statistics. Cambridge University Press, 2010.
10. 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.
11. Daniel Heldt, Martin Kreuzer, Sebastian Pokutta, and Hennie Poulisse. Approximate computation of zerodimensional polynomial ideals. Journal of Symbolic Computation, 44 (11): 1566-1591, 2009. In Memoriam Karin Gatermann.
12. Motoaki Kawanabe, Wojciech Samek, Paul von Bünau, and Frank Meinecke. An information geometrical view of stationary subspace analysis. In Artificial Neural Networks and Machine Learning -ICANN 2011, volume 6792 of Lecture Notes in Computer Science, pages 397-404. Springer Berlin / Heidelberg, 2011.
13. Risi Kondor. The skew spectrum of functions on finite groups and their homogeneous spaces, 2007. Eprint arXiv: 0712.4259.
14. 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.
15. Martin Kreuzer, Hennie Poulisse, and Lorenzo Robbiano. Approximate Commutative Algebra, chapter From Oil Fields to Hilbert Schemes. Springer-Verlag Berlin Heidelberg, 2009.
16. 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.
17. 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.
18. 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.
19. J.S. Müller, P. von Bünau, F.C. Meinecke, F.J. Király, and Klaus-Robert Müller. The stationary subspace analysis toolbox. Journal of Machine Learning Research, 12: 3065-3069, 2011.
20. Hans J. Stetter. Numerical polynomial algebra. Society for Industrial and Applied Mathematics, 2004.
21. Bernd Sturmfels. Solving Systems of Polynomial Equations, volume 97 of CBMS Regional Conferences Series. Amer. Math. Soc., Providence, Rhode Island, 2002.
22. René Vidal, Yi Ma, and Sastry Shankar. Generalized principal component analysis (GPCA). IEEE Transactions on Pattern Analysis and Machine Intelligence, 27 (12), 2005.
23. 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.
24. Paul von Bünau, Frank C. Meinecke, Jan S. Müller, Steven Lemm, and Klaus-Robert Müller. Boosting high-dimensional change point detection with stationary subspace analysis. In Workshop on Temporal Segmentation at NIPS 2009. 2009.
25. 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.
26. Sumio Watanabe. Algebraic Geometry and Statistical Learning Theory. Cambridge Monographs on Applied and Computational Mathematics. Cambridge University Press, United Kingdom, 2009.