( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Mining Inverse and Symmetric Axioms in Linked Data.

, и . JIST, том 10675 из Lecture Notes in Computer Science, стр. 215-231. Springer, (2017)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Geetha Sreenivasa

Sreenivasa Sahu

Sreenivasa Rao Kommana

Surendra Kumar

Jitendra Kumar

 

Другие публикации лиц с тем же именем

Discovering disjoint object property pairs in knowledge graphs using Probabilistic Soft Logic., и . Knowl. Inf. Syst., 65 (2): 899-919 (февраля 2023)ConnExt-BioBERT: Leveraging Transfer Learning for Brain-Connectivity Extraction from Neuroscience Articles., , , , , и . BI, том 12960 из Lecture Notes in Computer Science, стр. 235-244. Springer, (2021)MQEB: Metadata-based Query Evaluation of Bi-labeled XML data., и . COMAD (b), Computer Society of India, (2005)Solving age-word problems using domain ontology and BERT., , и . COMAD/CODS, стр. 95-103. ACM, (2023)PSMQ: Path Based Storage and Metadata Guided Twig Query Evaluation., , и . BNCOD, том 4587 из Lecture Notes in Computer Science, стр. 114-124. Springer, (2007)Improving Ontology Verbalization using Semantic-level Refinement (Extended Abstract)., и . Description Logics, том 2373 из CEUR Workshop Proceedings, CEUR-WS.org, (2019)Update Summarizer Using MMR Approach., и . TAC, NIST, (2008)Review of Approaches for Linked Data Ontology Enrichment., , и . ICDCIT, том 10722 из Lecture Notes in Computer Science, стр. 27-49. Springer, (2018)Ranked answer graph construction for keyword queries on RDF graphs without distance neighbourhood restriction., , и . WWW (Companion Volume), стр. 361-366. ACM, (2011)Efficient Trust-Based Approximate SPARQL Querying of the Web of Linked Data., и . URSW (LNCS Vol.), том 7123 из Lecture Notes in Computer Science, стр. 315-330. Springer, (2013)