IMPROVING THE SOFTWARE ARCHITECTURE THROUGH FUZZY CLUSTERING TECHNIQUE.
Journal Title: Indian Journal of Computer Science and Engineering - Year 2010, Vol 1, Issue 1
Abstract
Software Architecture Recovery is one of the finest parts of reverse engineering. Several different techniques have been adopted in vast literature to recover Software Architecture. One of the techniques is clustering, which extracts the similar components from the software. In general the component characteristics and its state are not clear. For that, Architecture recovered from ordinary clustering will not be appropriate in it. In this paper we used a fuzzy clustering technique to make the Software Architecture recovery to be more efficient and accurate. Our experimental results have shown that Architecture recovers from fuzzy clustering is better than ordinary clustering
Authors and Affiliations
Shaheda Akthar , Sk. Md. Rafi
Keywords
Related Articles
- EP ID EP134621
- DOI -
- Views 127
- Downloads 0
Comparative analysis of Recurrent and Finite Impulse Response Neural Networks in Time Series Prediction
The purpose of this paper is to perform evaluation of two different neural network architectures used for solving temporal problems, i.e. time series prediction. The data sets in this project include Mackey-Glass, Sunspo...
Comparison between simulations of different RBSD Adder Circuits
Adders are the key element of the arithmetic unit, especially fast parallel adder. Redundant Binary Signed Digit (RBSD) adders are designed to perform high-speed arithmetic operations. The RBSD Number System is gaining p...
A GENETIC ALGORITHM FOR FINITE STATE AUTOMATA
The genetic algorithm is described, including its three main steps: selection, crossover, and mutation. A comparison between implementation costs and running times of regular expressions matching a string is then made. T...
INDEXING TRADITIONAL UDDI FOR EFFICIENT DISCOVERY OF WEB SERVICES
Web service is a major trend in the industry for loosely coupled service-oriented architecture and interoperable solutions across heterogeneous platforms and systems. It receives profound attention and adoption by the in...
SUPER STRONGLY PERFECT NESS OF SOME INTERCONNECTION NETWORKS
A Graph G is Super Strongly Perfect Graph if every induced sub graph H of G possesses a minimal dominating set that meets all the maximal complete sub graphs of H. In this paper we have analyzed the structure of super st...