The DOI matches its Crossref record; 23 of the 23 references it cites were found in a registry or an index.
Software Module Clustering as a Multi-Objective Search Problem
Abstract
Software module clustering is the problem of automatically organizing software units into modules to improve program structure. There has been a great deal of recent interest in search-based formulations of this problem in which module boundaries are identified by automated search, guided by a fitness function that captures the twin objectives of high cohesion and low coupling in a single-objective fitness function. This paper introduces two novel multi-objective formulations of the software module clustering problem, in which several different objectives (including cohesion and coupling) are represented separately. In order to evaluate the effectiveness of the multi-objective approach, a set of experiments was performed on 17 real-world module clustering problems. The results of this empirical study provide strong evidence to support the claim that the multi-objective approach produces significantly better solutions than the existing single-objective approach.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Holland, J. H. (1992) · The MIT Press eBooks · doi:10.7551/mitpress/1090.001.0001 · Cited by 47,002
(1979) · Cited by 43,841
Genetic Algorithms in Search, Optimization and Machine Learning
Goldberg, D. E., & Robson, D. (1988) · Cited by 18,391
Software engineering: A practitioner's approach
(1983) · Advances in Engineering Software (1978) · doi:10.1016/0141-1195(83)90118-3 · Cited by 8,234
Non-Uniform Random Variate Generation
Devroye, L. (1986) · Springer eBooks · doi:10.1007/978-1-4613-8643-8 · Cited by 4,041
The Current State and Future of Search Based Software Engineering
Harman, M. (2007) · Future of Software Engineering (FOSE '07) · doi:10.1109/fose.2007.29 · Cited by 631
Self-citationStevens, W. P., Myers, G. J., & Constantine, L. L. (1979) · Cited by 609
Bunch: a clustering tool for the recovery and maintenance of software system structures
Mancoridis, S., Mitchell, B. S., Chen, Y., & Gansner, E. R. (1999) · Proceedings IEEE International Conference on Software Maintenance - 1999 (ICSM'99). 'Software Maintenance for Business Change' (Cat. No.99CB36360) · doi:10.1109/icsm.1999.792498 · Cited by 508
Using automatic clustering to produce high-level system organizations of source code
Mancoridis, S., Mitchell, B. S., Rorres, C., Chen, Y., & Gansner, E. R. (2002) · Proceedings. 6th International Workshop on Program Comprehension. IWPC'98 (Cat. No.98TB100242) · doi:10.1109/wpc.1998.693283 · Cited by 484
On the automatic modularization of software systems using the Bunch tool
Mitchell, B. S., & Mancoridis, S. (2006) · IEEE Transactions on Software Engineering · doi:10.1109/tse.2006.31 · Cited by 479
On understanding laws, evolution, and conservation in the large-program life cycle
Lehman, M. M. (1979) · Journal of Systems and Software · doi:10.1016/0164-1212(79)90022-0 · Cited by 377
Pareto efficient multi-objective test case selection
Yoo, S., & Harman, M. (2007) · Proceedings of the 2007 international symposium on Software testing and analysis · doi:10.1145/1273463.1273483 · Cited by 357
Self-citationReformulating software engineering as a search problem
Clarke, J., Dolado, J. J., Harman, M., Hierons, R., Jones, B., Lumkin, M., Mitchell, B., Mancoridis, S., Rees, K., Roper, M., et al. (2003) · IEE Proceedings - Software · doi:10.1049/ip-sen:20030559 · Cited by 286
Self-citationAutomatic clustering of software systems using a genetic algorithm
Doval, D., Mancoridis, S., & Mitchell, B. S. (2003) · STEP '99. Proceedings Ninth International Workshop Software Technology and Engineering Practice · doi:10.1109/step.1999.798481 · Cited by 262
Bieman, J. M., & Ott, L. M. (1994) · IEEE Transactions on Software Engineering · doi:10.1109/32.310673 · Cited by 251
The multi-objective next release problem
Zhang, Y., Harman, M., & Mansouri, S. A. (2007) · Proceedings of the 9th annual conference on Genetic and evolutionary computation · doi:10.1145/1276958.1277179 · Cited by 249
Self-citationA multiple hill climbing approach to software module clustering
Mahdavi, K., Harman, M., & Hierons, R. M. (2004) · International Conference on Software Maintenance, 2003. ICSM 2003. Proceedings. · doi:10.1109/icsm.2003.1235437 · Cited by 166
Self-citationA heuristic approach to solving the software clustering problem
Mitchell, B. S. (2004) · International Conference on Software Maintenance · doi:10.1109/icsm.2003.1235432 · Cited by 146
The Future of Software Engineering
Laplante, P. A. (2007) · CRC Press eBooks · doi:10.1201/9781420006742-11 · Cited by 112
Using Heuristic Search Techniques To Extract Design Abstractions From Source Code
Mitchell, B. S., & Mancoridis, S. (2002) · Cited by 101
An empirical study of the robustness of two module clustering fitness functions
Harman, M., Swift, S., & Mahdavi, K. (2005) · Genetic and Evolutionary Computation Conference (GECCO) · doi:10.1145/1068009.1068184 · Cited by 85
Self-citationThink and Explain with Statistics.
Bibby, J., & Moses, L. E. (1988) · Journal of the Royal Statistical Society Series C (Applied Statistics) · doi:10.2307/2347321 · Cited by 84
Think and Explain with Statistics.
Iversen, G. R., Moses, L. E., & Weldon, K. L. (1987) · Journal of the American Statistical Association · doi:10.2307/2289509 · Cited by 45
Cited by
Dhiman, G., & Kumar, V. (2017) · Advances in Engineering Software · doi:10.1016/j.advengsoft.2017.05.014 · Cited by 1,042
Many-Objective Evolutionary Algorithms: A Survey
Li, B., Li, J., Tang, K., & Yao, X. (2015) · ACM Computing Surveys · doi:10.1145/2792984 · Cited by 815
Self-citationSearch-based software engineering: Trends, techniques and applications
Harman, M., Mansouri, S. A., & Zhang, Y. (2012) · ACM Computing Surveys · doi:10.1145/2379776.2379787 · Cited by 777
Self-citationA New Dominance Relation-Based Evolutionary Algorithm for Many-Objective Optimization
Yuan, Y., Xu, H., Wang, B., & Yao, X. (2016) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2015.2420112 · Cited by 752
Self-citationA Survey of Multiobjective Evolutionary Algorithms for Data Mining: Part I
Mukhopadhyay, A., Maulik, U., Bandyopadhyay, S., & Coello, C. A. C. (2014) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2013.2290086 · Cited by 421
Metadata
- Authors
- Praditwong, K., Harman, M., & Yao, X.
- Venue
- IEEE Transactions on Software Engineering
- Published
- 2011-03
- Volume
- 37
- Issue
- 2
- Pages
- 264-282
- ISSN
- 0098-5589 (ISSN-L)
- OpenAlex
- W2111540240
- Cited by
- 395
- References
- 23
- FWCI
- 58.73
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.