Preference-Based Query Tuning Through Refinement/Enlargement in a Formal Context

  • Nicolas Spyratos
  • Carlo Meghini
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3861)


The user of an information system rarely knows exactly what he is looking for, but once shown a piece of information he can quickly tell whether it is what he needs. Query tuning is the process of searching for the query that best approximates the information need of the user. Typically, navigation and querying are two completely separate processes, and the user usually has to switch often from one to the other–a painstaking process producing a frustrating experience. In this paper, we propose an approach to query tuning that integrates navigation and querying into a single process, thus leading to a more flexible and more user friendly method of query tuning. The proposed approach is based on formal concept analysis, and models the directory of an information source as a formal context in which the underlying concept lattice serves for navigation and the attributes of the formal context serve for query formulation. In order to support the user in coping with a possibly overwhelming number of alternative query tunings, preferences are introduced.


Digital Library Current Concept Concept Lattice Query Enlargement Formal Context 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Formal concept analysis homepage,
  2. 2.
    The open directory project,
  3. 3.
    Carpineto, C., Romano, G.: Information retrieval through hybrid navigation of lattice representations. International Journal of Human-Computer Studies 45(5), 553–578 (1996)CrossRefGoogle Scholar
  4. 4.
    Carpineto, C., Romano, G.: A lattice conceptual clustering system and its application to browsing retrieval. Machine Learning 24(2), 95–122 (1996)Google Scholar
  5. 5.
    Carpineto, C., Romano, G.: Effective reformulation of boolean queries with concept lattices. In: Andreasen, T., Christiansen, H., Larsen, H.L. (eds.) FQAS 1998. LNCS (LNAI), vol. 1495, pp. 83–94. Springer, Heidelberg (1998)CrossRefGoogle Scholar
  6. 6.
    Carpineto, C., Romano, G.: Order-theoretical ranking. Journal of American Society for Information Science 51(7), 587–601 (2000)CrossRefGoogle Scholar
  7. 7.
    Chen, H. (ed.): Journal of the American Society for Information Science. Special Issue: Digital Libraries: Part 1, vol. 51. John Wiley & Sons, Inc., Chichester (2000)Google Scholar
  8. 8.
    Chen, H. (ed.): Journal of the American Society for Information Science. Special Issue: Digital Libraries: Part 2, vol. 51. John Wiley & Sons, Inc., Chichester (2000)Google Scholar
  9. 9.
    Chomicki, J.: Preference formulas in relational queries. University at Buffalo, Buffalo, New York ACM Transactions on Database Systems 28(4) (2003)Google Scholar
  10. 10.
    Davey, B.A., Priestley, H.A.: Introduction to lattices and order, ch. 3, 2nd edn., Cambridge (2002)Google Scholar
  11. 11.
    Ganter, B., Wille, R.: Applied lattice theory: Formal concept analysis,
  12. 12.
    Ganter, B., Wille, R.: Formal Concept Analysis: Mathematical Foundations, 1st edn. Springer, Heidelberg (1999)zbMATHGoogle Scholar
  13. 13.
    Godin, R., Gecsei, J., Pichet, C.: Design of a browsing interface for information retrieval. In: Proceedings of SIGIR 1989, the Twelfth Annual International ACM Conference on Research and Development in Information Retrieval, Cambridge, MA, pp. 32–39 (1989)Google Scholar
  14. 14.
    Andréka, H., Ryan, M., Schobbens, P.-Y.: Operators and laws for combining preference relations. Journal of Logic and Computation 12(1), 13–53 (2002)zbMATHCrossRefMathSciNetGoogle Scholar
  15. 15.
    Priss, U.: Lattice-based information retrieval. Knowledge Organization 27(3), 132–142 (2000)Google Scholar
  16. 16.
    Rigaux, P., Spyratos, N.: Metadata inference for document retrieval in a distributed repository. In: Maher, M.J. (ed.) ASIAN 2004. LNCS, vol. 3321, pp. 418–436. Springer, Heidelberg (2004) (invited Paper) CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Nicolas Spyratos
    • 1
  • Carlo Meghini
    • 2
  1. 1.Université Paris-Sud, Laboratoire de Recherche en InformatiqueOrsayFrance
  2. 2.Consiglio Nazionale delle Ricerche, Istituto della Scienza e delle Tecnologie della InformazionePisaItaly

Personalised recommendations