NotesFAQContact Us
Collection
Advanced
Search Tips
Showing all 9 results Save | Export
Peer reviewed Peer reviewed
Steinacker, Ivo – Journal of the American Society for Information Science, 1974
An algorithm is proposed to solve the problem of sequential indexing which does not use any grammatical or semantic analysis, but follows the principle of emulating human judgement by evaluation of machine-recognizable attributes of structured word assemblies. (Author)
Descriptors: Algorithms, Automatic Indexing, Databases, Indexing
Litofsky, Barry – 1969
Large-scale, on-line information storage and retrieval systems pose numerous problems above those encountered by smaller systems. A step toward the solution of these problems is presented along with several demonstrations of feasibility and advantages. The methodology on which this solution is based is that of a posteriori automatic classification…
Descriptors: Algorithms, Automation, Classification, Evaluation
CHIEN, R.T.; PREPARATA, F.P. – 1967
ONE OF THE PROBLEMS ENCOUNTERED IN CLUSTERING TECHNIQUES AS APPLIED TO DOCUMENT RETRIEVAL SYSTEMS USING BIBLIOGRAPHIC COUPLING DEVICES IS THAT THE COMPUTATIONAL EFFORT REQUIRED GROWS ROUGHLY AS THE SQUARE OF THE COLLECTION SIZE. IN THIS STUDY GRAPH THEORY IS APPLIED TO THIS PROBLEM BY FIRST MAPPING THE CITATION GRAPH OF THE DOCUMENT COLLECTION…
Descriptors: Algorithms, Bibliographic Coupling, Classification, Cluster Grouping
Air Force Systems Command, Wright-Patterson AFB, OH. Foreign Technology Div. – 1969
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…
Descriptors: Abstracting, Algorithms, Automatic Indexing, Automation
Edwards, John S. – 1967
Three specific contributions to the field of information retrieval are presented. The first two describe the establishment of an adaptive, interactive man-machine dialogue that produces a form of unsolicited librarian-like assistance for the user in his selection of index terms to characterize an indexing function. The data set upon which the…
Descriptors: Algorithms, Automation, Computer Programs, Evaluation
Peer reviewed Peer reviewed
Smith, F. J.; Devine, K. – Information Processing and Management, 1985
Zipfian laws for frequency distributions of word pairs and longer phrases are derived from text sample analysis. From crossing of Zipfian curves, it is deduced that number of multi-word phrases that occur frequently in text is surprisingly small, of same order of magnitude as number of individual word-types. (8 references) (EJS)
Descriptors: Algorithms, Graphs, Indexing, Information Retrieval
Salton, Gerard – 1974
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…
Descriptors: Algorithms, Computer Programs, Computer Science, Content Analysis
Zunde, Pranas – 1973
STITE (Scientific and Technical Information Transfer for Education) is basically a system to interface between science information and the science learner. As such STITE acts as a link between STIC (Science and Technology Infromation Centers) and LIS (Learning Information Systems). In this second progress report the internal knowledge of STITE is…
Descriptors: Algorithms, Computer Assisted Instruction, Indexing, Information Centers
Peer reviewed Peer reviewed
Al-Kharashi, Ibrahim A.; Evens, Martha W. – Journal of the American Society for Information Science, 1994
Describes experiments in Arabic information retrieval using 29 queries against a base of 355 bibliographic records. Using roots and stems as index terms worked better than words, and the root performed as well as or better than the stem at low recall levels and definitely better at high recall levels. (Contains 30 references.) (KRN)
Descriptors: Algorithms, Arabic, Bibliographic Databases, Comparative Analysis