Implementation of IncrementalDBSCAN clustering.
Project description
IncrementalDBSCAN
incdbscan
is an implementation of IncrementalDBSCAN, the incremental version of the DBSCAN clustering algorithm.
IncrementalDBSCAN lets the user update the clustering by inserting or deleting data points. The algorithm yields the same result as DBSCAN but without reapplying DBSCAN to the modified data set.
Thus, IncrementalDBSCAN is ideal to use when the size of the data set to cluster is so large that applying DBSCAN to the whole data set would be costly but for the purpose of the application it is enough to update an already existing clustering by inserting or deleting some data points.
The implementation is based on the following paper. To see what's new compared to the paper, jump to Notes on the IncrementalDBSCAN paper.
Ester, Martin; Kriegel, HansPeter; Sander, Jörg; Wimmer, Michael; Xu, Xiaowei (1998). Incremental Clustering for Mining in a Data Warehousing Environment. In: Proceedings of the 24rd International Conference on Very Large Data Bases (VLDB 1998).
Table of Contents
Highlights
The incdbscan
package is an implementation of the IncrementalDBSCAN algorithm by Ester et al., with about 40 unit tests covering diverse cases, and with additional corrections to the original paper.
Installation
incdbscan
is on PyPI, and can be installed with pip
:
pip install incdbscan
The package requires at least Python 3.7.1.
Usage
The algorithm is implemented in the IncrementalDBSCAN
class.
There are 3 methods to use:
insert
for inserting data points into the clusteringdelete
for deleting data points from the clusteringget_cluster_labels
for obtaining cluster labels
All methods take a batch of data points in the form of an array of shape (n_samples, n_features)
(similar to the scikitlearn
API).
from sklearn.datasets import load_iris
X = load_iris()['data']
X_1, X_2 = X[:100], X[100:]
from incdbscan import IncrementalDBSCAN
clusterer = IncrementalDBSCAN(eps=0.5, min_pts=5)
# Insert 1st batch of data points and get their labels
clusterer.insert(X_1)
labels_part1 = clusterer.get_cluster_labels(X_1)
# Insert 2nd batch and get labels of all points in a oneliner
labels_all = clusterer.insert(X_2).get_cluster_labels(X)
# Delete 1st batch and get labels for 2nd batch
clusterer.delete(X_1)
labels_part2 = clusterer.get_cluster_labels(X_2)
For a longer description of usage check out the notebook developed just for that!
Performance
Performance has two components: insertion and deletion cost.
The cost of inserting a new data point into IncrementalDBSCAN is quite small and grows slower than the cost of applying (scikitlearns
's) DBSCAN to a whole data set. In other words, given that we have a data set D clustered with IncrementalDBSCAN, and we want to see which cluster would a new object P belong to, it is faster to insert P into the current IncrementalDBSCAN clustering than to apply DBSCAN to the union of D and P.
The cost of deleting a data point from IncrementalDBSCAN grows faster than the cost of applying (scikitlearns
's) DBSCAN to the data set minus that data point. Thus, the cost of deletion in IncrementalDBSCAN is quite small below a certain data set size, but becomes larger as data set size grows.
These results do not imply that it is very efficient to cluster a whole data set with a series of IncrementalDBSCAN insertions. If we measure the time to cluster a data set with DBSCAN versus to cluster the data by adding the data points one by one to IncrementalDBSCAN, IncrementalDBSCAN will be slower compared to DBSCAN. A typical performance number is that clustering 8,000 data points takes about 1020 seconds with this implementation.
See this notebook about performance for more details.
Known shortcomings
 Batch insertion: In the current implementation batch insertion of data points is not efficient, since pairwise distances between new points and existing points are not calculated with matrix multiplication.
 Deletion: Data point deletion can take long in big data sets (big clusters), because there is a graph traversal step that can take long. Whether this can be sped up is not clear.
Project details
Release history Release notifications  RSS feed
Download files
Download the file for your platform. If you're not sure which to choose, learn more about installing packages.
Source Distribution
Built Distribution
Hashes for incdbscan0.1.0py3noneany.whl
Algorithm  Hash digest  

SHA256  b8e9fff2f6c22f11c66e75731023b95b3150c9425ce43b821da5d70731e46168 

MD5  c14614260ab4bfb819b87b14ce42ce3b 

BLAKE2b256  4976a585066591c05b735064588268bbba4a65963d267e5a692f0fe65b94fedd 