Monographs on statistics and applied probability

[1]  J. Nelder,et al.  Generalized Linear Models with Random Effects: Unified Analysis via H-likelihood , 2006 .

[2]  Raymond J. Carroll,et al.  Measurement error in nonlinear models: a modern perspective , 2006 .

[3]  Douglas H. Fisher,et al.  Knowledge Acquisition Via Incremental Conceptual Clustering , 1987, Machine Learning.

[4]  János Podani,et al.  New combinatorial clustering methods , 1989, Vegetatio.

[5]  Teuvo Kohonen,et al.  Self-organized formation of topologically correct feature maps , 2004, Biological Cybernetics.

[6]  Sw. Banerjee,et al.  Hierarchical Modeling and Analysis for Spatial Data , 2003 .

[7]  G. Molenberghs,et al.  Topics in Modelling of Clustered Data , 2002 .

[8]  A. D. Gordon,et al.  Partitions of Partitions , 1998 .

[9]  Bernard Van Cutsem,et al.  Indexed Dendrograms on random Dissimilarities , 1998 .

[10]  Kin-Nam Lau,et al.  A Nonlinear Programming Approach to Metric Unidimensional Scaling , 1998 .

[11]  Ross Sparks,et al.  Multivariate Process Monitoring Using the Dynamic Biplot , 1997 .

[12]  Shi-Jinn Horng,et al.  Parallel hierarchical clustering algorithms on processor arrays with a reconfigurable bus system , 1997, Pattern Recognit..

[13]  Pierre Hansen,et al.  Cluster analysis and mathematical programming , 1997, Math. Program..

[14]  Bradley P. Carlin,et al.  BAYES AND EMPIRICAL BAYES METHODS FOR DATA ANALYSIS , 1996, Stat. Comput..

[15]  F. B. Baulieu.  Two Variant Axiom Systems for Presence/Absence Based Dissimilarity Coefficients , 1997 .

[16]  J.-P. Benzécri,et al.  Rappel : Construction d'une classification ascendante hiérarchique par la recherche en chaîne des voisins réciproques , 1997 .

[17]  Douglas H. Fisher,et al.  Iterative Optimization and Simplification of Hierarchical Clusterings , 1996, J. Artif. Intell. Res..

[18]  J. V. Ness,et al.  Space-conserving agglomerative algorithms , 1996 .

[19]  J. Daws.  The analysis of free-sorting data: Beyond pairwise cooccurrences , 1996 .

[20]  V. Pliner.  Metric unidimensional scaling and global optimization , 1996 .

[21]  L. Hubert,et al.  Iterative projection strategies for the least-squares fitting of tree structures to proximity data , 1995 .

[22]  S. Joly,et al.  Three-way distances , 1995 .

[23]  F. Murtagh,et al.  The Kohonen self-organizing map method: An assessment , 1995 .

[24]  M. Wilkinson.  More on Reduced Consensus Methods , 1995 .

[25]  James C. Bezdek,et al.  On cluster validity for the fuzzy c-means model , 1995, IEEE Trans. Fuzzy Syst..

[26]  Clark F. Olson,et al.  Parallel Algorithms for Hierarchical Clustering , 1995, Parallel Comput..

[27]  Edwin Diday,et al.  Probabilist, possibilist and belief objects for knowledge analysis , 1995, Ann. Oper. Res..

[28]  Fionn Murtagh,et al.  Interpreting the Kohonen self-organizing feature map using contiguity-constrained clustering , 1995, Pattern Recognit. Lett..

[29]  B. Morgan,et al.  Non-uniqueness and Inversions in Cluster Analysis , 1995 .

[30]  Anil K. Jain,et al.  Artificial neural networks for feature extraction and multivariate data projection , 1995, IEEE Trans. Neural Networks.

[31]  D. Sankoff,et al.  An efficient algorithm for supertrees , 1995 .

[32]  A. D. Gordon.  Identifying genuine clusters in a classification , 1994 .

[33]  F. McMorris,et al.  The agreement metric for labeled binary trees. , 1994, Mathematical biosciences.

[34]  M. Wilkinson.  Common Cladistic Information and its Consensus Representation: Reduced Adams and Reduced Cladistic Consensus Trees and Profiles , 1994 .

