Results 281 to 290 of about 554,031 (298)
Some of the next articles are maybe not open access.
Journal of Web Semantics, 2005
The Semantic Web consists of many RDF graphs nameable by URIs. This paper extends the syntax and semantics of RDF to cover such named graphs. This enables RDF statements that describe graphs, which is beneficial in many Semantic Web application areas. Named graphs are given an abstract syntax, a formal semantics, an XML syntax, and a syntax based on N3.
Carroll, Jeremy J. +3 more
openaire +2 more sources
The Semantic Web consists of many RDF graphs nameable by URIs. This paper extends the syntax and semantics of RDF to cover such named graphs. This enables RDF statements that describe graphs, which is beneficial in many Semantic Web application areas. Named graphs are given an abstract syntax, a formal semantics, an XML syntax, and a syntax based on N3.
Carroll, Jeremy J. +3 more
openaire +2 more sources
On Graph-Based Name Disambiguation
Journal of Data and Information Quality, 2011Name ambiguity stems from the fact that many people or objects share identical names in the real world. Such name ambiguity decreases the performance of document retrieval, Web search, information integration, and may cause confusion in other applications.
Xiaoming Fan +4 more
openaire +1 more source
Named graphs, provenance and trust
Proceedings of the 14th international conference on World Wide Web - WWW '05, 2005The Semantic Web consists of many RDF graphs nameable by URIs. This paper extends the syntax and semantics of RDF to cover such Named Graphs. This enables RDF statements that describe graphs, which is beneficial in many Semantic Web application areas.
Carroll, Jeremy J. +3 more
openaire +2 more sources
Named Entity Recognition as Graph Classification
2021Injecting real-world information (typically contained in Knowledge Graphs) and human expertise into an end-to-end training pipeline for Natural Language Processing models is an open challenge. In this preliminary work, we propose to approach the task of Named Entity Recognition, which is traditionally viewed as a Sequence Labeling problem, as a Graph ...
Ismail Harrando, Raphaël Troncy
openaire +1 more source
Statistical estimation of the names of HTTPS servers with domain name graphs
Computer Communications, 2016We present the domain name graph (DNG), which is a formal expression that can keep track of CNAME chains and characterize the dynamic and diverse nature of DNS mechanisms and deployments.We develop a framework called Service-Flow map (SFMap) that works on top of the DNG.
Tatsuya Mori +6 more
openaire +1 more source
2011
We address how the structure of a social communication system affects language coordination. The naming game is an abstraction of lexical acquisition dynamics, in which N agents try to find an agreement on the names to give to objects. Most results on naming games are specific to certain communication network topologies.
Giorgio Gosti, William H. Batchelder
openaire +1 more source
We address how the structure of a social communication system affects language coordination. The naming game is an abstraction of lexical acquisition dynamics, in which N agents try to find an agreement on the names to give to objects. Most results on naming games are specific to certain communication network topologies.
Giorgio Gosti, William H. Batchelder
openaire +1 more source
The Mathematics Teacher, 1995
If the reader recognizes immediately the function in figure 1, then what follows may be anticlimactic. But 1f anythmg seems peculiar, some interesting surprises may be in store. A check of a few textbooks reveals a neglect of function, whose lessons are overlooked.
openaire +1 more source
If the reader recognizes immediately the function in figure 1, then what follows may be anticlimactic. But 1f anythmg seems peculiar, some interesting surprises may be in store. A check of a few textbooks reveals a neglect of function, whose lessons are overlooked.
openaire +1 more source
Building a Graph of Names and Contextual Patterns for Named Entity Classification
2009An algorithm that bootstraps the acquisition of large dictionaries of entity types (names) and pattern types from a few seeds and a large unannotated corpora is presented. The algorithm iteratively builds a bigraph of entities and collocated patterns by querying the text. Several classes simultaneously compete to label the entity types.
César de Pablo-Sánchez +1 more
openaire +1 more source
NamE: Capturing Biological Context in KGEs via Contextual Named Graph Embeddings
2024 46th Annual International Conference of the IEEE Engineering in Medicine and Biology Society (EMBC)Large biological databases have become standard in many fields of biology, particularly biomedicine. Much of this data (such as that from DrugBank, PharmKG, PrimeKG, BIOSNAP, and others) is now expressed in a Knowledge Graph (KG) format in which concepts (such as drugs and diseases) are represented as nodes and the relationships between then (such as ...
Jeffrey, Sardina +3 more
openaire +2 more sources
An Approach for Named Entity Disambiguation with Knowledge Graph
2018 International Conference on Audio, Language and Image Processing (ICALIP), 2018Entity disambiguation has always been a key issue in the field of semantic analysis, question answering and recommendation system. The existing approaches for entity disambiguation are based on similarity calculation. The similarity is calculated by considering the similarity of entity context, or the correlation between entities.
Ke Zhang +4 more
openaire +1 more source