Yamin Hu

Yamin Hu

Auto-generated profile, based on publicly available information

Yamin Hu

Guangdong Provincial Key Laboratory of Novel Security Intelligence Technologies, Institute of Cyberspace Security, School of Computer Science and Technology, Harbin Institute of Technology, Shenzhen, China

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 March 2018 in IEEE Transactions on Fuzzy Systems
Verified
Journal Article
Closed access
Wenjian LuoWenjian Luo
Wenjian Luo
DZDaofu Zhang
Daofu Zhang
HJHao Jiang
Hao Jiang
LNLi Ni
Li Ni
YHYamin Hu
Yamin Hu
Most of the community detection methods require the global information of the original network to be available, however, it is often expensive (even no way) to obtain the global information of the network in many real-world networks. So, the local community detection, only based on the local information, becomes especially important. The local community is the community in the network to which a given starting node belongs. Some local community detection methods have been proposed. However, these methods did not consider the characteristics of the local community during the local community formation. In this paper, we analyze the formation of the local community and propose two local community detection algorithms based on the dynamic membership function. Each of the algorithms is divided into three stages: 1) the initial stage, 2) the middle stage, and 3) the closing stage. At the initial stage, we design a dynamical membership function to detect local community and nodes with the greatest neighborhood intersect rate could be added to the local community. At the middle stage, we design another dynamical membership function, and the goal of this stage is to make the connection of the node in the local community closest. At the closing stage, the third dynamical membership function is provided, and the local community is further improved by collecting some nodes that should not be omitted. We test our algorithms on several synthetic datasets and real datasets; the results show that the local communities detected by our method are closer to the real local communities.

26 May 2022 in IEEE Transactions on Software Engineering
Verified
Journal Article
Closed access
YJYanjie Jiang
Yanjie Jiang
HLHui Liu
Hui Liu
XLXiaoqing Luo
Xiaoqing Luo
ZZZhihao Zhu
Zhihao Zhu
XCXiaye Chi
Xiaye Chi
LZLu Zhang
Lu Zhang
Bug-related research, e.g., fault localization, program repair, and software testing, relies heavily on high-quality and large-scale software bug repositories. The importance of such repositories is twofold. On one side, real-world bugs and their associated patches may inspire novel approaches for finding, locating, and repairing software bugs. On the other side, the real-world bugs and their patches are indispensable for rigorous and meaningful evaluation of approaches to software testing, fault localization, and program repair. To this end, a number of software bug repositories, e.g., iBUGS and Defects4J, have been constructed recently by mining version control systems and bug tracking systems. However, fully automated construction of bug repositories by simply taking bug-fixing commits from version control systems often results in inaccurate patches that contain many bug-irrelevant changes. Although we may request experts or developers to manually exclude the bug-irrelevant changes (as the authors of Defects4J did), such extensive human intervention makes it difficult to build large-scale bug repositories. To this end, in this paper, we propose an automatic approach, called BugBuilder, to construct bug repositories from version control systems. Different from existing approaches, it automatically extracts complete and concise bug-fixing patches and excludes bug-irrelevant changes. It first detects and excludes software refactorings involved in bug-fixing commits. BugBuilder then enumerates all subsets of the remaining part, and discards invalid subsets by compilation and software testing. If exactly a single subset survives the validation, this subset is taken as the complete and concise bug-fixing patch for the associated bug. In case multiple subsets survive, BugBuilder employs a sequence of heuristics to select the most likely one. Evaluation results on 809 real-world bug-fixing commits in Defects4J suggest that BugBuilder successfully extracted complete and concise bug-fixing patches from forty-three percent of the bug-fixing commits, and its precision (99%) was even higher than human experts. We also built a bug repository, called GrowingBugs, with the proposed approach. The resulting repository serves as evidence of the usefulness of the proposed approach, as well as a publicly available benchmark for bug-related research.

