Sciweavers

1013 search results - page 13 / 203
» Comparisons Between Data Clustering Algorithms
Sort
View
NN
2002
Springer
226views Neural Networks» more  NN 2002»
13 years 7 months ago
Data visualisation and manifold mapping using the ViSOM
The self-organising map (SOM) has been successfully employed as a nonparametric method for dimensionality reduction and data visualisation. However, for visualisation the SOM requ...
Hujun Yin
ICC
2011
IEEE
257views Communications» more  ICC 2011»
12 years 7 months ago
Increasing the Lifetime of Roadside Sensor Networks Using Edge-Betweenness Clustering
Abstract—Wireless Sensor Networks are proven highly successful in many areas, including military and security monitoring. In this paper, we propose a method to use the edge–bet...
Joakim Flathagen, Ovidiu Valentin Drugan, Paal E. ...
WIRN
2005
Springer
14 years 1 months ago
Ensembles Based on Random Projections to Improve the Accuracy of Clustering Algorithms
We present an algorithmic scheme for unsupervised cluster ensembles, based on randomized projections between metric spaces, by which a substantial dimensionality reduction is obtai...
Alberto Bertoni, Giorgio Valentini
SIGIR
2008
ACM
13 years 7 months ago
Pagerank based clustering of hypertext document collections
Clustering hypertext document collection is an important task in Information Retrieval. Most clustering methods are based on document content and do not take into account the hype...
Konstantin Avrachenkov, Vladimir Dobrynin, Danil N...
AI
2005
Springer
14 years 1 months ago
A Comparative Study of Two Density-Based Spatial Clustering Algorithms for Very Large Datasets
Spatial clustering is an active research area in spatial data mining with various methods reported. In this paper, we compare two density-based methods, DBSCAN and DBRS. First, we ...
Xin Wang, Howard J. Hamilton