Data mining has been successfully and widely utilized in educational information systems, and an important research field has been formed, which is educational data mining. Process mining inherits the characteristics of data mining which can not only use historical data in the system to analyze learning behavior and predict academic performance,…

THE STUDY IS CONCERNED WITH THE LINGUISTIC PROBLEM INVOLVED IN TEXT COMPRESSION--EXTRACTING, INDEXING, AND THE AUTOMATIC CREATION OF SPECIAL-PURPOSE CITATION DICTIONARIES. IN SPITE OF EARLY SUCCESS IN USING LARGE-SCALE COMPUTERS TO AUTOMATE CERTAIN HUMAN TASKS, THESE PROBLEMS REMAIN AMONG THE MOST DIFFICULT TO SOLVE. ESSENTIALLY, THE PROBLEM IS TO…

Describes the theoretical framework of a retrieval system that uses data structures called bitmaps to improve search algorithms for medium-sized systems. Information retrieval systems that contain the full text of the documents are discussed, and the use of inverted files such as concordances for small texts is explained. (24 references) (LRW)

The set reduction algorithm is based on set theory and Boolean algebra rather than the graph-theoretic approach. Time trials with a small file of organic chemical structures indicate that the algorithm can be economically used for substructure (or complete structure) sequential searches on a file containing 30,000-50,000 computer-coded structures.…

Discusses the problem of duplicate citations resulting from file overlaps in multidatabase searching and shows that such duplicates could be identified automatically and eliminated by a host computer as a complementary service to online retrieval. Steps involved in the realization of this service are described, and 11 references are listed. (RBF)

This study of ranking algorithms used in a Boolean environment is based on an evaluation of factors affecting document ranking by information retrieval systems. The algorithms were decomposed into term weighting schemes and similarity measures, representatively selected from those known to exist in information retrieval environments, before being…

Investigates applicability of inverted file processing in magnetic bubble memories by presenting four magnetic bubble memory models as storage mediums: one based on a major-minor loop configuration; one utilizing a decoder design on a magnetic bubble memory chip; and two based on different structural configurations of the first two. (MBR)

Describes WebACE, the architecture of a client-side agent that explores and classifies Web documents in clusters automatically and discusses the details of the algorithms within its key components. Highlights principal direction divisive partitioning (PDDP), a scalable hierarchical clustering algorithm; compares it to other clustering methods; and…

Questions of the automation of input, output and data processing on computers in systems of information services are covered in the discussion of peculiarities of applied computers and processed information, general characteristics of processing algorithms and problems of information input and output. This is followed by a discussion of the…

This paper addresses the problem of data management techniques for efficiently retrieving requested subsets of large data sets from mass storage devices. Describes the development of algorithms and software that facilitate the partitioning of a large data set into multiple "clusters" that reflect their expected access. (Author/JKP)

Response time in large, inverted file document retrieval systems is determined by time required to access files of document identifiers on disk and process a Boolean search request. A specialized computer system has been devised that can perform a complicated sample search involving 70 terms and over 60,000 document references 12 to 60 times…

THE INVESTIGATION IS CONCERNED WITH THE DEVELOPMENT OF AUTOMATIC INDEXING, ABSTRACTING, AND EXTRACTING SYSTEMS. BASIC INVESTIGATIONS IN ENGLISH MORPHOLOGY, PHONETICS, AND SYNTAX ARE PURSUED AS NECESSARY MEANS TO THIS END. IN THE FIRST SECTION THE THEORY AND DESIGN OF THE "SENTENCE DICTIONARY" EXPERIMENT IN AUTOMATIC EXTRACTION IS OUTLINED. SOME OF…

The goal of this project was to find ways of enhancing the efficiency of searching machine readable data bases. Ways are sought to transfer to the computer some of the tasks that are normally performed by the user, i.e., to further automate information retrieval. Four experiments were conducted to test the feasibility of a sequential processing…

A relational data system (RDS) is one that has the capability not only to retrieve specific facts but also the ability to deduce facts that are implicit rather than explicit in the data base. The study investigated the application of RDS technology to intelligence data processing. RDS technology and the nature of intelligence data processing are…

The twenty-second in a series, this report describes research in information organization and retrieval conducted by the Department of Computer Science at Cornell University. The report covers work carried out during the period summer 1972 through summer 1974 and is divided into four parts: indexing theory, automatic content analysis, feedback…