<p>You could use the DENCLUE algorithm, you don't need the number of clusters apriori and the attractor points could act as representative points for a cluster.</p>

<p>Also, the algorithm handles arbitrarily shaped clusters and is quite robust to noise. </p>

<p>Of course, there are other algorithms that could be used, but I believe DENCLUE is a good choice.</p>

CC BY-SA 3.0
2014-12-18T07:46:27.080Z
2014-12-18T07:46:27.080Z
user3660112
<p>Does anyone know of an algorithm that can perform the following tasks:</p>

<ol>
<li><p>Unsupervised clustering <em>without</em> specifying the number of clusters apriori. For example if all the buildings in wide geographical are plotted as as points on a 2d plane such an algorithm should be able to identify the number of settlements such as cities, towns and villages, regardless of the size of the settlements.</p></li>
<li><p>Thinning the cluster of points to a representative points. In the wide geographical area example this thinning operation would select a number of "representative" dwellings (of minimum size 1, for the smallest settlements) for each settlement.</p></li>
</ol>

CC BY-SA 3.0
2012-11-26T22:47:30.723Z
there are tons of algorithms for unsupervised clustering.  You can find dozens of books with name "clustering".   Your question seem standard, so it is not hard to choose/tailor the algorithms for your purpose.
Yixin Cao
CC BY-SA 3.0
2012-11-27T04:09:11.177Z
In particular, HAC is something you should look into
Suresh Venkat
<clustering>
Clustering without specifying the number of clusters apriori
Olumide
# Clustering without specifying the number of clusters apriori

(Asked by: username_0 on 2012-11-26)

Does anyone know of an algorithm that can perform the following tasks:

1. Unsupervised clustering *without* specifying the number of clusters apriori. For example if all the buildings in wide geographical are plotted as as points on a 2d plane such an algorithm should be able to identify the number of settlements such as cities, towns and villages, regardless of the size of the settlements.
2. Thinning the cluster of points to a representative points. In the wide geographical area example this thinning operation would select a number of "representative" dwellings (of minimum size 1, for the smallest settlements) for each settlement.

**Tags:** clustering

> **Comments:**
> **username_1**: there are tons of algorithms for unsupervised clustering.  You can find dozens of books with name "clustering".   Your question seem standard, so it is not hard to choose/tailor the algorithms for your purpose.  
> **username_2**: In particular, HAC is something you should look into  

---

## 1 answers

### Answer by username_3 on 2014-12-18. Score: 0

You could use the DENCLUE algorithm, you don't need the number of clusters apriori and the attractor points could act as representative points for a cluster.

Also, the algorithm handles arbitrarily shaped clusters and is quite robust to noise.

Of course, there are other algorithms that could be used, but I believe DENCLUE is a good choice.


---

