Abstract
In recent years, there are many studies to classify data automatically.
There are many methods to realize data classification, and there are two types: supervised clutering and unsupervised clustering. Each method has both advantage and disadvantage.Thus, semi-supervised clustering has payed much attention these days, aim to cluster many data and get any result as one's like. One of an important method is pairwised constraints, using must-link and cannot-link. In this paper, we will propose a new method of pairwised constraints using penalty vectors. We will show some examples of the new method and demonstrate our new algorithm.
