Exploratory data analysis with MATLAB®

Exploratory Data Analysis with MATLAB

Volumn , Issue , 2004, Pages 1-405

  Martinez, Wendy L ^a   Martinez, Angel R ^a  

^a NONE

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84938711223     PISSN: None     EISSN: None     Source Type: Book    
DOI: None     Document Type: Book

References (344)

1. Alter, O., P. O. Brown, and D. Botstein. 2000. “Singular value decomposition for genome-wide expression data processing and modeling,” Proceedings of the National Academy of Science, 97:10101-10106.
2. Anderberg, Michael R. 1973. Cluster Analysis for Applications, New York: Academic Press.
3. Anderson, E. 1935. “The irises of the Gaspe Peninsula,” Bulletin of the American Iris Society, 59:2-5.
4. Andrews, D. F. 1972. “Plots of high-dimensional data,” Biometrics, 28:125-136.
5. Andrews, D. F. 1974. “A robust method of multiple linear regression,” Technometrics, 16:523-531.
6. Andrews, D. F. and A. M. Herzberg. 1985. Data: A Collection of Problems from Many Fields for the Student and Research Worker, New York: Springer-Verlag.
7. Anscombe, F. J. 1973. “Graphs in statistical analysis,” The American Statistician, 27:17-21.
8. Asimov, Daniel. 1985. “The grand tour: A tool for viewing multidimensional data,” SIAM Journal of Scientific and Statistical Computing, 6:128-143.
9. Asimov, D. and A. Buja. 1994. “The grand tour via geodesic interpolation of 2-frames,” in Visual Data Exploration and Analysis, Symposium on Electronic Imaging Science and Technology, IS&T/SPIE.
10. Baeza-Yates, Ricardo and Berthier Ribero-Neto. 1999. Modern Information Retrieval, New York, NY: ACM Press.
11. Bailey, T. A. and R. Dubes. 1982. “Cluster validity profiles,” Pattern Recognition, 15:61-83.
12. Balasubramanian, M. and E. L. Schwartz. 2002. “The isomap algorithm and topological stability (with rejoinder),” Science, 295:7.
13. Banfield, A. D. and A. E. Raftery. 1993. “Model-based Gaussian and non-Gaussian clustering,” Biometrics, 49:803-821.
14. Basseville, Michele. 1989. “Distance measures for signal processing and pattern recognition,” Signal Processing, 18:349-369.
15. Becker, R. A., and W. S. Cleveland. 1987. “Brushing scatterplots,” Technometrics, 29:127-142.
16. Becker, R. A., and W. S. Cleveland. 1991. “Viewing multivariate scattered data,” Pixel, July/August, 36-41.
17. Becker, R. A., W. S. Cleveland, and A. R. Wilks. 1987. “Dynamic graphics for data analysis,” Statistical Science, 2:355-395.
18. Becker, R. A., L. Denby, R. McGill, and A. Wilks. 1986. “Datacryptanalysis: A case study,” Proceedings of the Section on Statistical Graphics, 92-91.
19. Benjamini, Yoav. 1988. “Opening the box of a boxplot,” The American Statistician, 42:257-262.
20. Bennett, G. W. 1988. “Determination of anaerobic threshold,” Canadian Journal of Statistics, 16:307-310.
21. Bensmail, H., G. Celeux, A. E. Raftery, and C. P. Robert. 1997. “Inference in modelbased cluster analysis,” Statistics and Computing, 7:1-10.
22. Berry, Michael W., and Murray Browne. 1999. Understanding Search Engines: Mathematical Modeling and Text Retrieval, Philadelphia, PA: SIAM.
23. Berry, M. W., S. T. Dumais, and G. W. O’Brien. 1995. “Using linear algebra for intelligent information retrieval,” SIAM Review, 37:573-595.
24. Berry, M. W., Z. Drmac, and E. R. Jessup. 1999. “Matrices, vector spaces, and information retrieval,” SIAM Review, 41:335-362.
25. Bertin, Jacques. 1983. Semiology of Graphics: Diagrams, Networks, Maps. Madison, WI:The University of Wisconsin Press.
26. Bhattacharjee, A., W. G. Richards, J. Staunton, C. Li, S. Monti, P. Vasa, C. Ladd, J. Beheshti, R. Bueno, M. Gillette, M. Loda, G. Weber, E. J. Mark, E. S. Lander, W. Wong, B. E. Johnson, T. R. Bolub, D. J. Sugarbaker, & M. Meyerson. 2001. “Classification of human lung carcinomas by mRNA expression profiling reveals distinct adenocarcinoma subclasses,” Proceedings of the National Academy of Science, 98:13790-13795.
27. Biernacki, C. and G. Govaert. 1997. “Using the classification likelihood to choose the number of clusters,” Computing Science and Statistics, 29(2):451-457.
28. Biernacki, C., G. Celeux, and G. Govaert. 1999. “An improvement of the NEC criterion for assessing the number of clusters in a mixture model,” Pattern Recognition Letters, 20:267-272.
29. Binder, D. A. 1978. “Bayesian cluster analysis,” Biometrika, 65:31-38.
30. Bishop, Christopher M., G. E. Hinton, and I. G. D. Strachan. 1997. “GTM through time,” Proceedings IEEE 5th International Conference on Artificial Neural Networks, Cambridge, UK, 111-116.
31. Bishop, Christopher M., Markus Svensén, and Christopher K. I. Williams. 1996. “GTM: The generative topographic mapping,” Neural Computing Research Group, Technical Report NCRG/96/030.
32. Bishop, Christopher M., Markus Svensén, and Christopher K. I. Williams. 1997a. “Magnification factors for the SOM and GTM algorithms, Proceedings 1997 Workshop on Self-Organizing Maps, Helsinki University of Technology, 333-338.
33. Bishop, Christopher M., Markus Svensén, and Christopher K. I. Williams. 1997b. “Magnification factors for the GTM algorithm,” Proceedings IEEE 5th International Conference on Artificial Neural Networks, Cambridge, UK, 64-69.
34. Bishop, Christopher M., Markus Svensén, and Christopher K. I. Williams. 1998a. “The generative topographic mapping,” Neural Computation, 10:215-234.
35. Bishop, Christopher M., Markus Svensén, and Christopher K. I. Williams. 1998b. “Developments of the generative topographic mapping,” Neurocomputing, 21:203-224.
36. Bishop, Christopher M. and M. E. Tipping. 1998. “A hierarchical latent variable model for data visualization,” IEEE Transactions on Pattern Analysis and Machine Intelligence, 20:281-293.
37. Blasius, J. and M. Greenacre. 1998. Visualizing of Categorical Data, New York: Academic Press.
38. Bock, H. 1985. “On some significance tests in cluster analysis,” Journal of Classification, 2:77-108.
39. Bock, H. 1996. “Probabilistic models in cluster analysis,” Computational Statistics and Data Analysis, 23:5-28.
40. Bolton, R. J. and W. J. Krzanowski. 1999. “A characterization of principal components for projection pursuit,” The American Statistician, 53:108-109.
41. Bonner, R. 1964. “On some clustering techniques,” IBM Journal of Research and Development, 8:22-32.
42. Borg, Ingwer and Patrick Groenen. 1997. Modern Multidimensional Scaling: Theory and Applications, New York: Springer.
43. Bowman, A. W. and A. Azzalini. 1997. Applied Smoothing Techniques for Data Analysis:The Kernel Approach with S-Plus Illustrations, Oxford: Oxford University Press.
44. Brinkman, N. D. 1981. “Ethanol fuel - a single-cylinder engine study of efficiency and exhaust emissions,” SAE Transactions, 90:1410-1424.
45. Bruls, D. M., C. Huizing, J. J. van Wijk. 2000. “Squarified Treemaps,” in: W. de Leeuw, R. van Liere (eds.), Data visualization 2000, Proceedings of the Joint Eurographics and IEEE TCVG Symposium on Visualization, 33-42, New York: Springer.
46. Bruntz, S. M., W. S. Cleveland, B. Kleiner, and J. L. Warner. 1974. “The dependence of ambient ozone on solar radiation, wind, temperature and mixing weight,” Symposium on Atmospheric Diffusion and Air Pollution, Boston: American Meteorological Society, 125-128.
47. Bruske, J. and G. Sommer. 1998. “Intrinsic dimensionality estimation with optimally topology preserving maps,” IEEE Transactions on Pattern Analysis and Machine Intelligence, 20:572-575.
48. Buijsman, E., H. F. M. Maas, and W. A. H. Asman. 1987. “Anthropogenic NH3 Emissions in Europe,” Atmospheric Environment, 21:1009-1022.
49. Buja, A. and D. Asimov. 1986. “Grand tour methods: An outline,” Computer Science and Statistics, 17:63-67.
50. Buja, A., J. A. McDonald, J. Michalak, and W. Stuetzle. 1991. “Interactive data visualization using focusing and linking,” IEEE Visualization, Proceedings of the 2nd Conference on Visualization '91, 156-163.
51. Buta, R. 1987. “The structure and dynamics of ringed galaxies, III: Surface photometry and kinematics of the ringed nonbarred spiral NGC 7531,” The Astrophysical Journal Supplement Series, 64:1-37.
52. Calinski, R. and J. Harabasz. 1974. “A dendrite method for cluster analysis,” Communications in Statistics, 3:1-27.
53. Campbell, J. G., C. Fraley, F. Murtagh, and A. E. Raftery. 1997. “Linear flaw detection in woven textiles using model-based clustering,” Pattern Recognition Letters, 18:1539-1549.
54. Campbell, J. G., C. Fraley, D. Stanford, F. Murtagh, and A. E. Raftery. 1999. “Modelbased methods for real-time textile fault detection,” International Journal of Imaging Systems and Technology, 10:339-346.
55. Carr, D., R. Littlefield, W. Nicholson, and J. Littlefield. 1987. “Scatterplot matrix techniques for large N,” Journal of the American Statistical Association, 82:424-436.
56. Cattell, R. B. 1966. “The scree test for the number of factors,” Journal of Multivariate Behavioral Research, 1:245-276.
57. Cattell, R. B. 1978. The Scientific Use of Factor Analysis in Behavioral and Life Sciences, New York: Plenum Press.
58. Celeux, G. and G. Govaert. 1995. “Gaussian parsimonious clustering models,” Pattern Recognition, 28:781-793.
59. Chakrapani, T. K. and A. S. C. Ehrenberg. 1981. “An alternative to factor analysis in marketing research - Part 2: Between group analysis,” Professional Marketing Research Society Journal, 1:32-38.
60. Chambers, John. 1999. “Computing with data: Concepts and challenges,” The American Statistician, 53:73-84.
61. Chambers, J. M., W. S. Cleveland, B. Kleiner, and P. A. Tukey. 1983. Graphical Methods for Data Analysis, Boca Raton: CRC/Chapman and Hall.
62. Charniak, Eugene. 1996. Statistical Language Learning, Cambridge, MA: The MIT Press.
63. Chatfield, C. 1985. “The initial examination of data,” Journal of the Royal Statistical Society, A, 148:214-253.
64. Chee, M., R. Yang, E. Hubbell, A. Berno, X. C. Huang, D. Stern, J. Winkler, D. J. Lockhart, M. S. Morris, and S. P. A. Fodor. 1996. “Accessing genetic information with high-density DNA arrays,” Science, 274:610-614.
65. Chernoff, Herman. 1973. “The use of faces to represent points in k-dimensional space graphically,” Journal of the American Statistical Association, 68:361-368.
66. Cho, R. J., M. J. Campbell, E. A. Winzeler, L. Steinmetz, A. Conway, L. Wodicka, T. G. Wolfsberg, A. E. Gabrielian, D. Landsman, D. J. Lockhart, and R. W. Davis. 1998. “A genome-wide transcriptional analysis of the mitotic cell cycle,” Molecular Cell, 2:65-73.
67. Cleveland, W. S. 1979. “Robust locally weighted regression and smoothing scatterplots,” Journal of the American Statistical Association, 74:829-836.
68. Cleveland, W. S. 1984. “Graphical methods for data presentation: Full scale breaks, dot charts, and multibased logging,” The American Statistician, 38:270-280.
69. Cleveland, W. S. 1993. Visualizing Data, New York: Hobart Press.
70. Cleveland, W. S. and Susan J. Devlin. 1988. “Locally weighted regression: An approach to regression analysis by local fitting,” Journal of the American Statistical Association, 83:596-610.
71. Cleveland, W. S., Susan J. Devlin, and Eric Grosse. 1988. “Regression by local fitting:Methods, properties, and computational algorithms,” Journal of Econometrics, 37:87-114.
72. Cleveland, W. S. and C. Loader. 1996. “Smoothing by local regression: Principles and methods, in Härdle and Schimek (eds.), Statistical Theory and Computational Aspects of Smoothing, Heidelberg: Phsyica-Verlag, 10-49.
73. Cleveland, W. S. and Robert McGill. 1984. “The many faces of a scatterplot,” Journal of the American Statistical Association, 79:807-822.
74. Cohen, A., R. Gnanadesikan, J. R. Kettenring, and J. M. Landwehr. 1977. “Methodological developments in some applications of clustering,” in: Applications of Statistics, P. R. Krishnaiah (ed.), Amsterdam: North-Holland.
75. Cook, D., A. Buja, and J. Cabrera. 1993. “Projection pursuit indexes based on orthonormal function expansions,” Journal of Computational and Graphical Statistics, 2:225-250.
76. Cook, D., A. Buja, J. Cabrera, and C. Hurley. 1995. “Grand tour and projection pursuit,” Journal of Computational and Graphical Statistics, 4:155-172.
77. Cook, W. J., W. H. Cunningham, W. R. Pulleyblank, and A. Schrijver. 1998. Combinatorial Optimization, New York: John Wiley & Sons.
78. Cormack, R. M. 1971. “A review of classification,” Journal of the Royal Statistical Society, Series A, 134:321-367.
79. Costa, Jose A. and Alfred O. Hero. 2004. “Geodesic entropic graphs for dimension and entropy estimation in manifold learning,” IEEE Transactions on Signal Processing, 52:2210-2221.
80. Cottrell, M., J. C. Fort, and G. Pages. 1998. “Theoretical aspects of the SOM algorithm,” Neurocomputing, 21:119-138.
81. Cox, Trevor F. and Michael A. A. Cox. 2001. Multidimensional Scaling, 2nd Edition, Boca Raton: Chapman & Hall/CRC.
82. Crawford, Stuart. 1991. “Genetic optimization for exploratory projection pursuit,” Proceedings of the 23rd Symposium on the Interface, 23:318-321.
83. Crile, G. and D. P. Quiring. 1940. “A record of the body weight and certain organ and gland weights of 3690 animals,” Ohio Journal of Science, 15:219-259.
84. Dasgupta, A. and A. E. Raftery. 1998. “Detecting features in spatial point processes with clutter via model-based clustering,” Journal of the American Statistical Association, 93:294-302.
85. Davies, O. L. 1957. Statistical Methods in Research and Production, New York: Hafner Press.
86. Davies, David L. and Donald W. Bouldin. 1979. “A cluster separation measure,” IEEE Transactions on Pattern Analysis and Machine Intelligence, 1:224-227.
87. Day, N. E. 1969. “Estimating the components of a mixture of normal distributions,” Biometrika, 56:463-474.
88. de Leeuw, J. 1977. “Applications of convex analysis to multidimensional scaling,” in Recent Developments in Statistics, J. R. Barra, R. Brodeau, G. Romier & B. van Cutsem (ed.), Amsterdam, The Netherlands: North-Holland, 133-145.
89. Deboecek, G. and T. Kohonen. 1998. Visual Explorations in Finance using Self-Organizing Maps, London: Springer-Verlag.
90. Deewester, S., Susan T. Dumais, George W. Furnas, Thomas K. Landauer, and Richard Harshman. 1990. “Indexing by Latent Semantic Analysis,” Journal of the American Society for Information Science, 41:391-407.
91. Dempster, A. P., Laird, N. M., and Rubin, D. B. 1977. “Maximum likelihood from incomplete data via the EM algorithm (with discussion),” Journal of the Royal Statistical Society: B, 39:1-38.
92. Diaconis, Persi. 1985. “Theories of data analysis: From magical thinking through classical statistics,” in Exploring Data Tables, Trends, and Shapes, D. Hoaglin, F. Mosteller, and J. W. Tukey (eds.), New York: John Wiley and Sons.
93. Diaconis, P. and J. H. Friedman. 1980. “M and N plots,” Technical Report 15, Department of Statistics, Stanford University.
94. Donoho, D. L. and M. Gasko. 1992. “Breakdown properties of location estimates based on halfspace depth and projected outlyingness,” The Annals of Statistics, 20:1803-1827.
95. Donoho, D. L. and C. Grimes. 2002. Technical Report 2002-27, Department of Statistics, Stanford University.
96. Donoho, D. L. and C. Grimes. 2003. “Hessian eigenmaps: Locally linear embedding techniques for high-dimensional data,” Proceedings of the National Academy of Science, 100:5591-5596.
97. Draper, N. R. and H. Smith. 1981. Applied Regression Analysis, 2nd Edition, New York:John Wiley & Sons.
98. du Toit, S. H. C., A. G. W. Steyn, and R. H. Stumpf. 1986. Graphical Exploratory Data Analysis, New York: Springer-Verlag.
99. Dubes, R. and A. K. Jain. 1980. “Clustering methodologies in exploratory data analysis,” Advances in Computers, Vol. 19, New York: Academic Press.
100. Duda, Richard O. and Peter E. Hart. 1973. Pattern Classification and Scene Analysis, New York: John Wiley & Sons.
101. Duda, Richard O., Peter E. Hart, and David G. Stork. 2001. Pattern Classification, Second Edition, New York: John Wiley & Sons.
102. Edwards, A. W. F. and L. L. Cavalli-Sforza. 1965. “A method for cluster analysis,” Biometrics, 21:362-375.
103. Efromovich, Sam. 1999. Nonparametric Curve Estimation: Methods, Theory, and Applications, New York: Springer-Verlag.
104. Efron, B. and R. J. Tibshirani. 1993. An Introduction to the Bootstrap, London: Chapman and Hall.
105. Embrechts, P. and A. Herzberg. 1991. “Variations of Andrews’ plots,” International Statistical Review, 59:175-194.
106. Emerson, John D. and Michael A. Stoto. 1983. “Transforming Data,” in Understanding Robust and Exploratory Data Analysis, Hoaglin, Mosteller, and Tukey (eds.), New York: John Wiley & Sons.
107. Estivill-Castro, Vladimir. 2002. “Why so many clustering algorithms - A position paper,” SIGKDD Explorations, 4:65-75.
108. Esty, Warren W. and Jeffrey D. Banfield. 2003. “The box-percentile plot,” Journal of Statistical Software, 8, http://www.jstatsoft.org/v08/i17.
109. Everitt, Brian S. 1993. Cluster Analysis, Third Edition, New York: Edward Arnold Publishing.
110. Everitt, B. S. and D. J. Hand. 1981. Finite Mixture Distributions, London: Chapman and Hall.
111. Everitt, B. S., S. Landau, and M. Leese. 2001. Cluster Analysis, Fourth Edition, New York: Edward Arnold Publishing.
112. Fawcett, C. D. 1901. “A second study of the variation and correlation of the human skull, with special reference to the Naqada crania,” Biometrika, 1:408-467.
113. Fieller, N. R. J., E. C. Flenley, and W. Olbricht. 1992. “Statistics of particle size data,” Applied Statistics, 41:127-146.
114. Fieller, N. R. J., D. D. Gilbertson, and W. Olbricht. 1984. “A new method for environmental analysis of particle size distribution data from shoreline sediments,” Nature, 311:648-651.
115. Fienberg, S. 1979. “Graphical methods in statistics,” The American Statistician, 33:165-178.
116. Fisher, R. A. 1936. “The use of multiple measurements in taxonomic problems,” Annals of Eugenics, 7:179-188.
117. Flick, T., L. Jones, R. Priest, and C. Herman. 1990. “Pattern classification using projection pursuit,” Pattern Recognition, 23:1367-1376.
118. Flury, B. and H. Riedwyl. 1988. Multivariate Statistics: A Practical Approach, London:Chapman and Hall.
119. Fowlkes, E. B. and C. L. Mallows. 1983. “A method for comparing two hierarchical clusterings,” Journal of the American Statistical Association, 78:553-584.
120. Frakes, W. B. and Ricardo Baeza-Yates. 1992. Information Retrieval: Data Structures & Algorithms, Prentice Hall, New Jersey.
121. Fraley, C. 1998. “Algorithms for model-based Gaussian hierarchical clustering,” SIAM Journal on Scientific Computing, 20:270-281.
122. Fraley, C. and A. E. Raftery. 1998. “How many clusters? Which clustering method? Answers via model-based cluster analysis,” The Computer Journal, 41:578-588.
123. Fraley, C. and A. E. Raftery. 2002. “Model-based clustering, discriminant analysis, and density estimation: MCLUST,” Journal of the American Statistical Association, 97:611-631.
124. Fraley, C. and A. E. Raftery. 2003. “Enhanced software for model-based clustering, discriminant analysis, and density estimation: MCLUST,” Journal of Classification, 20:263-286.
125. Fraley, C., A. E. Raftery, and R. Wehrens. 2003. “Incremental model-based clustering for large datasets with small clusters,” Technical Report 439, Department of Statistics, University of Washington (to appear in Journal of Computational and Graphical Statistics).
126. Freedman, D. and P. Diaconis. 1981. “On the histogram as a density estimator:theory,” Zeitschrift fur Wahrscheinlichkeitstheorie und verwandte Gebiete, 57:453-476.
127. Fridlyand, Jane and Sandrine Dudoit. 2001. “Applications of resampling methods to estimate the number of clusters and to improve the accuracy of a clustering method,” Technical Report #600, Division of Biostatistics, University of California, Berkeley.
128. Friedman, J. 1987. “Exploratory projection pursuit,” Journal of the American Statistical Association, 82:249-266.
129. Friedman, J. and W. Stuetzle. 1981. “Projection pursuit regression,” Journal of the American Statistical Association, 76:817-823.
130. Friedman, J. and John Tukey. 1974. “A projection pursuit algorithm for exploratory data analysis,” IEEE Transactions on Computers, 23:881-889.
131. Friedman, J., W. Stuetzle, and A. Schroeder. 1984. “Projection pursuit density estimation,” Journal of the American Statistical Association, 79:599-608.
132. Friendly, Michael. 2000. Visualizing Categorical Data, Cary, NC: SAS Institute, Inc.
133. Friendly, M. and E. Kwan. 2003. “Effect ordering for data displays,” Computational Statistics and Data Analysis, 43:509-539.
134. Friendly, Michael and Howard Wainer. 2004. “Nobody’s perfect,” Chance, 17:48-51.
135. Frigge, M., D. C. Hoaglin, and B. Iglewicz. 1989. “Some implementations of the boxplot,” The American Statistician, 43:50-54.
136. Fua, Ying-Huey, Matthew O. Ward, and Elke A. Rundensteiner. 1999. “Hierarchical parallel coordinates for exploration of large datasets,” IEEE Visualization, Proceedings of the Conference on Visualization '99, 43 - 50.
137. Fukunaga, Keinosuke. 1990. Introduction to Statistical Pattern Recognition, Second Edition, New York: Academic Press.
138. Fukunaka, K. and D. R. Olsen. 1971. “An algorithm for finding intrinsic dimensionality of data,” IEEE Transactions on Computers, 20:176-183.
139. Gentle, James E. 2002. Elements of Computational Statistics, New York: Springer-Verlag.
140. Golub, G. and C. Van Loan. 1996. Matrix Computations, Baltimore: Johns Hopkins University Press.
141. Golub, T. R., Slonim, D. K., P. Tamayo, C. Huard, M. Gaasenbeek, J. P. Mesirov, H. Coller, M. L. Loh, J. R. Downing, M. A. Caligiuri, C. D. Bloomfield, and E. S. Lander. 1999. “Molecular classification of cancer: Class discovery and class prediction by gene expression monitoring,” Science, 286:531-537.
142. Good, I. J. 1983. “The philosophy of exploratory data analysis,” Philosophy of Science, 50:283-295.
143. Gordon, A. D. 1999. Classification, London: Chapman and Hall.
144. Gower, J. C. 1966. “Some distance properties of latent root and vector methods in multivariate analysis,” Biometrika, 53:325-338.
145. Gower, J. C. and Legendre, P. 1986. “Metric and Euclidean properties of dissimilarity coefficients,” Journal of Classification, 3:5-48.
146. Green P. J. and B. W. Silverman. 1994. Nonparametric Regression and Generalized Linear Models: A Roughness Penalty Approach, London: Chapman and Hall.
147. Griffiths, A. J. F., J. H. Miller, D. T. Suzuki, R. X. Lewontin, and W. M. Gelbart. 2000. An Introduction to Genetic Analysis, 7th ed., New York: Freeman.
148. Groenen, P. 1993. The Majorization Approach to Multidimensional Scaling: Some Problems and Extensions, Leiden, The Netherlands: DSWO Press.
149. Guttman, L. 1968. “A general nonmetric technique for finding the smallest coordinate space for a configuration of points,” Psychometrika, 33:469-506.
150. Hand, D., F. Daly, A. D. Lunn, K. J. McConway and E. Ostrowski. 1994. A Handbook of Small Data Sets, London: Chapman and Hall.
151. Hand, David, Heikki Mannila, and Padhraic Smyth. 2001. Principles of Data Mining, Cambridge, MA: The MIT Press.
152. Hanselman, D. and B. Littlefield. 1998. Mastering MATLAB 5: A Comprehensive Tutorial and Reference, New Jersey: Prentice Hall.
153. Hanselman, D. and B. Littlefield. 2001. Mastering MATLAB 6: A Comprehensive Tutorial and Reference, New Jersey: Prentice Hall.
154. Hansen, Pierre, Brigitte Jaumard, and Bruno Simeone. 1996. “Espaliers: A generalization of dendrograms,” Journal of Classification, 13:107-127.
155. Hartigan, J. A. 1967. “Representation of similarity measures by trees,” Journal of the American Statistical Association, 62:1140-1158.
156. Hartigan, J. A. 1975. Clustering Algorithms, New York: John Wiley & Sons.
157. Hartigan, J. A. 1985. “Statistical theory in clustering,” Journal of Classification, 2:63-76.
158. Hartwig, F. and Brian E. Dearing. 1979. Exploratory Data Analysis, Newbury Park, CA:Sage University Press.
159. Hastie, T. J. and C. Loader. 1993. “Local regression: Automatic kernel carpentry (with discussion),” Statistical Science, 8:120-143.
160. Hastie, T. J. and R. J. Tibshirani. 1986. “Generalized additive models,” Statistical Science, 1:297-318.
161. Hastie, T. J., and R. J.Tibshirani. 1990. Generalized Additive Models, London: Chapman and Hall.
162. Hastie, T. J., R. J. Tibshirani, and J. Friedman. 2001. The Elements of Statistical Learning:Data Mining, Inference and Prediction, New York: Springer.
163. Hastie, T., R. Tibshirani, M. B. Eisen, A. Alizadeh, R. Levy, L. Staudt, W. C. Chan, D. Botstein and P. Brown. 2002. “Gene shaving as a method for identifying distinct sets of genes with similar expression patterns,” Genome Biology, 1.
164. Hoaglin, D. C. 1982. “Exploratory data analysis,” in Encyclopedia of Statistical Sciences, Volume 2, Kotz, S. and N. L. Johnson, eds., New York: John Wiley & Sons.
165. Hoaglin, D. C., B. Iglewicz, and J. W. Tukey. 1986. “Performance of some resistant rules for outlier labeling,” Journal of the American Statistical Association, 81:991-999.
166. Hoaglin, D. C. and John Tukey. 1985. “Checking the shape of discrete distributions,” in Exploring Data Tables, Trends and Shapes, D. Hoaglin, F. Mosteller, J. W. Tukey, eds., New York: John Wiley & Sons.
167. Hoaglin, D. C., F. Mosteller, and J. W. Tukey (eds.). 1983. Understanding Robust and Exploratory Data Analysis, New York: John Wiley & Sons.
168. Hogg, Robert. 1974. “Adaptive robust procedures: A partial review and some suggestions for future applications and theory (with discussion),” Journal of the American Statistical Association, 69:909-927.
169. Huber, P. J. 1973. “Robust regression: Asymptotics, conjectures, and Monte Carlo,” Annals of Statistics, 1:799-821.
170. Huber, P. J. 1981. Robust Statistics, New York: John Wiley & Sons.
171. Huber, P. J. 1985. “Projection pursuit (with discussion),” Annals of Statistics, 13:435-525.
172. Hubert, L. J. and P. Arabie. 1985. “Comparing partitions,” Journal of Classification, 2:193-218.
173. Hurley, Catherine and Andreas Buja. 1990. “Analyzing high-dimensional data with motion graphics,” SIAM Journal of Scientific and Statistical Computing, 11:1193-1211.
174. Inselberg, Alfred. 1985. “The plane with parallel coordinates,” The Visual Computer, 1:69-91.
175. Jackson, J. Edward. 1981. “Principal components and factor analysis: Part III - What is factor analysis?" Journal of Quality Technology, 13:125-130.
176. Jackson, J. Edward. 1991. A User’s Guide to Principal Components, New York: John Wiley & Sons.
177. Jain, Anil K. and Richard C. Dubes. 1988. Algorithms for Clustering Data, New York:Prentice Hall.
178. Jain, Anil K., M. N. Murty, and P. J. Flynn. 1999. “Data clustering: A review,” ACM Computing Surveys, 31:264-323.
179. Jeffreys, H. 1935. “Some tests of significance, treated by the theory of probability,” Proceedings of the Cambridge Philosophy Society, 31:203-222.
180. Jeffreys, H. 1961. Theory of Probability, Third Edition, Oxford, U. K.: Oxford University Press.
181. Johnson, B. and B. Shneiderman. 1991. “Treemaps: A space-filling approach to the visualization of hierarchical information structures,” Proceedings of the 2nd International IEEE Visualization Conference, 284-291.
182. Jolliffe, I. T. 1972. “Discarding variables in a principal component analysis I: Artificial data,” Applied Statistics, 21:160-173.
183. Jolliffe, I. T. 1986. Principal Component Analysis, New York: Springer-Verlag.
184. Jones, W. P. and George W. Furnas. 1987. “Pictures of relevance: A geometric analysis of similarity measures,” Journal of the American Society for Information Science, 38:420-442.
185. Jones, M. C. and R. Sibson. 1987. “What is projection pursuit” (with discussion), Journal of the Royal Statistical Society, Series A, 150:1-36.
186. Kaiser, H. F. 1960. “The application of electronic computers to factor analysis, Educational and Psychological Measurement, 20:141-151.
187. Kangas, J. and S. Kaski. 1998. "3043 works that have been based on the self-organizing map (SOM) method developed by Kohonen,” Technical Report A50, Helsinki University of Technology, Laboratory of Computer and Information Science.
188. Kaski, Samuel. 1997. Data Exploration Using Self-Organizing Maps, Ph.D. dissertation, Helsinki University of Technology.
189. Kaski, S., T. Honkela, K. Lagus, and T. Kohonen. 1998. “WEBSOM - Self-organizing maps of document collections,” Neurocomputing, 21:101-117.
190. Kass, R. E. and A. E. Raftery. 1995. “Bayes factors,” Journal of the American Statistical Association, 90:773-795.
191. Kaufman, Leonard and Peter J. Rousseeuw. 1990. Finding Groups in Data: An Introduction to Cluster Analysis, New York: John Wiley & Sons.
192. Kiang, Melody Y. 2001. “Extending the Kohonen self-organizing map networks for clustering analysis,” Computational Statistics and Data Analysis, 38:161-180.
193. Kimbrell, Roy E. 1988. “Searching for text? Send an N-Gram!,” Byte, May, 297 - 312.
194. Kimball, B. F. 1960. “On the choice of plotting positions on probability paper,” Journal of the American Statistical Association, 55:546-560.
195. Kirby, M. 2001. Geometric Data Analysis: An Empirical Approach to Dimensionality Reduction and the Study of Patterns, New York: John Wiley & Sons.
196. Kleiner, B. and J. A. Hartigan. 1981. “Representing points in many dimensions by trees and castles,” Journal of the American Statistical Association, 76:260-276
197. Kohonen, Tuevo. 1998. “The self-organizing map,” Neurocomputing, 21:1-6.
198. Kohonen, Tuevo. 2001. Self-Organizing Maps, Third Edition, Berlin: Springer.
199. Kohonen, T., S. Kaski, K. Lagus, J. Salojarvi, T. Honkela, V. Paatero, and A. Saarela. 2000. “Self organization of a massive document collection,” IEEE Transactions on Neural Networks, 11:574-585.
200. Kotz, Samuel and Norman L. Johnson (eds.). 1986. Encyclopedia of Statistical Sciences, New York: John Wiley & Sons.
201. Kruskal, Joseph B. 1964a. “Multidimensional scaling by optimizing goodness of fit to a nonmetric hypothesis,” Psychometrika, 29:1-27.
202. Kruskal, Joseph B. 1964b. “Nonmetric multidimensional scaling: A numerical method,” Psychometrika, 29:115-129.
203. Kruskal, Joseph B. and Myron Wish. 1978. Multidimensional Scaling, Newbury Park, CA: Sage Publications, Inc.
204. Krzanowski, W. J. and Y. T. Lai. 1988. “A criterion for determining the number of groups in a data set using sum-of-squares clustering,” Biometrics, 44:23-34.
205. Lander, Eric S. 1999. “Array of hope.” Nature Genetics Supplement, 21:3-4.
206. Launer, R., and G. Wilkinson (eds.). 1979. Robustness in Statistics, New York: Academic Press.
207. Lawley, D. N. and A. E. Maxwell. 1971. Factor Analysis as a Statistical Method, 2nd Edition, London: Butterworth.
208. Levina, Elizaveta and Peter Bickel. 2004. “Maximum likelihood estimation of intrinsic dimension,” NIPS 2004 (to appear).
209. Li, G. and Z. Chen. 1985. “Projection-pursuit approach to robust dispersion matrices and principal components: Primary theory and Monte Carlo,” Journal of the American Statistical Association, 80:759-766.
210. Lindsey, J. C., A. M. Herzberg, and D. G. Watts. 1987. “A method for cluster analysis based on projections and quantile-quantile plots,” Biometrics, 43:327-341.
211. Ling, R. F. 1973. “A computer generated aid for cluster analysis,” Communications of the ACM, 16:355-361.
212. Loader, C. 1999. Local Regression and Likelihood, New York: Springer-Verlag.
213. Manly, B. F. J. 1994. Multivariate Statistical Methods - A Primer, Second Edition, London:Chapman & Hall.
214. Manning, Christopher D. and Hinrich Schütze. 2000. Foundations of Statistical Natural Language Processing, Cambridge, MA: The MIT Press.
215. Mao, J. and A. K. Jain. 1995. “Artificial neural networks for feature extraction and multivariate data projection,” IEEE Transaction on Neural Networks, 6:296-317.
216. Marchand, Patrick and O. Thomas Holland. 2003. Graphics and GUIs with MATLAB, Third Edition, Boca Raton: CRC Press.
217. Marchette, D. J. and J. L. Solka. 2003. “Using data images for outlier detection,” Computational Statistics and Data Analysis, 43:541-552.
218. Martinez, A. R. 2002. A Framework for the Representation of Semantics, Ph.D. Dissertation, Fairfax, Va: George Mason University.
219. Martinez, A. R. and Edward J. Wegman. 2002a. “A text stream transformation for semantic-based clustering,” Computing Science and Statistics, 34:184-203.
220. Martinez, A. R. and Edward J. Wegman. 2002b. “Encoding of text to preserve “meaning”,” Proceedings of the Eighth Annual U. S. Army Conference on Applied Statistics, 27-39.
221. Martinez, W. L. and A. R. Martinez. 2002. Computational Statistics Handbook with MATLAB, Boca Raton: CRC Press.
222. McGill, Robert, John Tukey, and Wayne Larsen. 1978. “Variations of box plots,” The American Statistician, 32:12-16.
223. McLachlan, G. J. and K. E. Basford. 1988. Mixture Models: Inference and Applications to Clustering, New York: Marcel Dekker.
224. McLachlan, G. J. and T. Krishnan. 1997. The EM Algorithm and Extensions, New York:John Wiley & Sons.
225. McLachlan, G. J. and D. Peel. 2000. Finite Mixture Models, New York: John Wiley & Sons.
226. McLachlan, G. J., D. Peel, K. E. Basford, and P. Adams. 1999. “The EMMIX software for the fitting of mixtures of normal and t-components,” Journal of Statistical Software, 4, http://www.jstatsoft.org/index.php?vol=4
227. McLeod, A. I. and S. B. Provost. 2001. “Multivariate Data Visualization,” www.stats.uwo.ca/faculty/aim/mviz.
228. Mead, A. 1992. “Review of the development of multidimensional scaling methods,” The Statistician, 41:27-39.
229. Milligan, G. W. and M. C. Cooper. 1985. “An examination of procedures for determining the number of clusters in a data set,” Psychometrika, 50:159-179.
230. Milligan, G. W. and M. C. Cooper. 1988. “A study of standardization of variables in cluster analysis,” Journal of Classification, 5:181-204.
231. Minnotte, M. and R. West. 1998. “The data image: A tool for exploring high dimensional data sets,” Proceedings of the ASA Section on Statistical Graphics, Dallas, Texas, 25-33.
232. Mojena, R. 1977. “Hierarchical grouping methods and stopping rules: An evaluation,” Computer Journal, 20:359-363.
233. Moler, Cleve. 2004. Numerical Computing with MATLAB, New York: SIAM.
234. Montanari, Angela and Laura Lizzani. 2001. “A projection pursuit approach to variable selection,” Computational Statistics and Data Analysis, 35:463-473.
235. Morgan, Byron J. T. and Andrew P. G. Ray. 1995. “Non-uniqueness and inversions in cluster analysis,” Applied Statistics, 44:114-134.
236. Mosteller, F. and J. W. Tukey. 1977. Data Analysis and Regression: A Second Course in Statistics, New York: Addison-Wesley.
237. Mosteller, F. and D. L. Wallace. Inference and Disputed Authorship: The Federalist Papers, New York: Addison-Wesley.
238. Mukherjee, S., E. Feigelson, G. Babu, F. Murtagh, C. Fraley, and A. E. Raftery. 1998. “Three types of gamma ray bursts,” Astrophysical Journal, 508:314-327.
239. Murtagh, F. and A. E. Raftery. 1984. “Fitting straight lines to point patterns,” Pattern Recognition, 17:479-483.
240. Nason, Guy. 1995. “Three-dimensional projection pursuit,” Applied Statistics, 44:411-430.
241. Olbricht, W. 1982. “Modern statistical analysis of ancient sand,” MSc Thesis, University of Sheffield, Sheffield, UK.
242. Panel on Discriminant Analysis, Classification, and Clustering. 1989. “Discriminant Analysis and Clustering,” Statistical Science, 4:34-69.
243. Pearson, K. and A. Lee. 1903. “On the laws of inheritance in man. I. Inheritance of physical characters,” Biometrika, 2:357-462.
244. Pettis, K. W., T. A. Bailey, A. K. Jain, and R. C. Dubes. 1979. “An intrinsic dimensionality estimator from near-neighbor information,” IEEE Transactions on Pattern Analysis and Machine Intelligence, 1:25-37.
245. Porter, M. F. 1980. ‘An algorithm for suffix stripping,’ Program, 14:130 - 137.
246. Posse, Christian. 1995a. “Projection pursuit exploratory data analysis,” Computational Statistics and Data Analysis, 29:669-687.
247. Posse, Christian. 1995b. “Tools for two-dimensional exploratory projection pursuit,” Journal of Computational and Graphical Statistics, 4:83-100.
248. Posse, Christian. 2001. “Hierarchical model-based clustering for large data sets,” Journal of Computational and Graphical Statistics,” 10:464-486.
249. Rand, William M. 1971. “Objective criteria for the evaluation of clustering methods,” Journal of the American Statistical Association, 66:846-850.
250. Rao, C. R. 1993. Computational Statistics, The Netherlands: Elsevier Science Publishers.
251. Redner, A. R. and H. F. Walker. 1984. “Mixture densities, maximum likelihood and the EM algorithm,” SIAM Review, 26:195-239.
252. Ripley, Brian D. 1996. Pattern Recognition and Neural Networks, Cambridge: Cambridge University Press.
253. Roeder, Kathryn. 1994. “A graphical technique for determining the number of components in a mixture of normals,” Journal of the American Statistical Association, 89:487-495.
254. Rousseeuw, P. J. and A. M. Leroy. 1987. Robust Regression and Outlier Detection, New York: John Wiley & Sons.
255. Rousseeuw, P. J. and I. Ruts. 1996. “Algorithm AS 307: Bivariate location depth,” Applied Statistics (JRSS-C), 45:516-526.
256. Rousseeuw, P. J. and I. Ruts. 1998. “Constructing the bivariate Tukey median,” Statistica Sinica, 8:827-839.
257. Rousseeuw, P, J., I. Ruts, and J. W. Tukey. 1999. “The bagplot: A bivariate boxplot,” The American Statistician, 53:382-387.
258. Roweis, S. T. and L. K. Saul. 2000. “Nonlinear dimensionality reduction by locally linear embedding,” Science, 290:2323-2326.
259. Salton, Gerard, Chris Buckley, and Maria Smith. 1990. ‘On the application of syntactic methodologies,’ Automatic Text Analysis, Information Processing & Management, 26:73 - 92.
260. Saul, L. K. and S. T. Roweis. 2002. “Think globally, fit locally: Unsupervised learning of nonlinear manifolds,” Technical Report MS CIS-02-18, University of Pennsylvania.
261. Schena, M., Shalon, D., R. W. Davis, and P. O. Brown. 1995. “Quantitative monitoring of gene expression patterns with a complementary DNA microarray,” Science, 270:497-470.
262. Schimek, M. G. (ed.) 2000. Smoothing and Regression: Approaches, Computation, and Application, New York: John Wiley & Sons.
263. Schwarz, G. 1978. “Estimating the dimension of a model,” The Annals of Statistics, 6:461-464.
264. Scott, A. J. and M. J. Symons. 1971. “Clustering methods based on likelihood ratio criteria,” Biometrics, 27:387-397.
265. Scott, David W. 1992. Multivariate Density Estimation: Theory, Practice, and Visualization, New York: John Wiley & Sons.
266. Sebastani, P., E. Gussoni, I. S. Kohane, & M. F. Ramoni. 2003. “Statistical Challenges in Functional Genomics,” Statistical Science, 18:33-70.
267. Seber, G. A. F. 1984. Multivariate Observations, New York: John Wiley & Sons.
268. Shepard, R. N. 1962a. “The analysis of proximities: Multidimensional scaling with an unknown distance function I,” Psychometrika, 27:125-140.
269. Shepard, R. N. 1962b. “The analysis of proximities: Multidimensional scaling with an unknown distance function II,” Psychometrika, 27:219-246.
270. Shneiderman, B. 1992. “Tree visualization with tree-maps: 2-D space-filling approach,” ACM Transactions on Graphics, 11:92-99.
271. Sieklecki, W., K. Siedlecka, and J. Sklansky. 1988. “An overview of mapping techniques for exploratory pattern analysis,” Pattern Recognition, 21:411-429.
272. Silverman, B. W. 1986. Density Estimation for Statistics and Data Analysis, London:Chapman and Hall.
273. Simonoff, J. S. 1996. Smoothing Methods in Statistics, New York: Springer-Verlag.
274. Slomka, M. 1986. “The analysis of a synthetic data set,” Proceedings of the Section on Statistical Graphics, 113-116.
275. Sneath, P. H. A. and R. R. Sokal. 1973. Numerical Taxonomy, San Francisco: W. H. Freeman.
276. Solka, J. and W. L. Martinez. 2004. “Model-based clustering with an adaptive mixtures smart start,” to appear in Computing Science and Statistics.
277. Späth, Helmuth. 1980. Cluster Analysis Algorithms for Data Reduction and Classification of Objects, New York: Halsted Press.
278. Steyvers, Mark. 2002. “Multidimensional scaling,” in Encyclopedia of Cognitive Science.
279. Stone, Charles J. 1977. “Consistent nonparametric regression,” The Annals of Statistics, 5:595-645.
280. Strang, Gilbert. 1988. Linear Algebra and its Applications, Third Edition, San Diego:Harcourt Brace Jovanovich.
281. Strang, Gilbert. 1993. Introduction to Linear Algebra, Wellesley, MA: Wellesley-Cambridge Press.
282. Stuetzle, Werner. 1987. “Plot windows,” Journal of the American Statistical Association, 82:466-475.
283. Sturges, H. A. 1926. “The choice of a class interval,” Journal of the American Statistical Association, 21:65-66.
284. Swayne, D. F., D. Cook, and A. Buja. 1991. “XGobi: Interactive dynamic graphics in the X window system with a link to S,” ASA Proceedings of the Section on Statistical Graphics. 1-8.
285. Tamayho, P., D. Slonim, J. Mesirov, Q. Zhu, S. Kitareewan, E. Dmitrovsky, E. S. Lander, and T. R. Golub. 1999. “Interpreting patterns of gene expression with self-organizing maps: Methods and application to hematopoietic differentiation,” Proceedings of the National Academy of Science, 96:2907-2912.
286. Tenenbaum, J. B., V. de Silva, and J. C. Langford. 2000. “A global geometric framework for nonlinear dimensionality reduction,” Science, 290:2319-2323.
287. Tibshirani, R., G. Walther, D. Botstein, and P. Brown. 2001. “Cluster validation by prediction strength,” Technical Report, Stanford University.
288. Tibshirani, R., Guenther Walther, and Trevor Hastie. 2001. “Estimating the number of clusters in a data set via the gap statistic,” Journal of the Royal Statistical Society, B, 63:411-423.
289. Tiede, J. J. and M. Pagano. 1979. “The application of robust calibration to radioimmunoassay,” Biometrics, 35:567-574.
290. Timmins, D. A. Y. 1981. “Study of sediment in mesolithic middens on Oronsay,” MA Thesis, University of Sheffield, Sheffield, UK.
291. Titterington, D. B. 1985. “Common structure of smoothing techniques in statistics,” International Statistical Review, 53:141-170.
292. Titterington, D. M., A. F. M. Smith, and U. E. Makov. 1985. Statistical Analysis of Finite Mixture Distributions, New York: John Wiley & Sons.
293. Torgerson, W. S. 1952. “Multidimensional scaling: 1. Theory and method,” Psychometrika, 17:401-419.
294. Trunk, G. 1968. “Statistical estimation of the intrinsic dimensionality of data collections,” Inform. Control, 12:508-525.
295. Trunk, G. 1976. “Statistical estimation of the intrinsic dimensionality of data,” IEEE Transactions on Computers, 25:165-171.
296. Tufte, E. 1983. The Visual Display of Quantitative Information, Cheshire, CT: Graphics Press.
297. Tufte, E. 1990. Envisioning Information, Cheshire, CT: Graphics Press.
298. Tufte, E. 1997. Visual Explanations, Cheshire, CT: Graphics Press.
299. Tukey, John W. 1973. “Some thoughts on alternagraphic displays,” Technical Report 45, Series 2, Department of Statistics, Princeton University.
300. Tukey, John W. 1975. “Mathematics and the picturing of data,” Proceedings of the International Congress of Mathematicians, 2:523-531.
301. Tukey, John W. 1977. Exploratory Data Analysis, New York: Addison-Wesley.
302. Tukey, John W. 1980. “We need both exploratory and confirmatory,” The American Statistician, 34:23-25.
303. Ultsch, A. and H. P. Siemon. 1990. “Kohonen’s self-organizing feature maps for exploratory data analysis,” Proceedings of the International Neural Network Conference (INNC’90), Dordrecht, Netherlands, 305-308.
304. Vandervieren, E. and M. Hubert. 2004. “An adjusted boxplot for skewed distributions,” COMPSTAT 2004, 1933-1940.
305. Velicer, W. F., and D. N. Jackson. 1990. “Component analysis versus common factor analysis: Some issues on selecting an appropriate procedure (with discussion),” Journal of Multivariate Behavioral Research, 25:1-114.
306. Venables, W. N. and B. D. Ripley. 1994. Modern Applied Statistics with S-Plus, New York: Springer-Verlag.
307. Verveer, P. J. and R. P. W. Duin. 1995. “An evaluation of intrinsic dimensionality estimators,” IEEE Transactions on Pattern Analysis and Machine Intelligence, 17:81-86.
308. Vesanto, Juha. 1997. “Data mining techniques based on the self-organizing map,” Master’s Thesis, Helsinki University of Technology.
309. Vesanto, Juha. 1999. “SOM-based data visualization methods,” Intelligent Data Analysis, 3:111-126.
310. Vesanto, Juha and Esa Alhoniemi. 2000. “Clustering of the self-organizing map,” IEEE Transactions on Neural Networks, 11:586-6000.
311. Wainer, H. 1997. Visual Revelations: Graphical Tales of Fate and Deception from Napoleon Bonaparte to Ross Perot, New York: Copernicus/Springer-Verlag.
312. Wall, M. E., P. A. Dyck, and T. S. Brettin. 2001. “SVDMAN - singular value decomposition analysis of microarray data,” Bioinformatics, 17:566-568.
313. Wall, M. E., A. Rechtsteiner, and L. M. Rocha. 2003. “Chapter 5: Singular value decomposition and principal component analysis,” in A Practical Approach to Microarray Data Analysis, D. P. Berar, W. Dubitsky, M. Granzow, eds., Kluwer:Norwell, MA.
314. Wand, M. P. and M. C. Jones. 1995. Kernel Smoothing, London: Chapman and Hall.
315. Ward, J. H. 1963. “Hierarchical groupings to optimize an objective function,” Journal of the American Statistical Association, 58:236-244.
316. Webb, Andrew. 1999. Statistical Pattern Recognition, Oxford: Oxford University Press.
317. Wegman, E. J. 1986. Hyperdimensional Data Analysis Using Parallel Coordinates, Technical Report No. 1, George Mason University Center for Computational Statistics.
318. Wegman, E. 1988. “Computational statistics: A new agenda for statistical theory and practice,” Journal of the Washington Academy of Sciences, 78:310-322.
319. Wegman, E. J. 1990. “Hyperdimensional data analysis using parallel coordinates,” Journal of the American Statistical Association, 85:664-675.
320. Wegman, E. J. 1991. “The grand tour in k-dimensions,” Computing Science and Statistics:Proceedings of the 22nd Symposium on the Interface, 127-136.
321. Wegman, E. J. 2003. “Visual data mining,” Statistics in Medicine, 22:1383-1397.
322. Wegman, E. J. and D. Carr. 1993. “Statistical graphics and visualization,” in Handbook of Statistics, Vol 9, C. R. Rao, ed., The Netherlands: Elsevier Science Publishers, 857-958.
323. Wegman, E. J. and Q. Luo. 1997. “High dimensional clustering using parallel coordinates and the grand tour,” Computing Science and Statistics, 28:361-368.
324. Wegman, E. J. and J. Shen. 1993. “Three-dimensional Andrews plots and the grand tour,” Proceedings of the 25th Symposium on the Interface, 284-288.
325. Wegman, E. J. and J. Solka. 2002. “On some mathematics for visualizing high dimensional data,” Sankkya: The Indian Journal of Statistics, 64:429-452.
326. Wegman, E. J. and I. W. Wright. “Splines in statistics,” Journal of the American Statistical Association, 78:351-365.
327. Wegman, E. J., D. Carr, and Q. Luo. 1993. “Visualizing multivariate data,” in Multivariate Analysis: Future Directions, C. R. Rao, ed., The Netherlands: Elsevier Science Publishers, 423-466.
328. Wehrens, R., L. M. C. Buydens, C. Fraley, and A. E. Raftery. 2003. “Model-based clustering for image segmentation and large datasets via sampling,” Technical Report 424, Department of Statistics, University of Washington (to appear in Journal of Classification).
329. Weihs, C. 1993. “Multivariate exploratory data analysis and graphics: A tutorial,” Journal of Chemometrics, 7:305-340.
330. Weihs, C. and H. Schmidli. 1990. “OMEGA (Online multivariate exploratory graphical analysis): Routine searching for structure,” Statistical Science, 5:175-226.
331. West, M., C. Blanchette, H. Dressman, E. Huang, S. Ishida, R. Spang, H. Zuzan, J. A. Olson, Jr., J. R. Marks, and J. R. Nevins. 2001. “Predicting the clinical status of human breast cancer by using gene expression profiles,” Proceedings of the National Academy of Science, 98:11462-11467.
332. Wijk, J. J. van and H. van de Wetering. 1999. “Cushion treemaps: Visualization of hierarchical information,” in: G. Wills, De. Keim (eds.), Proceedings IEEE Symposium on Information Visualization (InfoVis’99), 73-78.
333. Wilhelm, A. F. X., E. J. Wegman, and J. Symanzik. 1999. “Visual clustering and classification: The Oronsay particle size data set revisited,” Computational Statistics, 14:109-146.
334. Wilk, M. B. and R. Gnanadesikan. 1968. “Probability plotting methods for the analysis of data,” Biometrika, 55:1-17.
335. Wilkinson, Leland. 1999. The Grammar of Graphics, New York: Springer-Verlag.
336. Wills, G. J. 1998. “An interactive view for hierarchical clustering,” Proceedings IEEE Symposium on Information Visualization, 26-31.
337. Witten, I. H., A. Moffat and T. C. Bell. 1994. Managing Gigabytes: Compressing and Indexing Documents and Images, New York, NY: van Nostrand Reinhold.
338. Wolfe, J. H. 1970. “Pattern clustering by multivariate mixture analysis,” Multivariate Behavioral Research, 5:329-350.
339. Yeung, K. Y. and W. L. Ruzzo. 2001. “Principal component analysis for clustering gene expression data,” Bioinformatics, 17:363-774
340. Yeung, K. Y., C. Fraley, A. Murua, A. E. Raftery, and W. L. Ruzzo. 2001. “Model-based clustering and data transformation for gene expression data,” Technical Report 396, Department of Statistics, University of Washington.
341. Young, Forrest W. 1985. “Multidimensional scaling,” in Encyclopedia of Statistical Sciences, Kotz, S. and Johnson, N. K. (eds.), 649-659.
342. Young, F. W., and Penny Rheingans. 1991. “Visualizing structure in high-dimensional multivariate data,” IBM Journal of Research and Development, 35:97-107.
343. Young, F. W., R. A. Faldowski, and M. M. McFarlane. 1993. “Multivariate statistical visualization,” in Handbook of Statistics, Vol 9, C. R. Rao, ed., The Netherlands:Elsevier Science Publishers, 959-998.
344. Young, G. and A. S. Householder. 1938. “Discussion of a set of points in terms of their mutual distances,” Psychometrika, 3:19-22.