Under construction… Categories and Subject Descriptors H.3.3 [Information Storage and Retrieval]: Information Search and Retrieval – clustering. General Terms Algorithms, Expe...
The cluster connecting problem inside a simple polygon is introduced in this paper. The problem is shown to be NP-complete. A log n-factor approximation algorithm is proposed.
Sanjib Sadhu, Arijit Bishnu, Subhas C. Nandy, Part...
In this paper we present an improved version of the Probabilistic Ant based Clustering Algorithm for Distributed Databases (PACE). The most important feature of this algorithm is ...
We propose a simple and efficient modification of the popular DBSCAN clustering algorithm. This modification is able to detect the most interesting vertical threshold level in a...
Subspace clustering has attracted great attention due to its capability of finding salient patterns in high dimensional data. Order preserving subspace clusters have been proven to...