LYLong Yin

Long Yin

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Long Yin has a total of 9 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Improving Enzyme Prediction with Chemical Reaction Equations by Hypergraph-Enhanced Knowledge Graph Embeddings

    by Tengwei Song, Long Yin, Zhen Han, Zhiqiang Xu

    Predicting enzyme-substrate interactions has long been a fundamental problem in biochemistry and metabolic engineering. While existing methods could leverage databases of expert-curated enzyme-substrate pairs for models to learn from known pair interactions, the databases are often sparse, i.e., there are only limited and incomplete examples of such pairs, and also labor-intensive to maintain. This lack of sufficient training data significantly hinders the ability of traditional enzyme prediction models to generalize to unseen interactions. In this work, we try to exploit chemical reaction equations from domain-specific databases, given their easier accessibility and denser, more abundant data. However, interactions of multiple compounds, e.g., educts and products, with the same enzymes create complex relational data patterns that traditional models cannot easily capture. To tackle that, we represent chemical reaction equations as triples of (educt, enzyme, product) within a knowledge graph, such that we can take advantage of knowledge graph embedding (KGE) to infer missing enzyme-substrate pairs for graph completion. Particularly, in order to capture intricate relationships among compounds, we propose our knowledge-enhanced hypergraph model for enzyme prediction, i.e., Hyper-Enz, which integrates a hypergraph transformer with a KGE model to learn representations of the hyper-edges that involve multiple educts and products. Also, a multi-expert paradigm is introduced to guide the learning of enzyme-substrate interactions with both the proposed model and chemical reaction equations. Experimental results show a significant improvement, with up to a 88% relative improvement in average enzyme retrieval accuracy and 30% improvement in pair-level prediction compared to traditional models, demonstrating the effectiveness of our approach.

  • Expressiveness Analysis and Enhancing Framework for Geometric Knowledge Graph Embedding Models

    by Tengwei Song, Long Yin, Yang Liu, Long Liao, Jie Luo, Zhiqiang Xu

    Existing geometric knowledge graph embedding methods employ various relational transformations, such as translation, rotation, and projection, to model different relation patterns, which aims to enhance the expressiveness of models. In contrast to current approaches that treat the expressiveness of the model as a binary issue, we aim to delve deeper into analyzing the level of difficulty in which geometric knowledge graph embedding models can represent relation patterns. In this paper, we provide a theoretical analysis framework that measures the expressiveness of the model in relation patterns by quantifying the size of the solution space of linear equation systems. Additionally, we propose a mechanism for imposing relational constraints on geometric knowledge graph embedding models by setting “traps” near relational optimal solutions, which enables the model to better converge to the optimal solution. Empirically, we analyze and compare several typical knowledge graph embedding models with different geometric algebras, revealing that some models have insufficient solution space due to their design, which leads to performance weaknesses. We also demonstrate that the proposed relational constraint operations can improve the performance of certain relation patterns. The experimental results on public benchmarks and relation pattern specified dataset are consistent with our theoretical analysis.


  • Joint Access and Relay-Assisted Backhaul Resource Allocation for Dense mmWave Multiple Access Networks

    by Jinsong Gui, Long Yin, Xiaoheng Deng, Lin Cai

    In dense millimeter wave (mmWave) multiple access networks, there are a large number of wireless access links and wireless backhaul links. The mmWave bandwidth is shared among two types of links. So a time-division mode is appropriate for such a scenario to determine a reasonable backhaul/access transmission duration, which is critical to network performance. Meanwhile, minimizing energy consumption is also an important design objective. However, the existence of long backhaul links is an obstacle. The introduction of relay mode can overcome it, but it also leads to more complex mutual interference relationships. On the other hand, each individual (e.g., smart wireless device) wants to obtain the highest access data rate, but it may prevent the entire network from achieving the highest energy efficiency. To cope with these challenges, we propose the new mutual interference characterization method and model the joint access and relay-assisted backhaul resource allocation problem as a Stackelberg game. The Stackelberg Nash equilibrium is guaranteed by the rational design of utility function, and the corresponding solution is solved by a backward induction method. Simulation results show that, our scheme is superior to the state-of-the-art in terms of network sum rate and network energy efficiency, and also it achieves a better balance between the access data rate and backhaul data rate for each access point.