Estimating the optimal number of latent concepts in source code analysis

Proceedings - 10th IEEE International Working Conference on Source Code Analysis and Manipulation, SCAM 2010

Volumn , Issue , 2010, Pages 65-74

  Grant, Scott ^a   Cordy, James R ^a  

^a QUEEN S UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

EMPIRICAL EVIDENCE; LATENT DIRICHLET ALLOCATION; NATURAL LANGUAGES; OPTIMAL NUMBER; SOURCE CODE ANALYSIS; SOURCE CODES;

OPTIMIZATION;

OPTIMAL SYSTEMS;

EID: 78649438251     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SCAM.2010.22     Document Type: Conference Paper

References (28)

1. P. F. Baldi, C. V. Lopes, E. J. Linstead, and S. K. Bajracharya. A theory of aspects as latent topics. ACM SIGPLAN Notices, 43(10):543-562, 2008.
2. D. Bartholomew and M. Knott. Latent variable models and factor analysis. Oxford University Press Inc., Arnold, 2nd edition, 1999.
3. T. J. Biggerstaff, B. G. Mitbander, and D. E. Webster. The concept assignment problem in program understanding. In Proceedings of the 15th International Conference on Software Engineering (ICSE '93), pages 482-498, Los Alamitos, CA, USA, 1993. IEEE Computer Society Press.
4. T. J. Biggerstaff, B. G. Mitbander, and D. E. Webster. Program understanding and the concept assignment problem. Communications of the ACM, 37(5):72-82, 1994.
5. D. M. Blei, A. Y. Ng, and M. I. Jordan. Latent dirichlet allocation. The Journal of Machine Learning Research, 3:993-1022, 2003.
6. K. A. Bollen. Structural Equations with Latent Variables. Wiley-Interscience, New York, NY, USA, 1989.
7. R. B. Bradford. An empirical study of required dimensionality for large-scale latent semantic indexing applications. In Proceeding of the 17th ACM Conference on Information and Knowledge Management (CIKM '08), pages 153-162, New York, NY, USA, 2008. ACM.
8. R. E. Brooks. Using a behavioral theory of program comprehension in software engineering. In Proceedings of the 3rd International Conference on Software Engineering (ICSE '78), pages 196-201, Piscataway, NJ, USA, 1978. IEEE Press.
9. R. E. Brooks. Towards a theory of the comprehension of computer programs. International Journal of Man-Machine Studies, 18(6):543-554, 1983.
10. P. Comon. Independent component analysis, a new concept? Signal Processing, 36(3):287-314, 1994.
11. J. R. Cordy. The txl source transformation language. Science of Computer Programming, 61(3):190-210, 2006.
12. S. Grant and J. R. Cordy. Vector space analysis of software clones. In 17th IEEE International Conference on Program Comprehension (ICPC '09), pages 233-237, May 2009.
13. S. Grant, J. R. Cordy, and D. B. Skillicorn. Automated concept location using independent component analysis. In Proceedings of the 15th Working Conference on Reverse Engineering (WCRE '08), pages 138-142, October 2008.
14. S. Grant, D. B. Skillicorn, and J. R. Cordy. Topic detection using independent component analysis. In Proceedings of the 2008 Workshop on Link Analysis, Counterterrorism and Security (LACTS '08), pages 23-28, April 2008.
15. A. Kontostathis. Essential Dimensions of Latent Semantic Indexing (LSI). In Proceedings of the 40th Annual Hawaii International Conference on System Sciences (HICSS '07), page 73, Washington, DC, USA, 2007. IEEE Computer Society.
16. A. Kuhn, S. Ducasse, and T. Gírba. Semantic clustering: Identifying topics in source code. Information and Software Technology, 49(3):230-243, 2007.
17. T. K. Landauer and S. T. Dumais. A solution to plato's problem: The latent semantic analysis theory of the acquisition, induction, and representation of knowledge. Psychological Review, 104:211-240, 1997.
18. E. Linstead, C. Lopes, and P. Baldi. An application of latent dirichlet allocation to analyzing software evolution. In Proceedings of the 2008 7th International Conference on Machine Learning and Applications (ICMLA '08), pages 813-818, Washington, DC, USA, 2008. IEEE Computer Society.
19. E. Linstead, P. Rigor, S. Bajracharya, C. Lopes, and P. Baldi. Mining concepts from code with probabilistic topic models. In Proceedings of the 22nd IEEE/ACM International Conference on Automated Software Engineering (ASE '07), pages 461-464, New York, NY, USA, 2007. ACM.
20. J. I. Maletic and A. Marcus. Using latent semantic analysis to identify similarities in source code to support program understanding. In Proceedings of the 12th IEEE International Conference on Tools with Artificial Intelligence (ICTAI '00), page 46, Washington, DC, USA, 2000. IEEE Computer Society.
21. J. I. Maletic and N. Valluri. Automatic software clustering via latent semantic analysis. In Proceedings of the 14th IEEE International Conference on Automated Software Engineering (ASE '99), page 251, Washington, DC, USA, 1999. IEEE Computer Society.
22. A. Marcus and J. I. Maletic. Recovering documentation-tosource- code traceability links using latent semantic indexing. In Proceedings of the 25th International Conference on Software Engineering (ICSE '03), pages 125-135,Washington, DC, USA, 2003. IEEE Computer Society.
23. G. Maskeri, S. Sarkar, and K. Heafield. Mining business topics in source code using latent dirichlet allocation. In Proceedings of the 1st Conference on India Software Engineering Conference (ISEC '08), pages 113-120, New York, NY, USA, 2008. ACM.
24. X.-H. Phan and C.-T. Nguyen. GibbsLDA++, A C/C++ Implementation of Latent Dirichlet Allocation (LDA) using Gibbs Sampling for Parameter Estimation and Inference. http://gibbslda.sourceforge.net.
25. C. K. Roy and J. R. Cordy. Are scripting languages really different? In 4th International Workshop on Software Clones (IWSC '10), May 2010.
26. C. K. Roy and J. R. Cordy. Near-miss function clones in open source software: An empirical study. Journal of Software Maintenance and Evolution, Special Issue on WCRE '08, 2010.
27. G. Salton, A. Wong, and C. S. Yang. A vector space model for automatic indexing. Communications of the ACM, 18(11):613-620, 1975.
28. B. Shneiderman and R. Mayer. Syntactic/semantic interactions in programmer behavior: A model and experimental results. International Journal of Parallel Programming, 8(3):219-238, June 1979.