Nejat Arinik

Orcid: 0000-0001-5080-4320

According to our database1, Nejat Arinik authored at least 11 papers between 2017 and 2024.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Whole-Graph Representation Learning for the Classification of Signed Networks.
IEEE Access, 2024

2023
Efficient enumeration of the optimal solutions to the correlation clustering problem.
J. Glob. Optim., June, 2023

An Evaluation Framework for Comparing Epidemic Intelligence Systems.
IEEE Access, 2023

2021
Multiplicity in the Partitioning of Signed Graphs. (Multiplicité dans la partitionnement de graphes signés).
PhD thesis, 2021

Multiplicity and diversity: analysing the optimal solution space of the correlation clustering problem on complete signed graphs.
J. Complex Networks, 2021

Characterizing and Comparing External Measures for the Assessment of Cluster Analysis and Community Detection.
IEEE Access, 2021

2020
Multiple partitioning of multiplex signed networks: Application to European parliament votes.
Soc. Networks, 2020

Multiplicity and Diversity: Analyzing the Optimal Solution Space of the Correlation Clustering Problem on Complete Signed Graphs.
CoRR, 2020

Characterizing measures for the assessment of cluster analysis and community detection (extended abstract).
Proceedings of MARAMI 2020 - Modèles & Analyse des Réseaux : Approches Mathématiques & Informatiques, 2020

2018
Analysis of Roll-Calls in the European Parliament by Multiple Partitioning of Multiplex Signed Networks.
CoRR, 2018

2017
Signed Graph Analysis for the Interpretation of Voting Behavior.
CoRR, 2017


  Loading...