The FastDP software implements the following fast variant of Density Peaks clustering algorithm:
Sieranoja, Sami, and Pasi Fränti. "Fast and General Density Peaks Clustering." Pattern Recognition Letters (2019). https://www.sciencedirect.com/science/article/pii/S0167865519303009
Datasets used in the article:
http://cs.uef.fi/sipu/datasets/denpk_random_clusters.7z
http://cs.uef.fi/sipu/datasets/worms.zip
The software is provided with GNU Lesser General Public License, Version 3. https://www.gnu.org/licenses/lgpl.html. All files except those under data and contrib -folders are subject to this license. See LICENSE.txt.
Contact: [email protected]
This should work nicely, but has not been widely tested yet. Let me know how it works for you if you try it out.
Compile:
git clone 'https://github.com/uef-machine-learning/fastdp.git'
cd fastdp
pip install -r requirements.txt
pip install .
python3 python/api_example.py
Usage example (see python/api_example.py):
import numpy as np
from fastdp import fastdp,fastdp_generic
x=np.loadtxt('data/b2.txt')
numclu=100
(labels,peak_ids) = fastdp(x,numclu,distance="l2",num_neighbors=20,window=50,nndes_start=0.2,maxiter=30,endcond=0.001,dtype="vec")
Generic version, giving distance function as parameter:
class DistanceMeasureL2:
def __init__(self,x):
self.tmp = 1
self.x = x
self.size = len(x)
def distance(self,a,b):
dist = np.linalg.norm(self.x[a]-self.x[b])
return dist
dist = DistanceMeasureL2(x)
(labels,peak_ids) = fastdp_generic(dist,numclu,num_neighbors=20,window=50,nndes_start=0.0,maxiter=30,endcond=0.03,dtype="vec")
make clean
make
Cluster vectorial (numerical) S1 dataset to 15 clusters by first constructing kNN graph k=30 neighbors:
./denc --neighbors 30 --clusters 15 --type=vec data/s1.txt --out-pa=data/output_s1.pa
Same as above, but also evaluate clustering based on ground truth (s1-label) by calculating CI and NMI values:
./denc data/s1.txt --neighbors 30 --clusters 15 --type=vec --gt-pa=data/s1-label.pa --out-pa=data/output_s1.pa
For short strings (e.g. words of around 8 characters), edit distance works ok.
Download list of 466551 English words:
wget https://github.com/dwyl/english-words/raw/master/words.txt
Cluster them (command should run in around 30 minutes.):
./denc --neighbors=30 --clusters=500 --type=txt --knng-delta=0.01 --dfunc=lev --out-pa words.pa words.txt
Take 20 samples from each cluster, show as html (requires Ruby 2.0+):
./show_text_clusters.rb words.txt words.pa > words.html
Example clusters in result:
Cluster 24: taurophobia taphephobia Onychophora antlophobia Judaeophobia ischocholia graphophonic Russophilism Turcophilism ...
Cluster 313: incorruptibly incompletable undecomposable comportable unsummonable compellable competible computerizable compossible comportance ...
Cluster 481: roodles robotize whooplike rootless howkit stormlike hoggie Goetae nookiest boomless toodle-oo blowziest hokiest crowdie ...
For a faster, but lower quality version, use dice distance and disable use of NNDES (command should run in around 4 minutes):
./denc --neighbors=30 --clusters=500 --type=txt --knng-delta=0.01 --dfunc=dice --out-pa words_dice.pa --knng-nndes 0.0 words.txt
Dice distance works also for long strings of around 140 characters.
This feature is somewhat experimental and has not been tested thoroughly.
./denc --neighbors=30 --clusters=2000 --type=set --knng-delta=0.05 --dfunc=dice --out-pa=set_data.pa --knng-nndes 0.0 set_data.txt
Input format for set_data.txt. One set per line, members of set separated by spaces:
A B D E H
B D E F
C D E F G
C D G H
...
Line ends with "\n" characters. Files end with "\n"
Output .pa -file contains header information and cluster labels for each input item.
Create a 2D dataset with a maximum of 20 clusters. Save to file 'worms_88.txt'.
gen_2d_worms(88,20);
Create a 64D dataset with a maximum of 20 clusters. Save to file 'worms_1064.txt'.
gen_high_dim_worms(1064,20,64);
In -labels file first column is label of data point, second column: 2=noise, 1=normal.