Sciweavers

1385 search results - page 27 / 277
» Clustering by Random Projections
Sort
View
COLING
2008
15 years 1 months ago
Using Hidden Markov Random Fields to Combine Distributional and Pattern-Based Word Clustering
Word clustering is a conventional and important NLP task, and the literature has suggested two kinds of approaches to this problem. One is based on the distributional similarity a...
Nobuhiro Kaji, Masaru Kitsuregawa
AAAI
2008
15 years 2 months ago
Clustering via Random Walk Hitting Time on Directed Graphs
In this paper, we present a general data clustering algorithm which is based on the asymmetric pairwise measure of Markov random walk hitting time on directed graphs. Unlike tradi...
Mo Chen, Jianzhuang Liu, Xiaoou Tang
RSA
2011
124views more  RSA 2011»
14 years 6 months ago
Sparse random graphs with clustering
In 2007 we introduced a general model of sparse random graphs with independence between the edges. The aim of this paper is to present an extension of this model in which the edge...
Béla Bollobás, Svante Janson, Oliver...
PAMI
2008
270views more  PAMI 2008»
14 years 11 months ago
Randomized Clustering Forests for Image Classification
This paper introduces three new contributions to the problems of image classification and image search. First, we propose a new image patch quantization algorithm. Other competitiv...
Frank Moosmann, Eric Nowak, Frédéric...
ICC
2007
IEEE
121views Communications» more  ICC 2007»
15 years 6 months ago
BER Analysis in A Generalized UWB Frequency Selective Fading Channel With Randomly Arriving Clusters and Rays
— In this paper, we present an analytical method to evaluate the bit error rate (BER) of the ultra-wideband (UWB) system in the IEEE 802.15.4a standardized channel model. The IEE...
Wei-Cheng Liu, Li-Chun Wang