7 June 2018 in IEEE Transactions on Information Forensics and Security
Verified
Journal Article
Closed access
Wenjian LuoWenjian Luo
Wenjian Luo
YHYamin Hu
Yamin Hu
HJHao Jiang
Hao Jiang
JWJunteng Wang
Junteng Wang
Secure password storage is a vital aspect in systems based on password authentication, which is still the most widely used authentication technique, despite its some security flaws. In this paper, we propose a password authentication framework that is designed for secure password storage and could be easily integrated into existing authentication systems. In our framework, first, the received plain password from a client is hashed through a cryptographic hash function (e.g., SHA-256). Then, the hashed password is converted into a negative password. Finally, the negative password is encrypted into an Encrypted Negative Password (abbreviated as ENP) using a symmetric-key algorithm (e.g., AES), and multi-iteration encryption could be employed to further improve security. The cryptographic hash function and symmetric encryption make it difficult to crack passwords from ENPs. Moreover, there are lots of corresponding ENPs for a given plain password, which makes precomputation attacks (e.g., lookup table attack and rainbow table attack) infeasible. The algorithm complexity analyses and comparisons show that the ENP could resist lookup table attack and provide stronger password protection under dictionary attack. It is worth mentioning that the ENP does not introduce extra elements (e.g., salt); besides this, the ENP could still resist precomputation attacks. Most importantly, the ENP is the first password protection scheme that combines the cryptographic hash function, the negative password and the symmetric-key algorithm, without the need for additional information except the plain password.

21 January 2023 in Frontiers of Computer Science
Verified
Journal Article
Closed access
PDF file
YHYamin Hu
Yamin Hu
HJHao Jiang
Hao Jiang
ZHZongyao Hu
Zongyao Hu

6 February 2026 in IEEE Transactions on Reliability
Verified
Journal Article
Closed access
YHYamin Hu
Yamin Hu
YSYuhui Shi
Yuhui Shi
Wenjian LuoWenjian Luo
Wenjian Luo
Explainability is a crucial aspect of practical defect prediction. Recently, model-agnostic explanation methods like LIME have been employed to explain individual predictions made by defect prediction models, providing the importance of each feature to a single prediction. However, the provided explanations are often inaccurate and even misleading. To this end, we propose an interpretable scoring approach for effort-aware defect prediction, named ScoringDP, to enhance its explainability. ScoringDP ranks software modules based on the scores assigned to them, which reflect their defect densities. The score of a module is calculated by adding up the scores assigned to its features, and each feature score represents the deviation between two values indicated by the corresponding feature value: the actual defect ratio and the expected defect ratio, which are statistically derived based on a defect dataset. For a given prediction, these feature scores directly serve as feature importance to the prediction, i.e., the explanations provided by ScoringDP are directly derived from its internal decision-making process. Such expectation-based direct explanations are more tangible for developers compared to post-hoc explanations resulting from model-agnostic explanation methods. Besides, ScoringDP achieves competitive prediction performance compared to state-of-the-art approaches for effort-aware defect prediction.

22 April 2026 in IEEE Transactions on Computational Social Systems
Verified
Journal Article
Closed access
SXShaocong Xue
Shaocong Xue
Wenjian LuoWenjian Luo
Wenjian Luo
ZYZeping Yin
Zeping Yin
JGJiahao Gu
Jiahao Gu
YHYamin Hu
Yamin Hu
Federated multilabel learning enables the collaborative training of multilabel classification models while preserving client privacy. Existing federated multilabel learning methods either fail to effectively capture label correlations, which significantly affects model performance in scenarios where labels are interdependent, or increase the risk of client privacy leakage due to the transmission of unnecessary client data. To this end, we propose FML-DGCN, a federated multi-label learning approach based on dynamic graph convolutional networks. In the local training phase, a dynamic graph convolutional module is designed and employed to generate label representations specific to the input image, with parameters efficiently optimized by our designed correlation alignment loss. Within the module, we employ a fully connected layer-based network to merge static label embeddings and image features for computing dynamic label graphs, instead of leveraging complex attention-based networks, making it suitable for federated learning environments with limited computing resources. In the federated aggregation phase, clients transmit only model parameters, without sharing any additional information such as scene knowledge, thus lowering the risk of client privacy leakage. Experimental results on four typical multilabel image classification datasets demonstrate the superiority of our approach.