{"id":2211,"date":"2021-03-05T20:09:11","date_gmt":"2021-03-05T11:09:11","guid":{"rendered":"http:\/\/www.sa.c.titech.ac.jp\/?p=2211"},"modified":"2026-02-16T15:15:05","modified_gmt":"2026-02-16T06:15:05","slug":"%e7%a0%94%e7%a9%b6%e7%99%ba%e8%a1%a8-untangling-composite-changes-using-tree-based-convolution-neural-network","status":"publish","type":"post","link":"https:\/\/www.sa.comp.isct.ac.jp\/en\/archives\/2211","title":{"rendered":"[Research] Untangling Composite Changes Using Tree-based Convolution Neural Network"},"content":{"rendered":"

Cong Li, a master’s student of our laboratory, presented our paper in the 2021 March Meeting of IEICE Technical Committees on Software Science, held online.<\/p>\n

Authors: Cong Li, Takashi Kobayashi\uff08Tokyo Tech\uff09
\nTitle: Untangling Composite Changes Using Tree-based Convolution Neural Network
\nBook Title: \u4fe1\u5b66\u6280\u5831, vol. 120, no. 407, SS2020-46<\/a>, pp. 108-113, 2021\u5e743\u6708.
\nAbstract:
\nDevelopers often bundle unrelated changes in a single commit, thus creating a so-called composite commit. Composite commit is problematic because it makes code review, reversion, and integration of these commits harder. Recent
\nresearches have attempted to use the information of Abstract Syntax Tree (AST) to untangling composite commits. However, they did not make full use of the AST structure information. To make full use of AST structure information to untangle a
\ncomposite commit. First, we predict the relationship between two code fragments using a Tree-based CNN model, which can capture both the structural and lexical information of the code fragment. Second, we cluster these code fragments according to
\ntheir relationship. Third, we evaluated whether our approach can untangle composite commits correctly.<\/p><\/blockquote>\n

\"\"<\/p>","protected":false},"excerpt":{"rendered":"

Cong Li, a master’s student of our laboratory, presented our paper in the 2021 March Meeting of IEICE Te […]<\/p>\n","protected":false},"author":19,"featured_media":0,"comment_status":"closed","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[3],"tags":[],"class_list":["post-2211","post","type-post","status-publish","format-standard","hentry","category-research"],"_links":{"self":[{"href":"https:\/\/www.sa.comp.isct.ac.jp\/en\/wp-json\/wp\/v2\/posts\/2211","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.sa.comp.isct.ac.jp\/en\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.sa.comp.isct.ac.jp\/en\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.sa.comp.isct.ac.jp\/en\/wp-json\/wp\/v2\/users\/19"}],"replies":[{"embeddable":true,"href":"https:\/\/www.sa.comp.isct.ac.jp\/en\/wp-json\/wp\/v2\/comments?post=2211"}],"version-history":[{"count":10,"href":"https:\/\/www.sa.comp.isct.ac.jp\/en\/wp-json\/wp\/v2\/posts\/2211\/revisions"}],"predecessor-version":[{"id":2854,"href":"https:\/\/www.sa.comp.isct.ac.jp\/en\/wp-json\/wp\/v2\/posts\/2211\/revisions\/2854"}],"wp:attachment":[{"href":"https:\/\/www.sa.comp.isct.ac.jp\/en\/wp-json\/wp\/v2\/media?parent=2211"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.sa.comp.isct.ac.jp\/en\/wp-json\/wp\/v2\/categories?post=2211"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.sa.comp.isct.ac.jp\/en\/wp-json\/wp\/v2\/tags?post=2211"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}