In order to better grasp the needs of library users and provide them with more accurate knowledge services, combining the characteristics of university libraries, this article applies library small data to personalized recommendation and proposes a small data fusion algorithm model for library personalized recommendation. This model combines the…

Categorical data become increasingly ubiquitous in the modern big data era. In this dissertation, we propose novel statistical learning and inference methods for large-scale categorical data, focusing on latent variable models and their applications to psychometrics. In psychometric assessments, the subjects' underlying aptitude often cannot be…

Scores on different items of a test are often combined linearly (sometimes with equal weights) to form the test score, mainly for the sake of computational convenience. In this paper, the author studies the consequences of doing this, and also studies the problems involved in finding a suitable linear combination. (Author/RK)

The main purpose of this paper is to describe and discuss the mechanism and properties of a computer program which can achieve an analogous segmentation of letter strings on punched cards. (Author)

Describes research that examined the feasibility of automatically deriving name access points from machine readable title pages of English language monographs. An algorithm for automatic derivation is presented and results using the algorithm are compared to traditionally cataloged name access points. The implications for bibliographic standards…

A model for the analysis of paired comparison data is presented which is metric, mathematically tractable, and has an exact algebraic solution. (Authors/MB)

Discusses the notion that knowledge grows exponentially and describes its growth mathematically by an exponential function. Growth patterns in subfields of knowledge or research areas are described citing related research. Interpretation of growth rate statistics and forecasts are included. Thirty-three references and statistics used for graphs…

Describes fast, dynamic update algorithms for document retrieval systems. B-trees are discussed; the M-B-T file directory structure is explained; insertions and deletions in inverted files are described; and performance evaluation is discussed. An appendix provides the formal definition of an M-B-T directory. (Contains 18 references.) (LRW)

Presents a relevance-feedback strategy that improves the effectiveness of information-retrieval systems based on back-propagation of the relevance of retrieved documents using an algorithm developed in a neural approach. Describes a neural information-retrieval model and reports results obtained with the algorithm in three different environments.…

A method for checking college students' completion of program and graduation requirements by computer is outlined. The procedure operates by having degree programs defined in tables and is simple enough to be achieved by junior program staff without the need for programmers and analysts. (MSE)

Presents a mathematical theory that can be used to define concentration places of objects within unordered classes. The application to research on the evolution of journals and subject areas is illustrated, and an online method of calculating concentration evolution is described. (1 references) (CLB)

The present paper discusses two rather different types of partitioning techniques that still have the same property of monotone invariance. (Author)

The intent of this paper is to generalize the min and max clustering procedures in such a way that the assumption of a symmetric similarity measure is unnecessary. (Author)

Paper is an attempt to extend the hierarchical partitioning algorithms and to emphasize a general connection between these clustering procedures and the mathematical theory of lattices. (Author)

Results of study investigating human memory organization in processing of computer programming languages indicate that algorithmic logic segments form a cognitive organizational structure in memory for programs. Statement indentation and internal program documentation did not enhance organizational process of recall of statements in five Fortran…