Search Results (18)

Rapid technological innovation has made navigating millions of new patent filings a critical challenge for corporations and research institutions. Existing patent recommendation systems, largely constrained by their static designs, struggle to capture the dynamic pulse of an ever-evolving technological ecosystem. At the same time, their “black-box” decision-making processes severely limit their trustworthiness and practical value in high-stakes, real-world scenarios. To address this impasse, we introduce TEAHG-EPR, a novel, end-to-end framework for explainable patent recommendation. The core of our approach is to reframe the recommendation task as a dynamic learning and reasoning process on a temporal-aware attributed heterogeneous graph. Specifically, we first construct a sequence of patent knowledge graphs that evolve on a yearly basis. A dual-encoder architecture, comprising a Relational Graph Convolutional Network (R-GCN) and a Bidirectional Long Short-Term Memory network (Bi-LSTM), is then employed to simultaneously capture the spatial structural information within each time snapshot and the evolutionary patterns across time. Building on this foundation, we innovatively introduce uncertainty modeling, learning a dual “deterministic core + probabilistic potential” representation for each entity and balancing recommendation precision with exploration through a hybrid similarity metric. Finally, to achieve true explainability, we design a feature-guided controllable text generation module that can attach a well-reasoned, faithful textual explanation to every single recommendation. We conducted comprehensive experiments on two large-scale datasets: a real-world industrial patent dataset (USPTO) and a classic academic dataset (AMiner). The results are compelling: TEAHG-EPR not only significantly outperforms all state-of-the-art baselines in recommendation accuracy but also demonstrates a decisive advantage across multiple “beyond-accuracy” dimensions, including explanation quality, diversity, and novelty. Full article

The increasing sophistication of social bots demands advanced simulation frameworks to model potential vulnerabilities in detection systems and probe their robustness.While existing studies have explored aspects of social bot simulation, they often fall short in capturing key adversarial behaviors. To address this gap, we propose a simulation framework that jointly incorporates both realistic behavioral mimicry and adaptive inter-bot coordination. Our approach introduces a human-like behavior module that reduces detectable divergence from genuine user activity patterns through distributional matching, combined with a coordination module that enables strategic cooperation while maintaining structural stealth. The effectiveness of the proposed framework is validated through adversarial simulations against both feature-based (Random Forest) and graph-based (BotRGCN) detectors on a real-world dataset. Experimental results demonstrate that our approach enables bots to achieve remarkable evasion capabilities, with the human-like behavior module reaching up to a 100% survival rate against RF-based detectors and 99.1% against the BotRGCN detector. This study yields two key findings: (1) The integration of human-like behavior and target-aware coordination establishes a new paradigm for simulating botnets that are resilient to both feature-based and graph-based detectors; (2) The proposed likelihood-based reward and group-state optimization mechanism effectively align botnet activities with the social context, achieving concealment through integration rather than mere avoidance. The framework provides valuable insights into the complex interplay between evasion strategies and detector effectiveness, offering a robust foundation for future research on social bot threats. Full article

