A (Dis)similarity Index for Comparing Two Character Networks Based on the Same Story
Détails
Télécharger: Bavaud_Metrailler_2022_A (Dis)similarity Index for Comparing Two Character Networks.pdf (3026.88 [Ko])
Etat: Public
Version: Final published version
Licence: CC BY 4.0
Etat: Public
Version: Final published version
Licence: CC BY 4.0
ID Serval
serval:BIB_D8FA307C0142
Type
Actes de conférence (partie): contribution originale à la littérature scientifique, publiée à l'occasion de conférences scientifiques, dans un ouvrage de compte-rendu (proceedings), ou dans l'édition spéciale d'un journal reconnu (conference proceedings).
Collection
Publications
Institution
Titre
A (Dis)similarity Index for Comparing Two Character Networks Based on the Same Story
Titre de la conférence
COMHUM 2022: Workshop on Computational Methods in the Humanities. CEUR Workshop Proceedings , Vol. 3602
Statut éditorial
Publié
Date de publication
2023
Peer-reviewed
Oui
Pages
33-42
Langue
anglais
Résumé
Comparing networks is always a complicated matter, whose effective implementation strongly depends on the amount of shared information between them, in particular whether nodes, edges, weights etc. are identical, or not. In the case of character networks and adaptations (from book to movie, from movie to theater, and so on), the formal challenge proves stimulating: some characters will be mapped from one work to the other, some will have no correspondence, and their weights, measuring their relative occurence, are bound to differ. This formal contribution, rooted in Multivariate Data Analysis, proposes a presumably novel similarity index, the generalized weighted RV coefficient, taking into account both the difference in character weights (nodes) and in character interactions (edges). This approach first requires to transform the character networks into weighted squared Euclidean configurations. We then compare a novel of C.S. Lewis, part of the series The Chronicles of Narnia, and the script of its film adaptation to illustrate the proposal and the results.
Open Access
Oui
Création de la notice
04/10/2024 12:15
Dernière modification de la notice
08/10/2024 6:07