用聚类分析方法挖掘Aspect

• 论文 •

用聚类分析方法挖掘Aspect

何丽莉，白洪涛

1.吉林大学计算机科学与技术学院，吉林长春 130012；2.深圳电信新技术开发中心，广东深圳 518048

收稿日期:2004-11-08 修回日期:2005-02-04 出版日期:2006-01-15 发布日期:2006-01-25
基金资助:
国家自然科学基金资助项目(69903005)。

Research on Aspect mining using clustering analysis

HE Li-li, BAI Hong-tao

1.Sch. of Computer S & T, Jilin Univ., Changchun 130012, China;2.New Tech. Research Cent., Shenzhen Telecom, Shenzhen 518048, China

Received:2004-11-08 Revised:2005-02-04 Online:2006-01-15 Published:2006-01-25
Supported by:
Project supported by the National Nataral Science Foundation,China(No.69903005).

摘要/Abstract

摘要： 面向方面的编程是解决传统编程技术中横切问题的有效途径之一。为了将传统方法开发的系统转换成面向方面的系统，实现关注分离，提出了一种从遗产系统中发现横切关注点的方法。该方法将聚类分析与程序静态分析方法相结合，基于方法间的直接调用关系，识别面向对象遗产系统中的横切关注点，根据方法调用相似性自动形成候选Aspect集。本方法不受相似行为需要有相同的命名规则的限制，能够避免因横切关注点分离的粒度太细而导致的系统复杂度增加，为Aspect重构提供有用的帮助。

关键词: 切关注点, 聚类分析, Aspect挖掘

Abstract: Crosscutting concern is the inherent limitation for traditional programming, and Aspect-Oriented Programming (AOP) is one of the most effective ways to solve this problem. A novel method to discover crosscutting concerns from source-code for transformation from legacy system to Aspect-oriented system was proposed. Both the clustering analysis technology and static source-code analysis were used in this method to identify crosscutting concerns from object-oriented legacy system. Direct method invocation relationship was used as the characteristics of scattering code. Candidate Aspects set was generated automatically after clustering. The proposed method was not be limited to the same naming rules for similar behavior and the granularity of candidate aspect, which was much larger leading to the complexity of the system, were also avoided. The method was proved to be effective in the following Aspect reconfiguration and program understanding progresses.

Key words: crosscutting concern, clustering analysis, Aspect mining

中图分类号:

TP311

何丽莉，白洪涛. 用聚类分析方法挖掘Aspect[J]. .

HE Li-li, BAI Hong-tao. Research on Aspect mining using clustering analysis[J]. .

参考文献

［1］ ELRAD T,FILMAN R E,BADER A. Aspect-oriented programming［J］.Communication of the ACM, 2001, 44(10):29-32.

[2] ELRAD T, AKSIT M M, KICZALES G, et al. Discussing aspects of AOP［J］.Communication of the ACM, 2001, 44(10):33-38.

[3] HANNEMANN J,KICZALES G. Overcoming the prevalent decomposition of legacy code［EB/OL］.http://www.cs.ubc.ca/～jan/papers/hannemann-icse2001.pdf,2004-10.

[4] GRISWOLD W G, KATO Y, YUAN J J. Aspect browser: tool support for managing dispersed aspects［R］.San Diego,CA,USA: Department of Computer Science and Engineering, University of California, 1999.

[5] BREU S,KRINKE J. Aspect mining using event traces［A］.Proceedings of 19th IEEE International Conference on Automated Software Engineering［C］.Linz,Austria: IEEE Computer Society, 2004.310-315.

[6] CAO Donggang, MEI Hong. Aspect orientation - a new approach to programming［J］.Computer Science, 2003,30(9):5-10(in Chinese).［曹东刚, 梅宏. 面向Aspect的程序设计－一种新的编程范型［J］.计算机科学，2003, 30 (9): 5-10.］

[7] HAN J W, KANBR M. Data mining concepts and techniques［M］.Beijing: Higher Education Press, 2001.143-177.

[8] KAUFAN L, ROUSSEEUW P J. Finding groups in data: an introduction to cluster analysis［M］.New York,NY,USA: John Wiley&Sons,1990.

