کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
490046 705265 2015 8 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Frequent Subgraph Mining Algorithms – A Survey
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر علوم کامپیوتر (عمومی)
پیش نمایش صفحه اول مقاله
Frequent Subgraph Mining Algorithms – A Survey
چکیده انگلیسی

Graphs are common data structures used to represent / model real-world systems. Graph Mining is one of the arms of Data mining in which voluminous complex data are represented in the form of graphs and mining is done to infer knowledge from them. Frequent sub graph mining is a sub section of graph mining domain which is extensively used for graph classification, building indices and graph clustering purposes. The frequent sub graph mining is addressed from various perspectives and viewed in different directions based upon the domain expectations. In this paper, a survey is done on the approaches in targeting frequent sub graphs and various scalable techniques to find them.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Procedia Computer Science - Volume 47, 2015, Pages 197-204