DocumentCode :
3734278
Title :
A path-finding based method for concept discovery in graphs
Author :
N. Ceren Abay;Alev Mutlu;Pinar Karagoz
Author_Institution :
Department of Computer Engineering, Middle East Technical University, Ankara, Turkey
fYear :
2015
fDate :
7/1/2015 12:00:00 AM
Firstpage :
1
Lastpage :
6
Abstract :
In the multi-relational data mining, concept discovery is the problem of inducing definitions of a relation in terms of other relations provided. In this paper, we present a method that combines graph-based and association rule mining-based methods for concept discovery in graphs. The proposed method is related to graphs as the data, which is initially stored in a relational database, is represented as a graph and concept descriptors are the paths that connect certain vertices; and it is related to association rule mining as it uses methods of association rule mining to prune the search space and evaluate the quality of the concept descriptors. The method is evaluated on several data sets, and the experimental results show that it is compatible with the state-of-the art methods in terms of accuracy and coverage of the induced concept descriptors and the running time of the application.
Keywords :
"Object oriented modeling","Data models","Relational databases","Association rules","Biological system modeling"
Publisher :
ieee
Conference_Titel :
Information, Intelligence, Systems and Applications (IISA), 2015 6th International Conference on
Type :
conf
DOI :
10.1109/IISA.2015.7388092
Filename :
7388092
Link To Document :
بازگشت