Results 51 to 60 of about 3,015 (169)

Interpretable Tree‐Based Models for Predicting Short‐Term Rockburst Risk Considering Multiple Factors

Energy Science &Engineering, EarlyView.
Interpretable tree‐based models integrate microseismic, geological, and mining indicators to predict short‐term rockburst risk. SHAP analysis reveals the dominant role of energy‐related features and clarifies nonlinear factor interactions, enabling transparent and reliable early‐warning in deep coal mines.
Shuai Chen, Linming Dou, Atao Li, Wu Cai, Lei Zhang   +4 more
wiley   +1 more source

哈林图的偶匹配可扩性(Bipartite matching-extendability of Halin graphs)

Zhejiang Daxue xuebao. Lixue ban, 2009
Let G be a connected graph containing a perfect matching. G is said to be bipartite matching extendable if every matching M of G whose induced subgraph is a bipartite matching extends to a perfect matching of G. The main result is as follows: Halin graph
HUIZhi-hao(惠志昊), ZHAOBiao(赵飚)
doaj   +1 more source

Efficient Subgraph Matching on Heterogeneous Graphs via Concurrent Graphics Processing Units Processing

IEEE Access
Subgraph matching is a key graph analysis technique employed in a wide range of fields, including security threat detection and biological network analysis.
Jongwoo Jeon, Sangho Song, Dojin Choi, Jongtae Lim, Kyoungsoo Bok, Jaesoo Yoo   +5 more
doaj   +1 more source

Explainable Neural Subgraph Matching With Learnable Multi-Hop Attention

IEEE Access
Subgraph matching is a challenging problem with a wide range of applications in drug discovery, social network analysis, biochemistry, and cognitive science.
Duc Q. Nguyen, Thanh Toan Nguyen, Jun Jo, Florent Poux, Shikha Anirban, Tho T. Quan   +5 more
doaj   +1 more source

Extremal Matching Energy of Random Polyomino Chains

Entropy, 2017
Polyomino graphs is one of the research objectives in statistical physics and in modeling problems of surface chemistry. A random polyomino chain is a subgraph of a polyomino graph.
Tingzeng Wu, Huazhong Lü, Xuexin Zhang
doaj   +1 more source

View-Based 3D Model Retrieval by Joint Subgraph Learning and Matching

IEEE Access, 2020
View-based 3D model retrieval is an important and challenging task in computer vision, which can be utilized in many applications such as landmark detection, image set classification, etc.
Haipeng Guan, Qiuxia Zhao, Yan Ren, Weizhi Nie   +3 more
doaj   +1 more source

Accelerating Streaming Subgraph Matching via Vector Databases

Intelligent Computing
Graphs are widely used in applications such as social network analysis, bioinformatics, and recommendation systems to represent relationships and complex dependencies.
Liuyi Chen, Yi Ding, Xushuo Tang, Fangyue Chen, Siyuan Gong, Xu Zhou, Zhengyi Yang   +6 more
doaj   +1 more source

Verifiable Subgraph Matching With Cryptographic Accumulators in Cloud Computing

IEEE Access, 2019
Due to the rapid development of social networks, bio-informatics, internet-of-things etc., subgraph matching query can be found in various applications.
Yixiao Zhu, Hui Li, Jiangtao Cui, Yong Ma   +3 more
doaj   +1 more source

Subgraph Matching with Semidefinite Programming

Electronic Notes in Discrete Mathematics, 2003
Abstract We present a convex programming approach to the problem of matching subgraphs which represent object views against larger graphs which represent scenes. Starting from a linear programming formulation for computing optimal matchings in bipartite graphs, we extend the linear objective function in order to take into account the relational ...
Schellewald, Christian, Schnörr, Christoph   +1 more
openaire   +2 more sources

Efficient Subgraph Matching on Large RDF Graphs Using MapReduce

Data Science and Engineering, 2019
With the popularity of knowledge graphs growing rapidly, large amounts of RDF graphs have been released, which raises the need for addressing the challenge of distributed subgraph matching queries.
Xin Wang, Lele Chai, Qiang Xu, Yajun Yang, Jianxin Li, Junhu Wang, Yunpeng Chai   +6 more
doaj   +1 more source