Results 61 to 70 of about 2,836,177 (344)
Labelled (Hyper)Graphs, Negotiations and the Naming Problem [PDF]
, 2008 We consider four different models of process interactions that unify and generalise models introduced and studied by Angluin et al. [2] and models introduced and studied by Mazurkiewicz [17,18]. We encode these models by labelled (hyper)graphs and relabelling rules on this labelled (hyper)graphs called negotiations.
Chalopin, Jérémie +2 more
openaire +3 more sources
Leverage Lexical Knowledge for Chinese Named Entity Recognition via Collaborative Graph Network
Conference on Empirical Methods in Natural Language Processing, 2019 The lack of word boundaries information has been seen as one of the main obstacles to develop a high performance Chinese named entity recognition (NER) system.
Dianbo Sui +4 more
semanticscholar +1 more source
AAAI Conference on Artificial Intelligence, 2020 Spatial-temporal network data forecasting is of great importance in a huge amount of applications for traffic management and urban planning. However, the underlying complex spatial-temporal correlations and heterogeneities make this problem challenging ...
Chao Song +3 more
semanticscholar +1 more source
Name disambiguation from link data in a collaboration graph [PDF]
2014 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2014), 2014 The entity disambiguation task partitions the records belonging to multiple persons with the objective that each decomposed partition is composed of records of a unique person. Existing solutions to this task use either biographical attributes, or auxiliary features that are collected from external sources, such as Wikipedia.
Baichuan Zhang +2 more
openaire +2 more sources
Named entity disambiguation in short texts over knowledge graphs [PDF]
Knowledge and Information Systems, 2022 The ever-growing usage of knowledge graphs (KGs) positions named entity disambiguation (NED) at the heart of designing accurate KG-driven systems such as query answering systems (QAS). According to the current research, most studies dealing with NED on KGs involve long texts, which is not the case of short text fragments, identified by their limited ...
Wissem Bouarroudj +2 more
openaire +2 more sources
KCD indices and coindices of graphs
Ratio Mathematica, 2020 The relationship between vertices of a graph is always an interesting fact, but the relations of vertices and edges also seeks attention. Motivation of the relationship between vertices and edges of a graph has helped to arise with a set of new degree ...
Keerthi G. Mirajkar, Akshata Morajkar
doaj +1 more source
Using graph distances for named-entity linking
Science of Computer Programming, 2016 We formalize entity linking as an optimization problem.The problem is NP-hard but solvable in linear time under restrictive assumptions.We propose heuristics enforcing the assumptions or optimizing similar objectives.We show how our approaches perform w.r.t. some baselines on real data. Entity-linking is a natural-language-processing task that consists
Blanco Roi, Boldi Paolo, Marino Andrea
openaire +4 more sources
Named Graphs as a Mechanism for Reasoning About Provenance [PDF]
, 2006 Named Graphs is a simple, compatible extension to the RDF abstract syntax that enables statements to be made about RDF graphs. This approach is in contrast to earlier attempts such as RDF reification, or knowledge-base specific extensions including quads and contexts.
Watkins, E. Rowland, Nicole, Denis A.
openaire +3 more sources
GraphTranslator: Aligning Graph Model to Large Language Model for Open-ended Tasks [PDF]
The Web ConferenceLarge language models (LLMs) like ChatGPT, exhibit powerful zero-shot and instruction-following capabilities, have catalyzed a revolutionary transformation across diverse fields, especially for open-ended tasks.
Mengmei Zhang +8 more
semanticscholar +1 more source
MAGNN: Metapath Aggregated Graph Neural Network for Heterogeneous Graph Embedding [PDF]
The Web Conference, 2020 A large number of real-world graphs or networks are inherently heterogeneous, involving a diversity of node types and relation types. Heterogeneous graph embedding is to embed rich structural and semantic information of a heterogeneous graph into low ...
Xinyu Fu +3 more
semanticscholar +1 more source