کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
4947270 1439571 2017 32 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Iceberg Clique queries in large graphs
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر هوش مصنوعی
پیش نمایش صفحه اول مقاله
Iceberg Clique queries in large graphs
چکیده انگلیسی
This paper investigates the Iceberg Clique (IC) queries in a large graph, specially, given a user-specified threshold θ, an IC query reports the cliques where the number of vertices exceeds ⌊θ|V|⌋. Toward this end, a practical IC query theorem is formally proposed and proved. With this proposed query theorem, a formal context and its corresponding iceberg concept lattice are first constructed from an input graph topology by Modified Adjacency Matrix; then, we prove that the IC queries problem is equivalent to finding the iceberg equiconcepts whose number of elements exceeds ⌊θ|V|⌋. Theoretical analysis and experimental results demonstrate that the proposed query algorithm is feasible and efficient for finding the iceberg cliques from large graphs.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Neurocomputing - Volume 256, 20 September 2017, Pages 101-110
نویسندگان
, , , , , ,