Querying Triadic Concepts through Partial or Complete Matching of Triples (2401.10271v1)
Abstract: In this paper, we introduce a new method for querying triadic concepts through partial or complete matching of triples using an inverted index, to retrieve already computed triadic concepts that contain a set of terms in their extent, intent, and/or modus. As opposed to the approximation approach described in Ananias, this method (i) does not need to keep the initial triadic context or its three dyadic counterparts, (ii) avoids the application of derivation operators on the triple components through context exploration, and (iii) eliminates the requirement for a factorization phase to get triadic concepts as the answer to one-dimensional queries. Additionally, our solution introduces a novel metric for ranking the retrieved triadic concepts based on their similarity to a given query. Lastly, an empirical study is primarily done to illustrate the effectiveness and scalability of our approach against the approximation one. Our solution not only showcases superior efficiency, but also highlights a better scalability, making it suitable for big data scenarios.
- Restrictions on concept lattices for pattern management. In Marzena Kryszkiewicz and Sergei A. Obiedkov, editors, Proceedings of the 7th International Conference on Concept Lattices and Their Applications, Sevilla, Spain, October 19-21, 2010, volume 672 of CEUR Workshop Proceedings, pages 235–246. CEUR-WS.org, 2010.
- Formal Concept Analysis: Mathematical Foundations. Springer Berlin Heidelberg, Berlin, Heidelberg, jun 1999. ISBN 978-3-540-62771-5.
- A triadic approach to formal concept analysis. In Lecture Notes in Computer Science, volume 954, pages 32–43, 1995. ISBN 3540601619.
- Discovering shared conceptualizations in folksonomies. Web Semantics, 6(1):38–53, 2008. ISSN 15708268.
- Pattern discovery in triadic contexts. In Mehwish Alam, Tanya Braun, and Bruno Yun, editors, Ontologies and Concepts in Mind and Machine, pages 117–131, Cham, 2020. Springer International Publishing. ISBN 978-3-030-57855-8.
- Towards a navigation paradigm for triadic concepts. In Jaume Baixeries, Christian Sacarea, and Manuel Ojeda-Aciego, editors, Formal Concept Analysis, pages 252–267, Cham, 2015. Springer International Publishing. ISBN 978-3-319-19545-2.
- Yet a faster algorithm for building the hasse diagram of a concept lattice. In Sébastien Ferré and Sebastian Rudolph, editors, Formal Concept Analysis, pages 162–177, Berlin, Heidelberg, 2009. Springer Berlin Heidelberg. ISBN 978-3-642-01815-2.
- Rudolf Wille. The basic theorem of triadic concept analysis. Order, 12(2):149–158, 1995.
- Inverted files for text search engines. ACM Comput. Surv., 38(2):6–es, jul 2006. ISSN 0360-0300.
- Triadic concept approximation. Information Sciences, 572:126–146, 2021.
- Fca tools bundle-a tool that enables dyadic and triadic conceptual navigation. In FCA4AI@ ECAI, pages 42–50, 2016.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.