Possibilistic clustering in feature space

Maurizio Filippone*, Francesco Masulli, Stefano Rovetta

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

2 Scopus citations

Abstract

In this paper we propose the Possibilistic C-Means in Feature Space and the One-Cluster Possibilistic C-Means in Feature Space algorithms which are kernel methods for clustering in feature space based on the possibilistic approach to clustering. The proposed algorithms retain the properties of the possibilistic clustering, working as density estimators in feature space and showing high robustness to outliers, and in addition are able to model densities in the data space in a non-parametric way. One-Cluster Possibilistic C-Means in Feature Space can be seen also as a generalization of One-Class SVM.

Original languageEnglish (US)
Title of host publicationApplications of Fuzzy Sets Theory - 7th International Workshop on Fuzzy Logic and Applications, WILF 2007, Proceedings
PublisherSpringer Verlag
Pages219-226
Number of pages8
ISBN (Print)9783540733997
DOIs
StatePublished - 2007
Event7th International Workshop on Fuzzy Logic and Applications, WILF 2007 - Camogli, Italy
Duration: Jul 7 2007Jul 10 2007

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4578 LNAI
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference7th International Workshop on Fuzzy Logic and Applications, WILF 2007
Country/TerritoryItaly
CityCamogli
Period07/7/0707/10/07

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science

Fingerprint

Dive into the research topics of 'Possibilistic clustering in feature space'. Together they form a unique fingerprint.

Cite this