An algorithm to make a hit: Difference between revisions
From London Hackspace Wiki
(Created page with "==Millea and Wakefield's Article== This is relevant: [http://eprints.hud.ac.uk/7788/1/EVOPhD.pdf Automating the Composition of Popular Music: The Search For a Hit] '''Abstract:'...") |
No edit summary |
||
| Line 1: | Line 1: | ||
==Millea and Wakefield's Article== | ==Millea and Wakefield's Article== | ||
Researchers at the University of Huddersfield have published something regarding automating the composition of popular music. | |||
'''Abstract:'''<blockquote>Automated composition may be regarded as a search within the space defined by a datatype representing musical compositions. We develop a hierarchical representation of popular music compositions with the aim of increasing the probability of finding potential hits. Musical variations are calculated as difference vectors between patterns extracted from a given set of existing compositions. These form the basis of the mutation operator within an evolutionary algorithm search.</blockquote> | |||
* [http://eprints.hud.ac.uk/7788/1/EVOPhD.pdf The paper] | |||
--[[User:Ariel|Ariel]] 02:01, 28 October 2011 (UTC) | --[[User:Ariel|Ariel]] 02:01, 28 October 2011 (UTC) | ||
Revision as of 04:02, 28 October 2011
Millea and Wakefield's Article
Researchers at the University of Huddersfield have published something regarding automating the composition of popular music.
Abstract:
Automated composition may be regarded as a search within the space defined by a datatype representing musical compositions. We develop a hierarchical representation of popular music compositions with the aim of increasing the probability of finding potential hits. Musical variations are calculated as difference vectors between patterns extracted from a given set of existing compositions. These form the basis of the mutation operator within an evolutionary algorithm search.
--Ariel 02:01, 28 October 2011 (UTC)
