Intelligent code completion with Bayesian networks
| dc.contributor.author | Proksch, Sebastian | |
| dc.contributor.author | Lerch, Johannes | |
| dc.contributor.author | Mezini, Mira | |
| dc.contributor.editor | Knoop, Jens | |
| dc.contributor.editor | Zdun, Uwe | |
| dc.date.accessioned | 2017-06-21T07:37:30Z | |
| dc.date.available | 2017-06-21T07:37:30Z | |
| dc.date.issued | 2016 | |
| dc.description.abstract | Code completion is an integral part of modern Integrated Development Environments (IDEs). Intelligent code completion systems can reduce long lists of type-correct proposals to relevant items. In this work, we replace an existing code completion engine named Best-Matching Neighbor (BMN) by an approach using Bayesian Networks named Pattern-based Bayesian Network (PBN).We use additional context information for more precise recommendations and apply clustering techniques to improve model sizes and to increase speed. We compare the new approach with the existing algorithm and, in addition to prediction quality, we also evaluate model size and inference speed. Our results show that the additional context information we collect improves prediction quality, and that PBN can obtain comparable prediction quality to BMN, while model size and inference speed scale better with large input sizes. | en |
| dc.identifier.isbn | 978-3-88579-646-6 | |
| dc.identifier.pissn | 1617-5468 | |
| dc.language.iso | en | |
| dc.publisher | Gesellschaft für Informatik e.V. | |
| dc.relation.ispartof | Software Engineering 2016 | |
| dc.relation.ispartofseries | Lecture Notes in Informatics (LNI) - Proceedings, Volume P-252 | |
| dc.title | Intelligent code completion with Bayesian networks | en |
| dc.type | Text/Conference Paper | |
| gi.citation.endPage | 26 | |
| gi.citation.publisherPlace | Bonn | |
| gi.citation.startPage | 25 | |
| gi.conference.date | 23.-26. Februar 2016 | |
| gi.conference.location | Wien |
Dateien
Originalbündel
1 - 1 von 1