Discovering Identical Frequent Sub-Graphs in Object-Oriented Design
using Graph Partitioning and Closed Sub-graph Approach
Versandkostenfrei!
Versandfertig in 6-10 Tagen
36,99 €
inkl. MwSt.
PAYBACK Punkte
18 °P sammeln!
This book describes the identification of Subgraphs in the Object-Oriented Design using a Closed subgraph mining Algorithm. Objected Oriented Programming (OOP) allows to leverage the best practices and principles, thus reduces a human effort for reinventing new design. Further, understanding a software design is not an easy task, it requires a lot of domain and a deep understanding of OOP principles. Therefore, it becomes necessary to identify similar design structures in a group.Further, for large object-oriented systems, it is difficult to understand the functionalities because of their topo...
This book describes the identification of Subgraphs in the Object-Oriented Design using a Closed subgraph mining Algorithm. Objected Oriented Programming (OOP) allows to leverage the best practices and principles, thus reduces a human effort for reinventing new design. Further, understanding a software design is not an easy task, it requires a lot of domain and a deep understanding of OOP principles. Therefore, it becomes necessary to identify similar design structures in a group.Further, for large object-oriented systems, it is difficult to understand the functionalities because of their topological and behavioral complexity. It is even more difficult to extend or modify an existing design, which can be error-prone and can even lead to poor quality of software. Developers who work with software systems tend to break large and complex systems into smaller sub-components. Therefore, this research work proposes a partitioning based graph mining approach to discover frequent identical design patterns in an object-oriented design model.
Andere Kunden interessierten sich für