[9] ZHANG T,RAMAKRISHNAN R, LIVNY M. Birch: an efficient data clustering method for very large databases［A］.Proceedings of ACM SIGMOD［C］.Montreal,Quebec,Canada: ACM Press，1996. 103-114.

[10] ESTER M, KRIEGEL HP, SANDER J, et al. A density based algorithm for discovering clusters in large spatial databases with noise［A］.Proceedings of the 2nd International Conference on Knowledge Discovery and Data Mining［C］.Portland: AAAI Press,1996. 226-231.

[11] GUHA S, RASTOGI R, SHIM K. CURE: an efficient clustering algorithm for large databases［A］.Proceeding of the ACM SIGMOD International Conference on Management of Data［C］.Seattle，WA，USA: ACM Press, 1998. 73-84.

[12] KRIEGEL H P, KROGER P, GOTLIBOVICH I.Incremental OPTICS: efficient computation of updates in a hierarchical cluster ordering［A］.Proceedings of 5th International Conference on Data Warehousing and Knowledge Discouery［C］.Progue,Czechic:Springer-Verlag Press,2003.224-233.

[13] CHU S C, RODDICK, J F，PAN J S. An incremental multi-centroid, multi-run sampling scheme for k-medoids-based algorithms［A］.Proceedings of the 3rd International Conference on Data Mining Methods and Databases［C］.Bologna,Italy:WIT Press, 2002,553-562.

[14] KARYPIS G, HAN E H,KUMAR V. Chameleon: a hierarchical clustering algorithm using dynamic modeling［J］.IEEE Transactions on Computer, 1999, 32(8):68-75.

[1]	孙殿柱,沈江华,汪思腾,李延瑞,林伟. 复杂型面点云的法向特征聚类分级估计方法[J]. 计算机集成制造系统, 2021, 27(5): 1440-1446.
[2]	蔡安江,郭宗祥,郭师虹,蔡曜,薛晓飞. 云制造环境下的知识服务组合优化策略[J]. 计算机集成制造系统, 2019, 25(第2): 421-430.
[3]	王骁,刘检华,刘少丽,金鹏,吴天一. 基于聚类分析的管路图像亚像素边缘提取算法[J]. 计算机集成制造系统, 2018, 24(第9): 2201-2209.
[4]	冯涛,褚学宁,陈东萍. 顾客需求驱动的模块参数组合规划方法[J]. 计算机集成制造系统, 2016, 22(第9期): 2081-2088.
[5]	晁永生,孙文磊. 基于聚类分析的白车身零件工艺模板提取[J]. 计算机集成制造系统, 2014, 20(12): 3032-3039.
[6]	张文学,李铁克. 面向多种生产工艺的冶铸轧一体化批量计划优化[J]. 计算机集成制造系统, 2013, 19(06 ): 1296-1303.
[7]	谌炎辉,，周德俭,+. 基于相异度计算的模块库聚类分析方法[J]. , 2012, 18(03): 0-0.
[8]	李山，石源，刘红军. 基于ART2网络的三维模型聚类分析方法[J]. , 2011, 17(09): 0-0.
[9]	赵德滨，宋利利,闫纪红+. 基于模糊聚类分析的特征识别方法及其应用[J]. , 2009, 15(12): 0-0.
[10]	杨静萍，刘晓冰，王宇春，薄洪光. 基于多约束聚类的钢铁合同组批质量设计方法[J]. , 2009, 15(11): 0-0.
[11]	孙习武，褚学宁+，苏於梁，汤岑书. 基于聚类分析法的装夹规划算法研究[J]. , 2009, 15(06): 0-0.
[12]	朱海平, 王忠浩, 张国军, 邵新宇. 基于数据挖掘的通用物料清单重构方法研究[J]. , 2008, 14(02): 0-0.
[13]	朱海平, 赵玉, 吴军, 邵新宇. 神经网络集成方法在产品完工期预测中的应用[J]. , 2007, 13(11): 0-0.
[14]	陈永亮，褚巍丽，徐燕申. 面向可适应性的参数化产品平台设计[J]. , 2007, 13(05): 0-0.
[15]	张旭梅，邱晗光. 基于k-中心点法的改进粒子群算法在旅行商问题中的应用[J]. , 2007, 13(01): 0-0.