Example: barber
A Density-Based Algorithm for Discovering Clusters in ...

A Density-Based Algorithm for Discovering Clusters in ...

Back to document page

able for applications such as character recognition with moderate values for n, but it is prohibitive for applications on large databases. Jain (1988) explores a density based approach to identify clusters in k-dimensional point sets. The data set is parti-tioned into a number of nonoverlapping cells and histograms are constructed.

  Based, Cluster, Density, Discovering, Character, Algorithm, Density based algorithm for discovering clusters

Download A Density-Based Algorithm for Discovering Clusters in ...


Information

Domain:

Source:

Link to this page:

Please notify us if you found a problem with this document:

Other abuse

Advertisement

Related search queries