期刊名称：Studia Universitatis Babes-Bolyai : Series Informatica
印刷版ISSN：1224-869X
出版年度：2006
卷号：LI
期号：02
页码：3-3
出版社：Babes-Bolyai University, Cluj-Napoca
摘要：The purpose of this paper is to present a new graph-based ap-
proach in aspect mining. We de¡¥ne the problem of identifying the crosscutting
concerns as a search problem in a graph and we introduce GAAM algorithm
(Graph Algorithm in Aspect Mining) for solving this problem. We evaluate
the results obtained by applying GAAM algorithm from the aspect mining
point of view, based on a set of quality measure that we have previously de-
¡¥ned in [3]. The proposed approach is compared with a clustering approach
in aspect mining ([4]) and a case study is also reported.
