Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

8

IDEAL
2004
Springer

favoriteEmaildiscussreport

116views Intelligent Agents» more IDEAL 2004»

DESCRY: A Density Based Clustering Algorithm for Very Large Data Sets

13 years 10 months ago

DESCRY: A Density Based Clustering Algorithm for Very Large Data Sets

Download dns2.icar.cnr.it

Fabrizio Angiulli, Clara Pizzuti, Massimo Ruffolo

Real-time Traffic

IDEAL 2004 |

claim paper

Related Content

» A Fast Clustering Algorithm to Cluster Very Large Categorical Data Sets in Data Mining

» A Comparative Study of Two DensityBased Spatial Clustering Algorithms for Very Large Datas...

» A Genetic Algorithm for Clustering on Very Large Data Sets

» OCluster Scalable Clustering of Large High Dimensional Data Sets

» Efficiently clustering transactional data with weighted coverage density

» Finding Clusters of Different Sizes Shapes and Densities in Noisy High Dimensional Data

» Accelerated EMbased clustering of large data sets

» WaveCluster A MultiResolution Clustering Approach for Very Large Spatial Databases

» DensityBased Clustering for Similarity Search in a P2P Network

Post Info
More Details (n/a)

Added	02 Jul 2010
Updated	02 Jul 2010
Type	Conference
Year	2004
Where	IDEAL
Authors	Fabrizio Angiulli, Clara Pizzuti, Massimo Ruffolo

Comments (0)