This paper proposes an online learning platform learner DM method based on the improved fuzzy C clustering (FCM) algorithm, constructs a learner feature database, and combines clustering analysis and SPSS statistical methods to statistically summarize the big data of law, thus improving the deficiencies of static and absolute classification of…

The Indian Institute of Science is proud to host the fully in-person sixteenth iteration of the International Conference on Educational Data Mining (EDM) during July 11-14, 2023. EDM is the annual flagship conference of the International Educational Data Mining Society. The theme of this year's conference is "Educational data mining for…

Genetic algorithms, a class of nondeterministic algorithms in which the role of chance makes the precise nature of a solution impossible to guarantee, seem to be well suited to combinatorial-optimization problems in information retrieval. Provides an introduction to techniques and characteristics of genetic algorithms and illustrates their…

Describes a genetic algorithm (GA) that assigns weights to query terms in a ranked-output document retrieval system. Experiments showed the GA often found weights slightly superior to those produced by deterministic weighting (F4). Many times, however, the two methods gave the same results and sometimes the F4 results were superior, indicating…

Describes the use of PROLOG to program knowledge-based information retrieval systems, in which the knowledge contained in a document is translated into machine processable logic. Several examples of the resulting search process, and the program rules supporting the process, are given. (10 references) (CLB)

Discussion of knowledge management for electronic data focuses on creating a high quality similarity ranking algorithm. Topics include similarity ranking and unstructured data management; searching, categorization, and summarization of documents; query evaluation; considering sentences in addition to keywords; and vector models. (LRW)

Compares the performance of inverted and signature file organizations in handling incrementally specified Boolean queries to an information retrieval system. The discussion covers the impact of more sophisticated signature file organizations, related problems, and possible future work. (65 references) (CLB)

Discussion of index construction for large text collections highlights a new indexing algorithm designed to create large compressed inverted indexes "in situ." Topics include a computational model, inversion, index compression, merging, experimental test results, effect on retrieval performance, memory restrictions, and dynamic…

Presents a model for the a priori analysis of natural language queries which uses an algorithm to transform the query into a logical pattern that is used to determine the answerability of the query. The results of testing by a prototype system implemented in PROLOG are discussed. (20 references) (CLB)

Describes the use of a highly parallel array processor for pattern matching operations in a bibliographic retrieval system. The discussion covers the hardware and software features of the processor, the pattern matching algorithm used, and the results of experimental tests of the system. (37 references) (Author/CLB)

Describes a study funded by the Commission of the European Community that applied document retrieval algorithms to the "Excerpta Medica" database using the EMTREE thesaurus. Nonhierarchical relations were added to enrich the thesaurus, and document ranking is discussed in terms of the conceptual distance between the documents and the…

Proposes that topic representations should consist of excerpts from domain thesaurus, generated by spreading activation technique. Algorithm for generating excerpts is outlined and exemplified, and problem of assessing resemblance between two excerpts is discussed. Whether existing thesauri are adequate for this purpose is questioned, and ideas…

Describes the three subsystems of an information retrieval system (document descriptions, queries, and matching algorithms) and argues that the interdependency of these subsystems requires adaptation for the system to perform when any component changes. An algorithm for redescribing documents, in response to changes in queries and retrieval rules,…

Describes the design and implementation of a prototype visualization system, AuthorLink, to enhance author searching. AuthorLink is based on author co-citation analysis and visualization mapping algorithms. AuthorLink produces interactive author maps in real time from a database of 1.26 million records supplied by the Institute for Scientific…

Reports on the use of stemming for Slovene language documents and queries in free-text retrieval systems and demonstrates that an appropriate stemming algorithm results in an increase in retrieval effectiveness when compared with nonstemming processing. A comparison is made with stemming of English versions of the same documents and queries. (24…