Results 81 to 90 of about 564 (166)
Quad Census Computation : Simple, Efficient, and Orbit-Aware
The prevalence of select substructures is an indicator of network effects in applications such as social network analysis and systems biology. Moreover, subgraph statistics are pervasive in stochastic network models, and they need to be assessed ...
Brandes, Ulrik +3 more
core +1 more source
CF‐SBERTHet: Collaborative and Textual Knowledge Enhanced Semantic Graphs for Sparse Recommendations
ABSTRACT Modern e‐commerce platforms face a critical challenge: delivering accurate recommendations under extreme user–item interaction sparsity, where textual context remains systematically underutilised. Existing collaborative filtering methods degrade sharply in sparse settings, while semantic approaches fail to capture collaborative patterns ...
He Ma +7 more
wiley +1 more source
Abstract The exponential growth of scientific literature—over 2.5 million papers and 3.5 million patents annually—poses critical challenges for knowledge discovery. To address these, we propose SCIMKG (Scientific Knowledge Graph), a framework for constructing scientific knowledge graphs via multi‐source heterogeneous multi‐source.
Erxi Zhu, Yuan Hu
wiley +1 more source
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 +4 more
wiley +1 more source
Taxonomy of Graphs of Order 10
Extending earlier data summaries for graphs of order n 9, this paper describes structural characteristics and relationships for the 12005168 graphs of order 10.
MacDougall, James A. +2 more
core
ABSTRACT The analysis of certain properties of the underlying graph of a public transport network generates insights about the network's structure. Hereby, the choice of the graph representation depends on a trade‐off between complexity reduction and information preservation to adequately model a public transport network.
Michael Palk +2 more
wiley +1 more source
Finding Maximum Weight 2‐Packing Sets on Arbitrary Graphs
ABSTRACT A 2‐packing set for an undirected, weighted graph G=(V,E,w) is a subset 𝒮⊆V such that any two vertices v1,v2∈𝒮 are not adjacent and have no common neighbors. The Maximum Weight 2‐Packing Set problem that asks for a 2‐packing set of maximum weight is NP‐hard.
Jannick Borowitz +2 more
wiley +1 more source
A Resource Efficient Ising Model‐Based Quantum Sudoku Solver
ABSTRACT Background Quantum algorithms exploit superposition and parallelism to address complex combinatorial problems, many of which fall into the non‐polynomial (NP) class. Sudoku, a widely known logic‐based puzzle, is proven to be NP‐complete and thus presents a suitable testbed for exploring quantum optimization approaches.
Wen‐Li Wang +5 more
wiley +1 more source
STARGATE-X: a Python package for statistical analysis on the REACTOME network. [PDF]
Marino A +3 more
europepmc +1 more source
Text Mining in Bibliometrics and Science Mapping: A Methodological Review
Text mining has become a foundational component of contemporary bibliometrics and science mapping, enabling systematic analysis of the semantic structure, thematic evolution, and cognitive organization of scientific fields. Integrating textual evidence with relational indicators enriches knowledge maps and supports more comprehensive, content‐sensitive
Michelangelo Misuraca
wiley +1 more source

