Yanfang Ye

Yanfang Ye

Auto-generated profile, based on publicly available information

Yanfang Ye

Department of Computer Science and Engineering, University of Notre Dame, Notre Dame, Indiana, USA

Research Focus & Metrics

Academic Career Length

8Years (2019-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
24 May 2022 in IEEE Transactions on Big Data
Verified
Journal Article
Closed access
Xiao WangXiao Wang
Xiao Wang
DBDeyu Bo
Deyu Bo
Chuan ShiChuan Shi
Chuan Shi
SFShaohua Fan
Shaohua Fan
YYYanfang Ye
Yanfang Ye
PYPhilip S. Yu
Philip S. Yu
Heterogeneous graphs (HGs) also known as heterogeneous information networks have become ubiquitous in real-world scenarios; therefore, HG embedding, which aim to learn representations in a lower-dimension space while preserving the heterogeneous structures and semantics for downstream tasks (e.g., node/graph classification, node clustering, link prediction), has drawn considerable attentions. In this survey, we perform a comprehensive review of the recent development on HG embedding methods and techniques. We first introduce the basic concepts of HG and discuss the unique challenges brought by the heterogeneity for HG embedding; and then we systemically survey and categorize the state-of-the-art HG embedding methods based on the information they used in the learning process. In particular, for each representative HG embedding method, we provide detailed introduction and further analyze its pros and cons; meanwhile, we explore the transformativeness and applicability of different types of HG embedding methods in the real-world industrial environments. We further present several widely deployed systems that have demonstrated the success of HG embedding techniques in resolving real-world application problems. To facilitate future research and applications in this area, we also summarize the open-source code, existing graph learning platforms and benchmark datasets. Finally, we explore the additional issues and challenges of HG embedding and forecast the future research directions in this field.

13 January 2021 in IEEE Transactions on Network Science and Engineering
Verified
Journal Article
Closed access
DLDeqiang Li
Deqiang Li
QLQianmu Li
Qianmu Li
YYYanfang Ye
Yanfang Ye
SXShouhuai Xu
Shouhuai Xu
Machine learning-based malware detection is known to be vulnerable to adversarial evasion attacks. The state-of-the-art is that there are no effective defenses against these attacks. As a response to the adversarial malware classification challenge organized by the MIT Lincoln Lab and associated with the AAAI-19 Workshop on Artificial Intelligence for Cyber Security (AICS'2019), we propose six guiding principles to enhance the robustness of deep neural networks. Some of these principles have been scattered in the literature, but the others are introduced in this paper for the first time. Under the guidance of these six principles, we propose a defense framework to enhance the robustness of deep neural networks against adversarial malware evasion attacks. By conducting experiments with the Drebin Android malware dataset, we show that the framework can achieve a 98.49% accuracy (on average) against grey-box attacks, where the attacker knows some information about the defense and the defender knows some information about the attack, and an 89.14% accuracy (on average) against the more capable white-box attacks, where the attacker knows everything about the defense and the defender knows some information about the attack. The framework wins the AICS'2019 challenge by achieving a 76.02% accuracy, where neither the attacker (i.e., the challenge organizer) knows the framework or defense nor we (the defender) know the attacks. This gap highlights the importance of knowing about the attack.

18 May 2021 in IEEE Transactions on Big Data
Verified
Journal Article
Closed access
YZYiding Zhang
Yiding Zhang
Xiao WangXiao Wang
Xiao Wang
Chuan ShiChuan Shi
Chuan Shi
XJXunqiang Jiang
Xunqiang Jiang
YYYanfang Fanny Ye
Yanfang Fanny Ye
Graph neural network (GNN) has shown superior performance in dealing with structured graphs, which has attracted considerable research attention recently. Most of the existing GNNs are designed in Euclidean spaces; however, real-world spatial structured data can be non-Euclidean surfaces (e.g., hyperbolic spaces). For example, biologists may inspect the geometric shape of a protein surface to determine its interaction with other biomolecules for drug discovery. Although there is growing research on generalizing GNNs to non-Euclidean surfaces, the works in these fields are still scarce. In this paper, we exploit the graph attention network to learn robust node representations of graphs in hyperbolic spaces. As the gyrovector space framework provides an elegant algebraic formalism for hyperbolic geometry, we utilize this framework to learn the graph representations in hyperbolic spaces. Specifically, we first use the operations defined in the framework to transform the features in a graph; and we exploit the proximity in the product of hyperbolic spaces to model the multi-head attention mechanism in the non-Euclidean setting; afterward, we further devise a parallel strategy using logarithmic and exponential maps to improve the efficiency of our proposed model. The comprehensive experimental results demonstrate the effectiveness of the proposed model, compared with state-of-the-art methods.

15 July 2020 in IEEE Journal of Biomedical and Health Informatics
Verified
Journal Article
Closed access
YYYanfang Ye
Yanfang Ye
SHShifu Hou
Shifu Hou
YFYujie Fan
Yujie Fan
YZYiming Zhang
Yiming Zhang
YQYiyue Qian
Yiyue Qian
KLKenneth A. Loparo
Kenneth A. Loparo
The fast evolving and deadly outbreak of coronavirus disease (COVID-19) has posed grand challenges to human society. To slow the spread of virus infections and better respond for community mitigation, by advancing capabilities of artificial intelligence (AI) and leveraging the large-scale and up-to-date data generated from heterogeneous sources (e.g., disease related data, demographic, mobility and social media data), in this work, we propose and develop an AI-driven system (named α-Satellite), as an initial offering, to provide dynamic COVID-19 risk assessment in the United States. More specifically, given a point of interest (POI), the system will automatically provide risk indices associated with it in a hierarchical manner (e.g., state, county, POI) to enable people to select appropriate actions for protection while minimizing disruptions to daily life. To comprehensively evaluate our system for dynamic COVID-19 risk assessment, we first conduct a set of empirical studies; and then we validate it based on a real-world dataset consisting of 5,060 annotated POIs, which achieves the area of under curve (AUC) of 0.9202. As of June 18, 2020, α-Satellite has had 56,980 users. Based on the feedback from its large-scale users, we perform further analysis and have three key findings: i) people from more severe regions (i.e., with larger numbers of COVID-19 cases) have stronger interests using our system to assist with actionable information; ii) users are more concerned about their nearby areas in terms of COVID-19 risks; iii) the user feedback about their perceptions towards COVID-19 risks of their query POIs indicates the challenge of public concerns about the safety versus its negative effects on society and the economy. Our system and generated datasets have been made publicly accessible via our website1.

