Abstract
The obvious analogy between an Objects×Properties binary relationship (called a formal context) and a binary Documents×Terms incidence matrix has led to a growing interest for the use of formal concept analysis (FCA) in information retrieval (IR). The main advantage of using FCA for IR is the possibility of creating a conceptual representation of a given document collection in the form of a lattice. Also, potentials of FCA for IR have been highlighted by a number of research studies since its inception. It turns out that almost all existing FCA-based IR approaches rely on: i) a Boolean Documents×Terms incidence matrix and, ii) the use of the classical Galois connection initially proposed by Wille. In such a case, there is no way for expressing weighted queries as well as there is no way for ranking query results that is usually done by query refinement or empirical navigation trough the concept lattice. In this paper we first enlarge the use of FCA for IR to the fuzzy setting which allows for a fuzzy incidence matrix and weighted queries. For instance, an incidence matrix may now allow for (normalized) numerical entries that may be achieved using the well known term frequency measure. Furthermore, it is worth noticing that in the existing approaches, user queries are restricted to the conjunctive form. Thus, another contribution consists in considering, in an original way, the use of other Galois derivation operators (namely the possibility, necessity and dual sufficiency) in order to express disjunction and negation in queries.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Bělohlávek, R.: Fuzzy Galois connections. Math. Logic Quart. 45, 497–504 (1999)
Bělohlávek, R., Vychodil, V.: What is a fuzzy concept lattice. In: Proceedings CLA 2005 Concept Lattices and their Applications, Olomounc, Czech Republic, pp. 34–45 (2005)
Carpineto, C., Romano, G.: Exploiting the potential of concept lattices for information retrieval with credo. Journal of Universal Computer Science 10(8), 985–1013 (2004)
Carpineto, C., Romano, G.: Effective reformulation of boolean queries with concept lattices. In: FQAS, pp. 83–94 (1998)
Dau, F., Ducrou, J., Eklund, P.W.: Concept similarity and related categories in searchsleuth. In: Eklund, P., Haemmerlé, O. (eds.) ICCS 2008. LNCS (LNAI), vol. 5113, pp. 255–268. Springer, Heidelberg (2008)
Djouadi, Y., Dubois, D., Prade, H.: Possibility theory and formal concept analysis: Context decomposition and uncertainty handling. In: Hüllermeier, E., Kruse, R., Hoffmann, F. (eds.) IPMU 2010. LNCS (LNAI), vol. 6178, pp. 260–269. Springer, Heidelberg (2010)
Djouadi, Y., Prade, H.: Possibility-theoretic extension of derivation operators in formal concept analysis. Fuzzy Optimization and Decision Making (submitted, 2011)
Dubois, D., Prade, H.: Possibility theory and formal concept analysis in information systems. In: Proc. IFSA 2009, International Fuzzy Systems Association World Congress, Lisbon, Portugal, pp. 1021–1026 (2009)
Dubois, D., de Saint Cyr, F.D., Prade, H.: A possibilty-theoretic view of formal concept analysis. Fundamenta Informaticae 75(1-4), 195–213 (2007)
Düntsch, I., Gediga, G.: Approximation operators in qualitative data analysis. In: de Swart, H., Orłowska, E., Schmidt, G., Roubens, M. (eds.) Theory and Applications of Relational Structures as Knowledge Instruments. LNCS, vol. 2929, pp. 214–230. Springer, Heidelberg (2003)
ElQadi, A., Aboutadjine, D., Ennouary, Y.: Formal concept analysis for information retrieval. International Journal of Computer Science and Information Security 7(2), 119–125 (2010)
Ganter, B., Wille, R.: Formal Concept Analysis. Springer, Heidelberg (1999)
Gediga, G., Düntsch, I.: Modal-style operators in qualitative data analysis. In: Proc. ICDM 2002 IEEE Int. Conf. on Data Mining, pp. 9–12 (2002)
Latiri, C.C., Elloumi, S., Chevallet, J.P., Jaouay, A.: Extension of fuzzy Galois connection for information retrieval using a fuzzy quantifier. In: Proc. AICCSA 2003 Int. Conf. on Computer Systems and Applications, Tunis, Tunisia, pp. 81–91 (2003)
Messai, N., Devignes, M.D., Napoli, A., Smaïl-Tabbone, M.: Many-valued concept lattices for conceptual clustering and information retrieval. In: ECAI 2008 - 18th European Conference on Artificial Intelligence, Patras, Greece, July 21-25, pp. 127–131 (2008)
Nauer, E., Toussaint, Y.: Classification dynamique par treillis de concepts pour la recherche d’information sur le web. In: Proc. Conférence en Recherche d’Infomations et Applications - CORIA 2008, Trégastel, France, March 12-14, pp. 71–86 (2008)
Priss, U.: Lattice-based information retrieval. Knowledge Organization 27(3), 132–142 (2000)
Salton, G.: Automatic information organization and retrieval. McGraw-Hill, New York (1968)
Wille, R.: Restructuring Lattice Theory: an Approach Based on Hierarchies of Concepts. In: Rival, I. (ed.) Ordered Sets. Reidel, Dordrecht (1982)
Zadeh, L.: Fuzzy sets as a basis for a possibility theory. Fuzzy Sets and Systems 1(1), 3–28 (1978)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Djouadi, Y. (2011). Extended Galois Derivation Operators for Information Retrieval Based on Fuzzy Formal Concept Lattice. In: Benferhat, S., Grant, J. (eds) Scalable Uncertainty Management. SUM 2011. Lecture Notes in Computer Science(), vol 6929. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-23963-2_27
Download citation
DOI: https://doi.org/10.1007/978-3-642-23963-2_27
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-23962-5
Online ISBN: 978-3-642-23963-2
eBook Packages: Computer ScienceComputer Science (R0)