Abstract
Possibilistic clustering is well-known as one of the useful techniques because it is robust against noise in data. We propose entropy based possibilistic clustering with L1-regularization and show its classification function. We, moreover, show the result of sequential extraction by proposed method.