Scaling analysis of affinity propagation

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Scaling Analysis of Affinity Propagation

We analyze and exploit some scaling properties of the affinity propagation (AP) clustering algorithm proposed by Frey and Dueck [Science 315, 972 (2007)]. Following a divide and conquer strategy we setup an exact renormalization-based approach to address the question of clustering consistency, in particular, how many cluster are present in a given data set. We first observe that the divide and ...

متن کامل

Sparse Affinity Propagation for Image Analysis

It is challenging to find a small set of data points, so-called exemplars or landmarks, that are nicely representative of itself and other data points. Affinity propagation (AP) is an effective algorithm that identifies exemplars among data points by recursively sending realvalued messages between pairs of data points. AP calculates the message using the similarity among data points. Hence, the...

متن کامل

Hybrid Affinity Propagation

In this paper, we address a problem of managing tagged images with hybrid summarization. We formulate this problem as finding a few image exemplars to represent the image set semantically and visually, and solve it in a hybrid way by exploiting both visual and textual information associated with images. We propose a novel approach, called homogeneous and heterogeneous message propagation (HMP)....

متن کامل

Patch Affinity Propagation

Affinity propagation constitutes an exemplar based clustering technique which reliably optimizes the quantization error given a matrix of pairwise data dissimilarities by means of the max-sum algorithm for factor graphs. Albeit very efficient for sparse matrices, it displays squared complexity in the worst case, hence it is not suited as high throughput method due to time and memory constraints...

متن کامل

Hierarchical Affinity Propagation

Facility location (FL) is a well-researched problem in operational-research (Şahin Güvenç & Haldun, 2007), and is closely related to EBC. Given a set of N customers and M potential facilities to open, as well as costs sij for customer i to use facility j, and a facility setup cost cj associated with opening a facility j, we wish to find the set of facilities to open, as well as the assignments ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Physical Review E

سال: 2010

ISSN: 1539-3755,1550-2376

DOI: 10.1103/physreve.81.066102