SlideServe
Télécharger Obtenir Pro
Menu
Accueil Pro
Préférences
ApparenceLight Aide et commentaires
© SlideServe · v2026

Unsupervised Evolutionary Clustering Algorithm for Mixed Type Data

hamish-walls avatar
hamish-walls
18 diapositives · 349 Views · Nov 06, 2014

This paper presents a novel unsupervised clustering algorithm called Evolutionary K-Prototype (EKP), designed to improve the K-Prototype (KP) algorithm for mixed-type data. The EKP approach addresses limitations in initialization sensitivity and local optimum convergence faced by KP by integrating evolutionary strategies. The methodology involves initial setup, crossover, mutation, and a comprehensive search process. Experiments demonstrate that EKP markedly enhances clustering outcomes compared to traditional KP, offering significant potential for mixed data applications. Future studies will explore automatic weight adjustment in EKP.

#unsupervised evolutionary clustering algorithm for mixed type data #unsupervised evolutionary clustering algorithm for mixed type data ppt #powerpoint #presentation
Unsupervised Evolutionary Clustering Algorithm for Mixed Type Data - slide 1
01 / 18Unsupervised Evolutionary Clustering Algorithm for Mixed Type Data
1 / 17

Télécharger la présentation

Unsupervised Evolutionary Clustering Algorithm for Mixed Type Data
Une image / un lien ci-dessous est fourni (tel quel) pour télécharger la présentation

Politique de téléchargement : le contenu du site vous est fourni TEL QUEL pour votre information et votre usage personnel ; il ne peut être vendu, concédé sous licence ni partagé sur d’autres sites sans l’accord de son auteur.Le contenu vous est fourni TEL QUEL, pour votre information et votre usage personnel uniquement. Téléchargez la présentation en cliquant sur ce lien. Lors du téléchargement, si vous ne parvenez pas à télécharger une présentation, l’éditeur a peut-être supprimé le fichier de son serveur.Pendant le téléchargement, si vous ne parvenez pas à obtenir une présentation, le fichier a peut-être été supprimé par l’éditeur.

F I N

Plus de contenu associé

Transcription de la présentation

  1. Unsupervised Evolutionary Clustering Algorithm for Mixed Type Data ZhiZheng, Maoguo Gong , Jingjing Ma , Licheng Jiao , Qiaodi Wu 2010,CEC Presented by Chien-Hao Kung 2011/12/1

  2. Outlines • Motivation • Objectives • Methodology • Experiments • Conclusions • Comments

  3. Motivation • As a partitional clustering algorithm, K-prototype (KP) algorithm is a well-known one for mixed type data. • However, it is sensitive to initialization and converges to local optimum easily.

  4. Objectives In this study, KP is applied as a local search strategy, and runs under the Global searching to help KP overcome its flaws.

  5. Methodology • K-prototype Algorithm • Step1.Initializing. • Step2.For each data item, calculating the distances. • Step3.Retest every data item. • Step4.Repeat Step3. until no item changes its cluster.

  6. Methodology • Evolutionary k-prototype(EKP) • Step1 Initialization. • Step2 Crossover. • Step3 Mutation. • Step4 KP Search. • Step5 Evaluation and Selection. • Step6 Termination Test.

  7. Methodology • Initialization • There are 8 parameters have to be set before evolution. • Cluster number • r is a weight in EKP which balance the influence on clustering • Population size • Proportion of initial individuals that generated by choosing items randomly in dataset (IP) • Crossover probability • Mutation probability • in simulated binary crossover(SBX) • n in polynomial mutation

  8. Methodology • Initialization • Two kinds of random initialization schemes • The first is randomly choosing K data item as the prototypes of clusters • The second is randomly generating K prototypes • Ex: • [2.23,5.63],[6.56,5.13], and {1,2,3,4,5,6},{2,4} • =>{3.21,6.23,2,4}

  9. Methodology • Crossover. • Numerical type --Simulated binary crossover(SBX) • Categorical type – Single point crossover

  10. Methodology Mutation

  11. Methodology • KP Search • Evaluation and Selection • Termination Test

  12. Experiments Parameter setting

  13. Experiments

  14. Experiments

  15. Experiments • Dataset

  16. Experiments

  17. Conclusions • This paper propose a novel unsupervised clustering algorithm for mixed type data named evolutionary k-prototype(EKP) . • The experiment result show that the evolutionary framework improves the original algorithms markedly. • EKP which can adjust this weight automatically needs to be studied.

  18. Comments • Drawback • This method use the parameter too much. Application • Clustering