STUDIA UNIVERSITATIS

AMBIENTUM BIOETHICA BIOLOGIA CHEMIA DIGITALIA DRAMATICA EDUCATIO ARTIS GYMNAST. ENGINEERING EPHEMERIDES EUROPAEA GEOGRAPHIA GEOLOGIA HISTORIA HISTORIA ARTIUM INFORMATICA IURISPRUDENTIA MATHEMATICA MUSICA NEGOTIA OECONOMICA PHILOLOGIA PHILOSOPHIA PHYSICA POLITICA PSYCHOLOGIA-PAEDAGOGIA SOCIOLOGIA THEOLOGIA CATHOLICA THEOLOGIA CATHOLICA LATIN THEOLOGIA GR.-CATH. VARAD THEOLOGIA ORTHODOXA THEOLOGIA REF. TRANSYLVAN ROMÂNA ENGLISH INFOKIOSK CONTACT ADDRESSES SPECIAL ACCESS SUBSCRIPTION FORM NEWSLETTER & DOWNLOAD NEWEST ISSUES THIS YEAR ISSUES ALL ISSUES IN ARCHIVE FIND IN ARCHIVE HISTORY TODAY SCOP & OBJECTIVES THE TEAM


	The STUDIA UNIVERSITATIS BABEŞ-BOLYAI issue article summary The summary of the selected article appears at the bottom of the page. In order to get back to the contents of the issue this article belongs to you have to access the link from the title. In order to see all the articles of the archive which have as author/co-author one of the authors mentioned below, you have to access the link from the author's name.


	STUDIA INFORMATICA - Issue no. 2 / 2006

	Article:	A GRAPH ALGORITHM FOR IDENTIFICATION OF CROSSCUTTING CONCERNS. Authors: GABRIELA ŞERBAN, GRIGORETA SOFIA MOLDOVAN.


	Abstract: The purpose of this paper is to present a new graph-based ap-proach in aspect mining. We define 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 defined in [3]. The proposed approach is compared with a clustering approach in aspect mining ([4]) and a case study is also reported.




			Back to previous page