[35]  Ru-Qin Yu,et al.  Cluster Analysis by Simulated Annealing , 1994, Comput. Chem..

[36]  Manabu Ichino,et al.  Generalized Minkowski metrics for mixed feature-type data analysis , 1994, IEEE Trans. Syst. Man Cybern..

[37]  Y. Takane,et al.  A generalization of GIPSCAL for the analysis of nonsymmetric data , 1994 .

[38]  P. Legendre,et al.  A Classification of Pure Malt Scotch Whiskies , 1994 .

[39]  Tandy J. Warnow,et al.  Kaikoura Tree Theorems: Computing the Maximum Agreement Subtree , 1993, Inf. Process. Lett..

[40]  A. Queiroz.  For Consensus (Sometimes) , 1993 .

[41]  A. Raftery,et al.  Model-based Gaussian and non-Gaussian clustering , 1993 .

[42]  Nathan Intrator,et al.  Objective function formulation of the BCM theory of visual cortical plasticity: Statistical connections, stability conditions , 1992, Neural Networks.

[43]  M. Steel.  The complexity of reconstructing trees from qualitative characters and subtrees , 1992 .

[44]  J. Hartigan,et al.  The runt test for multimodality , 1992 .

[45]  Shokri Z. Selim,et al.  A simulated annealing algorithm for the clustering problem , 1991, Pattern Recognit..

[46]  G. Sawitzki,et al.  Excess Mass Estimates and Tests for Multimodality , 1991 .

[47]  Ali S. Hadi,et al.  Finding Groups in Data: An Introduction to Chster Analysis , 1991 .

[48]  Gerardo Beni,et al.  A Validity Measure for Fuzzy Clustering , 1991, IEEE Trans. Pattern Anal. Mach. Intell..

[49]  Peter J. Rousseeuw,et al.  Fuzzy clustering algorithms based on the maximum likelihood principle , 1991 .

[50]  Gary Klein,et al.  Optimal clustering: A model and method , 1991 .

[51]  Edwin Diday,et al.  Symbolic clustering using a new dissimilarity measure , 1991, Pattern Recognit..

[52]  K. Bremer.  COMBINABLE COMPONENT CONSENSUS , 1990, Cladistics : the international journal of the Willi Hennig Society.

[53]  Xiaobo Li,et al.  Parallel Algorithms for Hierarchical Clustering and Cluster Validity , 1990, IEEE Trans. Pattern Anal. Mach. Intell..

[54]  A. D. Gordon.  Constructing dissimilarity measures , 1990 .

[55]  G. Brossier.  Piecewise hierarchical clustering , 1990 .

[56]  Teuvo Kohonen,et al.  The self-organizing map , 1990, Neurocomputing.

[57]  P. Legendre,et al.  A statistical framework to test the consensus of two nested classifications , 1990 .

[58]  B. Jaumard,et al.  Efficient algorithms for divisive hierarchical clustering with the diameter criterion , 1990 .

[59]  B. Mirkin.  Additive clustering and qualitative factor analysis methods for similarity matrices , 1989 .

[60]  S. Lewandowsky,et al.  Robust multidimensional scaling , 1989 .

[61]  Xiaobo Li,et al.  Parallel clustering algorithms , 1989, Parallel Comput..

[62]  Yoshiko Wakabayashi,et al.  A cutting plane algorithm for a clustering problem , 1989, Math. Program..

[63]  Edie M. Rasmussen,et al.  Efficiency of Hierarchic Agglomerative Clustering using the ICL Distributed array Processor , 1989, J. Documentation.

[64]  Mohamed A. Ismail,et al.  Multidimensional data clustering utilizing hybrid search strategies , 1989, Pattern Recognit..

[65]  Richard C. Dubes,et al.  Experiments in projection and clustering by simulated annealing , 1989, Pattern Recognit..

[66]  Edie M. Rasmussen,et al.  Searching and clustering of databases using the ICL distributed array processor , 1988, Parallel Comput..

[67]  G. W. Milligan,et al.  A study of standardization of variables in cluster analysis , 1988 .

[68]  J. Barthelemy,et al.  Thresholded consensus for n-trees , 1988 .

[69]  J. Bezdek,et al.  Recent convergence results for the fuzzy c-means clustering algorithms , 1988 .

[70]  Jun S. Huang,et al.  Statistical theory of edge detection , 1988, Comput. Vis. Graph. Image Process..

