Source Code Dependency Graph Based Contextual Probabilistic Clustering Approach on Large Open Source Projects
Nakul Sharma1, Prasanth Yalla2

1Nakul Sharma, Research Scholar, Department of Computer Science and Engineering, Koneru Lakshmaiah Education Foundation, Guntur (A.P), India.
2Prasanth Yalla, Professor, Department of Computer Science and Engineering, Koneru Laksmaiah Education Foundation, Guntur (A.P), India.

Manuscript received on 18 June 2019 | Revised Manuscript received on 25 June 2019 | Manuscript published on 30 June 2019 | PP: 1507-1517 | Volume-8 Issue-5, June 2019 | Retrieval Number: E7880068519/19©BEIESP
Open Access | Ethics and Policies | Cite | Mendeley | Indexing and Abstracting
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC-BY-NC-ND license (

Abstract: Software systems tend to become larger and more complex in terms of different metrics such as fields, methods and classes as the functional requirements of the project increases. Most of the open source or commercial software projects are represented in simple diagrammatic representation in order to understand the analysis of the source code metrics. Also, these projects are difficult to analyze the source code metrics by using traditional similarity measures and graph dependency approaches due to high computational memory and time. Analysis of source code metrics and compiled class metrics are necessary to represent various metrics and its complex relationship for software design representation. In order to overcome these issues, a novel graph dependency based probabilistic similarity clustering approach is implemented on the source codes and class files metrics. Experimental results proved that the present approach is better than the traditional source code analysis methods in terms of contextual similarity and accuracy.
Keywords: Source Code Analysis, Class Files Metrics, Graph Dependency Model.

Scope of the Article: Clustering