NotesFAQContact Us
Collection
Advanced
Search Tips
Showing all 12 results Save | Export
Peer reviewed Peer reviewed
Wirt, Edgar – Journal of Experimental Education, 1987
In negotiating to obtain a sample of records from a computer file, it is important to be able to present a simple program that will produce a representative and valid sample. This article describes two procedures: (1) an interval selection method; and (2) a random numbers file. (JAZ)
Descriptors: Algorithms, Business, Computers, Databases
Peer reviewed Peer reviewed
Kamel, M.; And Others – Information Processing and Management, 1990
Discusses the problem of processing fuzzy queries in databases and information retrieval systems and presents a prototype of a fuzzy query processing system for databases that is based on data clustering and uses Pascal programing language. Clustering schemes are explained, and the system architecture that uses natural language is described. (14…
Descriptors: Algorithms, Cluster Grouping, Computer System Design, Databases
Peer reviewed Peer reviewed
Bartell, Brian T.; And Others – Journal of the American Society for Information Science, 1995
Discussion of the failure of individual keywords to identify conceptual content of documents in retrieval systems highlights Metric Similarity Modeling, a method for creating vector space representation of documents based on modeling target interdocument similarity values. Semantic relatedness, latent semantic indexing, an indexing and retrieval…
Descriptors: Algorithms, Databases, Documentation, Indexing
Peer reviewed Peer reviewed
Nageswara Rao, S. V.; And Others – Information Processing and Management, 1985
Discusses properties of multiple attribute tree (MAT) and inverted file structures; establishes suitability of MAT data structure for bibliographic files using worst-case performance measures; provides arguments to establish MAT average case superiority; and proposes an efficient adaptation of MAT data structure to exploit special features of MAT…
Descriptors: Algorithms, Comparative Analysis, Data Processing, Databases
Peer reviewed Peer reviewed
Danilowicz, Czeslaw – Information Processing and Management, 1994
Discusses end-user searching in Boolean information retrieval systems considers the role of search intermediaries and proposes a model of user preferences that incorporates a user's profile. Highlights include document representation; information queries; document output ranking; calculating user profiles; and selecting documents for a local…
Descriptors: Algorithms, Comparative Analysis, Databases, Information Retrieval
Peer reviewed Peer reviewed
Onorato, Eveline; Bianchi, Gianfranco – Online Review, 1981
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)
Descriptors: Algorithms, Citations (References), Computers, Data Processing
Peer reviewed Peer reviewed
Craven, Timothy C. – Information Processing and Management, 1980
Proposes a single underlying structure for the production of a variety of computer index displays, using a networking system which represents both concepts and links by nodes. Desirable characteristics of index displays are outlined, and algorithmic extraction of subnetworks for local use is discussed. References are included. (Author/BK)
Descriptors: Algorithms, Automatic Indexing, Computer Graphics, Databases
Hawkins, Donald T. – Online, 1989
Reviews some of the models used for pricing online information services and discusses some of the implications of these pricing algorithms. Topics discussed include online versus print pricing; charges for the retrieval process; charges for the retrieved information; telecommunications charges; and the pricing policies of Chemical Abstracts…
Descriptors: Algorithms, Cost Estimates, Database Producers, Databases
Peer reviewed Peer reviewed
Self, John – Instructional Science, 1986
Considers possibility of developing a computer tutor around an explicit concept-learning theory derived from machine learning techniques. Some problems with using the focusing (and similar) algorithms in this role are discussed and possible solutions are developed. Design for a guided discovery learning system for tutoring concepts is proposed.…
Descriptors: Algorithms, Computer Software, Concept Teaching, Databases
Peer reviewed Peer reviewed
Savoy, Jacques – Information Processing and Management, 1994
Proposes a new learning algorithm to improve the retrieval effectiveness of the search system used in the hypertext environment using an extended Boolean model with links to improve the ranking of retrieved items. Highlights include the basic retrieval scheme, the learning scheme, and a review of basic probabilistic retrieval models. (Contains 32…
Descriptors: Algorithms, Database Design, Databases, Hypermedia
Peer reviewed Peer reviewed
Berry, P. A. M.; Meadows, A. J. – Journal of Documentation, 1987
Reviews the current status of satellite remote sensing data, including problems with efficient storage and rapid retrieval of the data, and appropriate computer graphics to process images. Areas of research concerned with overcoming these problems are described. (16 references) (CLB)
Descriptors: Algorithms, Computer Graphics, Computer Storage Devices, Copyrights
Peer reviewed Peer reviewed
Das-Gupta, Padmini – Journal of the American Society for Information Science, 1987
Presents an algorithm for use in natural language document retrieval systems which automatically determines if the conjunction "and" in a statement representing an information need should be translated into a Boolean "and" or "or." The results of an experiment that used the algorithm are reported, and further research is suggested. (CLB)
Descriptors: Algorithms, Componential Analysis, Computational Linguistics, Conjunctions