Abstract
This paper deals with Salton's systems of information retrieval. In his model, only the correspondence between requests and objects (documents or document descriptions) is described. The request language is treated as a partially ordered set which may have a lattice structure or even Boolean algebra structure. Those structures have influence in simplicity or retrieval methods and in mathematical pictoriality of some important properties of information systems like simplicity or selectivity. This paper investigates such problems and presents a method of designing artificial attributes and their values.
Similar content being viewed by others
References
E. F. Codd, “A Relational Model for Data for Large Shared Data Banks,”ACM Comm.,13 (6):377–387 (June 1970).
W. Marek and Z. Pawlak, “Information Storage and Retrieval Systems: Mathematical Foundations,”Theoret. Comptr. Sci.,1:331–354 (1976).
H. Rasiowa and R. Sikorski,The mathematics of Metamathematics (Polish Scientific Publishers, Warsaw, Poland, 1963).
Z. Ras, “Information Retrieval Systems—an Algebraic Approach, Part 1,”Proc. 1979 CISS 419–424 (Maryland, 1979).
Z. Ras, “Information Retrieval Systems—an Algebraic Approach, Part 2,”Proc. 1979 PAIS, 109–114, (North Carolina, 1979).
Z. Ras, “Information Retrieval Systems—an Algebraic Approach, Part 3,”Proc. 1980 CISS (New Jersey, 1980).
G. Salton,Automatic Information Organization and Retrieval, (McGraw-Hill, New York, 1968).
H. Thiele, “On a Graph-Theoretic Realization of Retrieval Systems,” Collogues Internationaux Du Centre National De La Recheoche Scientifique, Cachan (July, 1977) pp. 4–8.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Raś, Z.W. An algebraic approach to information retrieval systems. International Journal of Computer and Information Sciences 11, 275–293 (1982). https://doi.org/10.1007/BF00999444
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF00999444