Skip to main content
Fachgebiete
Automobil + Motoren Bauwesen + Immobilien Business IT + Informatik Elektrotechnik + Elektronik Energie + Nachhaltigkeit Finance + Banking Management + Führung Marketing + Vertrieb Maschinenbau + Werkstoffe Versicherung + Risiko
DE
EN
Bücher
Zeitschriften
Themenseiten
Organisationspsychologie Projektmanagement Marketing Smart Manufacturing
Weitere Formate
Podcasts Webinare Technik Webinare Wirtschaft Kongresse Veranstaltungskalender Awards
Jetzt Einzelzugang starten
Zugang für Unternehmen
Referenzkunden
SLX-Digitalkonferenz: Zukunftswerkstatt 2024

Mehr Umsatz mit Top-Kontakten

Am 7. Mai erfahren Sie, wie Vertriebsteams Leadgenerierung, Leadnurturing und Leadstrategien effizient steuern können.
Erweiterte Suche
Anmelden
nach oben
Erschienen in:
Buchtitelbild

2017 | OriginalPaper | Buchkapitel

1. Introduction

verfasst von : Xiangyu Kong, Changhua Hu, Zhansheng Duan

Erschienen in: Principal Component Analysis Networks and Algorithms

Verlag: Springer Singapore

Einloggen

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

