Skip to main content

Raga Analysis Using Entropy

  • Chapter
  • First Online:
Computational Musicology in Hindustani Music

Part of the book series: Computational Music Science ((CMS))

  • 1212 Accesses

Abstract

If P(E) is the probability of an event, the information content of the event E is defined as I(E) = −log2(P(E)). Events with lower probability will signal higher information content when they occur. The probability of a raga note, and hence its information content, depends on the raga concerned. The important raga notes will obviously be having higher probabilities. On the other hand, a weak note in a raga cannot be thrown away either for it would be carrying more surprise! The strength of entropy analysis lies here (entropy is the mean information content of a random variable).

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 54.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  • D. Applebaum, Probability and Information: An Integrated Approach (Cambridge University Press, Cambridge, 1996). Chapter 6

    MATH  Google Scholar 

  • P.A. Brandt, Music and the abstract mind. JMM J. Music Meaning 7, Winter (2009). http://www.musicandmeaning.net/issues/showArticle.php?artID=7.3

  • S. Chakraborty, Review of the book Computer Music Modeling and Retrieval: Genesis of Meaning in Sound and Music, 5th International Symposium, CMMR 2008, Copenhagen, Denmark, May 2008. Revised papers by S. Ystad, R. Kronland-Martinet, K. Jensen, Springer, New York, 2009 published in Comput. Rev., 7 May 2010, www.reviews.com

  • S. Chakraborty, R. Ranganayakulu, S. Chauhan, S.S. Solanki, K. Mahto, A statistical analysis of Raga Ahir Bhairav. J. Music Meaning 8, sec. 4, Winter (2009a), http://www.musicandmeaning.net/issues/showArticle.php?artID=8.4

  • S. Chakraborty, M. Kumari, S.S. Solanki, S. Chatterjee, On what probability can and cannot do: a case study in Raga Malkauns. J. Acoust. Soc. India 36(4), 176–180 (2009b)

    Google Scholar 

  • S. Chakraborty, S. Tewari, G. Akhoury, S.K. Jain, J. Kanaujia, Raga analysis using entropy. J. Acoust. Soc. India 38(4), 168–172 (2011a)

    Google Scholar 

  • S. Chakraborty, S. Tewari, G. Akhoury, How do ragas of the same thaat that evoke contrasting emotions like joy and pathos differ in entropy? Philomusica Online 10, 1–10 (2011b)

    Google Scholar 

  • D. Dutta, Sangeet Tattwa (Pratham Khanda), 5th edn. (Brati Prakashani, 2006) (Bengali) (Kolkata, India)

    Google Scholar 

  • J.L. Snyder, Entropy as a measure of musical style: the influence of a priori. Assumptions Music Theory Spectr. 12, 121–160 (1990)

    Article  Google Scholar 

  • S. Tewari, S. Chakraborty, Linking raga with probability. Ninad J. ITC Sangeet Res. Acad. 25, 25–30 (2011)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this chapter

Cite this chapter

Chakraborty, S., Mazzola, G., Tewari, S., Patra, M. (2014). Raga Analysis Using Entropy. In: Computational Musicology in Hindustani Music. Computational Music Science. Springer, Cham. https://doi.org/10.1007/978-3-319-11472-9_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-11472-9_6

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-11471-2

  • Online ISBN: 978-3-319-11472-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics