Transcription of A Density-Based Algorithm for Discovering Clusters in ...
{{id}} {{{paragraph}}}
Example: stock market
A Density-Based Algorithm for Discovering Clusters in ...
From: KDD-96 Proceedings. Copyright 1996, AAAI ( ). All rights reserved. A Density-Based Algorithm for Discovering Clusters in Large Spatial Databaseswith Noise Martin Ester, Hans-Peter Kriegel, Jiirg Sander, Xiaowei Xu Institute for ComputerScience, University of Munich Oettingenstr. 67, D-80538 Miinchen, Germany {ester I kriegel I sander I xwxu} Abstract are often not knownin advancewhendealing with large Clusteringalgorithmsare attractive for the task of class iden- databases. tification in spatial , the applicationto (2) Discoveryof Clusters with arbitrary shape, because the large spatial databasesrises the followingrequirements for shapeof Clusters in spatial databases maybe spherical, clustering algorithms: minimalrequirements of domain drawn-out,linear, elongatedetc. knowledgeto determinethe input parameters,discoveryof Clusters witharbitrary shapeandgoodefficiencyonlarge da- (3) Goodefficiency on large databases, on databases of tabases. Thewell-known clustering algorithmsoffer no solu- significantly morethan just a fewthousandobjects.
A Density-Based Algorithm for Discovering Clusters in Large Spatial Databases with Noise Martin Ester, Hans-Peter Kriegel, Jiirg Sander, Xiaowei Xu
Loading..
Tags:
Information
Domain:
Source:
Link to this page:
Please notify us if you found a problem with this document:
Related search queries
BASIC GASKET APPLICATION GUIDE & MATERIAL SELECTION, DETERMINING, Soil Bulk Density as related to Soil Texture, Organic, B1.1 Determination of Wind Loads for, OHIO DEPARTMENT OF TRANSPORTATION, OHIO DEPARTMENT OF TRANSPORTATION SUPPLEMENT 1055, DENSITY, 105 Webster St. Hanover Massachusetts 02339, Durag D-R 290, Recommended Practice and Procedure for, Final ANSWERS TO 10 COMMON QUESTIONS