[71]  E. Fowlkes,et al.  Variable selection in clustering , 1988 .

[72]  Edwin Diday,et al.  Generating rules for expert systems from observations , 1988, Pattern Recognit. Lett..

[73]  P. Rousseeuw.  Silhouettes: a graphical aid to the interpretation and validation of cluster analysis , 1987 .

[74]  M. P. Windham.  Parameter modification for clustering criteria , 1987 .

[75]  J. Ross Quinlan,et al.  Simplifying decision trees , 1987, Int. J. Hum. Comput. Stud..

[76]  Richard A. Becker,et al.  Brushing scatterplots , 1987 .

[77]  F. McMorris,et al.  The median procedure for n-trees , 1986 .

[78]  J. Gower,et al.  Metric and Euclidean properties of dissimilarity coefficients , 1986 .

[79]  E. Diday.  Une représentation visuelle des classes empiétantes: les pyramides , 1986 .

[80]  H. Bock.  On some significance tests in cluster analysis , 1985 .

[81]  A. D. Gordon,et al.  Obtaining common pruned trees , 1985 .

[82]  G. W. Milligan,et al.  An examination of procedures for determining the number of clusters in a data set , 1985 .

[83]  Dominique Peeters,et al.  A comparison of two dual-based procedures for solving the p-median problem , 1985 .

[84]  Guangzhou Zeng,et al.  A test for spatial randomness based on k-NN distances , 1985, Pattern Recognit. Lett..

[85]  E. Aronson,et al.  Theory and method , 1985 .

[86]  Fionn Murtagh,et al.  A Survey of Algorithms for Contiguity-Constrained Clustering and Related Problems , 1985, Comput. J..

[87]  Ronald L. Graham,et al.  On the History of the Minimum Spanning Tree Problem , 1985, Annals of the History of Computing.

[88]  William C. Halperin,et al.  Unclassed matrix shading and optimal ordering in hierarchical cluster analysis , 1984 .

[89]  G. Furnas.  The generation of random, binary unordered trees , 1984 .

[90]  Ralph Stinebrickner,et al.  s-Consensus trees and indices , 1984 .

[91]  Wayne S. DeSarbo,et al.  Constrained classification: The use of a priori information in cluster analysis , 1984 .

[92]  Fionn Murtagh,et al.  Counting dendrograms: A survey , 1984, Discret. Appl. Math..

[93]  P. Rubin.  Generating random points in a polytope , 1984 .

[94]  B. Fichet,et al.  Structure géométrique des principaux indices de dissimilarité sur signes de présence-absence , 1984 .

[95]  Fionn Murtagh,et al.  A Survey of Recent Advances in Hierarchical Clustering Algorithms , 1983, Comput. J..

[96]  L C Morey,et al.  A Comparison of Cluster Analysis Techniques Withing a Sequential Validation Framework. , 1983, Multivariate behavioral research.

[97]  P. Arabie,et al.  Indclus: An individual differences generalization of the adclus model and the mapclus algorithm , 1983 .

[98]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[99]  J. B. Kruskal,et al.  Icicle Plots: Better Displays for Hierarchical Clustering , 1983 .

[100]  D. A. Neumann.  Faithful consensus methods for n-trees , 1983 .

[101]  Ryszard S. Michalski,et al.  Automated Construction of Classifications: Conceptual Clustering Versus Numerical Taxonomy , 1983, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[102]  Anil K. Jain,et al.  A test of randomness based on the minimal spanning tree , 1983, Pattern Recognit. Lett..

[103]  S. Régnier,et al.  Sur quelques aspects mathématiques des problèmes de classification automatique , 1983 .

[104]  Frank Plastria,et al.  Non-hierarchical clustering with masloc , 1983, Pattern Recognit..

[105]  Z. Hubálek.  COEFFICIENTS OF ASSOCIATION AND SIMILARITY, BASED ON BINARY (PRESENCE‐ABSENCE) DATA: AN EVALUATION , 1982 .

[106]  Tamar Peli,et al.  A study of edge detection algorithms , 1982, Comput. Graph. Image Process..

[107]  F. Marriott.  Optimization methods of cluster analysis , 1982 .

[108]  W. Welch.  Algorithmic complexity: three NP- hard problems in computational statistics , 1982 .

