Exploration of Web Search Results Based on the Formal Concept Analysis

In this paper, we present an approach to support exploratory search by structuring search results based on concept lattices, which are created on the fly using advanced methods from the area of Formal Concept Analysis (FCA). The main aim of the approach is to organize query based search engine results (e.g. web documents) as a hierarchy of clusters that are composed of documents with similar attributes. The concept lattice provides a structured view on the query-related domains and hence can improve the understanding of document properties and shared features. Additionally, we applied a fuzzy extension of FCA in order to support the usage of different types of attributes within the analyzed query results set. The approach has been integrated into an interactive web search interface. It provides a smooth integration of keyword-based web search and interactive visualization of concept lattice and its concepts in order to support complex search tasks.

[1]  Emmanuel Nauer,et al.  CreChainDo: an iterative and interactive Web information retrieval system based on lattices , 2009, Int. J. Gen. Syst..

[2]  Peter Butka,et al.  Reduction of Concepts from Generalized One-Sided Concept Lattice Based on Subsets Quality Measure , 2014, MISSI.

[3]  Jozef Pócs,et al.  Note on generating fuzzy concept lattices via Galois connections , 2012, Inf. Sci..

[4]  Peter Butka,et al.  Two-Step Reduction of GOSCL Based on Subsets Quality Measure and Stability Index , 2016, MISSI.

[5]  Stanislav Krajci,et al.  On stability of fuzzy formal concepts over randomized one-sided formal context , 2018, Fuzzy Sets Syst..

[6]  Andreas Nürnberger,et al.  Data Exploration for Bisociative Knowledge Discovery: A Brief Overview of Tools and Evaluation Methods , 2012, Bisociative Knowledge Discovery.

[7]  Bernhard Ganter,et al.  Formal Concept Analysis: Mathematical Foundations , 1998 .

[8]  Andreas Nürnberger,et al.  CET: A Tool for Creative Exploration of Graphs , 2010, ECML/PKDD.

[9]  Peter Butka,et al.  On intent stability index for one-sided concept lattices , 2015, 2015 IEEE 10th Jubilee International Symposium on Applied Computational Intelligence and Informatics.

[10]  Jonas Poelmans,et al.  Text Mining Scientific Papers: A Survey on FCA-Based Information Retrieval Research , 2012, ICDM.

[11]  Peter Butka,et al.  Tree Based Reduction of Concept Lattices Based on Conceptual Indexes , 2016, ISAT.

[12]  Jozef Pócs,et al.  Basic theorem as representation of heterogeneous concept lattices , 2015, Frontiers of Computer Science.

[13]  Peter Butka,et al.  Generalization of One-Sided Concept Lattices , 2013, Comput. Informatics.

[14]  Manuel Ojeda-Aciego,et al.  Formal concept analysis via multi-adjoint concept lattices , 2009, Fuzzy Sets Syst..

[15]  Claudio Carpineto,et al.  Exploiting the Potential of Concept Lattices for Information Retrieval with CREDO , 2004, J. Univers. Comput. Sci..

[16]  Ch. Aswanikumar,et al.  Concept lattice reduction using fuzzy K-Means clustering , 2010, Expert Syst. Appl..

[17]  Jozef Pócs,et al.  On concept reduction based on some graph properties , 2016, Knowl. Based Syst..

[18]  Peter Butka,et al.  A Proposal of the Information Retrieval System Based on the Generalized One-Sided Concept Lattices , 2012 .

[19]  Stanislav Krajci,et al.  On heterogeneous formal contexts , 2014, Fuzzy Sets Syst..

[20]  Gary Marchionini,et al.  Exploratory search , 2006, Commun. ACM.

[21]  Andreas Nürnberger,et al.  A Framework for FCA-based Exploratory Web Search , 2015, ISCT.

[22]  Nicolas Spyratos,et al.  Preference-Based Query Tuning Through Refinement/Enlargement in a Formal Context , 2006, FoIKS.