In this paper, two new clustering algorithms are proposed for the data with some errors. In any of these algorithms, the error is interpreted as one of decision variables - called "tolerance" - of a certain optimization problem like the previously proposed algorithm, but the tolerance is determined based on the opposite criterion to its corresponding previously proposed one. Applying our each algorithm together with its corresponding previously proposed one, a reliability of the clustering result is discussed. Through some numerical experiments, the validity of this paper is discussed.
|ジャーナル||IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences|
|出版ステータス||Published - 2007 10月|
ASJC Scopus subject areas
- コンピュータ グラフィックスおよびコンピュータ支援設計