English argumentative writing is a cornerstone of academic and professional communication, yet it remains a significant challenge for second-language (L2) learners. While Large Language Models (LLMs) show promise as components in automated feedback systems, their responses are often generic and lack the structural insight necessary for meaningful improvement. Existing Automated Essay Scoring (AES) systems, conversely, typically provide holistic scores without the kind of actionable, fine-grained advice that can guide concrete revisions. To bridge this systemic gap, we introduce ARGUS (Argument Understanding and Structured-feedback), a novel neuro-symbolic system that synergizes the semantic understanding of LLMs with the structured reasoning of Graph Neural Networks (GNNs). The ARGUS system architecture comprises three integrated modules: (1) an LLM-based parser transforms an essay into a structured argument graph; (2) a Relational Graph Convolutional Network (R-GCN) analyzes this symbolic structure to identify specific logical and structural flaws; and (3) this flaw analysis directly guides a conditional LLM to generate feedback that is not only contextually relevant but also pinpoints precise weaknesses in the student’s reasoning. We evaluate ARGUS on the Argument Annotated Essays corpus and on an additional set of 150 L2 persuasive essays collected from the same population to augment training of both the parser and the structural flaw detector. Our argument parsing module achieves a component identification F1-score of 90.4% and a relation identification F1-score of 86.1%. The R-GCN-based structural flaw detector attains a macro-averaged F1-score of 0.83 across the seven flaw categories, indicating that the enriched training data substantially improves its generalization. Most importantly, in a human evaluation study, feedback generated by the ARGUS system was rated as consistently and significantly more specific, accurate, actionable, and helpful than that from strong baselines, including a fine-tuned LLM and a zero-shot GPT-4. Our work demonstrates a robust systems engineering approach, grounding LLM-based feedback in GNN-driven structural analysis to create an intelligent teaching system that provides targeted, pedagogically valuable guidance for L2 student writers engaging with persuasive essays. Full article

Molecular toxicity prediction plays a crucial role in drug screening and environmental health risk assessment. Traditional toxicity prediction models primarily rely on molecular fingerprints and other structural features, while neglecting the complex biological mechanisms underlying compound toxicity, resulting in limited predictive accuracy, poor interpretability, and reduced generalizability. To address this challenge, this study proposes a novel molecular toxicity prediction framework that integrates knowledge graphs with Graph Neural Networks (GNNs). Specifically, we constructed a heterogeneous toxicological knowledge graph (ToxKG) based on ComptoxAI. ToxKG incorporates data from authoritative databases such as PubChem, Reactome, and ChEMBL, and covers multiple entities and relationships including chemicals, genes, signaling pathways, and bioassays. We then systematically evaluated six representative GNN models (GCN, GAT, R-GCN, HRAN, HGT, and GPS) on the Tox21 dataset. Experimental results demonstrate that heterogeneous graph models enriched with ToxKG information significantly outperform traditional models relying solely on structural features across multiple metrics including AUC, F1-score, ACC, and balanced accuracy (BAC). Notably, the GPS model achieved the highest AUC value (0.956) for key receptor tasks such as NR-AR, highlighting the critical role of biological mechanism information and heterogeneous graph structures in toxicity prediction. This study provides a promising pathway toward the development of interpretable and efficient intelligent models for toxicological risk assessment. Full article

The proliferation of malicious social bots poses severe threats to cybersecurity and social media information ecosystems. Existing detection methods often overlook the semantic value and emotional cues conveyed by emojis in user-generated tweets. To address this gap, we propose ESA-BotRGCN, an emoji-driven multi-modal detection framework that integrates semantic enhancement, sentiment analysis, and multi-dimensional feature modeling. Specifically, we first establish emoji–text mapping relationships using the Emoji Library, leverage GPT-4 to improve textual coherence, and generate tweet embeddings via RoBERTa. Subsequently, seven sentiment-based features are extracted to quantify statistical disparities in emotional expression patterns between bot and human accounts. An attention gating mechanism is further designed to dynamically fuse these sentiment features with user description, tweet content, numerical attributes, and categorical features. Finally, a Relational Graph Convolutional Network (RGCN) is employed to model heterogeneous social topology for robust bot detection. Experimental results on the TwiBot-20 benchmark dataset demonstrate that our method achieves a superior accuracy of 87.46%, significantly outperforming baseline models and validating the effectiveness of emoji-driven semantic and sentiment enhancement strategies. Full article

