Target Gene Mining Algorithm Based on gSpan

Lu, Liangfu; Ren, Xiaoxu; Qi, Lianyong; Cui, Chenming; Jiao, Yichen

doi:10.1007/978-3-030-12981-1_36

Cited by 5 publications

(1 citation statement)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…When using depth-first traversal on a graph, choosing different initial nodes and intermediate nodes results in different depth-first search sequences. In the frequent subgraph mining algorithm gSpan, the lexicographical order-based minimal DFS encoding, which is a formal description of graphs, was proposed [24]. Li et al [25] proved that the minimum DFS encoding is a serialization code corresponding to the graph.…”

Section: Minimum Dfs Encodingmentioning

confidence: 99%

Automatic Code Review by Learning the Structure Information of Code Graph

Yin

Zhao

Sun

et al. 2023

Sensors

View full text Add to dashboard Cite

At present, the explosive growth of software code volume and quantity makes the code review process very labor-intensive and time-consuming. An automated code review model can assist in improving the efficiency of the process. Tufano et al., designed two automated tasks to help improve the efficiency of code review based on the deep learning approach, from two different perspectives, namely, the developer submitting the code and the code reviewer. However, they only used code sequence information and did not explore the logical structure information with a richer meaning of the code. To improve the learning of code structure information, a program dependency graph serialization algorithm PDG2Seq algorithm is proposed, which converts the program dependency graph into a unique graph code sequence in a lossless manner, while retaining the program structure information and semantic information. We then designed an automated code review model based on the pre-trained model CodeBERT architecture, which strengthens the learning of code information by fusing program structure information and code sequence information, and then fine-tuned the model according to the code review activity scene to complete the automatic modification of the code. To verify the efficiency of the algorithm, the two tasks in the experiment were compared with the best Algorithm 1-encoder/2-encoder. The experimental results show that the model we proposed has a significant improvement under the BLEU, Lewinshtein distance and ROUGE-L metrics.

show abstract

Section: Minimum Dfs Encodingmentioning

confidence: 99%