Co-occurrence Matrices of Time Series Applied to Literary Works

Co-occurrence Matrices of Time Series Applied to Literary Works

Loading document ...
Page
of
Loading page ...

Author(s)

Author(s): Amelia Carolina Sparavigna

Download Full PDF Read Complete Article

DOI: 10.18483/ijSci.533 441 1116 12-18 Volume 3 - Jul 2014

Abstract

Recently, it has been proposed to analyse the literary works, plays or novels, using graphs to display the social network of their interacting characters. In this approach, the timeline of the literary work is lost, because the storyline is projected on a planar graph. However, timelines can be used to build some time series and analyse the work by means of vectors and matrices. These series can be used to describe the presence and relevance, not only of words in the text, but also of persons and places portrayed in the drama or novel. In this framework, we discuss here an approach with co-occurrence matrices plotted over time, concerning the presence of characters in the pages of a novel. These matrices are similar to those appearing in recurrence plots.

Keywords

Literary experiments, Time series, Co-occurrence plots, Harry Potter

References

  1. F. Moretti, Network theory, plot analysis, A Stanford Lit Lab Pamphlet, 2011, http://litlab.stanford.edu/LiteraryLabPamphlet2A.Text.pdf
  2. J. Stiller, D. Nettle and R.I.M. Dunbar, The small world of Shakespeare’s plays, Human Nature, Volume 14, Issue 4, 2003, pages 397-408
  3. R. Alberich, J. Miro-Julia and F. Rossello, Marvel Universe looks almost like a real social network, http://arxiv.org/abs/cond-mat/0202174v1
  4. A.C. Sparavigna, On Social Networks in Plays and Novels, The International Journal of Sciences, 2013, Volume 2, Issue 10, Pages: 20-25
  5. A.C. Sparavigna and R. Marazzato, Graph Visualization Software for Networks of Characters in Plays, The International Journal of Sciences, 2014, Volume 3, Issue 2, Pages: 69-79
  6. R. Marazzato and A.C. Sparavigna, Extracting Networks of Characters and Places from Written Works with CHAPLIN, arXiv:1402.4259 [cs.CY], 2014
  7. G. Box and G. Jenkins, Time Series Analysis Forecasting and Control, Holden-Day, San Francisco, 1976
  8. A.C. Sparavigna, Recurrence Plots of Sunspots, Solar Flux and Irradiance, arXiv:0804.1941 [physics.pop-ph], 2008
  9. C.L. Webber Jr and J.P. Zbilut, Dynamical Assessment of Physiological Systems and States Using Recurrence Plot Strategies, Journal of Applied Physiology, 1994, Volume 76, Issue 2, Pages 965-973
  10. J.P. Zbilut, N. Thomasson, and C.L. Webber, Recurrence Quantification Analysis as a Tool for Nonlinear Exploration of Nonstationary Cardiac Signals, Medical Engineering & Physics, 2002, Volume 24, Issue 1, Pages: 53-60
  11. Gaoxiang Ouyang, Li Xiaoli, Dang Chuangyin and D.A. Richards, Using Recurrence Plot for Determinism Analysis of EEG Recordings in Genetic Absence Epilepsy Rats, Clinical Neurophysiology, 2008, Volume 119, Issue 8, Pages 1747-1755
  12. Melina Alexa, Computer-assisted text analysis methodology in the social sciences, ZUMA-Arbeitbericht 97/07, October 1997
  13. R. Oppenheim, The Mathematical Analysis of Style: A Correlation-based Approach, Computers and the Humanities, 1988, Volume 22, Issue 4, pp 241-252
  14. Vv. Aa., Wikipedia, /wiki/Autoregressive_integrated_moving_average
  15. R. Hogenraad, D.P. McKenzie and C. Martindale, The Enemy within: Autocorrelation Bias in Content Analysis of Narratives, Computers and the Humanities, 1996/1997, Volume 30, Issue 6, pp. 433-439
  16. R. Pitz, Quantifying Degrees of Randomness in Word Rhythms of Literary Works, ProQuest, UMI Dissertation Publishing, 2008
  17. Vv. Aa., Wikipedia, wiki/Approximate_entropy
  18. M. Bostock, Les Misérables Co-occurrence, at http://bost.ocks.org/mike/miserables/
  19. http://en.wikipedia.org/wiki/Harry_Potter_and_the_Philosopher's_Stone
  20. N. Marwan, M.C. Romano, M. Thiel and J. Kurths, Recurrence Plots for the Analysis of Complex Systems, Physics Reports, 2007, Volume 438, Issue 5-6, Pages: 237-329

Cite this Article:

International Journal of Sciences is Open Access Journal.
This article is licensed under a Creative Commons Attribution 4.0 International (CC BY 4.0) License.
Author(s) retain the copyrights of this article, though, publication rights are with Alkhaer Publications.

Search Articles

Issue June 2024

Volume 13, June 2024


Table of Contents



World-wide Delivery is FREE

Share this Issue with Friends:


Submit your Paper