Abstract
In this paper, we propose a new clustering algorithm
based on probabilistic similarity. The probabilistic similarity is formed by introducing the concept of probability into conventional similarity. First, we define the probabilistic similarity.
Next, we show some probabilistic similarity functions which
satisfy the definition of the probabilistic similarity. Third, we consider a objective function with the probabilistic similarity.
Furthermore, we construct a new clustering algorithm based on the probabilistic similarity by using the optimal solutions which minimize the objective function. Last, we show some numerical examples to verify the effectiveness of the proposed algorithm.
