Results 31 to 40 of about 6,572,416 (223)
Microsoft Academic Graph: When experts are not enough
Quantitative Science Studies, 2020 An ongoing project explores the extent to which artificial intelligence (AI), specifically in the areas of natural language processing and semantic reasoning, can be exploited to facilitate the studies of science by deploying software agents equipped ...
Kuansan Wang +5 more
semanticscholar +1 more source
Graph Theory and Additive Combinatorics
, 2023 Using the dichotomy of structure and pseudorandomness as a central theme, this accessible text provides a modern introduction to extremal graph theory and additive combinatorics.
Yufei Zhao
semanticscholar +1 more source
Locally Private Graph Neural Networks [PDF]
Conference on Computer and Communications Security, 2020 Graph Neural Networks (GNNs) have demonstrated superior performance in learning node representations for various graph inference tasks. However, learning over graph data can raise privacy concerns when nodes represent people or human-related variables ...
Sina Sajadmanesh, D. Gática-Pérez
semanticscholar +1 more source
Graph coarsening: from scientific computing to machine learning [PDF]
SeMA Journal, 2021 The general method of graph coarsening or graph reduction has been a remarkably useful and ubiquitous tool in scientific computing and it is now just starting to have a similar impact in machine learning.
Jie Chen, Y. Saad, Zecheng Zhang
semanticscholar +1 more source
Functional centrality in graphs [PDF]
Linear and Multilinear Algebra, 2007 In this paper we introduce the functional centrality as a generalization of the subgraph centrality. We propose a general method for characterizing nodes in the graph according to the number of closed walks starting and ending at the node. Closed walks are appropriately weighted according to the topological features that we need to measure.
Rodriguez, J. A. +2 more
openaire +2 more sources
Journal of Medicinal Chemistry, 2015 Drug development has a high attrition rate, with poor pharmacokinetic and safety properties a significant hurdle. Computational approaches may help minimize these risks.
Douglas E. V. Pires +2 more
semanticscholar +1 more source
Commuting graphs and extremal centralizers
Ars Mathematica Contemporanea, 2013 We determine the conditions for matrix centralizers which can guarantee the connectedness of the commuting graph for the full matrix algebra M n ( F ) over an arbitrary field F . It is known that if F is an algebraically closed field and n ≥ 3 , then the diameter of the commuting graph of M n ( F ) is always equal to four.
Dolinar, Gregor +3 more
openaire +4 more sources
Central loops in random planar graphs [PDF]
Physical Review E, 2017 Random planar graphs appear in a variety of context and it is important for many different applications to be able to characterize their structure. Local quantities fail to give interesting information and it seems that path-related measures are able to convey relevant information about the organization of these structures.
Lion, Benjamin, Barthelemy, Marc
openaire +3 more sources
Journal of Chemical Information and Modeling, 2021 The estimation of chemical reaction properties such as activation energies, rates, or yields is a central topic of computational chemistry. In contrast to molecular properties, where machine learning approaches such as graph convolutional neural networks
Esther Heid, W. Green
semanticscholar +1 more source
ACHROMATIC COLORING OF QUADRILATERAL SNAKES
Journal of Amasya University the Institute of Sciences and Technology, 2021 The Main objective of this article is to discuss achromatic coloring and to investigate the achromatic number of the central graph of quadrilateral snake, double quadrilateral snake, triple quadrilateral snake, k-quadrilateral snake, alternate ...
Yashwant Panwar, Akhlak Mansurı
doaj