Pattern recognition and data compression are two applications that rely critically on efficient data representation.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Jetzt informieren

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Jetzt informieren

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Jetzt informieren
Nächstes Kapitel Matrix Analysis Basics
Literatur
1.
Diamantaras, K. I., & Kung, S. Y. (1996). Principal component neural networks: Theory and application. Wiley, INC.
2.
Zhang, Q., & Leung, Y.-W. (2000). A class of learning algorithms for principal component analysis and minor component analysis. IEEE Transactions on Neural Network, 11(1), 200–204.CrossRef
3.
Washizawa, Y. (2010). Feature extraction using constrained approximation and suppression. IEEE Transactions on Neural Network, 21(2), 201–210.CrossRef
4.
Cirrincione, G., Cirrincione, M., Herault, J., & Huffel, S. V. (2002). The MCA EXIN neuron for the minor component analysis. IEEE Transactions on Neural Network, 13(1), 160–187.CrossRef
5.
Yang, B. (1995). Projection approximation subspace tracking. IEEE Transactions on Signal Processing, 43(1), 95–107.CrossRef
6.
Comon, P., & Golub, G. H. (1990). Tracking a few extreme singular values and vectors in signal processing. In Processing of the IEEE (pp. 1327–1343).
7.
Owsley, N. L. (1978). Adaptive data orthogonalization. In Proceedings of IEEE ICASSP (pp. 100–112).
8.
Tufts, D. W., & Melissinos, C. D. (1986). Simple, effective computation of principal eigenvectors and their eigenvalues and applications to high-resolution estimation of frequencies. IEEE Transactions on Acoustic, Speech and Signal Processing, ASSP-34, 1046–1053.
9.
Shaman, K. C. (1986). Adaptive algorithms for estimating the complete covariance eigenstructure. In Proceedings of IEEE ICASSP (Tokyo, Japan) (pp. 1401–1404).
10.
Moonen, M., Van Dooren, P., & Vandewalle, J. (1989). Updating singular value decompositions: A parallel implementation. In PWC. SPlE 4dv. Algorithms Arthitectures Signal Processing (San Diego, CA) (pp. 80–91).
11.
Bunch, J. R., Nielsen, C. P., & Sorenson, D. (1978). Rank-one modification of the symmetric eigenproblem. Numerical Mathematics, 31, 31–48.MathSciNetCrossRefMATH
12.
Karasalo, I. (1986). Estimating the covariance matrix by signal subspace averaging. IEEE Transactions on Acoustic Speech and Signal Processing, ASSP-34, 8–12.
13.
DeGroat, R. D. (1992). Noniterative subspace tracking. IEEE Transactions on Signal Processing, 40(3), 571–577.CrossRef
14.
Thompson, P. A. (1980). An adaptive spectral analysis technique for unbiased frequency estimation in the presence of white noise. In Proceeding 13th Asilnmur Conj:Circuit System. Computation (pp. 529–533).
15.
Oja, E. (1982). A simplified neuron model as a principal component analyzer. Journal of Mathematical Biology, 15(3), 267–273.MathSciNetCrossRefMATH
16.
Karhunen, J., & Oja, E. (1982). New methods for stochastic approximation of truncated Karhunen-LoCve expansions. In Prw. 6th International Conference: Putt. Recop. (5Xk553).
17.
Karhunen, J. (1984). Adaptive algorithms for estimating eigenvectors of correlation type matrices. In Proceedings of IEEE ICASSP (San Diego, CA) (pp. 14.6.1–14.6.3).
18.
Yang, J., & Kaveh, M. (1988). Adaptive eigensubspace algorithms for direction or frequency estimation and tracking. IEEE Transactions on Acoustic, Speech and Signal Processing, 36(2), 241–251.CrossRef
19.
Kung, S. Y. (1993). Digital neural processing. Englewood Cliffs, NJ: Prentice Hall.MATH
20.
Reddy, V. U., Egardt, B., & Kailath, T. (1982). Least squares type algorithm for adaptive implementation of Pisarenko’s harmonic retrieval method. IEEE Transactions on Acoustic Speech and Signal processing, 30(3), 399–405.CrossRef
21.
Bannour, S., & Azimi-Sadjadi, M. R. (1992). An adaptive approach for optimal data reduction using recursive least squares learning method. In Pwc. IEEE ICASSP (San Francisco, CA) (pp. 11297–11300).
22.
Yang, X., Sarkar, T. K., & Arvas, E. (1989). A survey of conjugate gradient algorithms for solution of extreme eigen-problems of a symmetric matrix. IEEE Transactions on Acoustic, Speech and Signal Processing, 37(10), 1550–1556.MathSciNetCrossRefMATH
23.
Stewart, G. W. (1992). An updating algorithm for subspace tracking. IEEE Transactions on Signal Processing, 40(6), 1535–1541.CrossRef
24.
Bischof, C. H., & Shroff, G. M. (1992). On updating signal subspaces. IEEE Transactions on Signal Processing, 40(1), 96–105.CrossRef
25.
Bannour, S., & Azimi-Sadjadi, R. (1995). Principal component extraction using recursive least squares learning. IEEE Transactions on Neural Networks, 6(2), 457–469.CrossRef
26.
Cichocki, A., Kasprzak, W., & Skarbek, W. (1996). Adaptive learning algorithm for principal component analysis with partial data. Cybernetic Systems, 2, 1014–1019.CrossRef
27.
Kung, S. Y., Diamantaras, K., & Taur, J. (1994). Adaptive principal component extraction (APEX) and applications. IEEE Transactions on Signal Processing, 42(5), 1202–1217.CrossRef
28.
Möller, R., & Könies, A. (2004). Coupled principal component analysis. IEEE Transactions on Neural Networks, 15(1), 214–222.CrossRef
29.
Ouyang, S., Bao, Z., & Liao, G. S. (2000). Robust recursive least squares learning algorithm for principal component analysis. IEEE Transactions on Neural Networks, 11(1), 215–221.CrossRef
30.
Sanger, T. D. (1989). Optimal unsupervised learning in a single-layer linear feedforward neural network. Neural Networks, 2(6), 459–473.CrossRef
31.
Xu, L. (1993). Least mean square error reconstruction principle for selforganizing neural-nets. Neural Netwoks, 6(5), 627–648.CrossRef
32.
Xu, L., Oja, E., & Suen, C. (1992). Modified Hebbian learning for curve and surface fitting. Neural Networks, 5, 441–457.CrossRef
33.
Oja, E. (1992). Principal component, minor component and linear neural networks. Neural Networks, 5(6), 927–935.CrossRef
34.
Feng, D. Z., Bao, Z., & Jiao, L. C. (1998). Total least mean squares algorithm. IEEE Transactions on Signal Processing, 46(6), 2122–2130.CrossRef
35.
Feng, D. Z., Zheng, W. X., & Jia, Y. (2005). Neural network learning algorithms for tracking minor subspace in high-dimensional data stream. IEEE Transactions on Neural Networks, 16(3), 513–521.CrossRef
36.
Luo, F. L., & Unbehauen, R. (1997). A minor subspace analysis algorithm. IEEE Transactions on Neural Networks, 8(5), 1149–1155.CrossRef
37.
Ouyang, S., Bao, Z., Liao, G. S., & Ching, P. C. (2001). Adaptive minor component extraction with modular structure. IEEE Transactions on Signal Processing, 49(9), 2127–2137.CrossRef
38.
Zhang, Q., & Leung, Y.-W. (2000). A class of learning algorithms for principal component analysis and minor component analysis. IEEE Transactions on Neural Networks, 11(2), 529–533.CrossRef
39.
Möller, R. (2004). A self-stabilizing learning rule for minor component analysis. International Journal of Neural Systems, 14(1), 1–8.CrossRef
40.
Douglas, S. C., Kung, S. Y., & Amari, S. (2002). A self-stabilized minor subspace rule. IEEE Signal Processing Letter, 5(12), 1342–1352.
41.
Oja, E. (1989). Neural networks, principal components, and subspaces. International Journal of Neural Systems, 1(1), 61–68.CrossRef
42.
Williams R. J.(1985). Feature discovery through error-correction learning. Institute of Cognition Science, University of California, San Diego, Technical Report. 8501.
43.
Baldi, P. (1989). Linear learning: Landscapes and algorithms. In D. S. Touretzky (Ed.), Advances in neural information processing systems 1. San Mateo, CA: Morgan Kaufmann.
44.
Miao, Y. F., & Hua, Y. B. (1998). Fast subspace tracking and neural network learning by a novel information criterion. IEEE Transactions on Signal Processing, 46(7), 1967–1979.CrossRef
45.
Fu, Z., & Dowling, E. M. (1995). Conjugate gradient eigenstructure tracking for adaptive spectral estimation. IEEE Transactions on Signal Processing, 43(5), 1151–1160.CrossRef
46.
Mathew, G., Reddy, V. U., & Dasgupta, S. (1995). Adaptive estimation of eigensubspace. IEEE Transactions on Signal Processing, 43(2), 401–411.CrossRef
47.
Chiang, C. T., & Chen, Y. H. (1999). On the inflation method in adaptive noise subspace estimator. IEEE Transactions on Signal Processing, 47(4), 1125–1129.CrossRef
48.
Nguyen, T. D., & Yamada, I. (2013). Adaptive normalized quasi-newton algorithms for extraction of generalized eigen-pairs and their convergence analysis. IEEE Transactions on Signal Processing, 61(6), 1404–1418.MathSciNetCrossRef
49.
Chatterjee, C., Roychowdhury, V., Ramos, P. J., & Zoltowski, M. D. (1997). Self-organizing algorithms for generalized eigen-decomposition. IEEE Transactions on Neural Networks, 8(6), 1518–1530.CrossRef
50.
Xu, D. X., Principe, J. C., & Wu, H. C. (1998). Generalized eigendecomposition with an on-line local algorithm. IEEE Signal Processing Letter, 5(11), 298–301.CrossRef
51.
Rao, Y. N., Principe, J. C., & Wong, T. F. (2004). Fast RLS-like algorithm for generalized eigendecomposition and its applications. Journal of VLSI Signal Processing, 37(2–3), 333–344.CrossRefMATH
52.
Wong, T. F., Lok, T. M., Lehnert, J. S., & Zoltowski, M. D. (1998). A linear receiver for direct-sequence spread-spectrum multiple-access systems with antenna arrays and blind adaptation. IEEE Transactions on Information Theory, 44(2), 659–676.MathSciNetCrossRefMATH
53.
Strobach, P. (1998). Fast orthogonal iteration adaptive algorithms for the generalized symmetric eigenproblem. IEEE Transactions on Signal Processing, 46(12), 3345–3359.MathSciNetCrossRefMATH
54.
Yang, J., Xi, H. S., Yang, F., & Zhao, Y. (2006). RLS-based adaptive algorithms for generalized eigen-decomposition. IEEE Transactions on Signal Processing, 54(4), 1177–1188.CrossRef
55.
Tanaka, T. (2009). Fast generalized eigenvector tracking based on the power method. IEEE Signal Processing Letter, 16(11), 969–972.CrossRef
56.
Attallah, S., & Abed-Meraim, K. (2008). A fast adaptive algorithm for the generalized symmetric eigenvalue problem. IEEE Signal Processing Letter, 15, 797–800.CrossRef
57.
Chen, T. P., & Amari, S. (2001). Unified stabilization approach to principal and minor components extraction algorithms. Neural Networks, 14(10), 1377–1387.CrossRef
58.
Hasan, M. A. (2007). Self-normalizing dual systems for minor and principal component extraction. In Proceedings of ICASSP 2007 IEEE International Conference on Acoustic, Speech and Signal Processing (15–20, Vol. 4, pp. IV-885–IV-888).
59.
Peng, D. Z., Zhang, Y., & Xiang, Y. (2009). A unified learning algorithm to extract principal and minor components. Digit Signal Processing, 19(4), 640–649.CrossRef
60.
Manton, J. H., Helmke, U., & Mareels, I. M. Y. (2005). A dual purpose principal and minor component flow. Systems Control Letter, 54(8), 759–769.MathSciNetCrossRefMATH
61.
Chen, T., Amari, S. I., & Lin, Q. (1998). A unified algorithm for principal and minor component extraction. Neural Networks, 11(3), 365–369.CrossRef
62.
Peng, D. Z., & Zhang, Y. (2007). Dynamics of generalized PCA and MCA learning algorithms. IEEE Transactions on Neural Networks, 18(6), 1777–1784.CrossRef
63.
Kong, X. Y., Hu, C. H., & Han, C. Z. (2012). A dual purpose principal and minor subspace gradient flow. IEEE Transactions on Signal Processing, 60(1), 197–210.MathSciNetCrossRef
64.
Kong, X. Y., Hu, C. H., Ma, H. G., & Han, C. Z. (2012). A unified self-stabilizing neural network algorithm for principal and minor components extraction. IEEE Transactions on Neural Networks and Learning Systems, 23(2), 185–198.CrossRef
65.
Ferali, W., & Proakis J. G. (1990). Adaptive SVD algorithm for covariance matrix eigenstructure computation. In Proceedings of IEEE International Conference on Acoustic, Speech, Signal Processing (pp. 176–179).
66.
Cichocki, A. (1992). Neural network for singular value decomposition. Electronic Letter, 28(8), 784–786.CrossRef
67.
Diamantaras, K. I., & Kung, S. Y. (1994). Cross-correlation neural network models. IEEE Transactions on Signal Processing, 42(11), 3218–3223.CrossRef
68.
Feng, D. Z., Bao, Z., & Zhang, X. D. (2001). A cross-associative neural network for SVD of nonsquared data matrix in signal processing. IEEE Transactions on Neural Networks, 12(9), 1215–1221.CrossRef
69.
Feng, D. Z., Zhang, X. D., & Bao, Z. (2004). A neural network learning for adaptively extracting cross-correlation features between two high-dimensional data streams. IEEE Transactions on Neural Networks, 15(6), 1541–1554.CrossRef
70.
Kong, X. Y., Ma, H. G., An, Q. S., & Zhang, Q. (2015). An effective neural learning algorithm for extracting cross-correlation feature between two high-dimensional data streams. Neural Processing Letter, 42(2), 459–477.CrossRef
71.
Zhang, X. D. (2004) Matrix analysis and applications, Tsinghua University Press, Beijing.
72.
Bradbury, W. W., & Fletcher, R. (1966). New iterative methods for solutions of the eigenproblem. Numerical Mathematics, 9(9), 259–266.MathSciNetCrossRefMATH
73.
Sarkar, T. K., Dianat, S. A., Chen, H., & Brule, J. D. (1986). Adaptive spectral estimation by the conjugate gradient method. IEEE Transactions on Acoustic, Speech, and Signal Processing, 34(2), 272–284.CrossRef
74.
Golub, G. H., & Van Load, C. F. (1989). Matrix computation (2nd ed.). Baltimore: The John Hopkins University Press.
75.
76.
Bunch, J. R., Nielsen, C. P., & Sorensen, D. C. (1978). Rank-one modification of the symmetric eigenproblem. Numerical Mathematics, 31(1), 31–48.MathSciNetCrossRefMATH
77.
78.
Schereiber, R. (1986). Implementation of adaptive array algorithms. IEEE Transactions on Acoustic, Speech, and Signal Processing, 34(5), 1038–1045.CrossRef
79.
Karasalo, I. (1986). Estimating the covariance matrix by signal subspace averaging. IEEE Transactions on Acoustic, Speech, and Signal Processing, 34(1), 8–12.MathSciNetCrossRef
80.
DeGroat, R. D., & Roberts, R. A. (1990). Efficient, numerically stabilized rank-one eigenstructure updating. IEEE Transactions on Acoustic, Speech, and Signal Processing, 38(2), 301–316.CrossRef
81.
Yu, K. B. (1991). Recursive updating the eigenvalue decomposition of a covariance matrix. IEEE Transactions on Signal Processing, 39(5), 1136–1145.MathSciNetCrossRef
82.
Stewart, G. W. (1992). An updating algorithm for subspace tracking. IEEE Transactions on Signal Processing, 40(6), 1135–1541.CrossRef
83.
Bischof, C. H., & Shroff, G. M. (1992). On updating signal subspace. IEEE Transactions on Signal Processing, 40(1), 96–105.CrossRef
84.
Champagne, B. (1994). Adaptive eigendecomposition of data covariance matrices based on first-order perturbations. IEEE Transactions on Signal Processing, 42(10), 2758–2770.CrossRef
85.
Fuhrmann, D. R. (1988). An algorithm for subspace computation with applications in signal processing. SIAM Journal of Matrix Analysis and Applications, 9(2), 213–220.MathSciNetCrossRefMATH
86.
Xu, G., Cho, Y., & Kailath, T. (1994). Application of fast subspace decomposition to signal processing and communication problems. IEEE Transactions on Signal Processing, 42(6), 1453–1461.CrossRef
87.
Xu, G., & Kailath, T. (1994). Fast subspace decomposition. IEEE Transactions on Signal Processing, 42(3), 539–551.CrossRef
88.
Moonen, M., Dooren, P. V., & Vandewalle, J. (1992). A singular value decomposition updating algorithm for subspace tracking. SIAM Journal of Matrix Analysis and Applications, 13(4), 1015–1038.MathSciNetCrossRefMATH
Metadaten
Titel
Introduction
verfasst von
Xiangyu Kong
Changhua Hu
Zhansheng Duan
Copyright-Jahr
2017
Verlag
Springer Singapore
Buch
Principal Component Analysis Networks and Algorithms

Print ISBN: 978-981-10-2913-4

Electronic ISBN: 978-981-10-2915-8

Copyright-Jahr: 2017

DOI
https://doi.org/10.1007/978-981-10-2915-8_1