Qian Chen
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
Qian Chen has a total of 22 co-authors. Here are the top co-authors by number of shared publications:
- Ling Chen
Emory University
3 shared publications - Hongyu Shi
The State Key Laboratory of Blockchain and Data Security, College of Computer Science and Technology, Zhejiang University, Hangzhou, China
2 shared publications - Jiyuan Xu
Zhejiang University of Finance and Economics
2 shared publications - Shuai Zhang
Zhejiang University of Finance and Economics, Hangzhou, 310018, China
2 shared publications - Wenyu Zhang
Zhejiang University of Finance and Economics, Hangzhou, China
2 shared publications Di Zhou
1 shared publication
Latest Publications
- Open Access
- 20 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 82-93
Rethinking Temporal Knowledge Graph Representation Learning: From Entities to Evolutionary Event-Centric Clusters
- 20 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 82-93
Open AccessRethinking Temporal Knowledge Graph Representation Learning: From Entities to Evolutionary Event-Centric Clusters
- Open Access
- 21 November 2025
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Knowledge Discovery From Data
- Vol. 20 (1) , 1-19
SR-HyperFM: Sample Relationship Aware Hypergraph Factorization Machines for Feature Interaction Modeling
Feature interaction modeling, which exploits interactive information between features, has been widely explored in various applications. Recently, many graph or hypergraph structures-based models have been proposed to model feature interactions by predicting the existence of edges or hyperedges among nodes. However, these models lack the capability to capture the inherent comparability among samples, where multiple samples exhibit both shared and distinct characteristics, and such comparable relationships are often beneficial for prediction. To this end, we propose SR-HyperFM, Sample Relationship aware Hypergraph Factorization Machines, which incorporate sample comparable relationships into feature interaction modeling, leveraging both shared features and critical differences among samples. Specifically, the sample relationship aware hypergraph construction module is introduced to fully capture the comparable relationships among samples and discover beneficial high-order feature interactions. In addition, the dual hypergraph message passing module explicitly models feature interactions by exploiting these inherent relationships. Extensive experiments on four real-world datasets demonstrate the superiority of SR-HyperFM. In addition, case studies are conducted to further justify the effectiveness of SR-HyperFM.
- 21 November 2025
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Knowledge Discovery From Data
- Vol. 20 (1) , 1-19
Open AccessSR-HyperFM: Sample Relationship Aware Hypergraph Factorization Machines for Feature Interaction Modeling
Feature interaction modeling, which exploits interactive information between features, has been widely explored in various applications. Recently, many graph or hypergraph structures-based models have been proposed to model feature interactions by predicting the existence of edges or hyperedges among nodes. However, these models lack the capability to capture the inherent comparability among samples, where multiple samples exhibit both shared and distinct characteristics, and such comparable relationships are often beneficial for prediction. To this end, we propose SR-HyperFM, Sample Relationship aware Hypergraph Factorization Machines, which incorporate sample comparable relationships into feature interaction modeling, leveraging both shared features and critical differences among samples. Specifically, the sample relationship aware hypergraph construction module is introduced to fully capture the comparable relationships among samples and discover beneficial high-order feature interactions. In addition, the dual hypergraph message passing module explicitly models feature interactions by exploiting these inherent relationships. Extensive experiments on four real-world datasets demonstrate the superiority of SR-HyperFM. In addition, case studies are conducted to further justify the effectiveness of SR-HyperFM.
- 5 September 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Human-Machine Systems
- Vol. 55 (6) , 1033-1042
SHA-SCP: A UI Element Spatial Hierarchy Aware Smartphone User Click Behavior Prediction Method
Predicting user click behavior and making relevant recommendations based on the user’s historical click behavior are critical to simplifying operations and improving user experience. Modeling User Interface (UI) elements is essential to user click behavior prediction, while the complexity and variety of the UI make it difficult to adequately capture the information of different scales. In addition, the lack of relevant datasets also presents difficulties for such studies. In response to these challenges, we construct a fine-grained smartphone usage behavior dataset containing 3 664 325 clicks of 100 users and propose a UI element Spatial Hierarchy Aware Smartphone user Click behavior Prediction method (SHA-SCP). SHA-SCP builds element groups by clustering the elements according to their spatial positions and uses attention mechanisms to perceive the UI at the element level and the element group level to fully capture the information of different scales. Experiments are conducted on the fine-grained smartphone usage behavior dataset, and the results show that our method outperforms the best baseline by an average of 18.35$\%$, 13.86$\%$, and 11.97$\%$ in Top-1 Accuracy, Top-3 Accuracy, and Top-5 Accuracy, respectively.
- 5 September 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Human-Machine Systems
- Vol. 55 (6) , 1033-1042
SHA-SCP: A UI Element Spatial Hierarchy Aware Smartphone User Click Behavior Prediction Method
Predicting user click behavior and making relevant recommendations based on the user’s historical click behavior are critical to simplifying operations and improving user experience. Modeling User Interface (UI) elements is essential to user click behavior prediction, while the complexity and variety of the UI make it difficult to adequately capture the information of different scales. In addition, the lack of relevant datasets also presents difficulties for such studies. In response to these challenges, we construct a fine-grained smartphone usage behavior dataset containing 3 664 325 clicks of 100 users and propose a UI element Spatial Hierarchy Aware Smartphone user Click behavior Prediction method (SHA-SCP). SHA-SCP builds element groups by clustering the elements according to their spatial positions and uses attention mechanisms to perceive the UI at the element level and the element group level to fully capture the information of different scales. Experiments are conducted on the fine-grained smartphone usage behavior dataset, and the results show that our method outperforms the best baseline by an average of 18.35$\%$, 13.86$\%$, and 11.97$\%$ in Top-1 Accuracy, Top-3 Accuracy, and Top-5 Accuracy, respectively.
- 20 May 2022
- Published by Elsevier in Knowledge-Based Systems
- Vol. 250
Dynamic graph convolutional networks based on spatiotemporal data embedding for traffic flow forecasting
- 20 May 2022
- Published by Elsevier in Knowledge-Based Systems
- Vol. 250
Dynamic graph convolutional networks based on spatiotemporal data embedding for traffic flow forecasting
- 1 November 2021
- Published by Elsevier in Expert Systems with Applications
- Vol. 182
A novel trilinear deep residual network with self-adaptive Dropout method for short-term load forecasting
- 1 November 2021
- Published by Elsevier in Expert Systems with Applications
- Vol. 182
A novel trilinear deep residual network with self-adaptive Dropout method for short-term load forecasting
- Open Access
Automated Ransomware Behavior Analysis: Pattern Extraction and Early Detection
Security operation centers (SOCs) typically use a variety of tools to collect large volumes of host logs for detection and forensic of intrusions. Our experience, supported by recent user studies on SOC operators, indicates that operators spend ample time (e.g., hundreds of man-hours) on investigations into logs seeking adversarial actions. Similarly, reconfiguration of tools to adapt detectors for future similar attacks is commonplace upon gaining novel insights (e.g., through internal investigation or shared indicators). This paper presents an automated malware pattern-extraction and early detection tool, testing three machine learning approaches: TF-IDF (term frequency-inverse document frequency), Fisher's LDA (linear discriminant analysis) and ET (extra trees/extremely randomized trees) that can (1) analyze freshly discovered malware samples in sandboxes and generate dynamic analysis reports (host logs); (2) automatically extract the sequence of events induced by malware given a large volume of ambient (un-attacked) host logs, and the relatively few logs from hosts that are infected with potentially polymorphic malware; (3) rank the most discriminating features (unique patterns) of malware and from the learned behavior detect malicious activity; and (4) allows operators to visualize the discriminating features and their correlations to facilitate malware forensic efforts. To validate the accuracy and efficiency of our tool, we design three experiments and test seven ransomware attacks (i.e., WannaCry, DBGer, Cerber, Defray, GandCrab, Locky, and nRansom). The experimental results show that TF-IDF is the best of the three methods to identify discriminating features, and ET is the most time-efficient and robust approach.
Open AccessAutomated Ransomware Behavior Analysis: Pattern Extraction and Early Detection
Security operation centers (SOCs) typically use a variety of tools to collect large volumes of host logs for detection and forensic of intrusions. Our experience, supported by recent user studies on SOC operators, indicates that operators spend ample time (e.g., hundreds of man-hours) on investigations into logs seeking adversarial actions. Similarly, reconfiguration of tools to adapt detectors for future similar attacks is commonplace upon gaining novel insights (e.g., through internal investigation or shared indicators). This paper presents an automated malware pattern-extraction and early detection tool, testing three machine learning approaches: TF-IDF (term frequency-inverse document frequency), Fisher's LDA (linear discriminant analysis) and ET (extra trees/extremely randomized trees) that can (1) analyze freshly discovered malware samples in sandboxes and generate dynamic analysis reports (host logs); (2) automatically extract the sequence of events induced by malware given a large volume of ambient (un-attacked) host logs, and the relatively few logs from hosts that are infected with potentially polymorphic malware; (3) rank the most discriminating features (unique patterns) of malware and from the learned behavior detect malicious activity; and (4) allows operators to visualize the discriminating features and their correlations to facilitate malware forensic efforts. To validate the accuracy and efficiency of our tool, we design three experiments and test seven ransomware attacks (i.e., WannaCry, DBGer, Cerber, Defray, GandCrab, Locky, and nRansom). The experimental results show that TF-IDF is the best of the three methods to identify discriminating features, and ET is the most time-efficient and robust approach.