Sciweavers

1385 search results - page 71 / 277
» Clustering by Random Projections
Sort
View
SGP
2004
15 years 2 months ago
Two Algorithms for Fast Reclustering of Dynamic Meshed Surfaces
Numerous mesh algorithms such as parametrization, radiosity, and collision detection require the decomposition of meshes into a series of clusters. In this paper we present two no...
Nathan A. Carr, John C. Hart
INFFUS
2006
142views more  INFFUS 2006»
14 years 12 months ago
Moderate diversity for better cluster ensembles
Adjusted Rand index is used to measure diversity in cluster ensembles and a diversity measure is subsequently proposed. Although the measure was found to be related to the quality...
Stefan Todorov Hadjitodorov, Ludmila I. Kuncheva, ...
AINA
2008
IEEE
15 years 6 months ago
PRODUCE: A Probability-Driven Unequal Clustering Mechanism for Wireless Sensor Networks
There has been proliferation of research on seeking for distributing the energy consumption among nodes in each cluster and between cluster heads to extend the network lifetime. H...
Jung-Hwan Kim, Sajjad Hussain Chauhdary, WenCheng ...
KDD
2004
ACM
157views Data Mining» more  KDD 2004»
15 years 5 months ago
On detecting space-time clusters
Detection of space-time clusters is an important function in various domains (e.g., epidemiology and public health). The pioneering work on the spatial scan statistic is often use...
Vijay S. Iyengar
ICASSP
2008
IEEE
15 years 6 months ago
Finding needles in noisy haystacks
The theory of compressed sensing shows that samples in the form of random projections are optimal for recovering sparse signals in high-dimensional spaces (i.e., finding needles ...
Rui M. Castro, Jarvis Haupt, Robert Nowak, Gil M. ...