A stochastic algorithm finding generalized means on compact manifolds
نویسندگان
چکیده
منابع مشابه
A stochastic algorithm finding generalized means on compact manifolds
A stochastic algorithm is proposed, finding the set of generalized means associated to a probability measure ν on a compact Riemannian manifold and a continuous cost function κ on M ˆM . Generalized means include p-means for p P p0,8q, computed with any continuous distance function, not necessarily the Riemannian distance. They also include means for lengths computed from Finsler metrics, or fo...
متن کاملA stochastic algorithm finding p-means on the circle
A stochastic algorithm is proposed, finding the set of intrinsic p-mean(s) associated to a probability measure ν on a compact Riemannian manifold and to p P r1,8q. It is fed sequentially with independent random variables pYnqnPN distributed according to ν and this is the only knowledge of ν required. Furthermore the algorithm is easy to implement, because it evolves like a Brownian motion betwe...
متن کاملOn some generalized recurrent manifolds
The object of the present paper is to introduce and study a type of non-flat semi-Riemannian manifolds, called, super generalized recurrent manifolds which generalizes both the notion of hyper generalized recurrent manifolds [A.A. Shaikh and A. Patra, On a generalized class of recurrent manifolds, Arch. Math. (Brno) 46 (2010) 71--78.] and weakly generalized recurrent manifolds ...
متن کامل3 A Generalized Period Finding Algorithm
In which we present a polynomial time quantum algorithm for the discrete logarithm problem. 1 The Discrete Log Problem If p is a prime and g is a generator of the multiplicative group Z * p , then the modular exponentiation function x → g x mod p is a bijection of Z * p to Z * p. The discrete log problem is the problem of inverting this mapping, that is, given a prime p, a generator g of Z * p ...
متن کاملk*-Means: A new generalized k-means clustering algorithm
This paper presents a generalized version of the conventional k-means clustering algorithm [Proceedings of 5th Berkeley Symposium on Mathematical Statistics and Probability, 1, University of California Press, Berkeley, 1967, p. 281]. Not only is this new one applicable to ellipse-shaped data clusters without dead-unit problem, but also performs correct clustering without pre-assigning the exact...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Stochastic Processes and their Applications
سال: 2014
ISSN: 0304-4149
DOI: 10.1016/j.spa.2014.05.011