通过三元组的部分或完全匹配查询三元概念
Querying Triadic Concepts through Partial or Complete Matching of Triples
AI总结:
提出一种基于倒排索引的三元概念查询方法,支持三元组部分或完全匹配及相似度排序,实验表明其比Ananias近似方法更高效、更具可扩展性。
摘要:
本文提出了一种利用倒排索引,通过三元组的部分或完全匹配来查询三元概念的新方法,用于检索已计算出的、在其外延、内涵和/或方式中包含一组术语的三元概念。与Ananias中描述的近似方法不同,该方法:(i)无需保留初始三元背景或其三个二元对应背景;(ii)避免通过背景探索在三元组组件上应用推导算子;(iii)消除了为获得作为一维查询答案的三元概念而进行分解阶段的需求。此外,我们的解决方案引入了一种新的度量,用于根据检索到的三元概念与给定查询的相似性对其进行排序。最后,本文主要开展了一项实证研究,以说明我们的方法相对于近似方法的有效性和可扩展性。我们的解决方案不仅展现出更优的效率,还凸显出更好的可扩展性,使其适用于大数据场景。
英文摘要:
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.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。