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

Context-Aware Clustering for High-Level Pattern Discovery

barrerap avatar
barrerap
17 diapositives · 250 Views · Jan 02, 2020

This study introduces a context-aware clustering method for discovering higher-level compositional patterns through co-occurrences. The proposed approach efficiently incorporates spatial contexts to enhance primitive feature clustering. By utilizing a nested-EM solution, the algorithm ensures convergence in finite steps, with applications in image pattern discovery and multiple-feature clustering. It can be adapted to various clustering challenges.

Context-Aware Clustering for High-Level Pattern Discovery - slide 1
01 / 17Context-Aware Clustering for High-Level Pattern Discovery
1 / 17

Télécharger la présentation

Context-Aware Clustering for High-Level Pattern Discovery
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. Context-Aware Clustering Junsong Yuan and Ying Wu EECS Dept., Northwestern University

  2. Contextual pattern and co-occurrences ? Spatial contexts provide useful cues for clustering

  3. K-means revisit EM Update Binary label indicator Assumption: data samples are independent Limitation: contextual information of spatial dependency is not considered in clustering data samples

  4. Clustering higher-level patterns • Regularized k-means Not a smooth term! Distortion in hamming space charactering contextual patterns Distortion in original feature space Same as traditional K-means clustering Regularization term due to contextual patterns

  5. Chicken and Egg Problem • Hamming distance in clustering contextual patterns • Matrix form J1 is coupled with J2 • Cannot minimize J1 and J2 separately !

  6. Decoupling Fix Update Fix Update

  7. Nested-EM solution Nested E-step M-step Update and separately Theorem of convergence the nested-EM algorithm can converge in finite steps.

  8. Simulation results (feature space)

  9. Simulation results (spatial space)

  10. K-means Initialization

  11. 1st round Final Phrases

  12. Multiple-feature clustering • Dataset: handwritten numerical (‘0’-‘9’) from UCI data set • Each digit has three different types of features • Contextual pattern corresponds to compositional feature • Different types of features serve as contexts of each other • Clustering each type of features into 10 “words” • Clustering 10 “phrases” based on a word-lexicon of size 3x10

  13. Conclusion • A context-aware clustering formulation proposed • Targets on higher-level compositional patterns in terms of co-occurrences • Discovered contextual patterns can feed back to improve the primitive feature clustering • An efficient nested-EM solution which is guaranteed to converge in finite steps • Successful applications in image pattern discovery and multiple-feature clustering • Can be applied to other general clustering problems