In order to promote the growth of contemporary music and the reform of music, this article designs an improved collaborative filtering (CF) algorithm to solve the problem of sparse matrix in traditional recommendation algorithms. The data matrix is dimensionally reduced to find the nearest neighbor, so as to realize personalized recommendation of…

For efficiency, Computerized Adaptive Test (CAT) algorithm selects items with the maximum information, typically with a 50% probability of being answered correctly. However, examinees may not be satisfied if they only correctly answer 50% of the items. Researchers discovered that changing the item selection algorithms to choose easier items (i.e.,…

Developed a branch-and-bound algorithm that can be used to seriate a symmetric dissimilarity matrix by identifying a reordering of rows and columns of the matrix optimizing an anti-Robinson criterion. Computational results suggest that with respect to computational efficiency, the approach is generally competitive with dynamic programming. (SLD)

Proposes and explains a new mechanism for controlling the access requests in information protection systems that is based on Newton's interpolating polynomial. Access control matrices are discussed; single-key-lock systems are described; relevant algorithms are explained; and an example of the new mechanism is included. (10 references) (LRW)

The details of EM algorithms for maximum likelihood factor analysis are presented for both the exploratory and confirmatory models. An example is presented to demonstrate potential problems in other approaches to maximum likelihood factor analysis. (Author/JKS)

Discusses difficulties of producing computer assisted learning (CAL) software economically. Proposed as a solution, modular programing is illustrated by describing production of a matrix algebra package. Use of special CAL modules and facilities provided by subroutine libraries are cited, and development of a package to teach matrix theory is…

Presents principles for determining profile of a system user based on analysis of co-occurrence of index terms in queries and pertinent documents. A procedure for determining index term weights, the information value of which depends on the degree of homogeneity of system users, is introduced. Three references are cited. (EJS)

The suggestion that the IDIOSCAL model be fitted by the TUCKALS2 algorithm for three-way components analysis is examined. The claim that resulting coordinate matrices will be identical is supported when the data matrices are semidefinite. Counterexamples for indefinite matrices are also constructed. (SLD)

The first part of this four-part dissertation reviews conceptual and operational approaches to human communication systems. A new conceptual model for studying communication, General Algorithm for Studying Structuring in Complex Systems (GASSICS), is developed in the second part, and an operational method for applying GASSICS is presented in part…

The results of an algorithm which is designed to take a set of commonality coefficients, either real or manipulated, and, if possible, produce one or more sets of regressor correlations that are consistent with them are examined. A number of different ways of resolving the higher order commonality values into their lower orders were tried and the…

Commonality analysis is an attempt to understand the relative predictive power of the regressor variables, both individually and in combination. The squared multiple correlation is broken up into elements assigned to each individual regressor and to each possible combination of regressors. The elements have the property that the appropriate sums…

Presents methods of information query building in selective dissemination of information systems based on user's publications and examines possible compatibility between user's information queries and his publications. Methods of information query construction determined by logical operators AND, OR, NOT and set of weighted keywords are described.…