Please use this identifier to cite or link to this item:
http://repository.iiitd.edu.in/xmlui/handle/123456789/1182Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Malhotra, Hrithik | - |
| dc.contributor.author | Purandare, Rahul (Advisor) | - |
| dc.date.accessioned | 2023-04-15T11:32:47Z | - |
| dc.date.available | 2023-04-15T11:32:47Z | - |
| dc.date.issued | 2021-12 | - |
| dc.identifier.uri | http://repository.iiitd.edu.in/xmlui/handle/123456789/1182 | - |
| dc.description.abstract | Code clones are duplicate code fragments that share (nearly) similar syntax or semantics. Code clone detection plays an important role in software maintenance, code refactoring, and reuse. Most of the techniques for code clone detection have achieved unprecedented performance on different open-source data sets. However, these methods are predominantly supervised and work only on samples drawn from the same distribution on which they have been trained. Since there is a scarcity of labeled data of code clones, it becomes hard to use these techniques in real-world software systems. To overcome this limitation, this project plans to build a code clone detection framework based on domain adaptation. I am planning to build this on top of an existing code clone detection tool - HOLMES. | en_US |
| dc.language.iso | en_US | en_US |
| dc.publisher | IIIT-Delhi | en_US |
| dc.subject | Code Clones | en_US |
| dc.subject | Program Analysis | en_US |
| dc.subject | Open Source | en_US |
| dc.subject | Deep Learning | en_US |
| dc.subject | Graph Neural Networks | en_US |
| dc.subject | Domain Adaptation | en_US |
| dc.title | Code clone detection framework based on domain adaptation | en_US |
| Appears in Collections: | Year-2021 | |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| Hrithik Malhotra.pdf Restricted Access | 1.1 MB | Adobe PDF | View/Open Request a copy |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.