The DOI matches its Crossref record; 26 of the 26 references it cites were found in a registry or an index.
Predicting source code changes by mining change history
Abstract
Software developers are often faced with modification tasks that involve source which is spread across a code base. Some dependencies between source code, such as those between source code written in different languages, are difficult to determine using existing static and dynamic analyses. To augment existing analyses and to help developers identify relevant source code during a modification task, we have developed an approach that applies data mining techniques to determine change patterns - sets of files that were changed together frequently in the past - from the change history of the code base. Our hypothesis is that the change patterns can be used to recommend potentially relevant source code to a developer performing a modification task. We show that this approach can reveal valuable dependencies by applying the approach to the Eclipse and Mozilla open source projects and by evaluating the predictability and interestingness of the recommendations produced for actual modification tasks on these systems.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Mining association rules between sets of items in large databases
Agrawal, R., Imieliński, T., & Swami, A. (1993) · Proceedings of the 1993 ACM SIGMOD international conference on Management of data · doi:10.1145/170035.170072 · Cited by 14,907 · cited 3×
“However, other systems such as CVS, which is used for the systems we targeted in our validation, do not track this information; as a result, we must process the change history to attempt to recreate these sets.”
BackgroundMethodFast algorithms for mining association rules
Agrawal, R., & Srikant, R. (1998) · Cited by 11,307
Fast Algorithms for Mining Association Rules in Large Databases
Agrawal, R., & Srikant, R. (1994) · Very Large Data Bases · Cited by 9,419
Mining frequent patterns without candidate generation
Han, J., Pei, J., & Yin, Y. (2000) · ACM SIGMOD Record · doi:10.1145/335191.335372 · Cited by 6,402
On the criteria to be used in decomposing systems into modules
Parnas, D. L. (1972) · Communications of the ACM · doi:10.1145/361598.361623 · Cited by 4,704
Mining frequent patterns without candidate generation
Han, J., Pei, J., & Yin, Y. (2000) · Proceedings of the 2000 ACM SIGMOD international conference on Management of data · doi:10.1145/342009.335372 · Cited by 3,216
Weiser, M. (1984) · IEEE Transactions on Software Engineering · doi:10.1109/tse.1984.5010248 · Cited by 3,204
Two case studies of open source software development: Apache and Mozilla
Mockus, A., Fielding, R. T., & Herbsleb, J. D. (2002) · ACM Transactions on Software Engineering and Methodology · doi:10.1145/567793.567795 · Cited by 1,685
Beyond market baskets: generalizing association rules to correlations
Brin, S., Motwani, R., & Silverstein, C. (1997) · Proceedings of the 1997 ACM SIGMOD international conference on Management of data - SIGMOD '97 · doi:10.1145/253260.253327 · Cited by 1,281
Clone detection using abstract syntax trees
Baxter, I. D., Yahin, A., Moura, L., Sant'Anna, M., & Bier, L. (2002) · Proceedings. International Conference on Software Maintenance (Cat. No. 98CB36272) · doi:10.1109/icsm.1998.738528 · Cited by 1,277
Cited by
Mining version histories to guide software changes
Zimmermann, T., Zeller, A., Weissgerber, P., & Diehl, S. (2005) · IEEE Transactions on Software Engineering · doi:10.1109/tse.2005.72 · Cited by 856
Change Distilling:Tree Differencing for Fine-Grained Source Code Change Extraction
Fluri, B., Wursch, M., PInzger, M., & Gall, H. (2007) · IEEE Transactions on Software Engineering · doi:10.1109/tse.2007.70731 · Cited by 607
Kagdi, H., Collard, M. L., & Maletic, J. I. (2007) · Journal of Software Maintenance and Evolution: Research and Practice · doi:10.1002/smr.344 · Cited by 413
Is it a bug or an enhancement?: a text-based approach to classify change requests
Antoniol, G., Ayari, K., Di Penta, M., Khomh, F., & Guéhéneuc, Y.-G. (2008) · Proceedings of the 2008 conference of the center for advanced studies on collaborative research meeting of minds - CASCON '08 · doi:10.1145/1463788.1463819 · Cited by 366
Lucia, A. D., Fasano, F., Oliveto, R., & Tortora, G. (2007) · ACM Transactions on Software Engineering and Methodology · doi:10.1145/1276933.1276934 · Cited by 354
Hierarchical Clustering for Software Architecture Recovery
Maqbool, O., & Babri, H. (2007) · IEEE Transactions on Software Engineering · doi:10.1109/tse.2007.70732 · Cited by 349
The road ahead for Mining Software Repositories
Hassan, A. E. (2008) · 2008 Frontiers of Software Maintenance · doi:10.1109/fosm.2008.4659248 · Cited by 337
DynaMine: finding common error patterns by mining software revision histories
Livshits, B., & Zimmermann, T. (2005) · Proceedings of the 10th European software engineering conference held jointly with 13th ACM SIGSOFT international symposium on Foundations of software engineering · doi:10.1145/1081706.1081754 · Cited by 330
Hipikat: a project memory for software development
Cubranic, D., Murphy, G. C., Singer, J., & Booth, K. S. (2005) · IEEE Transactions on Software Engineering · doi:10.1109/tse.2005.71 · Cited by 324
Self-citationMining Version Histories for Detecting Code Smells
Palomba, F., Bavota, G., Penta, M. D., Oliveto, R., Poshyvanyk, D., & De Lucia, A. (2015) · IEEE Transactions on Software Engineering · doi:10.1109/tse.2014.2372760 · Cited by 259
How Programmers Debug, Revisited: An Information Foraging Theory Perspective
Lawrance, J., Bogart, C., Burnett, M., Bellamy, R., Rector, K., & Fleming, S. D. (2013) · IEEE Transactions on Software Engineering · doi:10.1109/tse.2010.111 · Cited by 142
Using information scent to model the dynamic foraging behavior of programmers in maintenance tasks
Lawrance, J., Bellamy, R., Burnett, M., & Rector, K. (2008) · Proceedings of the SIGCHI Conference on Human Factors in Computing Systems · doi:10.1145/1357054.1357261 · Cited by 76
“Scent-based indicators could also be added to existing software tools based on other ways of discovering relationships between source code, such as developer navigation and action histories [27, 28, 31, 32], or structural or lexical relationships [5, 7, 8].”
BackgroundMethodAn Industrial Case Study of Program Artifacts Viewed During Maintenance Tasks
Zou, L., & Godfrey, M. W. (2006) · 2006 13th Working Conference on Reverse Engineering · doi:10.1109/wcre.2006.12 · Cited by 20
Towards Activity-Aware Tool Support for Change Tasks
Kevic, K., & Fritz, T. (2017) · 2017 IEEE International Conference on Software Maintenance and Evolution (ICSME) · doi:10.1109/icsme.2017.48 · Cited by 5
On the Relationship between Program Evolution and Fault-Proneness: An Empirical Study
Jaafar, F., Hassaine, S., Gueheneuc, Y., Hamel, S., & Adams, B. (2013) · 2013 17th European Conference on Software Maintenance and Reengineering · doi:10.1109/csmr.2013.12 · Cited by 5
Metadata
- Authors
- Ying, A. T. T., Murphy, G. C., Ng, R., & Chu-Carroll, M. C.
- Venue
- IEEE Transactions on Software Engineering
- Published
- 2004-09
- Volume
- 30
- Issue
- 9
- Pages
- 574-586
- ISSN
- 0098-5589 (ISSN-L)
- OpenAlex
- W2133961160
- Cited by
- 571
- References
- 26
- FWCI
- 96.59
- 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.