In incremental approach, the DBSCAN algorithm is applied to a dynamic database where the data may be frequently updated. After insertions or deletions to the dynamic database, the clustering ...

We generate 2,639 test problems, which involve 99 items and are substantially larger than most of the previously used benchmark problems. Because there are no real-life test problems for combinatorial ...