As a guest user you are not logged in or recognized by your IP address. You have
access to the Front Matter, Abstracts, Author Index, Subject Index and the full
text of Open Access publications.
Traditional clustering methods cluster data with pairwise graph and usually result in information loss. In this paper, we propose a novel spectral clustering method by combing hypergraph and sample self-representation together. Specially, the proposed algorithm employs sample self-representation based loss function ℓ2,1-norm which is row sparse to weaken the effects of the noises. And then, a hypergraph regular term is imposed to construct the hypergraph Laplacian which fully consider the complex similarity relationships of the data. The experimental results on benchmark data-sets indicated that the proposed algorithm prominently outperforms the compared state-of-the-art algorithms in terms of CE, such as SRC, LSR and et al.
This website uses cookies
We use cookies to provide you with the best possible experience. They also allow us to analyze user behavior in order to constantly improve the website for you. Info about the privacy policy of IOS Press.
This website uses cookies
We use cookies to provide you with the best possible experience. They also allow us to analyze user behavior in order to constantly improve the website for you. Info about the privacy policy of IOS Press.