Gert Schmeltz Pedersen
ABSTRACT
An application of mathematical lattice theory, called relationship lattices, is utilized to attack problems of operational bibliographic information retrieval.
The proposed solution offers an interface to the information searcher enabling operation in a world of concepts, authors, and document records and their relationships. This hides the complexities of query language and database structures, and it allows to use a personally preferred terminology and to browse, query and download document records in a convenient way.
The main component of the proposed solution is a personal thesaurus built up as a relationship lattice.
- 1.M.I. Bates. The design of browsing and berrypicking techniques for the online search interface. Online Review, 1989, no. 5, pp. 407-424.Google Scholar
Cross Ref
- 2.P. Ingwersen. Information Retrieval Interaction. Taylor Graham, 1992. Google ScholarDigital Library
- 3.N.J. Belkin, P.G. Marchetti. Determining the Functionality and Features of an Intelligent Interface to an Information Retrieval System. SIGIR'90 Conference Proceedings, pp. 151-177. ACM Press, 1990. Google ScholarDigital Library
- 4.M. Agosti, G. Gradenigo, P.G. Marchetti. Architecture and Functions for a Conceptual Interface to Very Large Online Bibliographic Collections. RIAO 91 Conference Proceedings, pp. 2-24. Universitat Autbnoma de Barcelona, 1991.Google Scholar
- 5.G.S. Pedersen, H.L. Larsen. The Design of an Information Retrieval Assistant System. ESPRIT '87 Conference Proceedings, pp. 688-699. North-Holland, 1987.Google Scholar
- 6.P.P.-S. Chen. The Entity-Relationship Model: Towards a Unified View of Data. ACM Transactions on Database Systems, March 1976. Reprinted in J. Mylopoulos, M.L. Brodie (exls.). Artificial Intelligence and Databases, pp. 98-111. Morgan Kaufmann, 1989. Google ScholarDigital Library
- 7.P. Blackburn. Introduction to lattices, algebras and their applications in formal semantics. Lecture Notes for the Second European Summer School in Language, Logic, and Information. Katholieke Universiteit Leuven, 1990.Google Scholar
- 8.B.A. Davey, H.A. Priestley. Introduction to Lattices and Order. Cambridge University Press, 1990.Google Scholar
- 9.J.F. Nilsson. A Concept Object Algebra. Proceedings of The 2nd European-Japanese Seminar on information Modelling and Knowledge Bases, Ellivuori, Finland, June 1992. IOS Press, Amsterdam.Google Scholar
- 10.H. A'l't-Kaci, R. Nasr. LOGIN: A Logic Programming Language with Built-in Inheritance. The Journal of Logic Programming, 1986, no. 3, pp. 18.5-215. Google ScholarDigital Library
- 11.F. Lehmann. Semantic Networks. Computers and Mathematics with Applications, 1992, no. 2-5, pp. 1-50.Google Scholar
- 12.B.A. Davey, H.A. Priestley. Formal Concept Analysis, chapter 11 in {8}, building on the works of R. Wille.Google Scholar
- 13.G.S. Pedersen. Relationship Lattices for Information Modelling. Submitted to The 3rd European-Japanese Seminar on Information Modelling and Knowledge Bases, Budapest, Hungary, June 1993.Google Scholar
- 14.G. MacAlpine, P. Ingwersen. Integrated information retrieval in a knowledge worker support system. ACM SI- GIR Forum, June 1989, pp. 48-57. Google ScholarDigital Library
- 15.R.H. Thompson, W.B. Croft. Support for browsing in an intelligent text retrieval system. International Journal o{ Man-Machine Studies, June 1989, pp. 639-668. Google ScholarDigital Library
Index Terms
- A browser for bibliographic information retrieval, based on an application of lattice theory
Recommendations
A semantic approach to concept lattice-based information retrieval
The volume of available information is growing, especially on the web, and in parallel the questions of the users are changing and becoming harder to satisfy. Thus there is a need for organizing the available information in a meaningful way in order to ...
Complexity Reduction in Lattice-Based Information Retrieval
AbstractThough lattice-based information representation has the advantage of providing efficient visual interface over textual display, the complexity of a lattice may grow rapidly with the size of the database. In this paper we formally draw the analogy ...
Comments