12.07.2015 Views

Jolliffe I. Principal Component Analysis (2ed., Springer, 2002)(518s)

Jolliffe I. Principal Component Analysis (2ed., Springer, 2002)(518s)

Jolliffe I. Principal Component Analysis (2ed., Springer, 2002)(518s)

SHOW MORE
SHOW LESS
  • No tags were found...

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

414 Appendix A. Computation of <strong>Principal</strong> <strong>Component</strong>sNeural network algorithms are feasible for larger data sets than batchmethods because they are better able to take advantage of developmentsin computer architecture. DK96, Chapter 8, discuss the potential for exploitingparallel VSLI (very large scale integration) systems, where themost appropriate algorithms may be different from those for non-parallelsystems (DK96, Section 3.5.5). They discuss both digital and analogueimplementations and their pros and cons (DK96, Section 8.3). Classicaleigenvector-based algorithms are not easily parallelizable, whereas neuralnetwork algorithms are (DK96 pp. 205–207).

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!