A new method for automatic indexing and retrieval is described. The approach is to take advantage of implicit higher-order structure in the association of terms with documents (“semantic structure”) in order to improve the detection of relevant documents on the basis of terms found in queries. The particular technique used is singular-value decomposition, in which a large term by document matrix is decomposed into a set of ca. 100 orthogonal factors from which the original matrix can be approximated by linear combination. Documents are represented by ca. 100 item vectors of factor weights. Queries are represented as pseudo-document vectors formed from weighted combinations of terms, and documents with supra-threshold cosine values are returned. initial tests find this completely automatic method for retrieval to be promising.

/pdf/indexing-by-latent-semantic-analysis-4kzjkh4lw5.pdf

Indexing by Latent Semantic Analysis

In this article we discuss our experience designing and implementing a statistical computing language. In developing this new language, we sought to combine what we felt were useful features from two existing computer languages. We feel that the new language provides advantages in the areas of portability, computational efficiency, memory management, and scoping.

R: A Language for Data Analysis and Graphics

Today's Web-enabled deluge of electronic data calls for automated methods of data analysis. Machine learning provides these, developing methods that can automatically detect patterns in data and then use the uncovered patterns to predict future data. This textbook offers a comprehensive and self-contained introduction to the field of machine learning, based on a unified, probabilistic approach. The coverage combines breadth and depth, offering necessary background material on such topics as probability, optimization, and linear algebra as well as discussion of recent developments in the field, including conditional random fields, L1 regularization, and deep learning. The book is written in an informal, accessible style, complete with pseudo-code for the most important algorithms. All topics are copiously illustrated with color images and worked examples drawn from such application domains as biology, text processing, computer vision, and robotics. Rather than providing a cookbook of different heuristic methods, the book stresses a principled model-based approach, often using the language of graphical models to specify models in a concise and intuitive way. Almost all the models described have been implemented in a MATLAB software package--PMTK (probabilistic modeling toolkit)--that is freely available online. The book is suitable for upper-level undergraduates with an introductory-level college math background and beginning graduate students.

Machine Learning : A Probabilistic Perspective

Array programming provides a powerful, compact and expressive syntax for accessing, manipulating and operating on data in vectors, matrices and higher-dimensional arrays. NumPy is the primary array programming library for the Python language. It has an essential role in research analysis pipelines in fields as diverse as physics, chemistry, astronomy, geoscience, biology, psychology, materials science, engineering, finance and economics. For example, in astronomy, NumPy was an important part of the software stack used in the discovery of gravitational waves1 and in the first imaging of a black hole2. Here we review how a few fundamental array concepts lead to a simple and powerful programming paradigm for organizing, exploring and analysing scientific data. NumPy is the foundation upon which the scientific Python ecosystem is constructed. It is so pervasive that several projects, targeting audiences with specialized needs, have developed their own NumPy-like interfaces and array objects. Owing to its central position in the ecosystem, NumPy increasingly acts as an interoperability layer between such array computation libraries and, together with its application programming interface (API), provides a flexible framework to support the next decade of scientific and industrial analysis. NumPy is the primary array programming library for Python; here its fundamental concepts are reviewed and its evolution into a flexible interoperability layer between increasingly specialized computational libraries is discussed.

/pdf/array-programming-with-numpy-31s3jl24ra.pdf

Array programming with NumPy

MARK provides parameter estimates from marked animals when they are re-encountered at a later time as dead recoveries, or live recaptures or re-sightings. The time intervals between re-encounters do not have to be equal. More than one attribute group of animals can be modelled. The basic input to MARK is the encounter history for each animal. MARK can also estimate the size of closed populations. Parameters can be constrained to be the same across re-encounter occasions, or by age, or group, using the parameter index matrix. A set of common models for initial screening of data are provided. Time effects, group effects, time x group effects and a null model of none of the above, are provided for each parameter. Besides the logit function to link the design matrix to the parameters of the model, other link functions include the log—log, complimentary log—log, sine, log, and identity. The estimates of model parameters are computed via numerical maximum likelihood techniques. The number of parameters that are...

https://www.tandfonline.com/doi/pdf/10.1080/00063659909477239

Program MARK: survival estimation from populations of marked animals

/pdf/computer-methods-for-mathematical-computations-1oc1v508v1.pdf

Computer methods for mathematical computations

In principle, the exponential of a matrix could be computed in many ways. Methods involving approximation theory, differential equations, the matrix eigenvalues, and the matrix characteristic polyn...

/pdf/nineteen-dubious-ways-to-compute-the-exponential-of-a-matrix-49qnou6xyl.pdf

Nineteen Dubious Ways to Compute the Exponential of a Matrix, Twenty-Five Years Later ⁄

/pdf/nineteen-dubious-ways-to-compute-the-exponential-of-a-matrix-10fp740cmm.pdf

Nineteen Dubious Ways to Compute the Exponential of a Matrix

General matrices Band matrices Positive definite matrices Positive definite band matrices Symmetric Indefinite Matrices Triangular matrices Tridiagonal matrices The Cholesky decomposition The QR decomposition Updating QR and Cholesky decompositions The singular value decomposition References Basic linear algebra subprograms Timing data Program listings BLA Listings.

LINPACK Users' Guide

A new method, called the $QZ$ algorithm, is presented for the solution of the matrix eigenvalue problem $Ax = \lambda Bx$ with general square matrices A and B. Particular attention is paid to the degeneracies which result when B is singular. No inversions of B or its submatrices are used. The algorithm is a generalization of the $QR$ algorithm, and reduces to it when $B = I$. Problems involving higher powers of $\lambda $ are also mentioned.

Cleve B. Moler

Papers

Computer methods for mathematical computations

Nineteen Dubious Ways to Compute the Exponential of a Matrix, Twenty-Five Years Later ⁄

Nineteen Dubious Ways to Compute the Exponential of a Matrix

LINPACK Users' Guide

An Algorithm for Generalized Matrix Eigenvalue Problems.