کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
533707 870157 2008 8 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Fast online graph clustering via Erdős–Rényi mixture
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر چشم انداز کامپیوتر و تشخیص الگو
پیش نمایش صفحه اول مقاله
Fast online graph clustering via Erdős–Rényi mixture
چکیده انگلیسی

In the context of graph clustering, we consider the problem of simultaneously estimating both the partition of the graph nodes and the parameters of an underlying mixture of affiliation networks. In numerous applications the rapid increase of data size over time makes classical clustering algorithms too slow because of the high computational cost. In such situations online clustering algorithms are an efficient alternative to classical batch algorithms. We present an original online algorithm for graph clustering based on a Erdős–Rényi graph mixture. The relevance of the algorithm is illustrated, using both simulated and real data sets. The real data set is a network extracted from the French political blogosphere and presents an interesting community organization.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Pattern Recognition - Volume 41, Issue 12, December 2008, Pages 3592–3599
نویسندگان
, , ,