Cancan Feng

Mrs. Cancan Feng

Southwestern University of Finance and Economics, Chengdu, Sichuan, China
orcid

Research Focus & Metrics

Academic Career Length

9Years (2018-Present)

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

Representative Publications

View All Publications
5 February 2018 in Energy & Fuels
Verified
Journal Article
Closed access
RQRongrong Qi
Rongrong Qi
ZNZhengfu Ning
Zhengfu Ning
QWQing Wang
Qing Wang
YZYan Zeng
Yan Zeng
Liang HuangLiang Huang
Liang Huang
CFCancan Feng
Cancan Feng

17 November 2022 in IEEE Transactions on Knowledge and Data Engineering
Verified
Journal Article
Closed access
YZYu Zhao
Yu Zhao
SWShaopeng Wei
Shaopeng Wei
CFCancan Feng
Cancan Feng
XCXingyan Chen
Xingyan Chen
QLQin Li
Qin Li
Gang KouGang Kou
Gang Kou
Bi-typed multi-relational heterogeneous graph (BMHG) is one of the most common graphs in practice, for example, academic networks, e-commerce user behavior graph and enterprise knowledge graph. It is a critical and challenge problem on how to learn the numerical representation for each node to characterize subtle structures. However, most previous studies treat all node relations in BMHG as the same class of relation without distinguishing the different characteristics between the intra-type relations and inter-type relations of the bi-typed nodes, causing the loss of significant structure information. To address this issue, we propose a novel D ual H ierarchical A ttention N etworks (DHAN) based on the bi-typed multi-relational heterogeneous graphs to learn comprehensive node representations with the intra-type and inter-type attention-based encoder under a hierarchical mechanism. Specifically, the former encoder aggregates information from the same type of nodes, while the latter aggregates node representations from its different types of neighbors. Moreover, to sufficiently model node multi-relational information in BMHG, we adopt a newly proposed hierarchical mechanism. By doing so, the proposed dual hierarchical attention operations enable our model to fully capture the complex structures of the bi-typed multi-relational heterogeneous graphs. Experimental results on various tasks against the state-of-the-arts sufficiently confirm the capability of DHAN in learning node representations on the BMHGs.

3 August 2025
Verified
Conference Paper
Open access
CFCancan Feng
Cancan Feng
YZYujia Zheng
Yujia Zheng
BJBaoyu Jing
Baoyu Jing
YZYu Zhao
Yu Zhao
Gang KouGang Kou
Gang Kou
CYCarl Yang
Carl Yang

24 August 2024
Verified
Conference Paper
Open access
CFCancan Feng
Cancan Feng
Long ShiLong Shi
Long Shi
XCXingyan Chen
Xingyan Chen
YZYu Zhao
Yu Zhao
HZHegui Zhang
Hegui Zhang
Gang KouGang Kou
Gang Kou
Temporal graph representation learning has drawn considerable attention in recent years. Most existing works mainly focus on modeling local structural dependencies of temporal graphs. However, underestimating the inherent global structural role information in many real-world temporal graphs inevitably leads to sub-optimal graph representations. To overcome this shortcoming, we propose a novel Role-based Temporal Graph Convolution Network (RTGCN) that fully leverages the global structural role information in temporal graphs. Specifically, RTGCN can effectively capture the static global structural roles by using hypergraph convolution neural networks. To capture the evolution of nodes' structural roles, we further design structural role-based gated recurrent units. Finally, we integrate structural role proximity in our objective function to preserve global structural similarity, further promoting temporal graph representation learning. Experimental results on multiple real-world datasets demonstrate that RTGCN consistently outperforms state-of-the-art temporal graph representation learning methods by significant margins in various temporal link prediction and node classification tasks. Specifically, RTGCN achieves AUC improvement of up to 5.1% for link prediction and F1 improvement of up to 6.2% for new link prediction. In addition, RTGCN achieves AUC improvement up to 4.6% for node classification and 2.7% for structural role classification.

9 August 2024 in IEEE Transactions on Emerging Topics in Computing
Verified
Journal Article
Closed access
XCXingyan Chen
Xingyan Chen
CFCancan Feng
Cancan Feng
MWMu Wang
Mu Wang
YZYu Zhao
Yu Zhao
XSXiaoyang Shu
Xiaoyang Shu
GMGabriel-Miro Muntean
Gabriel-Miro Muntean
The exceptionally high bandwidth requirements associated with the delivery of live 360° video content pose significant challenges in the current network context. An avenue for addressing this bandwidth challenge is to use the limited network resources for sending the user's Field-of-View (FoV) tiles at a high resolution, instead of transmitting all frame components at high quality. However, precisely forecasting the FoV for 360° live video content distribution remains a complex endeavor due to the lack of pre-knowledge on user viewing behaviors. In this paper, we present GL360, a novel 360° transmission framework, which employs Graph Representation Learning for FoV prediction. First, we analyze the interaction between users and tiles in panoramic videos utilizing a dynamic heterogeneous Relational Graph Convolutional Network (RGCN), which facilitates efficient user and tile embedding representation learning. Secondly, we propose an online dynamic heterogeneous graph learning (DHGL)-based algorithm to dynamically capture the time-varying features of the user's viewing behaviors with limited prior knowledge. Further, we design a FoV-aware content delivery algorithm that allows the edge servers to determine the video tiles' resolution for each accessed user. Experimental results based on real traces demonstrate how our solution outperforms four other solutions in terms of FoV prediction and network performance

11 July 2022 in Entropy
Verified
Journal Article
Open access
PDF file
ZYZongjian Yu
Zongjian Yu
AZAnxiang Zhang
Anxiang Zhang
HFHuali Feng
Huali Feng
CFCancan Feng
Cancan Feng
WSWei Shaopeng
Wei Shaopeng
YZYu Zhao
Yu Zhao
Fine-grained entity typing (FET) aims to identify the semantic type of an entity in a plain text, which is a significant task for downstream natural language processing applications. However, most existing methods neglect rich known typing information about these entities in knowledge graphs. To address this issue, we take advantage of knowledge graphs to improve fine-grained entity typing through the use of a copy mechanism. Specifically, we propose a novel deep neural model called CopyFet for FET via a copy-generation mechanism. CopyFet can integrate two operations: (i) the regular way of making type inference from the whole type set in the generation model; (ii) the new copy mechanism which can identify the semantic type of a mention with reference to the type-copying vocabulary from a knowledge graph in the copy model. Despite its simplicity, this mechanism proves to be powerful since extensive experiments show that CopyFet outperforms state-of-the-art methods in FET on two benchmark datasets (FIGER (GOLD) and BBN). For example, CopyFet achieves the new state-of-the-art score of 76.4% and 83.6% on the accuracy metric in FIGER (GOLD) and BBN, respectively.