[109]  F. Rohlf.  Consensus indices for comparing classifications , 1982 .

[110]  S. P. Lloyd,et al.  Least squares quantization in PCM , 1982, IEEE Trans. Inf. Theory.

[111]  Gildas Brossier.  Classification hiérarchique à partir de matrices carrées non symétriques , 1982 .

[112]  R. Sibson,et al.  Studies in the robustness of multidimensional scaling: euclidean models and simulation studies , 1981 .

[113]  Fred R. McMorris,et al.  Consensusn-trees , 1981 .

[114]  O. Frank,et al.  On probability distributions of single-linkage dendrograms , 1981 .

[115]  F. Marcotorchino,et al.  Agr?gation des similarit?s en classification automatique , 1981 .

[116]  D. Matula,et al.  Properties of Gabriel Graphs Relevant to Geographic Variation Research and the Clustering of Points in the Plane , 2010 .

[117]  G. W. Milligan,et al.  A NOTE ON PROCEDURES FOR TESTING THE QUALITY OF A CLUSTERING OF A SET OF OBJECTS , 1980 .

[118]  G. W. Milligan,et al.  An examination of the effect of six types of error perturbation on fifteen clustering algorithms , 1980 .

[119]  I. Lerman.  Combinatorial analysis in the statistical treatment of behavioral data , 1980 .

[120]  R. Blashfield,et al.  A Nearest-Centroid Technique for Evaluating the Minimum-Variance Clustering Procedure. , 1980 .

[121]  Pierre Hansen,et al.  Bicriterion Cluster Analysis , 1980, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[122]  Youji Fukada,et al.  Spatial clustering procedures for region analysis , 1980, Pattern Recognit..

[123]  Robert M. Gray,et al.  An Algorithm for Vector Quantizer Design , 1980, IEEE Trans. Commun..

[124]  S. Zamir,et al.  Lower Rank Approximation of Matrices by Least Squares With Any Choice of Weights , 1979 .

[125]  G. Milligan.  Ultrametric hierarchical clustering algorithms , 1979 .

[126]  H. Crowder,et al.  Cluster Analysis: An Application of Lagrangian Relaxation , 1979 .

[127]  A. D. Gordon.  A measure of the agreement between rankings , 1979 .

[128]  J. A. Hartigan,et al.  A k-means clustering algorithm , 1979 .

[129]  L. A. Goodman,et al.  Measures of association for cross classifications , 1979 .

[130]  J. Graef,et al.  Using Distance Information in the Design of Large Multidimensional Scaling Experiments , 1979 .

[131]  Jack Bryant,et al.  On the clustering of multidimensional pictorial data , 1979, Pattern Recognit..

[132]  J. Friedman,et al.  Multivariate generalizations of the Wald--Wolfowitz and Smirnov two-sample tests , 1979 .

[133]  Donald Erlenkotter,et al.  A Dual-Based Procedure for Uncapacitated Facility Location , 1978, Oper. Res..

[134]  M. Williamson.  THE ORDINATION OF INCIDENCE DATA , 1978 .

[135]  M. Roubens.  Pattern classification problems and fuzzy sets , 1978 .

[136]  C. W. Harper.  Groupings by locality in community ecology and paleoecology: tests of significance , 1978 .

[137]  P. Hansen,et al.  Complete-Link Cluster Analysis by Graph Coloring , 1978 .

[138]  D. Rosen.  Vicariant Patterns and Historical Explanation in Biogeography , 1978 .

[139]  D. Binder.  Bayesian cluster analysis , 1978 .

[140]  Ludovic Lebart,et al.  Programme d'agrégation avec contraintes , 1978 .

[141]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[142]  R. Saunders,et al.  Poisson limits for a clustering model of strauss , 1977, Journal of Applied Probability.

[143]  A. Tversky.  Features of Similarity , 1977 .

[144]  C. F. Banfield,et al.  Algorithm AS 113: A Transfer for Non-Hierarchical Classification , 1977 .

[145]  Linda M. Doherty,et al.  Interscal: A TSO FORTRAN IV Program for Subject Computer Interactive Multidimensional Scaling‡ , 1977 .

[146]  P. Mehringer,et al.  Postglacial history of Lost Trail Pass Bog, Bitterroot Mountains, Montana , 1977 .

