- 9
- 3
- 1
- 1
Nejat ARINIK
14
Documents
Présentation
Short biography
===============
Nejat Arınık is currently a postdoctoral researcher at TETIS since september 2021. He obtained his PhD in 2021, under the direction of Rosa Figueiredo, Vincent Labatut and Rachid Elazouzi, at the Computer Science Labs (LIA) of the University of Avignon (Avignon, France). His PhD was about partitioning methods related to Structural Balance theory, in which two different disciplines are brought together: Data Mining and Operations Research. Before his PhD studies, he received his Computer Engineering (Bachelor degree) at Galatasaray University (Turkey) in 2015 and received his engineer’s degree (equivalent to Master of Science) in computer science from INSA of Lyon (France) in 2016.
**Contact:**
- Address: TETIS, 500 Rue Jean François Breton, 34000 Montpellier
- Email: nejat.arinik@inrae.fr
Publications
- 7
- 6
- 6
- 6
- 5
- 4
- 3
- 3
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 14
- 13
|
|
Efficient Enumeration of the Optimal Solutions to the Correlation Clustering problemJournal of Global Optimization, 2023, 86, pp.355-391. ⟨10.1007/s10898-023-01270-3⟩
Article dans une revue
hal-03935831v1
|
|
|
Characterizing and comparing external measures for the assessment of cluster analysis and community detectionIEEE Access, 2021, 9, pp.20255-20276. ⟨10.1109/ACCESS.2021.3054621⟩
Article dans une revue
hal-03124118v1
|
|
|
Multiple partitioning of multiplex signed networks: Application to European parliament votesSocial Networks, 2020, 60, pp.83-102. ⟨10.1016/j.socnet.2019.02.001⟩
Article dans une revue
hal-02082574v3
|
|
|
Multiplicity and Diversity: Analyzing the Optimal Solution Space of the Correlation Clustering Problem on Complete Signed GraphsJournal of Complex Networks, 2020, 8 (6), pp.cnaa025. ⟨10.1093/comnet/cnaa025⟩
Article dans une revue
hal-02994011v1
|
|
|
Multiplicity in Signed Graph Partitioning32th European Conference On Operational Research (EURO), Jul 2022, Helsinki, France
Communication dans un congrès
hal-03938976v1
|
|
|
Multiple Partitioning of Multiplex Signed Networks21ème Congrès Annuel de la Société Française de Recherche Opérationnelle et d’Aide à la Décision (ROADEF), Société Française de Recherche Opérationnelle et d’Aide à la Décision, Feb 2020, Montpellier, France
Communication dans un congrès
hal-02428300v1
|
|
|
Characterizing measures for the assessment of cluster analysis and community detection11ème Conférence Modèles & Analyse de Réseaux : approches mathématiques et informatiques (MARAMI), Oct 2020, Montpellier (en ligne), France. pp.4
Communication dans un congrès
hal-02993542v1
|
|
|
Multiple Optimal Solutions but Single Search: A Study of the Correlation Clustering Problem20ème congrès annuel de la société Française de Recherche Opérationnelle et d’Aide à la Décision (ROADEF), Société Française de Recherche Opérationnelle et d'Aide à la Décision, Feb 2019, Le Havre, France
Communication dans un congrès
hal-02051683v1
|
Exploiting Antagonistic Relations in Signed Graphs under the Structural Balance HypothesisPGMO Days, Dec 2018, Paris, France
Communication dans un congrès
hal-01939893v1
|
|
Study of the European Parliament votes through the multiple partitioning of signed multiplex networks29th European Conference On Operational Research (EURO), Jul 2018, Valencia, Spain
Communication dans un congrès
hal-01939888v1
|
|
|
|
Analysis of Roll-Calls in the European Parliament by Multiple Partitioning of Multiplex Signed Networks9ème Conférence Modèles & Analyse des Réseaux : Approches Mathématiques & Informatiques (MARAMI), Oct 2018, Avignon, France
Communication dans un congrès
hal-01933679v1
|
|
|
Signed Graph Analysis for the Interpretation of Voting BehaviorInternational Conference on Knowledge Technologies and Data-driven Business (i-KNOW), Oct 2017, Graz, Austria
Communication dans un congrès
hal-01583133v3
|
|
|
2-Edge Connected Balanced Subgraphs for Correlation Clustering Problem[Research Report] Avignon Université. 2020
Rapport
hal-02428305v1
|