Skip to Main content Skip to Navigation
Conference papers

Data ranking and clustering via normalized graph cut based on asymmetric affinity

O. Kyrgyzov 1 I. Bloch 1 Y. Yang 1 J. Wiart 2 A. Souloumiac 3
1 WHIST Lab, Institut Mines Telecom, 46 rue Barrault 75634 Paris Cedex 13, France
2 Orange Labs R&D [Rennes]
3 LADIS - Laboratoire d'analyse des données et d'intelligence des systèmes
DM2I - Département Métrologie Instrumentation & Information : DRT/LIST/DM2I
Abstract : In this paper, we present an extension of the state-of-the-art normalized graph cut method based on asymmetry of the affinity matrix. We provide algorithms for classification and clustering problems and show how our method can improve solutions for unequal and overlapped data distributions. The proposed approaches are based on the theoretical relation between classification accuracy, mutual information and normalized graph cut. The first method requires a priori known class labeled data that can be utilized, e.g., for a calibration phase of a brain-computer interface (BCI). The second one is a hierarchical clustering method that does not involve any prior information on the dataset.
Keywords : Classification and clustering Data distribution Graph cut Hierarchical clustering methods Mutual informations Brain computer interface Cluster analysis Image analysis Graphic methods Classification accuracy BCI asymmetric affinity
Document type :
Conference papers
Complete list of metadatas
https://hal-cea.archives-ouvertes.fr/cea-01831051
Contributor : Léna Le Roy <>
Submitted on : Thursday, July 5, 2018 - 3:24:56 PM
Last modification on : Monday, August 17, 2020 - 2:22:02 PM

Links full text

openaccess

Identifiers

Collections

CEA | INSTITUT-TELECOM | DRT | LIST | INSMI | TDS-MACS | DM2I

Citation

O. Kyrgyzov, I. Bloch, Y. Yang, J. Wiart, A. Souloumiac. Data ranking and clustering via normalized graph cut based on asymmetric affinity. 17th International Conference on Image Analysis and Processing – ICIAP 2013, Sep 2013, Naples, Italy. pp.562-571, ⟨10.1007/978-3-642-41184-7_57⟩. ⟨cea-01831051⟩

Export

BibTeX TEI DC DCterms EndNote

Share

Metrics

Record views

143