[147]  D. Defays,et al.  An Efficient Algorithm for a Complete Link Method , 1977, Comput. J..

[148]  H. Birks.  DISTRIBUTION OF EUROPEAN PTERIDOPHYTES - NUMERICAL-ANALYSIS , 1976 .

[149]  R. F. Ling,et al.  Probability Tables for Cluster Analysis Based on a Theory of Random Graphs , 1976 .

[150]  Theodosios Pavlidis,et al.  Picture Segmentation by a Tree Traversal Algorithm , 1976, JACM.

[151]  F. Kelly,et al.  A note on Strauss's model for clustering , 1976 .

[152]  Moonja P. Kim,et al.  The Method of Sorting as a Data-Gathering Procedure in Multivariate Research. , 1975, Multivariate behavioral research.

[153]  F. Marriott.  389: Separating Mixtures of Normal Distributions , 1975 .

[154]  Keinosuke Fukunaga,et al.  A Branch and Bound Clustering Algorithm , 1975, IEEE Transactions on Computers.

[155]  D. J. Strauss.  A model for clustering , 1975 .

[156]  R. F. Ling.  An exact probability distribution on the connectivity of random graphs , 1975 .

[157]  J. Hartigan.  Clustering Algorithms , 1975 .

[158]  J. Gower.  Maximal predictive classification , 1974 .

[159]  R. Shepard.  Representation of structure in similarity data: Problems and prospects , 1974 .

[160]  I. Spence,et al.  Single subject incomplete designs for nonmetric multidimensional scaling , 1974 .

[161]  John W. Tukey,et al.  A Projection Pursuit Algorithm for Exploratory Data Analysis , 1974, IEEE Transactions on Computers.

[162]  M. Rao,et al.  An Algorithm for the M-Median Plant Location Problem , 1974 .

[163]  J. Bezdek.  Numerical taxonomy with fuzzy sets , 1974 .

[164]  D. Hawkins,et al.  Optimal zonation of digitized sequential data , 1973 .

[165]  William E. Wright,et al.  A formalization of cluster analysis , 1973, Pattern Recognit..

[166]  D. N. Sparks.  Euclidean Cluster Analysis , 1973 .

[167]  S. Boorman,et al.  Metrics on spaces of finite trees , 1973 .

[168]  J. C. Dunn,et al.  A Fuzzy Relative of the ISODATA Process and Its Use in Detecting Compact Well-Separated Clusters , 1973 .

[169]  Robin Sibson,et al.  SLINK: An Optimally Efficient Algorithm for the Single-Link Cluster Method , 1973, Comput. J..

[170]  L. Bobisud,et al.  A METRIC FOR CLASSIFICATIONS , 1972 .

[171]  H. H. Birks.  STUDIES IN THE VEGETATIONAL HISTORY OF SCOTLAND , 1972 .

[172]  R. Webster,et al.  COMPUTER‐BASED SOIL MAPPING OF SMALL AREAS FROM SAMPLE DATA , 1972 .

[173]  Robert F. Ling,et al.  On the theory and construction of k-clusters , 1972, Comput. J..

[174]  William M. Rand,et al.  Objective Criteria for the Evaluation of Clustering Methods , 1971 .

[175]  J. Lingoes.  Some boundary conditions for a monotone analysis of symmetric matrices , 1971 .

[176]  A. Scott,et al.  Clustering methods based on likelihood ratio criteria. , 1971 .

[177]  J. V. Ness,et al.  Admissible clustering procedures , 1971 .

[178]  Enrique H. Ruspini,et al.  Numerical methods for fuzzy clustering , 1970, Inf. Sci..

[179]  F. Rohlf.  Adaptive Hierarchical Clustering Schemes , 1970 .

[180]  A. J. Cole,et al.  An Improved Algorithm for the Jardine-Sibson Method of Generating Overlapping Clusters , 1970, Computer/law journal.

[181]  R. Sokal,et al.  A New Statistical Approach to Geographic Variation Analysis , 1969 .

[182]  Enrique H. Ruspini,et al.  A New Approach to Clustering , 1969, Inf. Control..

[183]  Hrishikesh D. Vinod Mathematica.  Integer Programming and the Theory of Grouping , 1969 .

