Details

Autor(en) / Beteiligte

• Chuan Tan, Swee
• Ming Ting, Kai
• Wei Teng, Shyh

Titel

A general stochastic clustering method for automatic cluster discovery

Ist Teil von

• Pattern recognition, 2011-10, Vol.44 (10), p.2786-2799

Ort / Verlag

Kidlington: Elsevier Ltd

Erscheinungsjahr

2011

Quelle

Alma/SFX Local Collection

Beschreibungen/Notizen

• Finding clusters in data is a challenging problem. Given a dataset, we usually do not know the number of natural clusters hidden in the dataset. The problem is exacerbated when there is little or no additional information except the data itself. This paper proposes a general stochastic clustering method that is a simplification of nature-inspired ant-based clustering approach. It begins with a basic solution and then performs stochastic search to incrementally improve the solution until the underlying clusters emerge, resulting in automatic cluster discovery in datasets. This method differs from several recent methods in that it does not require users to input the number of clusters and it makes no explicit assumption about the underlying distribution of a dataset. Our experimental results show that the proposed method performs better than several existing methods in terms of clustering accuracy and efficiency in majority of the datasets used in this study. Our theoretical analysis shows that the proposed method has linear time and space complexities, and our empirical study shows that it can accurately and efficiently discover clusters in large datasets in which many existing methods fail to run. ► Our method simplifies and improves existing bio-inspired data clustering approach. ► It is a stochastic method that finds clusters automatically. ► The method outperforms competing methods in terms of speed and accuracy. ► Analysis shows that the proposed method has linear time and space complexities. ► The method also works with large data in which many existing methods fail to run.