Please use this identifier to cite or link to this item: http://artemis.cslab.ece.ntua.gr:8080/jspui/handle/123456789/17685
Full metadata record
DC FieldValueLanguage
dc.contributor.authorKanavakis, Eleftherios-
dc.date.accessioned2020-09-29T07:01:10Z-
dc.date.available2020-09-29T07:01:10Z-
dc.date.issued2020-09-09-
dc.identifier.urihttp://artemis.cslab.ece.ntua.gr:8080/jspui/handle/123456789/17685-
dc.description.abstractThe purpose of this dissertation is to study the problem of source code classification using neural networks. More specifically, in this problem, a piece of code is classified into an algorithmic class based on the function it performs. Pre-existing research has shown that neural networks are an effective way of modeling source code and solving such classification problems. Although literature results are encouraging, there are limitations related not only to datasets and preprocessing techniques but also to machine learning models. To this end, we propose a system that initially builds quality datasets, which are free of biases and noise. It then uses compilers to process these sets and finally uses neural networks to classify them into an algorithmic class. In the context of optimizing the system above, we studied a variety of pre-processing techniques and machine learning models.en_US
dc.languageelen_US
dc.subjectSource code classificationen_US
dc.subjectCompilersen_US
dc.subjectAbstract Syntax Tree (AST)en_US
dc.subjectLong Short Term Memory (LSTM)en_US
dc.subjectHierarchical Attention Network (HAN)en_US
dc.subjectDeep Averaging Network (DAN)en_US
dc.titleSource Code Classification using Neural Networksen_US
dc.description.pages123en_US
dc.contributor.supervisorΓκούμας Γεώργιοςen_US
dc.departmentΤομέας Τεχνολογίας Πληροφορικής και Υπολογιστώνen_US
Appears in Collections:Διπλωματικές Εργασίες - Theses

Files in This Item:
File Description SizeFormat 
Thesis_Kanavakis.pdf3.04 MBAdobe PDFView/Open


Items in Artemis are protected by copyright, with all rights reserved, unless otherwise indicated.