[184]  F. Rohlf,et al.  Tests for Hierarchical Structure in Random Data Sets , 1968 .

[185]  R. McCammon.  The Dendrograph: A New Tool for Correlation , 1968 .

[186]  G. N. Lance,et al.  Note on a New Information-Statistic Classificatory Program , 1968, Comput. J..

[187]  Robin Sibson,et al.  The Construction of Hierarchic and Non-Hierarchic Classifications , 1968, Comput. J..

[188]  J. Hartigan.  REPRESENTATION OF SIMILARITY MATRICES BY TREES , 1967 .

[189]  H. P. Friedman,et al.  On Some Invariant Criteria for Grouping Data , 1967 .

[190]  J. Gower.  A comparison of some methods of cluster analysis. , 1967, Biometrics.

[191]  S. C. Johnson.  Hierarchical clustering schemes , 1967, Psychometrika.

[192]  R. Crawford,et al.  A Rapid Multivariate Method for the Detection and Classification of Groups of Ecologically Related Species , 1967 .

[193]  C. J. Jardine,et al.  The structure and construction of taxonomic hierarchies , 1967 .

[194]  K. Matusita.  Classification based on distance in multivariate Gaussian cases , 1967 .

[195]  J. MacQueen.  Some methods for classification and analysis of multivariate observations , 1967 .

[196]  L. Mcquitty.  Similarity Analysis by Reciprocal Pairs for Discrete and Continuous Data , 1966 .

[197]  J. Gower.  Some distance properties of latent root and vector methods used in multivariate analysis , 1966 .

[198]  D. Rogers,et al.  A Graph Theory Model for Systematic Biology, with an Example for the Oncidiinae (Orchidaceae) , 1966 .

[199]  A W EDWARDS,et al.  A METHOD FOR CLUSTER ANALYSIS. , 1965, Biometrics.

[200]  W. B. Kendrick,et al.  COMPLEXITY AND DEPENDENCE IN COMPUTER TAXONOMY , 1965 .

[201]  J. Kruskal.  Nonmetric multidimensional scaling: A numerical method , 1964 .

[202]  J. Kruskal.  Multidimensional scaling by optimizing goodness of fit to a nonmetric hypothesis , 1964 .

[203]  W. Kendrick,et al.  COMPUTER TAXONOMY IN THE FUNGI IMPERFECTI , 1964 .

[204]  R. M. Johnson.  On a theorem stated by eckart and young , 1963 .

[205]  L. Mcquitty.  Rank Order Typal Analysis , 1963 .

[206]  J. H. Ward.  Hierarchical Grouping to Optimize an Objective Function , 1963 .

[207]  R N SHEPARD,et al.  Analysis of Proximities as a Technique for the Study of Information Processing in Man1 , 1963, Human factors.

[208]  R. Shepard.  The analysis of proximities: Multidimensional scaling with an unknown distance function. II , 1962 .

[209]  R. Sokal,et al.  THE COMPARISON OF DENDROGRAMS BY OBJECTIVE METHODS , 1962 .

[210]  S. F. Buck.  A Method of Estimation of Missing Values in Multivariate Data Suitable for Use with an Electronic Computer , 1960 .

[211]  Louis L. McQuitty,et al.  Hierarchical Linkage Analysis for the Isolation of Types , 1960 .

[212]  D. J. Harberd.  Association-Analysis in Plant Communities , 1960, Nature.

[213]  Walter D. Fisher.  On Grouping for Maximum Homogeneity , 1958 .

[214]  P. Sneath.  The application of computers to taxonomy. , 1957, Journal of general microbiology.

[215]  J. Kruskal.  On the shortest spanning subtree of a graph and the traveling salesman problem , 1956 .

[216]  K. Florek,et al.  Sur la liaison et la division des points d'un ensemble fini , 1951 .

[217]  H. B. Mann,et al.  On a Test of Whether one of Two Random Variables is Stochastically Larger than the Other , 1947 .

[218]  J. Gilmour.  A Taxonomic Problem , 1937, Nature.

[219]  C. Eckart,et al.  The approximation of one matrix by another of lower rank , 1936 .

[220]  H. Hotelling.  Analysis of a complex of statistical variables into principal components. , 1933 .

[221]  Karl Pearson F.R.S..  LIII. On lines and planes of closest fit to systems of points in space , 1901 .