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.
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
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
Fast 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
Agrawal, H., & Horgan, J. R. (1990) · Proceedings of the ACM SIGPLAN 1990 conference on Programming language design and implementation - PLDI '90 · doi:10.1145/93542.93576 · Cited by 867
Software Change Impact Analysis
Arnold, R. S. (1996) · Medical Entomology and Zoology · Cited by 665
Identifying similar code with program dependence graphs
Krinke, J. (2002) · Proceedings Eighth Working Conference on Reverse Engineering · doi:10.1109/wcre.2001.957835 · Cited by 616
Experiment on the automatic detection of function clones in a software system using metrics
Mayrand, Leblanc, & Merlo (1996) · Proceedings of International Conference on Software Maintenance ICSM-96 · doi:10.1109/icsm.1996.565012 · Cited by 528
Populating a Release History Database from version control and bug tracking systems
Fischer, M., Pinzger, M., & Gall, H. (2004) · International Conference on Software Maintenance, 2003. ICSM 2003. Proceedings. · doi:10.1109/icsm.2003.1235403 · Cited by 525
Mining Version Histories to Guide Software Changes
Zimmermann, T., Member, S., Weißgerber, P., Diehl, S., Zeller, A., & Ieee Computer Society (2004) · Cited by 494
Using a hash-based method with transaction trimming for mining association rules
Park, J. S., Chen, M.-S., & Yu, P. S. (1997) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/69.634757 · Cited by 440
Mining version histories to guide software changes
Zimmermann, T., Weibgerber, P., Diehl, S., & Zeller, A. (2004) · Proceedings. 26th International Conference on Software Engineering · doi:10.1109/icse.2004.1317478 · Cited by 322
Hipikat: recommending pertinent software development artifacts
Čubranić, D., & Murphy, G. C. (2003) · doi:10.5555/776816.776866 · Cited by 317
Self-citationOn the Criteria To Be Used in Decomposing Systems into Modules
Parnas, D. L. (2002) · Software Pioneers · doi:10.1007/978-3-642-59412-0_26 · Cited by 306
On the Criteria to Be Used in Decomposing Systems into Modules
Parnas, D. L. (1972) · Pioneers and Their Contributions to Software Engineering · doi:10.1007/978-3-642-48354-7_20 · Cited by 237
Incremental mining of frequent patterns without candidate generation or support constraint
Cheung, W., & Zaiane, O. R. (2003) · Seventh International Database Engineering and Applications Symposium, 2003. Proceedings. · doi:10.1109/ideas.2003.1214917 · Cited by 216
Hipikat: recommending pertinent software development artifacts
Cubranic, D., & Murphy, G. C. (2003) · 25th International Conference on Software Engineering, 2003. Proceedings. · doi:10.1109/icse.2003.1201219 · Cited by 174
Self-citationGlobalization by chunking: a quantitative approach
Mockus, A., & Weiss, D. M. (2001) · IEEE Software · doi:10.1109/52.914737 · Cited by 160
Analyzing and relating bug report data for feature tracking
Fischer, M. D., Pinzger, M., & Gall, H. C. (2004) · Working Conference on Reverse Engineering (WCRE) · doi:10.1109/wcre.2003.1287240 · Cited by 135
Facilitating program comprehension by mining association rules from source code
Tjortjis, C., Sinos, L., & Layzell, P. J. (2004) · International Symposium on Micro-NanoMechatronics and Human Science · doi:10.1109/wpc.2003.1199196 · Cited by 35
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
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.