Clustering of software systems using new hybrid algorithms

Proceedings - IEEE 9th International Conference on Computer and Information Technology, CIT 2009

Volumn 1, Issue , 2009, Pages 20-25

  Mamaghani, Ali Safari ^a   Meybodi, Mohammad Reza ^b  

^a ISLAMIC AZAD UNIVERSITY   (Iran)

^b AMIRKABIR UNIVERSITY OF TECHNOLOGY   (Iran)

Author keywords

Genetic algorithm; Learning automata; Module dependency graph; Software clustering

Indexed keywords

APPROXIMATE ALGORITHMS; DEPENDENCY GRAPHS; EXISTING METHOD; FUNCTION CALLS; GRAPH PARTITIONING; HIGH STABILITY; HYBRID ALGORITHMS; HYBRID EVOLUTIONARY ALGORITHM; INHERITANCE RELATIONSHIPS; LEARNING AUTOMATA; LOCAL OPTIMAL; NP COMPLETE PROBLEMS; OBJECT MIGRATION; SOFTWARE CLUSTERING; SOFTWARE DESIGNERS; SOFTWARE SYSTEMS; SYSTEM MODULES;

COMPUTER SOFTWARE; COMPUTER SOFTWARE MAINTENANCE; GENETIC ALGORITHMS; INFORMATION TECHNOLOGY; LEARNING ALGORITHMS; OBJECT ORIENTED PROGRAMMING; ROBOTS; TRANSLATION (LANGUAGES);

CLUSTERING ALGORITHMS;

EID: 73449121931     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CIT.2009.111     Document Type: Conference Paper

References (13)

1. B. S. Mitchell, A Heuristic Search Approach to Solving the Software Clustering Problem, Ph.D Thesis, Drexel University, Philadelphia, 2002.
2. D. Doval and S. Mancoridis, "Automatic Clustering of Software Systems using a Genetic Algorithm", In Proc. Of the IEEE Int. Conf. on Software Tools and Engineering Practice(STEP'99), 1999.
3. S. Mancordis, B. S. Mitchell, Y. Chen and E. R. Gansner, "Bunch: A clustering tool for the recovery and maintenance of software system Structures", in Proc. Of Int. Conf. of Software Maintenance, pp. 50-59, 1999.
4. B. S. Mitchell, M. Traverso and S. Mancoridis, "An architecture for distributing the computation of software clustering algorithms", In Proc. IEEE/IFIP Conf. on Software Architecture , 2001.
5. S. Mancordis, B. S. Mitchell, Y. Chen and E. R. Gansner, "Bunch: A clustering tool for the recovery and maintenance of software system Structures", in Proc. Of Int. Conf. of Software Maintenance, pp. 50-59, 1999.
6. Y. Chen, E. Gansner and E. Koutsofios, "A C++ Data Model Supporting Reachability Analysis and Dead Code Detection", In proc. Of 6th European Software Engineering Conf. and 5th ACM SIGSOFT Symposioum On The Foundations Of Ssoftware Engineering, 1997.
7. S. Parsa, and O. Bushehrian, "A New Encoding Scheme and a Framwork to investigate Genetic Clustering Algorithms", Journal of Research and Practice in Information Technology, Vol. 37, No. 1, pp. 127-143, 2005.
8. B. J. Oommen, and D. C .Y. Ma, "Deterministic Learning Automata Solutions to the equipartitioning problem", IEEE Traactions on Computers, Vol. 37 , pp. 2-13, 1998.
9. K. Narendra and M. A. L. Thathachar, Learning Automata: An Introduction, Prentice Hall, 1989.
10. H. Beygi and M. R. Meybodi, Solving the Graph Isomorphism Problem Using Learning Automata, In Proc. of CSI int. Conf. pp. 402-415, Tehran, 2000.
11. M. Rezapour, Solving Graph Isomorphism problem Using Learning Automata, M. Sc. Thesis, Amirkabir University of technology, Tehran, Iran, 2004.
12. A. Safari Mamaghani, Designing Hybrid Algorithms to Solving Graph Hard Problems, M. Sc. Thesis, Islamic Azad University, Qazvin, 2008.
13. K. Asghari, A. Safari Mamaghani and M. R. Meybodi,"An Evolutionary Approach for Query Optimization Problem in Database", In Proc. of Int. Joint Conf. on Computers, Information and System Sciences, and Engineering (CISSE2007), University of Bridgeport, England, 2007.