The prediction of microRNA-disease associations (MDAs) is crucial for understanding disease mechanisms and biomarker discovery. While graph neural networks have emerged as promising tools for MDA prediction, existing methods face critical limitations: (1) data leakage caused by improper use of Gaussian interaction profile (GIP) kernel similarity during feature construction, (2) self-validation loops in calculating miRNA functional similarity using known MDA data, and (3) information bottlenecks in conventional graph neural network (GNN) architectures that flatten heterogeneous relationships and employ over-simplified decoders. To address these challenges, we propose CoupleMDA, a metapath-guided heterogeneous graph learning framework coupling structural and semantic features. The model constructs a biological heterogeneous network using independent data sources to eliminate feature-target space coupling. Our framework implements a two-stage encoding strategy: (1) relational graph convolutional networks (RGCN) for pre-encoding and (2) metapath-guided semantic aggregation for secondary encoding. During decoding, common metapaths between node pairs structurally guide feature pooling, mitigating information bottlenecks. The comprehensive evaluation shows that CoupleMDA achieves a 2–5% performance improvement over the current state-of-the-art baseline methods in the heterogeneous graph link prediction task. Ablation studies confirm the necessity of each proposed component, while case analyses reveal the framework’s capability to recover cancer-related miRNA-disease associations through biologically interpretable metapaths. Full article

Gastric cancer (GC) is a prevalent malignancy, and the discovery of biomarkers plays a crucial role in the diagnosis and prognosis of GC. However, current strategies for identifying GC biomarkers often focus on a single ribonucleic acid (RNA) class, neglecting the potential for multiple RNA types to collectively serve as biomarkers with improved predictive capabilities. To bridge this gap, our study introduces the GC biomarker relation graph convolution neural network (GCBRGCN) model which integrates the competing endogenous RNA (ceRNA) network with GC clinical informations and whole transcriptomics data, leveraging the relational graph convolutional network (RGCN) to predict GC biomarkers. It demonstrates exceptional performance, surpassing traditional machine learning and graph neural network algorithms with an area under the curve (AUC) of 0.8172 in the task of predicting GC biomarkers. Our study identified three unreported potential novel GC biomarkers: CCNG1, CYP1B1, and CITED2. Moreover, FOXC1 and LINC00324 were characterized as biomarkers with significance in both prognosis and diagnosis. Our work offers a novel framework for GC biomarker identification, highlighting the critical role of multiple types RNA interaction in oncological research. Full article

Accurately predicting financial entity performance remains a challenge due to the dynamic nature of financial markets and vast unstructured textual data. Financial knowledge graphs (FKGs) offer a structured representation for tackling this problem by representing complex financial relationships and concepts. However, constructing a comprehensive and accurate financial knowledge graph that captures the temporal dynamics of financial entities is non-trivial. We introduce FintechKG, a comprehensive financial knowledge graph developed through a three-dimensional information extraction process that incorporates commercial entities and temporal dimensions and uses a financial concept taxonomy that ensures financial domain entity and relationship extraction. We propose a temporal and relational graph convolutional network (RGCN)-based representation for FintechKG data across multiple timesteps, which captures temporal dependencies. This representation is then combined with FinBERT embeddings through a projection layer, enabling a richer feature space. To demonstrate the efficacy of FintechKG, we evaluate its performance using the example task of financial performance prediction. A logistic regression model uses these combined features and social media embeddings for performance prediction. We classify whether the revenue will increase or decrease. This approach demonstrates the effectiveness of FintechKG combined with textual information for accurate financial forecasting. Our work contributes a systematic FKG construction method and a framework that utilizes both relational and textual embeddings for improved financial performance prediction. Full article

Malicious social bots pose a serious threat to social network security by spreading false information and guiding bad opinions in social networks. The singularity and scarcity of single organization data and the high cost of labeling social bots have given rise to the construction of federated models that combine federated learning with social bot detection. In this paper, we first combine the federated learning framework with the Relational Graph Convolutional Neural Network (RGCN) model to achieve federated social bot detection. A class-level cross entropy loss function is applied in the local model training to mitigate the effects of the class imbalance problem in local data. To address the data heterogeneity issue from multiple participants, we optimize the classical federated learning algorithm by applying knowledge distillation methods. Specifically, we adjust the client-side and server-side models separately: training a global generator to generate pseudo-samples based on the local data distribution knowledge to correct the optimization direction of client-side classification models, and integrating client-side classification models’ knowledge on the server side to guide the training of the global classification model. We conduct extensive experiments on widely used datasets, and the results demonstrate the effectiveness of our approach in social bot detection in heterogeneous data scenarios. Compared to baseline methods, our approach achieves a nearly 3–10% improvement in detection accuracy when the data heterogeneity is larger. Additionally, our method achieves the specified accuracy with minimal communication rounds. Full article

