In this paper, a clustering algorithm for relational data based on q-divergence between memberships and variables that control cluster sizes is proposed. A conventional method for vectorial data is first presented for interpretation as the regularization of another conventional method with q-divergence. With this interpretation, a clustering algorithm for relational data, based on q-divergence, is then derived from an optimization problem built by regularizing the conventional method with q-divergence. A theoretical discussion reveals the property of the proposed method. Numerical results are presented that substantiate this property and show that the proposed method outperforms two conventional methods in terms of accuracy.
|ジャーナル||Journal of Advanced Computational Intelligence and Intelligent Informatics|
|出版ステータス||Published - 2018 1月|
ASJC Scopus subject areas
- コンピュータ ビジョンおよびパターン認識