TY - CONF
TI - Detecting hyperplane clusters with adaptive possibilistic clustering
AU - Koutroumbas, K. D.
AU - Xenaki, S. D.
AU - Rontogiannis, A. A.
PY - 2016
SP - null
PB - ASSOCIATION FOR COMPUTING MACHINERY
T2 - 9TH HELLENIC CONFERENCE ON ARTIFICIAL INTELLIGENCE (SETN 2016)
TODO - 10.1145/2903220.2903236
TODO - possibilistic clustering; adaptivity; hyperplane clusters
TODO - In this paper the problem of detecting clusters whose points are spread
along an (1 1)-dimensional hyperplane in an 1-dimensional space is
considered. More specifically, the recently proposed adaptive
possibilistic c-means algorithm is modified in order to cope with this
type of clusters. The main advantage of the proposed method is that it
does not require a priori knowledge of the exact number of clusters.
Instead, it begins with an overestimated number of them and
(potentially) ends up with the true number of them. Preliminary results
of the proposed algorithm on both synthetic and real data verify its
validity.
ER -