Classification Recouvrante Basée sur les Méthodes à Noyau

11/29/2012
by   Chiheb-Eddine Ben N'Cir, et al.
0

Overlapping clustering problem is an important learning issue in which clusters are not mutually exclusive and each object may belongs simultaneously to several clusters. This paper presents a kernel based method that produces overlapping clusters on a high feature space using mercer kernel techniques to improve separability of input patterns. The proposed method, called OKM-K(Overlapping k-means based kernel method), extends OKM (Overlapping k-means) method to produce overlapping schemes. Experiments are performed on overlapping dataset and empirical results obtained with OKM-K outperform results obtained with OKM.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/29/2012

Overlapping clustering based on kernel similarity metric

Producing overlapping schemes is a major issue in clustering. Recent pro...
research
05/18/2017

Discovering the Graph Structure in the Clustering Results

In a standard cluster analysis, such as k-means, in addition to clusters...
research
12/18/2011

A Geometric Approach For Fully Automatic Chromosome Segmentation

A fundamental task in human chromosome analysis is chromosome segmentati...
research
03/11/2023

Distributed Solution of the Inverse Rig Problem in Blendshape Facial Animation

The problem of rig inversion is central in facial animation as it allows...
research
10/11/2020

GuCNet: A Guided Clustering-based Network for Improved Classification

We deal with the problem of semantic classification of challenging and h...
research
08/15/2016

Consistency constraints for overlapping data clustering

We examine overlapping clustering schemes with functorial constraints, i...
research
12/04/2020

Adaptive Explicit Kernel Minkowski Weighted K-means

The K-means algorithm is among the most commonly used data clustering me...

Please sign up or login with your details

Forgot password? Click here to reset