|
|
|
|
|
Xin Tian and Yuan Meng
The judicious configuration of predicates is a crucial but often overlooked aspect in the field of knowledge graphs. While previous research has primarily focused on the precision of triples in assessing knowledge graph quality, the rationality of predic...
ver más
|
|
|
|
|
|
|
|
|
|
|
Ahmed El-Mesady, Aleksandr Y. Romanov, Aleksandr A. Amerikanov and Alexander D. Ivannikov
Recent developments in commutative algebra, linear algebra, and graph theory allow us to approach various issues in several fields. Circulant graphs now have a wider range of practical uses, including as the foundation for optical networks, discrete cell...
ver más
|
|
|
|
|
|
|
|
|
|
|
Zuoxin Wang and Xiaohu Zhao
Most current non-intrusive load monitoring methods focus on traditional load characteristic analysis and algorithm optimization, lack knowledge of users? electricity consumption behavior habits, and have poor accuracy. We propose a novel attention-guided...
ver más
|
|
|
|
|
|
|
|
|
|
|
Sirui Shen, Daobin Zhang, Shuchao Li, Pengcheng Dong, Qing Liu, Xiaoyu Li and Zequn Zhang
Heterogeneous graph neural networks (HGNNs) deliver the powerful capability to model many complex systems in real-world scenarios by embedding rich structural and semantic information of a heterogeneous graph into low-dimensional representations. However...
ver más
|
|
|
|
|
|
|
|
|
|
|
Zhihong Chang, Chunsheng Liu and Jianmin Jia
As an important component of intelligent transportation-management systems, accurate traffic-parameter prediction can help traffic-management departments to conduct effective traffic management. Due to the nonlinearity, complexity, and dynamism of highwa...
ver más
|
|
|
|
|
|
|
|
|
|
|
Rui-Yu Li, Yu Guo and Bin Zhang
Nonnegative matrix factorization (NMF) is an efficient method for feature learning in the field of machine learning and data mining. To investigate the nonlinear characteristics of datasets, kernel-method-based NMF (KNMF) and its graph-regularized extens...
ver más
|
|
|
|
|
|
|
|
|
|
|
Ahmed El-Mesady, Tasneem Farahat, Ramadan El-Shanawany and Aleksandr Y. Romanov
Nowadays, graph theory is one of the most exciting fields of mathematics due to the tremendous developments in modern technology, where it is used in many important applications. The orthogonal double cover (ODC)" role="presentation">(??????)(ODC)
(
O
D
...
ver más
|
|
|
|
|
|
|
|
|
|
|
Geneviève Simonet and Anne Berry
The atom graph of a connected graph is a graph whose vertices are the atoms obtained by clique minimal separator decomposition of this graph, and whose edges are the edges of all its atom trees. A graph G is an atom graph if there is a graph whose atom g...
ver más
|
|
|
|
|
|
|
|
|
|
|
Anne Berry and Geneviève Simonet
The atom graph of a graph is a graph whose vertices are the atoms obtained by clique minimal separator decomposition of this graph, and whose edges are the edges of all possible atom trees of this graph. We provide two efficient algorithms for computing ...
ver más
|
|
|
|
|
|
|
|
|
|
|
Chao Zhou and Tao Zhang
In real applications, massive data with graph structures are often incomplete due to various restrictions. Therefore, graph data imputation algorithms have been widely used in the fields of social networks, sensor networks, and MRI to solve the graph dat...
ver más
|
|
|
|
|
|