Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userSERAG: Semantic Entity Retrieval from Arabic Knowledge Graphs
Serag: استرجاع الكيانات الدلالية من الرسوم البيانية المعرفة العربية
370
0 0
0.0
(
0
)
Created by
Shamra Editor
Ask ChatGPT about the research
تستخدم الرسوم البيانية المعرفة (KGS) على نطاق واسع لتخزين المعلومات والوصول إليها حول الكيانات وعلاقاتها.بالنظر إلى استفسار، تهدف مهمة استرجاع الكيانات من KG إلى تقديم قائمة في المرتبة ذات الصلة بالاستعلام.في الآونة الأخيرة، أظهر عدد متزايد من النماذج لاسترجاع الكيان تحسنا كبيرا على الأساليب التقليدية.هذه النماذج، ومع ذلك، تم تطويرها للكلية الإنجليزية.في هذا العمل، نبني على نظام واحد من هذا القبيل، يدعى Kewer، لاقتراح Serag (استرجاع الكيانات الدلالي من الرسوم البيانية المعرفة العربية).مثل Kewer، يستخدم Serag مناحي عشوائي لتوليد embeddings للكياء.تعتبر DBPedia-Entity V2 مجموعة الاختبار القياسية لاسترجاع الكيان.نناقش تحديات استخدامها للغات غير الإنجليزية بشكل عام والعربية على وجه الخصوص.نحن نقدم نسخة عربية من هذه المجموعة القياسية، واستخدامها لتقييم Serag.يظهر Serag أنه يتفوق بشكل كبير على نموذج BM25 الشهير بفضل التفكير المتعدد القفز.
Knowledge graphs (KGs) are widely used to store and access information about entities and their relationships. Given a query, the task of entity retrieval from a KG aims at presenting a ranked list of entities relevant to the query. Lately, an increasing number of models for entity retrieval have shown a significant improvement over traditional methods. These models, however, were developed for English KGs. In this work, we build on one such system, named KEWER, to propose SERAG (Semantic Entity Retrieval from Arabic knowledge Graphs). Like KEWER, SERAG uses random walks to generate entity embeddings. DBpedia-Entity v2 is considered the standard test collection for entity retrieval. We discuss the challenges of using it for non-English languages in general and Arabic in particular. We provide an Arabic version of this standard collection, and use it to evaluate SERAG. SERAG is shown to significantly outperform the popular BM25 model thanks to its multi-hop reasoning.
References used
https://aclanthology.org/
rate research
Read More
Text generation from semantic graphs is traditionally performed with deterministic methods, which generate a unique description given an input graph. However, the generation problem admits a range of acceptable textual outputs, exhibiting lexical, sy
ntactic and semantic variation. To address this disconnect, we present two main contributions. First, we propose a stochastic graph-to-text model, incorporating a latent variable in an encoder-decoder model, and its use in an ensemble. Second, to assess the diversity of the generated sentences, we propose a new automatic evaluation metric which jointly evaluates output diversity and quality in a multi-reference setting. We evaluate the models on WebNLG datasets in English and Russian, and show an ensemble of stochastic models produces diverse sets of generated sentences while, retaining similar quality to state-of-the-art models.
Knowledge graph entity typing aims to infer entities' missing types in knowledge graphs which is an important but under-explored issue. This paper proposes a novel method for this task by utilizing entities' contextual information. Specifically, we d
esign two inference mechanisms: i) N2T: independently use each neighbor of an entity to infer its type; ii) Agg2T: aggregate the neighbors of an entity to infer its type. Those mechanisms will produce multiple inference results, and an exponentially weighted pooling method is used to generate the final inference result. Furthermore, we propose a novel loss function to alleviate the false-negative problem during training. Experiments on two real-world KGs demonstrate the effectiveness of our method. The source code and data of this paper can be obtained from https://github.com/CCIIPLab/CET.
Knowledge Graphs (KGs) have become increasingly popular in the recent years. However, as knowledge constantly grows and changes, it is inevitable to extend existing KGs with entities that emerged or became relevant to the scope of the KG after its cr
eation. Research on updating KGs typically relies on extracting named entities and relations from text. However, these approaches cannot infer entities or relations that were not explicitly stated. Alternatively, embedding models exploit implicit structural regularities to predict missing relations, but cannot predict missing entities. In this article, we introduce a novel method to enrich a KG with new entities given their textual description. Our method leverages joint embedding models, hence does not require entities or relations to be named explicitly. We show that our approach can identify new concepts in a document corpus and transfer them into the KG, and we find that the performance of our method improves substantially when extended with techniques from association rule mining, text mining, and active learning.
The design of expressive representations of entities and relations in a knowledge graph is an important endeavor. While many of the existing approaches have primarily focused on learning from relational patterns and structural information, the intrin
sic complexity of KG entities has been more or less overlooked. More concretely, we hypothesize KG entities may be more complex than we think, i.e., an entity may wear many hats and relational triplets may form due to more than a single reason. To this end, this paper proposes to learn disentangled representations of KG entities - a new method that disentangles the inner latent properties of KG entities. Our disentangled process operates at the graph level and a neighborhood mechanism is leveraged to disentangle the hidden properties of each entity. This disentangled representation learning approach is model agnostic and compatible with canonical KG embedding approaches. We conduct extensive experiments on several benchmark datasets, equipping a variety of models (DistMult, SimplE, and QuatE) with our proposed disentangling mechanism. Experimental results demonstrate that our proposed approach substantially improves performance on key metrics.
Semantic Web is a new revolution in the world of the Web, where information and
data become viable for logical processing by computer programs. Where they are
transformed into meaningful data network. Although Semantic Web is considered the
future
of World Wide Web, the Arabic research and studies are still relatively rare in this
field. Therefore, this paper gives a reference study of Semantic Web and the different
methods to explore the knowledge and discover useful information from the vast amount
of data provided by the web. It gives a programming example like application of some of
these techniques provided by the Semantic Web and methods to discover the knowledge of
it. This simplified programming example provides services related to higher education
Syrian government, such as information about the Syrian public universities like the name
of the university (Syrian Virtual University, Tishreen, Aleppo, Damascus, and Al Baath),
address of the university, its web site, number of students and a summary of the university,
which helps intelligent agents to find those services dynamically.
suggested questions
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
