A Graph Partitioning Approach to Entity Disambiguation Using Uncertain Information

2008 ◽  
pp. 428-439 ◽  
Author(s):  
Emili Sapena ◽  
Lluís Padró ◽  
Jordi Turmo
Keyword(s):  
Graph Partitioning ◽  
Uncertain Information ◽  
Entity Disambiguation

The choice of optimum cross section for overhead line by economic intervals' method

2011 ◽  
Vol 28 (1) ◽  
pp. 37-42 ◽  
Author(s):  
Svetlana Guseva ◽  
Lubov Petrichenko
Keyword(s):  
Cross Section ◽  
Current Density ◽  
Uncertain Information ◽  
Overhead Line ◽  
Market Conditions ◽  
Overhead Lines ◽  
Mathcad Software

The choice of optimum cross section for overhead line by economic intervals' methodIn this paper an approach to choosing the optimum cross section for overhead line in conditions of incomplete and uncertain information is considered. The two methods of such choice are presented: method of economic current density and economic intervals' method. The correction of the economic intervals method is offered under market conditions of costs. As example 20 kV and 110 kV overhead lines with aluminum, copper and ferroaluminum wires are selected. Universal nomograms with different standard cross section are calculated and constructed. The graphics using Mathcad software are offered.

FINAL VERSION.pdf

2019 ◽  
Author(s):  
Nasir Saeed ◽  
Mohamed-Slim Alouini ◽  
Tareq Y. Al-Naffouri
Keyword(s):  
Graph Partitioning ◽  
Three Dimensional ◽  
Smart Objects ◽  
Localization Technique ◽  
Optical Internet ◽  
Spectral Graph ◽  
Accurate Localization ◽  
Spectral Graph Partitioning ◽  
Link Connectivity

<div>Localization is a fundamental task for optical internet</div><div>of underwater things (O-IoUT) to enable various applications</div><div>such as data tagging, routing, navigation, and maintaining link connectivity. The accuracy of the localization techniques for OIoUT greatly relies on the location of the anchors. Therefore, recently localization techniques for O-IoUT which optimize the anchor’s location are proposed. However, optimization of anchors location for all the smart objects in the network is not a useful solution. Indeed, in a network of densely populated smart objects, the data collected by some sensors are more valuable than the data collected from other sensors. Therefore, in this paper, we propose a three-dimensional accurate localization technique by optimizing the anchor’s location for a set of smart objects. Spectral graph partitioning is used to select the set of valuable</div><div>sensors.</div>

Mathematics of networks

2018 ◽  
Author(s):  
Mark Newman
Keyword(s):  
Random Walks ◽  
Adjacency Matrix ◽  
Graph Partitioning ◽  
Dynamic Networks ◽  
Graph Laplacian ◽  
Network Visualization ◽  
Final Part ◽  
Bipartite Networks ◽  
Component Structure ◽  
Basic Properties

An introduction to the mathematical tools used in the study of networks. Topics discussed include: the adjacency matrix; weighted, directed, acyclic, and bipartite networks; multilayer and dynamic networks; trees; planar networks. Some basic properties of networks are then discussed, including degrees, density and sparsity, paths on networks, component structure, and connectivity and cut sets. The final part of the chapter focuses on the graph Laplacian and its applications to network visualization, graph partitioning, the theory of random walks, and other problems.

Decision Support Under Incomplete and Uncertain Information

1998 ◽  
Vol 31 (20) ◽  
pp. 721-726
Author(s):  
Arkady Borisov ◽  
Clara Savchenko
Keyword(s):  
Decision Support ◽  
Uncertain Information

Processing uncertain information in the linear space of fuzzy sets

1991 ◽  
Vol 44 (2) ◽  
pp. 187-198 ◽  
Author(s):  
Wladyslaw Homenda ◽  
Witold Pedrycz
Keyword(s):  
Fuzzy Sets ◽  
Linear Space ◽  
Uncertain Information

scholarly journals Toward a Coronavirus Knowledge Graph

Genes ◽  
2021 ◽  
Vol 12 (7) ◽  
pp. 998
Author(s):  
Peng Zhang ◽  
Yi Bu ◽  
Peng Jiang ◽  
Xiaowen Shi ◽  
Bing Lun ◽  
...  
Keyword(s):  
Drug Discovery ◽  
Angiotensin Converting Enzyme ◽  
Information Sources ◽  
Knowledge Graph ◽  
Converting Enzyme ◽  
Related Information ◽  
Relationship Types ◽  
Entity Disambiguation ◽  
Public Datasets ◽  
Biological Entities

This study builds a coronavirus knowledge graph (KG) by merging two information sources. The first source is Analytical Graph (AG), which integrates more than 20 different public datasets related to drug discovery. The second source is CORD-19, a collection of published scientific articles related to COVID-19. We combined both chemo genomic entities in AG with entities extracted from CORD-19 to expand knowledge in the COVID-19 domain. Before populating KG with those entities, we perform entity disambiguation on CORD-19 collections using Wikidata. Our newly built KG contains at least 21,700 genes, 2500 diseases, 94,000 phenotypes, and other biological entities (e.g., compound, species, and cell lines). We define 27 relationship types and use them to label each edge in our KG. This research presents two cases to evaluate the KG’s usability: analyzing a subgraph (ego-centered network) from the angiotensin-converting enzyme (ACE) and revealing paths between biological entities (hydroxychloroquine and IL-6 receptor; chloroquine and STAT1). The ego-centered network captured information related to COVID-19. We also found significant COVID-19-related information in top-ranked paths with a depth of three based on our path evaluation.

Sign in / Sign up

Export Citation Format

Share Document