13 November 2023 in ACM Transactions on Knowledge Discovery From Data
Verified
Journal Article
Open access
BYbo yan
bo yan
Cheng YangCheng Yang
Cheng Yang
Chuan ShiChuan Shi
Chuan Shi
Yong FangYong Fang
Yong Fang
QLQi Li
Qi Li
JDJunping Du
Junping Du
The explosive growth of cyber attacks today, such as malware, spam, and intrusions, has caused severe consequences on society. Securing cyberspace has become a great concern for organizations and governments. Traditional machine learning based methods are extensively used in detecting cyber threats, but they hardly model the correlations between real-world cyber entities. In recent years, with the proliferation of graph mining techniques, many researchers have investigated these techniques for capturing correlations between cyber entities and achieving high performance. It is imperative to summarize existing graph-based cybersecurity solutions to provide a guide for future studies. Therefore, as a key contribution of this work, we provide a comprehensive review of graph mining for cybersecurity, including an overview of cybersecurity tasks, the typical graph mining techniques, and the general process of applying them to cybersecurity, as well as various solutions for different cybersecurity tasks. For each task, we probe into relevant methods and highlight the graph types, graph approaches, and task levels in their modeling. Furthermore, we collect open datasets and toolkits for graph-based cybersecurity. Finally, we present an outlook on the potential directions of this field for future research.