*[ABB]* O. Alter, P.O. Brown, D. Botstein, “Singular value
decomposition for genome-wide expression data processing and
modeling,” *Proceedings of the National Academy of Sciences*,
**97** (18), August 2000, pp. 10101–10106. PDF

*[ABE]* N. Amenta, M. Bern, D. Eppstein, “The crust and
the β-skeleton: Combinatorial curve reconstruction,”
*Graphical Models and Image Processing*, **60/2** (2), March 1998,
pp. 125–135. PDF

*[ABET]* N. Amenta, M. Bern, D. Eppstein, S.-H. Teng,
“Regression depth and center points,” *Discrete and
Computational Geometry*, **23** (3), April 2000, pp. 305–323.
PDF

*[BIH]* C.A.L. Bailer-Jones, M. Irwin, T. von Hippel,
“Automated classification of stellar spectra II: two-dimensional
classification with neural networks and principal components
analysis,” *Monthly Notices of the Royal Astronomical Society*,
**298** (2), August 1998, pp. 361–377. PDF

*[BW]* G.E.P. Box, “Sampling and Bayes’ inference in
scientific modelling and robustness,” *Journal of the Royal
Statistical Society*, Series A, **143** (4), 1980, pp. 383–430.
PDF

*[BE]* M. Bern, D. Eppstein, P.K. Agarwal, N. Amenta, P. Chew,
T. Dey, D.P. Dobkin, H. Edelsbrunner, C. Grimm, L.J. Guibas, J. Harer, J.
Hass, A. Hicks, C.K. Johnson, G. Lerman, D. Letscher, P. Plassmann, E.
Sedgwick, J. Snoeyink, J. Weeks, C. Yap, D. Zorin, “Emerging
challenges in computational topology,” *NSF Workshop on
Computational Topology*, June 11–12, 1999, Miami Beach, FL. PDF

*[BSW]* C.M. Bishop, M. Svensén, C.K.I. Williams,
“GTM: the generative topographic mapping,” *Neural
Computation*, **10** (1), January 1998, pp. 215–234. PDF

*[BMG]* E. Bizzi, F.A. Mussa-Ivaldi, S. Giszter,
“Computations underlying the execution of movement: A biological
perspective,” *Science*, **253** (5017), July 1991, pp.
287–291. PDF

*[BC]* G.E.P. Box, D.R. Cox, “An analysis of
transformations,” *Journal of the Royal Statistical Society*,
Series B, **26** (2), 1964, pp. 211–252. PDF

*[Da]* E.R. Davidson, “Iterative calculation of a few of
the lowest eigenvalues and corresponding eigenvectors of large
real-symmetric matrices,” *Journal of Computational Physics*,
**17** (1), 1975, pp. 87–94. PDF

*[DE]* C.J.A. Delfinado, H. Edelsbrunner, “An incremental
algorithm for Betti numbers of simplicial complexes on the
3-sphere,” *Computer Aided Geometric Design*, **12**, 1995,
pp. 771–784. PDF

*[DG]* T.K. Dey, S. Guha, “Computing homology groups of
simplicial complexes in **R**^{3},” *Journal of the
ACM*, **45** (2), March 1998, pp. 266–287. PDF

*[Di]* P. Diaconis, “Recent progress on de Finetti's
notions of exchangeability,” pp. 111–125 in *[BS3]*.

*[DW]* R. Durbin, D. Willshaw, “An analogue approach to
the travelling salesman problem using an elastic net method,”
*Nature*, **326** (6114), 22 April 1987, pp. 689–691.
PDF

*[Ed]* H. Edelsbrunner, “Shape reconstruction with
Delaunay complex,” pp. 119–132 in *[LNCS1380]*. PDF

*[EdM]* H. Edelsbrunner, E.P. Mücke,
“Three-dimensional alpha shapes,” *ACM Transactions on
Graphics*, **13** (1), January 1994, pp. 43–72. PDF

*[EdS]* H. Edelsbrunner, N.R. Shah, “Triangulating
topological spaces,” Tenth Annual ACM Symposium on Computational
Geometry, *International Journal of Computational Geometry and
Applications*, **7** (4), August 1997, pp. 365–378. PDF

*[Ep]* D. Eppstein, “Clustering for faster network
simplex pivots,” *Networks*, **35** (3), 2000, pp.
173–180. PDF

*[F]* J. Friedman, “Computing Betti numbers via
combinatorial Laplacians,” *Algorithmica*, **21** (4), 1998,
pp. 331–346. PDF

*[FR]* J.H. Friedman, L.C. Rafsky, “Graph theoretic
measures of multivariate association and prediction,” *Annals of
Statistics*, **11** (2), 1983, pp. 377–391. PDF

*[HS]* T. Hastie, W. Stuetzle, “Principal Curves,”
*Journal of the American Statistical Association*, **84** (406),
June 1989, pp. 502–516. PDF

*[He]* R. Hecht-Nielsen, “Replicator neural networks for
universal optimal source coding,” *Science*, **269** (5232),
September 1995, pp. 1860–1863. PDF

*[Ke]* D. Kendall, “A survey of the statistical theory of
shape,” *Statistical Science*, **4** (2), 1989, pp.
87–120. PDF

