Log in

Relevant bibliographies by topics / RDF-To-Text

Contents

Journal articles

Academic literature on the topic 'RDF-To-Text'

Author: Grafiati

Published: 4 May 2024

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'RDF-To-Text.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "RDF-To-Text"

1

Chellali, Mustapha, and Nader Jafari Rad. "Trees with independent Roman domination number twice the independent domination number." Discrete Mathematics, Algorithms and Applications 07, no. 04 (2015): 1550048. http://dx.doi.org/10.1142/s1793830915500482.

Full text

Abstract:

A Roman dominating function (RDF) on a graph [Formula: see text] is a function [Formula: see text] satisfying the condition that every vertex [Formula: see text] for which [Formula: see text] is adjacent to at least one vertex [Formula: see text] for which [Formula: see text]. The weight of a RDF [Formula: see text] is the value [Formula: see text]. The Roman domination number, [Formula: see text], of [Formula: see text] is the minimum weight of a RDF on [Formula: see text]. An RDF [Formula: see text] is called an independent Roman dominating function (IRDF) if the set [Formula: see text] is a

APA, Harvard, Vancouver, ISO, and other styles

2

Gryaznov, Yevgeny, and Pavel Rusakov. "Analysis of RDF Syntaxes for Semantic Web Development." Applied Computer Systems 18, no. 1 (2015): 33–42. http://dx.doi.org/10.1515/acss-2015-0017.

Full text

Abstract:

Abstract In this paper authors perform a research on possibilities of RDF (Resource Description Framework) syntaxes usage for information representation in Semantic Web. It is described why pure XML cannot be effectively used for this purpose, and how RDF framework solves this problem. Information is being represented in a form of a directed graph. RDF is only an abstract formal model for information representation and side tools are required in order to write down that information. Such tools are RDF syntaxes – concrete text or binary formats, which prescribe rules for RDF data serialization.

APA, Harvard, Vancouver, ISO, and other styles

3

Meddah, Nacéra, and Mustapha Chellali. "Roman domination and 2-independence in trees." Discrete Mathematics, Algorithms and Applications 09, no. 02 (2017): 1750023. http://dx.doi.org/10.1142/s1793830917500239.

Full text

Abstract:

A Roman dominating function (RDF) on a graph [Formula: see text] is a function [Formula: see text] satisfying the condition that every vertex [Formula: see text] with [Formula: see text] is adjacent to at least one vertex [Formula: see text] of [Formula: see text] for which [Formula: see text]. The weight of a RDF is the sum [Formula: see text], and the minimum weight of a RDF [Formula: see text] is the Roman domination number [Formula: see text]. A subset [Formula: see text] of [Formula: see text] is a [Formula: see text]-independent set of [Formula: see text] if every vertex of [Formula: see

APA, Harvard, Vancouver, ISO, and other styles

4

Samodivkin, Vladimir. "Roman domination in graphs: The class ℛUV R". Discrete Mathematics, Algorithms and Applications 08, № 03 (2016): 1650049. http://dx.doi.org/10.1142/s179383091650049x.

Full text

Abstract:

For a graph [Formula: see text], a Roman dominating function (RDF) [Formula: see text] has the property that every vertex [Formula: see text] with [Formula: see text] has a neighbor [Formula: see text] with [Formula: see text]. The weight of a RDF [Formula: see text] is the sum [Formula: see text], and the minimum weight of a RDF on [Formula: see text] is the Roman domination number [Formula: see text] of [Formula: see text]. The Roman bondage number [Formula: see text] of [Formula: see text] is the minimum cardinality of all sets [Formula: see text] for which [Formula: see text]. A graph [For

APA, Harvard, Vancouver, ISO, and other styles

5

Cui, Hong, Kenneth Yang Jiang, and Partha Pratim Sanyal. "From text to RDF triple store: An application for biodiversity literature." Proceedings of the American Society for Information Science and Technology 47, no. 1 (2010): 1–2. http://dx.doi.org/10.1002/meet.14504701415.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Khoeilar, R., and S. M. Sheikholeslami. "Rainbow reinforcement numbers in digraphs." Asian-European Journal of Mathematics 10, no. 01 (2017): 1750004. http://dx.doi.org/10.1142/s1793557117500048.

Full text

Abstract:

Let [Formula: see text] be a finite and simple digraph. A [Formula: see text]-rainbow dominating function ([Formula: see text]RDF) of a digraph [Formula: see text] is a function [Formula: see text] from the vertex set [Formula: see text] to the set of all subsets of the set [Formula: see text] such that for any vertex [Formula: see text] with [Formula: see text] the condition [Formula: see text] is fulfilled, where [Formula: see text] is the set of in-neighbors of [Formula: see text]. The weight of a [Formula: see text]RDF [Formula: see text] is the value [Formula: see text]. The [Formula: see

APA, Harvard, Vancouver, ISO, and other styles

7

Dosso, Dennis, and Gianmaria Silvello. "Search Text to Retrieve Graphs: A Scalable RDF Keyword-Based Search System." IEEE Access 8 (2020): 14089–111. http://dx.doi.org/10.1109/access.2020.2966823.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Dong, Ngan T., and Lawrence B. Holder. "Natural Language Generation from Graphs." International Journal of Semantic Computing 08, no. 03 (2014): 335–84. http://dx.doi.org/10.1142/s1793351x14500068.

Full text

Abstract:

The Resource Description Framework (RDF) is the primary language to describe information on the Semantic Web. The deployment of semantic web search from Google and Microsoft, the Linked Open Data Community project along with the announcement of schema.org by Yahoo, Bing and Google have significantly fostered the generation of data available in RDF format. Yet the RDF is a computer representation of data and thus is hard for the non-expert user to understand. We propose a Natural Language Generation (NLG) engine to generate English text from a small RDF graph. The Natural Language Generation fr

APA, Harvard, Vancouver, ISO, and other styles

9

Devi, Runumi, Deepti Mehrotra, and Hajer Baazaoui-Zghal. "RDF Model Generation for Unstructured Dengue Patients' Clinical and Pathological Data." International Journal of Information System Modeling and Design 10, no. 4 (2019): 71–89. http://dx.doi.org/10.4018/ijismd.2019100104.

Full text

Abstract:

The automatic extraction of triplets from unstructured patient records and transforming them into resource description framework (RDF) models has remained a huge challenge so far, and would provide significant benefit to potential applications like knowledge discovery, machine interoperability, and ontology design in the health care domain. This article describes an approach that extracts semantics (triplets) from dengue patient case-sheets and clinical reports and transforms them into an RDF model. A Text2Ontology framework is used for extracting relations from text and was found to have limi

APA, Harvard, Vancouver, ISO, and other styles

10

Mountantonakis, Michalis, and Yannis Tzitzikas. "Linking Entities from Text to Hundreds of RDF Datasets for Enabling Large Scale Entity Enrichment." Knowledge 2, no. 1 (2021): 1–25. http://dx.doi.org/10.3390/knowledge2010001.

Full text

Abstract:

There is a high increase in approaches that receive as input a text and perform named entity recognition (or extraction) for linking the recognized entities of the given text to RDF Knowledge Bases (or datasets). In this way, it is feasible to retrieve more information for these entities, which can be of primary importance for several tasks, e.g., for facilitating manual annotation, hyperlink creation, content enrichment, for improving data veracity and others. However, current approaches link the extracted entities to one or few knowledge bases, therefore, it is not feasible to retrieve the U

APA, Harvard, Vancouver, ISO, and other styles

More sources

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!