He Jiang

He Jiang

Auto-generated profile, based on publicly available information

He Jiang

Dalian University of Technology

Research Focus & Metrics

Academic Career Length

24Years (2003-Present)

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

Representative Publications

View All Publications
28 April 2016 in IEEE Transactions on Services Computing
Verified
Journal Article
Closed access
LNLiming Nie
Liming Nie
HJHe Jiang
He Jiang
ZRZhilei Ren
Zhilei Ren
ZSZeyi Sun
Zeyi Sun
XLXiaochen Li
Xiaochen Li
As code search is a frequent developer activity in software development practices, improving the performance of code search is a critical task. In the text retrieval based search techniques employed in the code search, the term mismatch problem is a critical language issue for retrieval effectiveness. By reformulating the queries, query expansion provides effective ways to solve the term mismatch problem. In this paper, we propose Query Expansion based on Crowd Knowledge (QECK), a novel technique to improve the performance of code search algorithms. QECK identifies software-specific expansion words from the high quality pseudo relevance feedback question and answer pairs on Stack Overflow to automatically generate the expansion queries. Furthermore, we incorporate QECK in the classic Rocchio's model, and propose QECK based code search method QECKRocchio. We conduct three experiments to evaluate our QECK technique and investigate QECKRocchio in a large-scale corpus containing real-world code snippets and a question and answer pair collection. The results show that QECK improves the performance of three code search algorithms by up to 64 percent in Precision, and 35 percent in NDCG. Meanwhile, compared with the state-of-the-art query expansion method, the improvement of QECK Rocchio is 22 percent in Precision, and 16 percent in NDCG.

24 December 2024 in Science China Information Sciences
Verified
Journal Article
Open access
PDF file
XCXiangping Chen
Xiangping Chen
XHXing Hu
Xing Hu
YHYuan Huang
Yuan Huang
HJHe Jiang
He Jiang
WJWeixing Ji
Weixing Ji
LZLu Zhang
Lu Zhang
Researchers have recently achieved significant advances in deep learning techniques, which in turn has substantially advanced other research disciplines, such as natural language processing, image processing, speech recognition, and software engineering. Various deep learning techniques have been successfully employed to facilitate software engineering tasks, including code generation, software refactoring, and fault localization. Many studies have also been presented in top conferences and journals, demonstrating the applications of deep learning techniques in resolving various software engineering tasks. However, although several surveys have provided overall pictures of the application of deep learning techniques in software engineering, they focus more on learning techniques, that is, what kind of deep learning techniques are employed and how deep models are trained or fine-tuned for software engineering tasks. We still lack surveys explaining the advances of subareas in software engineering driven by deep learning techniques, as well as challenges and opportunities in each subarea. To this end, in this study, we present the first task-oriented survey on deep learning-based software engineering. It covers twelve major software engineering subareas significantly impacted by deep learning techniques. Such subareas spread out through the whole lifecycle of software development and maintenance, including requirements engineering, software development, testing, maintenance, and developer collaboration. As we believe that deep learning may provide an opportunity to revolutionize the whole discipline of software engineering, providing one survey covering as many subareas as possible in software engineering can help future research push forward the frontier of deep learning-based software engineering more systematically. For each of the selected subareas, we highlight the major advances achieved by applying deep learning techniques with pointers to the available datasets in such a subarea. We also discuss the challenges and opportunities concerning each of the surveyed software engineering subareas.

9 September 2016 in Journal of Computer Science and Technology
Verified
Journal Article
Closed access
PDF file
NNNajam Nazar
Najam Nazar
YHYan Hu
Yan Hu
HJHe Jiang
He Jiang

6 August 2012 in IEEE Transactions on Software Engineering
Verified
Journal Article
Closed access
Jifeng XuanJifeng Xuan
Jifeng Xuan
HJHe Jiang
He Jiang
ZRZhilei Ren
Zhilei Ren
ZLZhongxuan Luo
Zhongxuan Luo
The Next Release Problem (NRP) aims to optimize customer profits and requirements selection for the software releases. The research on the NRP is restricted by the growing scale of requirements. In this paper, we propose a Backbone-based Multilevel Algorithm (BMA) to address the large scale NRP. In contrast to direct solving approaches, the BMA employs multilevel reductions to downgrade the problem scale and multilevel refinements to construct the final optimal set of customers. In both reductions and refinements, the backbone is built to fix the common part of the optimal customers. Since it is intractable to extract the backbone in practice, the approximate backbone is employed for the instance reduction while the soft backbone is proposed to augment the backbone application. In the experiments, to cope with the lack of open large requirements databases, we propose a method to extract instances from open bug repositories. Experimental results on 15 classic instances and 24 realistic instances demonstrate that the BMA can achieve better solutions on the large scale NRP instances than direct solving approaches. Our work provides a reduction approach for solving large scale problems in search-based requirements engineering.

19 July 2016 in IEEE Transactions on Services Computing
Verified
Journal Article
Closed access
HJHe Jiang
He Jiang
LNLiming Nie
Liming Nie
ZSZeyi Sun
Zeyi Sun
ZRZhilei Ren
Zhilei Ren
WKWeiqiang Kong
Weiqiang Kong
DLDaniel Luo
Daniel Luo
When implementing unfamiliar programming tasks, developers commonly search code examples and learn usage patterns of APIs from the code examples or reuse them by copy-pasting and modifying. For providing high-quality code examples, previous studies present several methods to recommend code snippets mainly based on information retrieval. In this paper, to provide better recommendation results, we propose ROSF, Recommending code Snippets with multi-aspect Features, a novel method combining both information retrieval and supervised learning. In our method, we recommend Top-K code snippets for a given free-form query based on two stages, i.e., coarse-grained searching and fine-grained re-ranking. First, we generate a code snippet candidate set by searching a code snippet corpus using an information retrieval method. Second, we predict probability values of the code snippets for different relevance scores in the candidate set by the learned prediction model from a training set, re-rank these candidate code snippets according to the probability values, and recommend the final results to developers. We conduct several experiments to evaluate our method in a large-scale corpus containing 921,713 real-world code snippets. The results show that ROSF is an effective method for code snippets recommendation and outperforms the-state-of-the-art methods by 20-41percent in Precision and 13-33 percent in NDCG.

22 February 2016 in Frontiers of Computer Science
Verified
Journal Article
Closed access
PDF file
NNNajam Nazar
Najam Nazar
HJHe Jiang
He Jiang
GGGuojun Gao
Guojun Gao
Tao ZhangTao Zhang
Tao Zhang
XLXiaochen Li
Xiaochen Li
ZRZhilei Ren
Zhilei Ren