Raga Analysis Using Entropy

0Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

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).

Cite

CITATION STYLE

APA

Chakraborty, S., Mazzola, G., Tewari, S., & Patra, M. (2014). Raga Analysis Using Entropy. In Computational Music Science (pp. 65–68). Springer Nature. https://doi.org/10.1007/978-3-319-11472-9_6

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free