Malaria continues to pose a significant global health burden despite concerted efforts to combat it. In 2020, nearly half of the world’s population faced the risk of malaria, underscoring the urgency of innovative strategies to tackle this pervasive threat. One of the major challenges lies in the emergence of the resistance of parasites to existing antimalarial drugs. This challenge necessitates the discovery of new, effective treatments capable of combating the Plasmodium parasite at various stages of its life cycle. Advanced computational approaches have been utilized to accelerate drug development, playing a crucial role in every stage of the drug discovery and development process. We have witnessed impressive and groundbreaking achievements, with GNNs applied to graph data and BERT from transformers across diverse NLP text analysis tasks. In this study, to facilitate a more efficient and effective approach, we proposed the integration of an NLP based model for SMILES (i.e., BERT) and a GNN model (i.e., RGCN) to predict the effect of antimalarial drugs against Plasmodium. The GNN model was trained using designed antimalarial drug and potential target (i.e., PfAcAS, F/GGPPS, and PfMAGL) graph-structured data with nodes representing antimalarial drugs and potential targets, and edges representing relationships between them. The performance of BERT-RGCN was further compared with that of Mordred-RGCN to evaluate its effectiveness. The BERT-RGCN and Mordred-RGCN models performed consistently well across different feature combinations, showcasing high accuracy, sensitivity, specificity, MCC, AUROC, and AUPRC values. These results suggest the effectiveness of the models in predicting antimalarial drugs against Plasmodium falciparum in various scenarios based on different sets of features of drugs and potential antimalarial targets. Full article

Most of the existing medical knowledge maps are incomplete and need to be completed/predicted to obtain a complete knowledge map. To solve this problem, we propose a knowledge graph embedding model (Cyclic_CKGE) based on cyclic consistency. The model first uses the “graph” constructed with the head entity and relationship to predict the tail entity, and then uses the “inverse graph” constructed with the tail entity and relationship to predict the head entity. Finally, the semantic space distance between the head entity and the original head entity should be very close, which solves the reversibility problem of the network. The Cyclic_CKGE model with a parameter of 0.46 M has the best results on FB15k-237, reaching 0.425 Hits@10. Compared with the best model R-GCN, its parameter exceeds 8 M and reaches 0.417 Hits@10. Overall, Cyclic_CKGE’s parametric efficiency is more than 17 times that of R-GCNs and more than 8 times that of DistMult. In order to better show the practical application of the model, we construct a visual medical information platform based on a medical knowledge map. The platform has three kinds of disease information retrieval methods: conditional query, path query and multi-symptom disease inference. This provides a theoretical method and a practical example for realizing knowledge graph visualization. Full article

The current fraud risk in digital finance is increasing year by year, and the mainstream solutions rely on the inherent characteristics of users, which makes it difficult to explain fraud behaviors and fraud behavior patterns are less researched. To address these problems, we propose an integrated multiple relational graphs fraud detection model Tri-RGCN-XGBoost, which analyzes the impact of user association patterns on fraud detection by mining the behavioral associations of users. The model builds a heterogeneous information network based on real transaction data, abstracts three types of bipartite graphs (user–device, user–merchant, and user–address), aggregates the information of the user’s neighbor nodes under the three types of behavioral patterns, and integrates the graph convolution classification results under the three behavioral patterns with the XGBoost model to achieve fraudulent user detection with integrated multiple relational graphs. The results show that the performance of this model in fraud identification is significantly improved, especially in reducing the fraudulent user underreporting rate. Further, the behavioral associations that play a key role in fraud user identification are analyzed in conjunction with shape value to provide a reference for fraud pattern mining. Full article

