Fixation for distributed clustering processes
نویسندگان
چکیده
منابع مشابه
Fixation for Distributed Clustering Processes
We study a discrete-time resource flow in Zd, where wealthier vertices attract the resources of their less rich neighbors. For any translation-invariant probability distribution of initial resource quantities, we prove that the flow at each vertex terminates after finitely many steps. This answers (a generalized version of) a question posed by Van den Berg and Meester in 1991. The proof uses th...
متن کاملEntropy-based Consensus for Distributed Data Clustering
The increasingly larger scale of available data and the more restrictive concerns on their privacy are some of the challenging aspects of data mining today. In this paper, Entropy-based Consensus on Cluster Centers (EC3) is introduced for clustering in distributed systems with a consideration for confidentiality of data; i.e. it is the negotiations among local cluster centers that are used in t...
متن کاملEscape of Resources in Distributed Clustering Processes
In a distributed clustering algorithm introduced by Coffman, Courtois, Gilbert and Piret [1], each vertex of Z receives an initial amount of a resource, and, at each iteration, transfers all of its resource to the neighboring vertex which currently holds the maximum amount of resource. In [4] it was shown that, if the distribution of the initial quantities of resource is invariant under lattice...
متن کاملBehavioral Clustering for Point Processes
Groups of (parallel) point processes may be analyzed with a variety of different goals. Here we consider the case in which one has a special interest in finding subgroups of processes showing a behavior that differs significantly from the other processes. In particular, we are interested in finding subgroups that exhibit an increased synchrony. Finding such groups of processes poses a difficult...
متن کاملClustering processes
The problem of clustering is considered, for the case when each data point is a sample generated by a stationary ergodic process. We propose a very natural asymptotic notion of consistency, and show that simple consistent algorithms exist, under most general non-parametric assumptions. The notion of consistency is as follows: two samples should be put into the same cluster if and only if they w...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Communications on Pure and Applied Mathematics
سال: 2010
ISSN: 0010-3640,1097-0312
DOI: 10.1002/cpa.20321