Gerald Salton
ABSTRACT
The comparison between stored information identifications and requests for information is one of the principal tasks to be performed in automatic information retrieval. In so-called descriptor systems, where information is represented by sets of independent key words, this operation is relatively simple, since it consists of a comparison between the respective "vertors" of key words. In many retrieval systems it has been found necessary or expedient to use more complicated constructs for the identification of information. Notably "role" indicators are often added to identify various types of key words, and "links" specify a variety of relations between key words. A complete identification for a document or an item of information is often represented by a graph, consisting of nodes and branches between nodes, to identify respectively the key words and relations between key words. The matching of such information graphs with graphs representing requests for information is a relatively complicated and time consuming operation, particularly since the request structure can be made to match the information structure only partially and incompletely.
- M. Détant, Y. Lecerf, and A. Leroy, "Travaux Pratiques sur l'Etablissement des Diagrammes," Enseignement Préparatoire aux. Techniques de la Documentation Automatique, Euratom Report, Ispra (February 1960).Google Scholar
- J. C. Gardin and F. Lévy, "Le Syntol---Syntagmatic Organization Language," Proceedings of the IFIP Congress---62, Munich (August 1962).Google Scholar
- R. Barnes, "Language Problems Posed by Heavily Structured Data," Communications of the ACM, Vol. 5, No. 1 (January 1962). Google ScholarDigital Library
- G. Salton, "The Manipulation of Trees in Information Retrieval," Communications of the ACM, Vol. 5, No. 2 (February 1962). Google ScholarDigital Library
- G. Salton, "Some Hierarchical Models for Automatic Document Retrieval," American Documentation, Vol. 14, No. 3 (July 1963).Google Scholar
- E. Marden and H. R. Koller, "A Survey of Computer Programs for Chemical Information Searching," National Bureau of Standards, Report No. 6865 (May 1960).Google Scholar
- H. Sherman, "A Quasi-topological Method for the Recognition of Line Patterns," Information Processing, Proceedings of the International Conference on Information Processing, Paris (June 1959), pp. 232--238.Google Scholar
- R. L. Grimsdale, F. H. Summer, C. J. Tunis, and T. Kilburn, "A System for the Automatic Recognition of Patterns," Proc. IEE, Vol. 106 (1959), pp. 211--221.Google Scholar
- S. H. Unger, "GIT---A Heuristic Program for Testing Pairs of Directed Line Graphs for Isomorphism," ACM National Conference, Denver (August 1963).Google Scholar
- E. H. Sussength, Jr., Doctoral Thesis, Harvard University (in preparation).Google Scholar
- E. H. Sussenguth, Jr., "A Graph Theoretic Algorithm for Matching Chemical Structures," Journal of Chemical Documentation (to appear).Google Scholar
- G. Salton and E. H. Sussenguth, Jr., "Automatic Structure - Matching Procedures and Some Typical Retrieval Applications," Report No. ISR-4 from the Harvard Computation Laboratory to the Air Force Cambridge Research Laboratories (August 1963).Google Scholar
- F. E. Hohn, S. Seshu, and D. D. Aufenkamp, "The Theory of Nets," IRE Transactions on Electronic Computers, Vol. EC-6, No. 3 (September 1957).Google Scholar
- G. Salton, "A Flexible Automatic System for the Organization, Storage and Retrieval of Language Data (SMART)," Report ISR-5 to the National Science Foundation, Harvard Computation Laboratory (January 1964).Google Scholar
- V. E. Giuliano, "Automatic Message Retrieval by Associative Techniques," First Congress on the Information System Sciences, Hot Springs (November 1962).Google Scholar
- H. E. Stiles, "The Association Factor in Information Retrieval," Journal of the Association for Computing Machinery, Vol. 8, No. 2 (April 1961). Google ScholarDigital Library
- A. Lemmon, "The Criterion Routine," Report No. ISR-5 to the National Science Foundation, Harvard Computation Laboratory (January 1964).Google Scholar
Recommendations
Exploiting Disambiguation and Discrimination in Information Retrieval Systems
WI-IAT '09: Proceedings of the 2009 IEEE/WIC/ACM International Joint Conference on Web Intelligence and Intelligent Agent Technology - Volume 03Polysemous words have more than one possible meaning, thus word ambiguity is a key issue for the systems which access textual information. Computational linguistics proposes two main methods to cope with word ambiguity: sense disambiguation and sense ...
Using Mutual Information Technique in Cross-Language Information Retrieval
ICADL 08: Proceedings of the 11th International Conference on Asian Digital Libraries: Universal and Ubiquitous Access to InformationThis paper describes the Indonesian-English cross language information system, where we investigated the problem of cross language document retrieval for Indonesian-English. Our work based on Indonesian-English parallel corpus and applied mutual ...
Automatic identification of light stop words for Persian information retrieval systems
Stop word identification is one of the most important tasks for many text processing applications such as information retrieval. Stop words occur too frequently in documents in a collection and do not contribute significantly to determining the context ...
Comments