NotesFAQContact Us
Collection
Advanced
Search Tips
What Works Clearinghouse Rating
Showing 1,096 to 1,110 of 2,728 results Save | Export
Peer reviewed Peer reviewed
Stejic, Zoran; Takama, Yasufumi; Hirota, Kaoru – Information Processing & Management, 2003
Proposes local similarity pattern (LSP) as a new method for computing digital image similarity. Topics include optimizing similarity computation based on genetic algorithm; relevance feedback; and an evaluation of LSP on five databases that showed an increase in retrieval precision over other methods for computing image similarity. (Author/LRW)
Descriptors: Algorithms, Databases, Evaluation Methods, Genetics
Peer reviewed Peer reviewed
Navarro, Gonzalo; Baeza-Yates, Ricardo; Arcoverde, Joao Marcelo Azevedo – Journal of the American Society for Information Science and Technology, 2003
Presents the architecture and algorithms behind Matchsimile, an approximate string matching lookup tool designed for extracting person and company names from large texts. Highlights include name formation rules, defining the search problem, system architecture, recognizing pattern words, recognizing whole patterns, and performance. (Author/MES)
Descriptors: Algorithms, Computer Software Development, Electronic Text, Information Retrieval
Peer reviewed Peer reviewed
Losada, David E.; Barreiro, Alvaro – Journal of the American Society for Information Science and Technology, 2003
Proposes an approach to incorporate term similarity and inverse document frequency into a logical model of information retrieval. Highlights include document representation and matching; incorporating term similarity into the measure of distance; new algorithms for implementation; inverse document frequency; and logical versus classical models of…
Descriptors: Algorithms, Information Retrieval, Logic, Measurement Techniques
Peer reviewed Peer reviewed
Kaufman, David – Electronic Library, 2002
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)
Descriptors: Algorithms, Classification, Information Retrieval, Online Searching
Peer reviewed Peer reviewed
Svenonius, Elaine; Molto, Mavis – Journal of the American Society for Information Science, 1990
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…
Descriptors: Algorithms, Automation, Machine Readable Cataloging, Monographs
Schmid, Richard F.; Gerlach, Vernon S. – Performance Improvement Quarterly, 1990
Discusses the role of algorithms in the design of computer-assisted instruction (CAI). Structural and processing characteristics of algorithms are analyzed, instructional algorithms are explained, empirically based design rules are presented, and the use of instructional algorithms in artificial intelligence is described. (44 references) (LRW)
Descriptors: Algorithms, Artificial Intelligence, Computer Assisted Instruction, Design Requirements
Peer reviewed Peer reviewed
Croft, W. B.; And Others – Information Processing and Management, 1989
Presents a model of information retrieval based on plausible inference which suggests that techniques should be found for combining multiple search strategies into an overall assessment of a document's relevance. The results of experiments designed to test this approach using a simple spreading activation search are discussed. (21 references) (CLB)
Descriptors: Algorithms, Inferences, Models, Online Searching
Peer reviewed Peer reviewed
Millman, Jason; Westman, Ronald S. – Journal of Educational Measurement, 1989
Five approaches to writing test items with computer assistance are described. A model of knowledge using a set of structures and a system for implementing the scheme are outlined. The approaches include the author-supplied approach, replacement-set procedures, computer-supplied prototype items, subject-matter mapping, and discourse analysis. (TJH)
Descriptors: Achievement Tests, Algorithms, Computer Assisted Testing, Test Construction
Peer reviewed Peer reviewed
Grotophorst, Clyde W. – Library Software Review, 1988
Describes a system that provides online access to holdings information for more than 4,500 journals on a single self-executing diskette. A brief discussion of data compression is offered, along with program listings in both BASIC and C. (MES)
Descriptors: Algorithms, Computer Software, Information Storage, Library Automation
Peer reviewed Peer reviewed
Kotamarti, Usha; Tharp, Alan L. – Journal of the American Society for Information Science, 1990
Reviews the use of signatures to improve the performance of text searching and considers the use of signature trees to further accelerate text searching. Based on the analysis of experimental results, it is concluded that the improvement in text searching performance using signature trees outweighs the increase in required storage. (12 references)…
Descriptors: Algorithms, Automation, Computer Storage Devices, Cost Effectiveness
Peer reviewed Peer reviewed
Lu, Xin – Information Processing and Management, 1990
Describes the development of a structural model of document retrieval based on lexical-semantic relationships between index terms. An algorithm that uses tree-to-tree distance to measure structural closeness between a document and a query statement is explained, and the proposed model is compared to a vector retrieval model. (18 references) (LRW)
Descriptors: Algorithms, Databases, Distance, Documentation
Peer reviewed Peer reviewed
Adema, Jos J.; van der Linden, Wim J. – Journal of Educational Statistics, 1989
Two zero-one linear programing models for constructing tests using classical item and test parameters are given. These models are useful, for instance, when classical test theory must serve as an interface between an item response theory-based item banking system and a test constructor unfamiliar with the underlying theory. (TJH)
Descriptors: Algorithms, Computer Assisted Testing, Item Banks, Linear Programing
Peer reviewed Peer reviewed
Watters, C. R. – Journal of the American Society for Information Science, 1989
Reviews models currently used to describe the retrieval process and questions whether extensions of traditional approaches can provide mechanisms for expert retrieval systems. An alternative view in which retrieval is based on concept space is presented. A logic framework is used to define a semantic model for using knowledge contained in concept…
Descriptors: Algorithms, Bibliographic Databases, Expert Systems, Information Retrieval
Peer reviewed Peer reviewed
Lee, Sik-Yum; And Others – Psychometrika, 1989
The frequencies of "m" independent "p-way" contingency tables are analyzed by a model that assumes that the ordinal category data in each of "m" groups are generated from a latent continuous multivariate normal distribution. The model permits analysis of several groups of individuals simultaneously. (TJH)
Descriptors: Algorithms, Equations (Mathematics), Mathematical Models, Multivariate Analysis
Peer reviewed Peer reviewed
van der Linden, Wim J.; Boekkooi-Timminga, Ellen – Psychometrika, 1989
A maximin model for test design based on item response theory is proposed. Only the relative shape of target test information function is specified. It serves as a constraint subject to which a linear programing algorithm maximizes the test information. The model is illustrated, and alternative models are discussed. (TJH)
Descriptors: Algorithms, Latent Trait Theory, Linear Programing, Mathematical Models
Pages: 1  |  ...  |  70  |  71  |  72  |  73  |  74  |  75  |  76  |  77  |  78  |  ...  |  182