Sciweavers

767 search results - page 32 / 154
» On Clustering Using Random Walks
Sort
View
ICASSP
2011
IEEE
13 years 12 days ago
On the success of network inference using a markov routing model
In this paper we discuss why a simple network topology inference algorithm based on network co-occurrence measurements and a Markov random walk model for routing enables perfect t...
Laura Balzano, Robert Nowak, Matthew Roughan
INCDM
2007
Springer
97views Data Mining» more  INCDM 2007»
14 years 2 months ago
Clustering by Random Projections
Abstract. Clustering algorithms for multidimensional numerical data must overcome special difficulties due to the irregularities of data distribution. We present a clustering algo...
Thierry Urruty, Chabane Djeraba, Dan A. Simovici
SDM
2009
SIAM
157views Data Mining» more  SDM 2009»
14 years 5 months ago
MUSK: Uniform Sampling of k Maximal Patterns.
Recent research in frequent pattern mining (FPM) has shifted from obtaining the complete set of frequent patterns to generating only a representative (summary) subset of frequent ...
Mohammad Al Hasan, Mohammed Javeed Zaki
RSA
2002
99views more  RSA 2002»
13 years 8 months ago
Distributed algorithms with dynamical random transitions
Given any measure-preserving dynamical system (Y, A , , T) and g Lp() , we study convergence of the sequence 1 n n k=1 g TSk , n 1 where Sk is a dynamic Zr -valued random w...
Nadine Guillotin-Plantard, René Schott
NIPS
2001
13 years 10 months ago
An Efficient Clustering Algorithm Using Stochastic Association Model and Its Implementation Using Nanostructures
This paper describes a clustering algorithm for vector quantizers using a "stochastic association model". It offers a new simple and powerful softmax adaptation rule. Th...
Takashi Morie, Tomohiro Matsuura, Makoto Nagata, A...