Sciweavers

581 search results - page 9 / 117
» Fast Hierarchical Clustering Based on Compressed Data
Sort
View
JDCTA
2010
152views more  JDCTA 2010»
13 years 3 months ago
Spatial Clustering Algorithm Based on Hierarchical-Partition Tree
In spatial clustering, the scale of spatial data is usually very large. Spatial clustering algorithms need high performance, good scalability, and are able to deal with noise and ...
Zhongzhi Li, Xuegang Wang
VISSYM
2003
13 years 10 months ago
Adaptive Smooth Scattered Data Approximation for Large-scale Terrain Visualization
We present a fast method that adaptively approximates large-scale functional scattered data sets with hierarchical B-splines. The scheme is memory efficient, easy to implement an...
Martin Bertram, Xavier Tricoche, Hans Hagen
SEBD
2003
144views Database» more  SEBD 2003»
13 years 10 months ago
Approximate Query Answering on Sensor Network Data Streams
Abstract. Sensor networks represent a non traditional source of information, as readings generated by sensors flow continuously, leading to an infinite stream of data. Traditiona...
Alfredo Cuzzocrea, Filippo Furfaro, Elio Masciari,...
BMCBI
2004
158views more  BMCBI 2004»
13 years 8 months ago
Incremental genetic K-means algorithm and its application in gene expression data analysis
Background: In recent years, clustering algorithms have been effectively applied in molecular biology for gene expression data analysis. With the help of clustering algorithms suc...
Yi Lu, Shiyong Lu, Farshad Fotouhi, Youping Deng, ...
PRL
2008
135views more  PRL 2008»
13 years 8 months ago
A hierarchical clustering algorithm based on the Hungarian method
We propose a novel hierarchical clustering algorithm for data-sets in which only pairwise distances between the points are provided. The classical Hungarian method is an efficient...
Jacob Goldberger, Tamir Tassa