کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
10329471 685412 2005 11 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
The Gaston Tool for Frequent Subgraph Mining
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر نظریه محاسباتی و ریاضیات
پیش نمایش صفحه اول مقاله
The Gaston Tool for Frequent Subgraph Mining
چکیده انگلیسی
Given a database of graphs, structure mining algorithms search for all substructures that satisfy constraints such as minimum frequency, minimum confidence, minimum interest and maximum frequency. In order to make frequent subgraph mining more efficient, we propose to search with steps of increasing complexity. We present the GrAph/Sequence/Tree extractiON (Gaston) tool that implements this idea by searching first for frequent paths, then frequent free trees and finally cyclic graphs. We give results on large molecular databases.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Electronic Notes in Theoretical Computer Science - Volume 127, Issue 1, 30 March 2005, Pages 77-87
نویسندگان
, ,