Abstract
The main motivation of this paper is to propose a method to extract the structure information from the output data and find the input data manifold that best represents that output structure. A graph similarity viewpoint is used to build up a clustering algorithm that tries to find out different linear models in a regression framework. The main novelty of the algorithm is related with using the structured information of the output data, to find out several input models that best represent that structure. This novelty is base on the intuition that similar structures in the output must share a common model. Finally, the proposed method is applied to a real remote sensing retrieval problem where we want to recover the physical parameters from a spectrum of energy.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Bach, F., Jordan, M.: Learning spectral clustering. In: Advances in Neural Information Processing Systems (NIPS), pp. 305–312 (2004)
Cai, D., He, X., Han, J.: Srda: An efficient algorithm for large-scale discriminant analysis. IEEE Transactions on Knowledge and Data Engineering 20(1) (2008)
Ding, C.: A tutorial on spectral clustering. In: Talk presented at ICML (2004), http://ranger.uta.edu/~chqding/Spectral/
Ester, M., Kriegel, H.-P., Sander, J., Xu, X.: A density-based algorithm for discovering clusters in large spatial databases with noise. In: KDD (1996)
Fukunaga, K.: Introduction to Statistical Pattern Recognition. Academic Press, New York (1990)
Goody, R.M., Yung, Y.: Atmospheric Radiation. Theoretical basis, ch. 2
Jollife, I.T.: Principal Component Analysis, ch. 8, 2nd edn. Springer Series in Statistics. Springer, New York (2002)
Lu, G., Yan, Y., Colechin, M.: A digital imaging based multifuncional flame monitoring system. IEEE T. Instrum. Meas. 53
Mohar, B.: Some applications of laplace eigenvalues of graphs. In: Graph Symmetry: Algebraic Methods and Applications, NATO, pp. 225–275 (1997)
Mohar, B.: The laplacian spectrum of graphs. Graph theory, combinatorics, and applications 2, 871–898 (2001)
Rothman, L.S., et al.: The hitran molecular spectroscopic database: edition of 2000 including updates through 2001. J. Quant. Spectrosc. Radiat. Transfer (2003)
Schölkopf, B., Smola, A.: Learning with Kernels: Support vector machines, regularization, optimization, and beyond. MIT Press, Cambridge (2002)
Song, L., Smola, A., Gretton, A., Borgwardt, K.M.: A dependence maximization view of clustering. In: Proceedings of ICML 2007, vol. 227, pp. 815–822 (2007)
Turk, M., Pentland, A.: Face recognition using eigenfaces. In: IEEE Conference on Computer Vision and Pattern Recognition (1991)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Garcia-Cuesta, E., Galvan, I.M., de Castro, A.J. (2009). Discriminant Regression Analysis to Find Homogeneous Structures. In: Corchado, E., Yin, H. (eds) Intelligent Data Engineering and Automated Learning - IDEAL 2009. IDEAL 2009. Lecture Notes in Computer Science, vol 5788. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04394-9_24
Download citation
DOI: https://doi.org/10.1007/978-3-642-04394-9_24
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-04393-2
Online ISBN: 978-3-642-04394-9
eBook Packages: Computer ScienceComputer Science (R0)