Tingting Li
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Tingting Li has a total of 13 co-authors. Here are the top co-authors by number of shared publications:
- Hui Li
Dalian Maritime University, Dalian, China
3 shared publications - Shikai Guo
Dalian Maritime University, Dalian, China
3 shared publications - Chen Guo
Marine Electrical Engineering College, Dalian Maritime University, Dalian, China
2 shared publications - Siwen Wang
Dalian Maritime University
2 shared publications - Chen Chen
Naval Architecture and Ocean Engineering College, Dalian Maritime University, Dalian 116026, China
1 shared publication - Decheng Zhang
The College of Information Science and Technology, Dalian Maritime University, Dalian 116026, China
1 shared publication
Latest Publications
- 29 July 2024
- Published by Elsevier in Expert Systems with Applications
- Vol. 256
Automated patch correctness predicting to fix software defect
- 29 July 2024
- Published by Elsevier in Expert Systems with Applications
- Vol. 256
Automated patch correctness predicting to fix software defect
- Open Access
- 4 September 2019
- Published by MDPI AG in Applied Sciences
- Vol. 9 (18) , 3663
Identify High-Impact Bug Reports by Combining the Data Reduction and Imbalanced Learning Strategies
As software systems become increasingly large, the logic becomes more complex, resulting in a large number of bug reports being submitted to the bug repository daily. Due to tight schedules and limited human resources, developers may not have enough time to inspect all the bugs. Thus, they often concentrate on the bugs that have large impacts. However, there are two main challenges limiting the automation technology that would help developers to become aware of high-impact bug reports early, namely, low quality and class distribution imbalance. To address these two challenges, we propose an approach to identify high-impact bug reports that combines the data reduction and imbalanced learning strategies. In the data reduction phase, we combine feature selection with the instance selection method to build a small-scale and high-quality set of bug reports by removing the bug reports and words that are redundant or noninformative; in the imbalanced learning strategies phase, we handle the imbalanced distributions of bug reports through four imbalanced learning strategies. We experimentally verified that the method of combining the data reduction and imbalanced learning strategies could effectively identify high-impact bug reports.
- 4 September 2019
- Published by MDPI AG in Applied Sciences
- Vol. 9 (18) , 3663
Open AccessIdentify High-Impact Bug Reports by Combining the Data Reduction and Imbalanced Learning Strategies
As software systems become increasingly large, the logic becomes more complex, resulting in a large number of bug reports being submitted to the bug repository daily. Due to tight schedules and limited human resources, developers may not have enough time to inspect all the bugs. Thus, they often concentrate on the bugs that have large impacts. However, there are two main challenges limiting the automation technology that would help developers to become aware of high-impact bug reports early, namely, low quality and class distribution imbalance. To address these two challenges, we propose an approach to identify high-impact bug reports that combines the data reduction and imbalanced learning strategies. In the data reduction phase, we combine feature selection with the instance selection method to build a small-scale and high-quality set of bug reports by removing the bug reports and words that are redundant or noninformative; in the imbalanced learning strategies phase, we handle the imbalanced distributions of bug reports through four imbalanced learning strategies. We experimentally verified that the method of combining the data reduction and imbalanced learning strategies could effectively identify high-impact bug reports.
- Open Access
- 13 August 2019
- Published by MDPI AG in Applied Sciences
- Vol. 9 (16) , 3327
A Multi-Factor Approach for Selection of Developers to Fix Bugs in a Program
In a software tracking system, the bug assignment problem refers to the activities that developers perform during software maintenance to fix bugs. As many bugs are submitted on a daily basis, the number of developers required is quite large, and it therefore becomes difficult to assign the right developers to resolve issues with specific bugs. Inappropriate dispatches results in delayed processing of bug reports. In this paper, we propose an algorithm called ABC-DR to solve the bug assignment problem. The ABC-DR algorithm is a two-part composite approach that includes analysis between bug reports (i.e., B-based analysis) and analysis between developers and bug reports (i.e., D-based analysis). For analysis between bug reports, we use the multi-label k-nearest neighbor (ML-KNN) algorithm to find similar bug reports when compared with the new bug reports, and the developers who analyze similar bug reports recommend developers for the new bug report. For analysis between developers and bug reports, we find developer rankings similar to the new bug report by calculating the relevance scores between developers and similar bug reports. We use the artificial bee colony (ABC) algorithm to calculate the weight of each part. We evaluated the proposed algorithms on three datasets—GCC, Mozilla, and NetBeans—comparing ABC-DR with DevRec, DREX, and Bugzie. The experimental results show that the proposed ABC-DR algorithm achieves the highest improvement of 51.2% and 53.56% over DevRec for recall@5 and recall@10 in the NetBeans dataset.
- 13 August 2019
- Published by MDPI AG in Applied Sciences
- Vol. 9 (16) , 3327
Open AccessA Multi-Factor Approach for Selection of Developers to Fix Bugs in a Program
In a software tracking system, the bug assignment problem refers to the activities that developers perform during software maintenance to fix bugs. As many bugs are submitted on a daily basis, the number of developers required is quite large, and it therefore becomes difficult to assign the right developers to resolve issues with specific bugs. Inappropriate dispatches results in delayed processing of bug reports. In this paper, we propose an algorithm called ABC-DR to solve the bug assignment problem. The ABC-DR algorithm is a two-part composite approach that includes analysis between bug reports (i.e., B-based analysis) and analysis between developers and bug reports (i.e., D-based analysis). For analysis between bug reports, we use the multi-label k-nearest neighbor (ML-KNN) algorithm to find similar bug reports when compared with the new bug reports, and the developers who analyze similar bug reports recommend developers for the new bug report. For analysis between developers and bug reports, we find developer rankings similar to the new bug report by calculating the relevance scores between developers and similar bug reports. We use the artificial bee colony (ABC) algorithm to calculate the weight of each part. We evaluated the proposed algorithms on three datasets—GCC, Mozilla, and NetBeans—comparing ABC-DR with DevRec, DREX, and Bugzie. The experimental results show that the proposed ABC-DR algorithm achieves the highest improvement of 51.2% and 53.56% over DevRec for recall@5 and recall@10 in the NetBeans dataset.