*[KPP]* W. Klein, R. Plomp, L.C.W. Pols, “Vowel spectra,
vowel spaces, and vowel identification,” *Journal of the
Acoustical Society of America*, **48** (4), 1970, pp.
999–1009. PDF

*[Kr]* M.A. Kramer, “Nonlinear principal component
analysis using autoassociative neural networks,” *AIChE
Journal*, **37** (2), February 1991, pp. 233–243. PDF

*[L]* C. Lanczos, “An iteration method for the solution of the
eigenvalue problem of linear differential and integral operators,”
*Journal of Research of the National Bureau of Standards*,
**45** (4), October 1950, pp. 255–282.

*[Ma]* G. Marsaglia, “Random numbers fall mainly in the
planes,” *Proceedings of the National Academy of Sciences*,
**61** (1), September 1968, pp. 25–28. PDF

*[MS1]* T. Martinetz, K. Schulten, “Topology Representing
Networks,” *Neural Networks*, **7** (3), 1994, pp.
507–522. PDF

*[MS2]* R.B. Morgan, D.S. Scott, “Preconditioning the
Lanczos algorithm for sparse symmetric eigenvalue problems,” *SIAM
Journal on Scientific Computing*, **14** (3), May 1993, pp.
585–593. PDF

*[MN]* H. Murase, S.K. Nayar, “Visual learning and
recognition of 3-D Objects from appearance,” *International
Journal of Computer Vision*, **14** (1), January 1995, pp.
5–24. PDF (Large file: 30MB)

*[NW]* D.Q. Naiman, H.P. Wynn, “Abstract tubes, improved
inclusion-exclusion identities and inequalities and importance
sampling,” *Annals of Statistics*, **25** (5), October 1997,
pp. 1954–1983. PDF

*[RMB]* V. Robins, J.D. Meiss, E. Bradley, “Computing
connectedness: An exercise in computational topology,”
*Nonlinearity*, **11** (4), July 1998, pp. 913–922. PDF

*[S]* T.D. Sanger, “Optimal movement primitives,”
pp. 1023–1030 in *[ANIPS7]*. PDF

*[SLD]* P. Simard, Y. Le Cun, J. Denker, “Efficient
pattern recognition using a new transformation distance,” pp.
50–58 in *[ANIPS5]*. PDF

*[TSM]* P. Tamayo, D. Slonim, J. Mesirov, Q. Zhu, S. Kitareewan,
E. Dmitrovsky, E.S. Lander, T.R. Golub, “Interpreting patterns of
gene expression with self-organizing maps: Methods and application to
hematopoietic differentiation,” *Proceedings of the National
Academy of Sciences*, **96** (6), March 1999, pp.
2907–2912. PDF

*[Te]* J.B. Tenenbaum, “Mapping a manifold of perceptual
observations,” pp. 682–688 in *[ANIPS10]*. PDF

*[Ti]* R. Tibshirani, “Principal curves revisited,”
*Statistics and Computing*, **2**, 1992, pp. 183–190. PS

*[YY]* M.P. Young, S. Yamane, “Sparse population coding of
faces in the inferotemporal cortex,” *Science*, **256**
(5061), May 1992, pp. 1327–1331. PDF

*[BS3]* J.-M. Bernardo, M.H. DeGroot, D.V.
Lindley, A.F.M. Smith (Eds.), * Bayesian Statistics*, **3**,
Proceedings of the Third Valencia International Meeting, June 1–5,
1987, Oxford University Press, New York, NY, 1988. (ISBN: 0-19-852220-7)

*[ANIPS5]* C. Giles, S. Hanson, J. Cowan
(Eds.), *Advances in Neural Information Processing Systems*,
**5**, Morgan Kaufmann, San Francisco, CA, 1993. (ISBN: 1-55860-274-7)

*[ANIPS7]* G. Tesauro, D.S. Touretzky, T.K.
Leen (Eds.), *Advances in Neural Information Processing Systems*,
**7**, MIT Press, Cambridge, MA, 1995. (ISBN: 0-262-20104-6)

*[ANIPS10]* M.I. Jordan, M.J. Kearns and
S.A. Solla (Eds.), *Advances in Neural Information Processing
Systems*, **10**, MIT Press, Cambridge, MA, 1997. (ISBN: 0-262-10076-2)

*[LNCS1380]* C.L. Lucchesi, A.V. Moura
(Eds), *LATIN '98: Theoretical Informatics*, Lecture Notes in
Computer Science, **1380**, Springer-Verlag, Berlin, 1998. (ISBN: 3-540-64275-7)

*[Ko]* T. Kohonen, *Self Organisation and Associative
Memory*, Springer Series in Information Sciences, **8**, 3nd Ed.,
Springer-Verlag, Berlin, 1989. (ISBN: 0-387-51387-6)

*[KGGK]* V. Kumar, A. Grama, A. Gupta, G. Karypis,
*Introduction to Parallel Computing: Design and Analysis of
Algorithms*, Benjamin Cummings, San Francisco CA, 1993. (ISBN: 0-8053-3170-0)

*[Mi]* J. Milnor, *Singular Points of Complex
Hypersurfaces*, Annals of Mathematics Studies, **61**, Princeton
University Press, Princeton, NJ, 1968. (ISBN: 0-691-08065-8)

E-mail webmaster: l e k h e n g @ m a t h . s t a n f o r d . e d u