EEG-based emotion recognition has become an important part of human–computer interaction. To solve the problem that single-modal features are not complete enough, in this paper, we propose a multimodal emotion recognition method based on the attention recurrent graph convolutional neural network, which is represented by Mul-AT-RGCN. The method explores the relationship between multiple-modal feature channels of EEG and peripheral physiological signals, converts one-dimensional sequence features into two-dimensional map features for modeling, and then extracts spatiotemporal and frequency–space features from the obtained multimodal features. These two types of features are input into a recurrent graph convolutional network with a convolutional block attention module for deep semantic feature extraction and sentiment classification. To reduce the differences between subjects, a domain adaptation module is also introduced to the cross-subject experimental verification. This proposed method performs feature learning in three dimensions of time, space, and frequency by excavating the complementary relationship of different modal data so that the learned deep emotion-related features are more discriminative. The proposed method was tested on the DEAP, a multimodal dataset, and the average classification accuracies of valence and arousal within subjects reached 93.19% and 91.82%, respectively, which were improved by 5.1% and 4.69%, respectively, compared with the only EEG modality and were also superior to the most-current methods. The cross-subject experiment also obtained better classification accuracies, which verifies the effectiveness of the proposed method in multimodal EEG emotion recognition. Full article

Twitter, as a popular social network, has been targeted by different bot attacks. Detecting social bots is a challenging task, due to their evolving capacity to avoid detection. Extensive research efforts have proposed different techniques and approaches to solving this problem. Due to the scarcity of recently updated labeled data, the performance of detection systems degrades when exposed to a new dataset. Therefore, semi-supervised learning (SSL) techniques can improve performance, using both labeled and unlabeled examples. In this paper, we propose a framework based on the multi-view graph attention mechanism using a transfer learning (TL) approach, to predict social bots. We called the framework ‘Bot-MGAT’, which stands for bot multi-view graph attention network. The framework used both labeled and unlabeled data. We used profile features to reduce the overheads of the feature engineering. We executed our experiments on a recent benchmark dataset that included representative samples of social bots with graph structural information and profile features only. We applied cross-validation to avoid uncertainty in the model’s performance. Bot-MGAT was evaluated using graph SSL techniques: single graph attention networks (GAT), graph convolutional networks (GCN), and relational graph convolutional networks (RGCN). We compared Bot-MGAT to related work in the field of bot detection. The results of Bot-MGAT with TL outperformed, with an accuracy score of 97.8%, an F1 score of 0.9842, and an MCC score of 0.9481. Full article

Accident investigation reports are text documents that systematically review and analyze the cause and process of accidents after accidents have occurred and have been widely used in the fields such as transportation, construction and aerospace. With the aid of accident investigation reports, the cause of the accident can be clearly identified, which provides an important basis for accident prevention and reliability assessment. However, since accident record reports are mostly composed of unstructured data such as text, the analysis of accident causes inevitably relies on a lot of expert experience and statistical analyses also require a lot of manual classification. Although, in recent years, with the development of natural language processing technology, there have been many efforts to automatically analyze and classify text. However, the existing methods either rely on large corpus and data preprocessing methods, which are cumbersome, or extract text information based on bidirectional encoder representation from transformers (BERT), but the computational cost is extremely high. These shortcomings make it still a great challenge to automatically analyze accident investigation reports and extract the information therein. To address the aforementioned problems, this study proposes a text-mining-based accident causal classification method based on a relational graph convolutional network (R-GCN) and pre-trained BERT. On the one hand, the proposed method avoids preprocessing such as stop word removal and word segmentation, which not only preserves the information of accident investigation reports to the greatest extent, but also avoids tedious operations. On the other hand, with the help of R-GCN to process the semantic features obtained by BERT representation, the dependence of BERT retraining on computing resources can be avoided. Full article