Methods and systems for utilizing contextual feedback to generate and modify playlists

Description

A portion of the disclosure of this patent document contains material that is subject to copyright protection. The copyright owner has no objection to the facsimile reproduction by anyone of the patent document or the patent disclosure, as it appears in the Patent and Trademark Office patent file or records, but otherwise reserves all copyright rights whatsoever.

FIELD OF THE EMBODIMENTS OF THE INVENTION

Embodiments of the invention are directed to methods and systems for utilizing contextual feedback to generate and modify playlists.

BACKGROUND OF THE EMBODIMENTS OF THE INVENTION

Automated techniques exist for identifying items that a consumer might enjoy in view of other items the consumer has previously indicated he or she enjoys. Some such techniques compare attributes of items the consumer previously indicated he or she enjoys with attributes of other items to identify items that the consumer might enjoy. Thus, for example, if the consumer enjoys “Dubliners” by James Joyce, “Ulysses” by James Joyce might be identified as another item the consumer may enjoy because both “Dubliners” and “Ulysses” have a common attribute (the author, James Joyce).

Other automated techniques utilize collaborative methods to identify items that the consumer might enjoy. For example, consumers who enjoyed “The Da Vinci Code” by Mark Brown might indicate that they also enjoyed “The Catcher in the Rye” by J. D. Salinger. Accordingly, if the consumer indicates that he or she enjoys “The Da Vinci Code,” “The Catcher in the Rye” would be identified as another item the consumer would enjoy because other consumers who enjoyed “The Da Vinci Code” indicated that they enjoyed “The Catcher in the Rye.”

One problem with these techniques is that they neglect the context of the attributes or information used to identify items that the consumer might enjoy. For example, consumers who enjoyed “The Da Vinci Code” and who indicated that they also enjoyed “The Catcher in the Rye” might only have enjoyed “The Catcher in the Rye” because they read “Dubliners,” which is written in a similar stream-of-consciousness style, immediately before “The Catcher in the Rye.” If so, then a recommendation such as “If you like ‘The Da Vinci Code,’ then you'll also like ‘The Catcher in the Rye’” may not be helpful to the consumer.

This problem also arises where the items are musical compositions. For example, radio station listeners may enjoy the song “House of the Rising Sun” by The Animals after the song “Stairway to Heaven” by Led Zeppelin, but not after the song “Aqualung” by Jethro Tull. However, existing automated techniques are only able to determine, for example, that radio station listeners who like “Stairway to Heaven” and “Aqualung” also like “House of the Rising Sun.” Accordingly, existing automated techniques cannot, for example, help create radio station playlists that account for listener preferences as to the context of a particular musical composition. Accordingly, there exists a need for methods and systems for using contextual information to generate and modify playlists that do account for such listener preferences.

BRIEF SUMMARY OF EMBODIMENTS OF THE INVENTION

Embodiments of the invention are directed to methods and systems for using contextual information to generate and modify playlists. For example, one embodiment of the invention includes the steps of storing feedback from at least one user about a first content object; storing contextual information relating to the feedback; retrieving the feedback and contextual information; and generating a playlist of content objects using the feedback and contextual information.

Another embodiment of the invention includes the steps of comparing an input seed to a first database item, wherein the first database item corresponds to a first content object; retrieving contextual information relating to the first content object; and selecting the first content object for the playlist based on the comparison and the contextual information. In other embodiments of the invention, computer-executable instructions for implementing the disclosed methods are stored as control logic or computer-readable instructions on computer-readable media, such as an optical or magnetic disk.

Other details features and advantages of embodiments of the invention will become apparent with reference to the following detailed description and the figures.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 depicts an exemplary operating environment for an embodiment of the invention;

FIGS. 2
a and 2b depict terminal-based displays for presenting and providing content to a user in accordance with embodiments of the invention;

FIGS. 3
a-3d depict in more detail the graphical user interface of FIGS. 2a and 2b in various stages of operation and in accordance with an embodiment of the invention;

FIG. 4 depicts, in accordance with an embodiment of the invention, a station pop-up menu generated in response to a user selecting a button such as “Station 1” button 308 in FIG. 3c.

FIG. 5 depicts, in accordance with an embodiment of the invention, the graphical user interface of FIGS. 2a and 2b after a user has clicked the “Add More Music” menu choice 402 of station pop-up menu 400 in FIG. 4;

FIG. 6 depicts, in accordance with an embodiment of the invention, the graphical user interface of FIGS. 2a and 2b after a user has clicked the “Email This Station” menu choice 404 of station pop-up menu 400 in FIG. 4;

FIGS. 7
a-c depict, in accordance with an embodiment of the invention, the graphical user interface of FIGS. 2a and 2b in various stages of operation after a user has clicked the “Edit This Station” menu choice 406 of station pop-up menu 400 in FIG. 4;

FIG. 8 depicts, in accordance with an embodiment of the invention, a content pop-up menu generated in response to a user selecting a component of a graphical element, such as content art 332 of second graphic element 326.

FIG. 9 depicts, in accordance with an embodiment of the invention, an “Information” panel 900 that appears on graphical user interface 208 after the user has selected, for example, “Why Did You Play This Song” menu choice 802.

FIG. 10 depicts, in accordance with an embodiment of the invention, a “Create New Station” panel 1000 that appears on graphical user interface 208 after the user has selected, for example, “Make a New Station from This Song” menu choice 804.

FIG. 11 depicts a “Favorites” display 1100 in accordance with an embodiment of the invention.

FIG. 12 depicts a flow diagram overview of methods for presenting and providing content to a user.

FIG. 13 depicts a relationship between different song candidates.

FIG. 14 is a graph showing a deviation vector.

FIG. 15 graphically depicts a bimodal song group.

FIG. 16 shows a flow diagram for one or more embodiments of the “Generate or Modify Playlist” step 1204 in FIG. 12.

FIG. 17 shows a flow diagram for one or more embodiments of the “Identify Characteristics” step 1604 in FIG. 16.

FIG. 18 shows a flow diagram of a method of generating a playlist of content objects in accordance with aspects of the invention.

FIG. 19 depicts feedback and contextual information stored in accordance with aspects of the invention.

FIG. 20 shows another flow diagram of a method of generating a playlist of content objects in accordance with aspects of the invention.

DETAILED DESCRIPTION OF EMBODIMENTS OF THE INVENTION

FIG. 1 depicts a diagram of exemplary system 100 that may be used to implement embodiments of the invention. A plurality of terminals, such as terminals 102, 104 and 106, coupled to playlist server 108 and content server 118 via network 110. In another embodiment, playlist server 108 and content server 118 may be the same server performing all functions of playlist server 108 and content server 118. Terminals 102, 104 and 106, playlist server 108 and content server 118, may include a processor, memory and other conventional electronic components and may be programmed with processor-executable instructions to facilitate communication via network 110 and perform aspects of the invention.

One skilled in the art will appreciate that network 110 is not limited to a particular type of network. For example, network 110 may feature one or more wide area networks (WANs), such as the Internet. Network 110 may also feature one or more local area networks (LANs) having one or more of the well-known LAN topologies and the use of a variety of different protocols on these topologies, such as Ethernet, TCP/IP, Frame Relay, Ethernet, FTP, HTTP and the like, is presumed. Moreover, network 110 may feature a Public Switched Telephone Network (PSTN) featuring land-line and cellular telephone terminals, or else a network featuring a combination of any or all of the above. Terminals 102, 104 and 106 may be coupled to network 110 via, for example, twisted pair wires, coaxial cable, fiber optics, electromagnetic waves or other media.

In one embodiment of the invention, playlist server 108 contains a database of items 112. Alternatively, playlist server 108 may be coupled to database of items 112. For example, playlist server 108 may be coupled to a “MUSIC GENOME PROJECT” database as described in U.S. Pat. No. 7,003,515. Playlist server 108 may also contain or be coupled to matching engine 114. Matching engine 114 utilizes an associated set of search and matching functions 116 to operate on the database of items 112. In an embodiment of the invention used with the “MUSIC GENOME PROJECT” database, for example, matching engine 114 utilizes search and matching functions implemented in software or hardware to effectively calculate the distance between a source song and other songs in the database (as described here and in U.S. Pat. No. 7,003,515), and then sorts the results to yield an adjustable number of closest matches.

In one embodiment of the invention, content server 118 contains a database of content objects 120. Alternatively, content server 118 may be wholly or partially integrated with playlist server 108, or separately coupled to a database of content objects 120. Content server 118 may also contain or be coupled to content engine 122. Content engine 122 utilizes an associated set of management functions 124, such as standard finding, packaging and sending functions, to operate on the database of content objects 122. In one embodiment of the invention, for example, content engine 122 utilizes management functions implemented in software or hardware to control the transmission of content objects by, for example, streaming and/or downloading to terminals 102, 104 and 106.

Terminals 102, 104 and 106 feature user interfaces that enable users to interact with server 108. The user interfaces may allow users to utilize a variety of functions, such as displaying information from playlist server 108, requesting additional information from playlist server 108, customizing local and/or remote aspects of the system and controlling local and/or remote aspects of the system. Terminals 102, 104 and 106 can be operated in a client-server configuration to permit a user to retrieve web pages from playlist server 108. Furthermore, any of various conventional web browsers can be used to display and manipulate data on the web pages.

FIG. 2
a depicts terminal-based display 200 for presenting and providing content to a user in accordance with an embodiment of the invention. Terminal-based display 200 may comprise, for example, a web browser window 204 displayed on terminal 102 (FIG. 1) running an operating system such as “WINDOWS” from Microsoft Corp. In this embodiment, terminal 102 is configured as the client in a client/server relationship with playlist server 108 and content server 118.

A user of terminal 102 establishes a client/server relationship with playlist server 108 by inputting the appropriate URL in address field 206 (in this case, the URL is “http://www.pandora.com”). In response, web page 204 is retrieved from playlist server 108. In this embodiment, web page 204 features graphical user interface 208 (shown in more detail in, e.g., FIG. 3d), “favorites” button 210, “minimize” button 212, tip 214 and advertisement 216.

In this embodiment, the user's selecting of “minimize” button 212 (such as by clicking a mouse button while the mouse pointer is over “minimize” button 212) removes graphical user interface 208 from web page 204 and results in the creation of terminal-based display 220 shown in FIG. 2b. Terminal-based display 220 presents and provides content to a user in accordance with another embodiment of the invention. Specifically, terminal-based display 220 may comprise, for example, a web browser window 222 featuring graphical user interface 208 without, for example, “favorites” button 210, “minimize” button 212, tip 214 and advertisement 216. Terminal-based display 220 is smaller than terminal-based display 200 and thus better preserves desktop display resources. In a web page replacing web page 204, the user is given the option to return graphical user interface 208 to terminal-based display 200. The user of terminal 102 may discontinue the client/server relationship with playlist server 108 by selecting “close window” button 218. To the extent the user later opens a new web browser window and reestablishes a client/server relationship with playlist server 108, playlist server 108 recognizes the user as a result of well-known schemes such as “cookies” and thus retains any customized user preferences or settings when web page 204 is retrieved and graphical user interface 208 is restarted.

In this embodiment, tip 214 enhances the user-friendliness of graphical user interface 208 by providing information to the user regarding how to use graphical user interface 208. For example, tip 214 may state “Use thumbs up/thumbs down to tune your stations. Click here to learn more.” To the extent the user clicks the hypertext link “Click here,” another web page is retrieved providing more detailed information about how to tune stations. Tip 214 may also advertise career opportunities or display other information. In another embodiment, tip 214 may be provided in connection with terminal-based display 220.

In this embodiment, advertisement 216 may comprise a standard paid “banner” advertisement for a third party in any configuration on web page 204. Advertisement 216 may generate royalty revenue or other income for the operator. In one embodiment, the type of advertisement 216 presented to the user on web page 204 depends on various criteria, including but not limited to input, feedback and other information provided by the user, the location of the user's IP address, and other information such as the time of day or year.

FIGS. 3
a-3d depict in more detail graphical user interface 208 (FIGS. 2a and 2b) in various stages of operation and in accordance with an embodiment of the invention. Graphical user interface 208 is provided through playlist server 108 (FIG. 1) and may be implemented through, for example, Java, JavaScript, XML, Flash or HTML.

Turning to FIG. 3c, graphical user interface 208 features station panel 302 and playlist panel 304. Other embodiments may have more or less panels. Station panel 302 features “Create Station” button 306 and “Station 1,” “Station 2” and “Station 3” buttons 308, 310 and 312.

As will be described further below, “Create Station” button 306 initiates the generation of a station (e.g., a station corresponding to “Station 1” button 308) corresponding to an input seed, such as a song name or artist name, selectively provided by the user. The station facilitates the providing of content to the user that, for example, corresponds to a playlist generated as a result of a comparison of the input seed to musicological attributes of other songs. Thus, for example, the user could input “Miles Davis” and a “Miles Davis station” would be created that facilitates the providing of content to the user that corresponds to “Miles Davis” songs or songs that are musicologically similar to songs by “Miles Davis.”

In this embodiment, playlist panel 304 visually represents to the user a playlist of content objects such as songs, the first song of which corresponds to first graphic element 314 and the second song of which corresponds to second graphic element 326. First graphic element features corresponding song text 316, artist text 318 and content art 320, while second graphic element 326 features corresponding song text 328, artist text 330 and content art 332. Corresponding song text 316 and 328, as well as corresponding artist text 318 and 330 may additionally comprise hypertext links that provide additional information, such as background knowledge about an artist or song. Corresponding content art 320 and 332 may comprise, for example, a picture of an album cover.

Other embodiments of first graphic element 314 or second graphic element 326 may feature additional or fewer components than the embodiment that has been described. Other types of components include “purchase” buttons, advertisements, feedback indicators (such as feedback indicator 336 in FIG. 3d) and links to additional services and information. In addition, other embodiments of first graphic element 314 or second graphic element 326 may feature different sizes, shapes and appearances than the embodiment that has been described.

In this embodiment, the song currently being provided to the user is visually represented by the rightmost graphic element (i.e., second graphic element 326). After songs have been provided to the user, or otherwise discarded, the graphic elements corresponding to those songs are scrolled to the left across playlist panel 304 (in this example, approximately three graphic elements total can be visualized to the user). In the embodiment shown in FIG. 3c, first graphic element 314 corresponds to a song that has already been provided to the user, while second graphic element 326 corresponds to a song that is currently being provided to the user. In one embodiment of the invention, the fact that second graphic element 326 is currently being provided to the user is emphasized by tinting, shading or otherwise de-emphasizing first graphic element 314, or highlighting, brightening or otherwise emphasizing second graphic element 326. In addition, playback bar 334 may be featured as a component of second graphic element 326 to indicate how much of the currently provided song has already been played. Of course, other embodiments may feature alternative ways of visually representing the playlist and/or the progression of the playlist, as well as fewer or more graphic elements and alternative ways for representing those graphic elements.

In the embodiment shown in FIG. 3c, graphical user interface 208 also features volume control 340, playback controls 342, “Help” button 344, “Share” button 346, “Account” button 348 and “Guide” button 350. Volume control 340 adjusts the audible volume of content objects having audio that are provided to the user in accordance with embodiments of the invention. Playback controls 342 allow the user to pause or resume the playing of content objects. Playback controls 342 also allow the user to terminate playing of the current content object in favor of another content object.

The user's selecting of “Help” button 344 generates an on-screen pop-up menu providing clickable menu choices that provide additional features to the user and enhance the user-friendliness of graphical user interface 208. For example, the on-screen pop-up menu may include choices providing additional information about a music discovery service, such as a FAQ, contact information or legal notices.

The user's selecting of “Share” button 346 generates another pop-up menu providing clickable menu choices relating to, for example, sharing features of graphical music interface 208. For example, the pop-up menu may include choices for providing a playlist to other users of the music discovery service (e.g., enabling another user to enjoy a station such as the station corresponding to “Station 1” button 308 and thus to be provided content corresponding to that station). The pop-up menu may also include choices for facilitating the providing of content by another station created by another user, the operator or a third party.

The user's selecting of “Account” button 348 generates another pop-up menu providing clickable menu choices relating to, for example, customized user preferences or settings. For example, the pop-up menu may include choices for viewing favorite stations, editing account and contact information or subscribing to the music discovery service. “Subscribing” may mean, for example, that in exchange for an annual fee, the user will no longer see advertisement 216 when using the music discovery service.

In this embodiment, the user's selecting of “Guide” button 350 generates another pop-up menu providing clickable menu choices relating to, for example, enabling the user to selectively provide feedback about a content object such as a song. In one embodiment, “Guide” button 350 serves as the primary interface for the “back-and-forth” conversation between the user and the music discovery service. For example, the pop-up menu may include choices for enabling the user to provide feedback corresponding to comments such as “I really like this song,” “I don't like this song,” or “I'm tired of this song.” This feedback can be used to customize, adapt and/or enhance the initial playlist generated in connection with a station so that it is more attuned to the preferences of the user.

As another example, the pop-up menu generated by selecting “Guide” button 350 may include other feedback options, such as reasons why the user likes or dislikes a certain song. Exemplary reasons that the user may select as reasons why he or she likes the song include “I like the artist,” “I like the song,” “I like the beat,” “I like the instrument being played,” “I like the meaning of the lyrics,” or “I like the genre.” Exemplary reasons that the user may select as reasons why he or she dislikes the song include “I don't like the artist,” “I don't like the vocals,” “I don't like the repetitiveness,” “The music is too ‘mainstream,’” or “The music is too loud.”

In response to feedback provided by the user, the playlist may be modified. Modifications to the playlist are accomplished, for example, by the use of weighing values and scaling functions as described in currently pending U.S. patent application Ser. No. 11/295,339, as will be discussed further below.

In addition, “Guide” button may include other choices that provide the user with information as to why a song is being played (i.e. what musicological attributes, such as characteristics or focus traits, are contained in a song). “Guide” button may also include other choices that enable the user to selectively modify the input seed so that it, and the playlist that is generated as a result of a comparison between the input seed and other songs, reflects additional artists or songs.

FIG. 4 depicts, in accordance with an embodiment of the invention, station pop-up menu 400, which is generated in response to a user selecting a button such as “Station 1” button 308 in FIG. 3c. Station pop-up menu 400 includes menu choices such as “Add More Music” menu choice 402, “Email This Station” menu choice 404, “Edit This Station” menu choice 406, “Rename This Station” menu choice 408 and “Delete This Station” menu choice 410. Other embodiments of the invention may have fewer, additional or alternative menu choices.

In one embodiment, “Add More Music” menu choice 402 enables the user to selectively modify the input seed corresponding to the current station. FIG. 5 depicts “Add More Music” panel 500 that appears on graphical user interface 208 after the user has selected “Add More Music” menu choice 402. “Add More Music” panel features entry field 502. Entry field 502 enables the user to selectively modify the input seed by entering, for example, another artist name or song name (in addition to the artist name, song name or other input seed previously entered) and then selecting “Add” button 504 (if the user does not desire to selectively modify the input seed, then the user selects “Close” button 506). The additional artist name or song name is then factored into the comparison between the input seed and songs contained in the “MUSIC GENOME PROJECT” database. One way to factor the additional artist name or song name into the comparison is to utilize confidence and weighting factors to assign, for example, more or less weight to the musicological attributes of the additional artist name or song name in view of the initial input seed. After the input seed has been selectively modified, “Add More Music” panel 500 disappears and graphical user interface 208 proceeds to present and provide content corresponding to the modified input seed in accordance with FIGS. 2a and 2b. In doing so, “Station 1” button 308 may appear differently to reflect the modified input seed.

In one embodiment, “Email This Station” menu choice 404 enables the user to selectively provide a station, and thus a playlist, to another user. FIG. 6 depicts “Email This Station” panel 600 that appears on graphical user interface 208 after the user has selected “Email This Station” menu choice 404. “Email This Station” panel 600 features station field 602, email field 604 and message field 606. When selected by the user, station field 602 enables the user to select a station to selectively provide to another user. The stations available to selectively appear on a drop-down menu and may include stations created by the user, such as the station corresponding to “Station 1” button 308 (FIG. 3c), or other stations.

Email field 604 enables the user to enter an email address corresponding to another user for which the user desires to selectively provide a station. Message field 606 enables the user to provide a message (such as regular text or HTML) to the user for which the station has been selectively provided.

After the user has entered information into station field 602, email field 604 and message field 606, the user selects “Share” button 608 to initiate the selective providing of a station to another user. The information is transmitted to playlist server 108 (FIG. 1). Playlist server 108 prepares an email including the information entered in message field 606 to the recipient user utilizing SMTP or other common protocols. The return address of the email corresponds to the email address provided by the user upon registration with the music discovery service. The email further includes a hypertext link to the URL of the music discovery service. The hypertext link includes a command line argument of an identifier corresponding to the station the user desires to selectively provide. If the recipient is already registered with the music discovery service, the station is automatically provided. If the recipient is not registered with the music discovery service, an anonymous registration is created and the hypertext link will direct the recipient to graphical user interface 208 as if the recipient were the anonymous registrant. If the user does not desire to selectively provide a station, and thus a playlist, to another user, then the user selects “Cancel” button 610.

In one embodiment, “Edit This Station” menu choice 406 enables the user to, among other things, selectively modify feedback about a content object such as a song. FIGS. 7a-c depict “Edit This Station” panel 700 that appears after the user has selected “Edit This Station” menu choice 406. Turning to FIG. 7a, “Edit This Station” panel 700 features station title 702, which displays the name of the station (such as the station corresponding to “Station 1” button 308) that is being edited. “Edit This Station” panel 700 also features “Items You Added” panel 704, “Songs You Liked” panel 706 and “Songs You Didn't Like” panel 708. The user may access each of these panels by selecting tab 710 that corresponds to the appropriate panel.

“Items You Added” panel 704 features song name text 712 and/or artist name text 714 corresponding to selective modifications of the input seed corresponding to the current station. Thus, for example, song name text 712 and artist name text 714 respectively correspond to a song and artist previously entered by the user in order to selectively modify the input seed. The user may remove, for example, a song that had previously selectively modified the input seed by selecting “Remove” button 716. Thereafter, graphical user interface 208 will no longer present and provide content corresponding to the modified input seed. Instead, graphical user interface 208 will proceed to present and provide content corresponding to, for example, the initial input seed, or to the input seed as selectively modified by entry of artist 714.

“Songs You Liked” panel 706 features, for example, song name text 718 (or artist name text) corresponding to selective feedback that the user has provided about a song. Thus, for example, song name text 712 corresponds to a song for which the user has previously selectively provided positive feedback. In addition, “Songs You Didn't Like” panel 708 features, for example, song name text 722 (or artist name text) corresponds to a song for which the user has previously selectively provided negative feedback.

The user may delete the feedback previously provided by selecting “Remove” button 720. Thereafter, when the song is provided, graphical user interface 208 will no longer display feedback indicator 336 (FIG. 3d). Multiple songs and/or artists may be listed on “Items You Added” panel 704, “Songs You Liked” panel 706 or “Songs You Didn't Like” panel 708. Moreover, the feedback about the song will no longer be utilized in connection with generating playlists.

As stated previously, in one embodiment, station pop-up menu 400 also features “Rename This Station” menu choice 408 and “Delete This Station” menu choice 410. “Rename This Station” menu choice 408 enables the user to selectively provide an edited name for, for example, the station that corresponds to “Station 1” button 308. “Delete This Station” menu choice 410 enables the user to remove a station from graphical interface 208.

FIG. 8 depicts, in accordance with an embodiment of the invention, content pop-up menu 800, which is generated in response to a user selecting a component of a graphical element, such as content art 332 of second graphic element 326. Content pop-up menu 800 includes menu choices such as “Why Did You Play This Song” menu choice 802, “Make a New Station from This Song” menu choice 804, “Buy This Song” menu choice 806 and “Buy This Album” menu choice 808. Other embodiments of the invention may have fewer, additional or alternative menu choices.

In one embodiment, “Why Did You Play This Song” menu choice 802 initiates the selectively providing of information to the user. FIG. 9 depicts “Information” panel 900 that appears on graphical user interface 208 after the user has selected, for example, “Why Did You Play This Song” menu choice 802. “Information” panel 900 features information, such as information provided in information text 902, about the song or other content object currently being provided to the user. For example, “Information” panel 900 may include information relating to a characteristic or focus trait of the song or other content object. Alternatively, “Information” panel 900 may also include information relating to background knowledge about the song, the artist who created the song or other relevant information. To the extent the user no longer desires to review the information, the user selects “Close” button 904 and information panel 900 disappears.

In one embodiment, “Make a New Station from This Song” menu choice 804 facilitates the presenting of content to a user in accordance with the present invention. FIG. 10 depicts “Create New Station” panel 1000 that appears on graphical user interface 208 after the user has selected, for example, “Make a New Station from This Song” menu choice 804. “Create New Station” panel 1000 features input seed field 1002 and “Create” button 1004. In one embodiment of the invention, input seed field 1002 is automatically filled with the song name corresponding to the song that was provided when content pop-up menu 800 was initially selected. In another embodiment, input seed field 1002 is empty and awaits the entry of a song name by the user. To initiate the creation of a new station, the user selects “Create” button 1004 after input seed field 1002 has been filled. In another embodiment, a station is automatically created in graphical user interface 208 after the user has selected “Make a New Station from This Song” menu choice 804. To the extent the user does not desire to create a new station, the user selects “Close” button 1006. “Create New Station” panel 1000 disappears and is replaced on the display by graphical user interface 208.

In one embodiment, content pop-up menu 800 features “Buy This Song” menu choice 806 and “Buy This Album” menu choice 808. If the user selects “Buy This Song” menu choice 806, then the selective purchase of the song (or other content object) is enabled. One way to enable the selective purchase of the song is to hyperlink “Buy This Song” menu choice 806 to a web site such as the “iTunes” web site from Apple Computer Corp. that offers songs for sale. The hyperlink may include a general URL as well as a parameter specifying the exact song for purchase. If the user selects “Buy This Album” menu choice 808, then the selective purchase of the album (or other content object) is enabled. One way to enable the selective purchase of the album is to hyperlink “Buy This Album” menu choice 808 to a web site such as the web site of Amazon.com, which sells albums. The hyperlink may include a general URL as well as a parameter specifying the exact song for purchase.

Content pop-up menu 800 also includes menu choices such as “I Like It” menu choice 810 and “I Don't Like It” menu choice 812. “I Like It” menu choice 810 and “I Don't Like It” menu choice 812 enable the user to selectively provide, respectively, positive or negative feedback about the current song or other content object. If the user selects “I Like It” menu choice 810, then feedback indicator 336 in the shape of, for example, a “thumbs-up” sign is displayed on graphic user interface 208 (FIG. 3d). If the user selects “I Don't Like It” menu choice 812, then feedback indicator 336 in the shape of, for example, a “thumbs-down” sign is displayed on graphic user interface 208 (FIG. 3d). Other types of feedback, such as “Don't play this song for awhile” may also be selectively provided. As stated previously, feedback may be used to customize and enhance playlists and other aspects of the user experience.

Content pop-up menu 800 further includes “Add to Favorites” menu choice 814. In one embodiment, “Add to Favorites” menu choice 814 enables the user to selectively associate the song or other content object with a favorites list. FIG. 11 depicts “Favorites” display 1100. “Favorites” display 1100 may appear, for example, as a panel in graphical user interface 208 or as a separate web page provided by playlist server 108. Another way for the user to access “Favorites” display 1100 is by selecting “Favorites” button 210 (FIG. 2a). “Favorites” display 1100 keeps track of songs that the user has identified as good or otherwise significant. In one embodiment, “Favorites” display 1100 features management icons 1102 and 1104, song text 1106, artist text 1108 and station text 1110. Management icons 1102 and 1104 enable the user to remove and otherwise manipulate songs listed in the favorites list in “Favorites” display 1100. Song text 1106 and artist text 1108 provide information about the song that has been selectively associated with the “Favorites” list. Station text 1110 provides the name of the station, such as the station corresponding to the “Station 1” button 308, from which the song was selectively associated with the “Favorites” list.

In one embodiment, “Favorites” display 1100 also features date 1112, album purchase icon 1114 and song purchase item 1116. Date 1112 provides information as to when the song was selectively associated with the “Favorites” list. Album purchase icon 1114 enables the selective purchase of the album (or other content object) from which the song originates. One way to enable the selective purchase of the album is to hyperlink album purchase icon 1114 to a web site such as the web site of Amazon.com, which sells albums. Song purchase icon 1116 enables the selective purchase of the song (or other content object). One way to enable the selective purchase of the song is to hyperlink song purchase icon 1116 to a web site such as the “iTunes” web site from Apple Computer Corp. that offers songs for sale.

It will be appreciated that the design of all displays, windows, interfaces, panels, graphic elements and other components discussed are not limited to the designs specified. Rather, such designs may be of any type or variety that is aesthetically pleasing or functional.

FIG. 12 depicts a flow diagram overview of a method for presenting and providing content to a user 1200 that can be executed in connection with, for example, the system depicted in FIG. 1.

In “Obtain Input Seed” step 1202 of FIG. 12, the user is enabled to selectively provide an input seed. As stated previously, the input seed may be a song name such as “Paint It Black” or even a group of songs such as “Paint It Black” and “Ruby Tuesday.” Alternatively, the input seed may be an artist name such as “Rolling Stones.” Other types of input seeds could include, for example, genre information such as “Classic Rock” or era information such as “1960s.” In one embodiment of the invention, the input seed is sent to playlist server 108 (FIG. 1) in order to perform the subsequent generation of a playlist. Encryption and other security methods may be used to protect communications between playlist server 108, content server 118 and/or terminals 102, 104 and 106.

In “Generate or Modify Playlist” step 1204, a playlist is first generated as a result of a comparison between the input seed and a plurality of database items. As stated previously, in one embodiment of the invention, the input seed is received from terminals 102, 104 and 106 and the playlist is generated on playlist server 108.

One or more embodiments of the invention utilize the “MUSIC GENOME PROJECT” database, which is a large database of records, each describing a single piece of music and an associated set of search and matching functions that operate on that database. The matching engine effectively calculates the distance between a source song and the other songs in the database and then sorts the results to yield an adjustable number of closest matches. Before continuing with FIG. 12, a method of generating or modifying a playlist will be discussed in accordance with one embodiment of the “MUSIC GENOME PROJECT” database will be discussed.

Song Matching

In the “MUSIC GENOME PROJECT” database, each song is described by a set of characteristics, or “genes”, or more that are collected into logical groups called “chromosomes.” The set of chromosomes make up the genome. One of these major groups in the genome is the “Music Analysis” Chromosome. This particular subset of the entire genome is sometimes referred to as “the genome.”

Each gene can be thought of as an orthogonal axis of a multi-dimensional space and each song as a point in that space. Songs that are geometrically close to one another are “good” musical matches. To maximize the effectiveness of the music matching engine, we maximize the effectiveness of this song distance calculation.

A given song “S” is represented by a vector containing approximately 150 genes. Each gene corresponds to a characteristic of the music, for example, gender of lead vocalist, level of distortion on the electric guitar, type of background vocals, etc. In a preferred embodiment, rock and pop songs have 150 genes, rap songs have 350, and jazz songs have approximately 400. Other genres of music, such as world and classical, have 300-500 genes. The system depends on a sufficient number of genes to render useful results. Each gene “s” of this vector has a value of an integer or half-integer between 0 and 5. However, the range of values for characteristics may vary and is not strictly limited to just integers or half-integers between 0 and 5.

Song S=(s₁, s₂, s₃, . . . , s_n)

The simple distance between any two songs “S” and “T”, in n-dimensional space, can be calculated as follows:

distance=square-root of (the sum over all n elements of the genome of (the square of (the difference between the corresponding elements of the two songs)))

This can be written symbolically as:

distance(S, T)=sqrt [(for i=1 to n)Σ(s_i−t_i)^2]

Because the monotonic square-root function is used in calculating all of these distances, computing the function is not necessary. Instead, the invention uses distance-squared calculations in song comparisons. Accepting this and applying subscript notation, the distance calculation is written in simplified form as:

distance(S, T)=Σ(s−t)^2

Weighted and Focus Matching

Weighted Matching

Because not all of the genes are equally important in establishing a good match, the distance is better calculated as a sum that is weighted according to each gene's individual significance. Taking this into account, the revised distance can be calculated as follows:

distance=Σ[w*(s−t)^2]=[w₁*(s₁−t₁)^2]+[w₂*(s₂−t₂)^2]+ . . .

where the weighting vector “W,”

Song W=(w₁, w₂, w₃, . . . , w_n)

is initially established through empirical work done, for example, by a music team that analyzes songs. The weighting vector can be manipulated in various ways that affect the overall behavior of the matching engine. This will be discussed in more detail later in this document.

Scaling Functions

The data represented by many of the individual genes is not linear. In other words, the distance between the values of 1 and 2 is not necessarily the same as the distance between the values of 4 and 5. The introduction of scaling functions f(x) may adjust for this non-linearity. Adding these scaling functions changes the matching function to read:

distance=Σ[w*(f(s)−f(t))^2]

There are a virtually limitless number of scaling functions that can be applied to the gene values to achieve the desired result.

Alternatively, one can generalize the difference-squared function to any function that operates of the absolute difference of two gene values. The general distance function is:

distance=Σ[w*g(|s−t|)]

In the specific case, g(x) is simply x², but it could become x³for example if it was preferable to prioritize songs with many small differences over ones with a few large ones.

Focus Matching

Focus matching allows the end user of a system equipped with a matching engine to control the matching behavior of the system. Focus traits may be used to re-weight the song matching system and refine searches for matching songs to include or exclude the selected focus traits.

Focus Trait Presentation

Focus Traits are the distinguishing aspects of a song. When an end user enters a source song into the system, its genome is examined to determine which focus traits have been determined by music analysts to be present in the music. Triggering rules are applied to each of the possible focus traits to discover which apply to the song in question. These rules may trigger a focus trait when a given gene rises above a certain threshold, when a given gene is marked as a definer, or when a group of genes fits a specified set of criteria. The identified focus traits (or a subset) are presented on-screen to the user. This tells the user what elements of the selected song are significant.

Focus Trait Matching

An end user can choose to focus a match around any of the presented traits. When a trait, or number of traits, is selected, the matching engine modifies its weighting vector to more tightly match the selection. This is done by increasing the weights of the genes that are specific to the Focus Trait selected and by changing the values of specific genes that are relevant to the Trait. The resulting songs will closely resemble the source song in the trait(s) selected.

Personalization

The weighting vector can also be manipulated for each end user of the system. By raising the weights of genes that are important to the individual and reducing the weights of those that are not, the matching process can be made to improve with each use.

Aggregation

Song to Song Matching

The matching engine is capable of matching songs. That is, given a source song, it can find the set of songs that closely match it by calculating the distances to all known songs and then returning the nearest few. The distance between any two songs is calculated as the weighted Pythagorean sum of the squares of the differences between the corresponding genes of the songs.

Basic Multi-Song Matching

It may also be desirable to build functionality that will return the best matches to a group of source songs. Finding matches to a group of source songs is useful in a number of areas as this group can represent a number of different desirable searches. The source group could represent the collected works of a single artist, the songs on a given CD, the songs that a given end user likes, or analyzed songs that are known to be similar to an unanalyzed song of interest. Depending on the makeup of the group of songs, the match result has a different meaning to the end user but the underlying calculation should be the same.

This functionality provides a list of songs that are similar to the repertoire of an artist or CD. Finally, it will allow us to generate recommendations for an end user, purely on taste, without the need for a starting song.

FIG. 13 illustrates two songs. In this Figure, the song on the right is a better match to the set of source songs in the center.

Vector Pairs

Referring to FIG. 14, one way to implement the required calculation is to group the songs into a single virtual song that can represent the set of songs in calculations. The virtual “center” is defined to be a song vector whose genes are the arithmetic average of the songs in the original set. Associated with this center vector is a “deviation” vector that represents the distribution of the songs within the set. An individual gene that has a very narrow distribution of values around the average will have a strong affinity for the center value. A gene with a wide distribution, on the other hand, will have a weak affinity for the center value. The deviation vector will be used to modify the weighing vector used in song-to-song distance calculations. A small deviation around the center means a higher net weighting value.

The center-deviation vector pair can be used in place of the full set of songs for the purpose of calculating distances to other objects.

Raw Multi-Song Matching Calculation

If the assumption is made that a songs gene's are normally distributed and that they are of equal importance, the problem is straightforward. First a center vector is calculated and a standard deviation vector is calculated for the set of source songs. Then the standard song matching method is applied, but using the center vector in place of the source song and the inverse of the square of the standard deviation vector elements as the weights:

Target song vectors T=(t₁, t₂, . . . t_n)
Center vector of the source group C=(μ₁, μ₂, . . . μ_n)
Standard deviation vector of the source group D=(σ₁, σ₂, . . . σ_n)
distances_t=Σ[(1/σ_i)^2*(μ_i−t_i)^2]

As is the case with simple song-to-song matching, the songs that are the smallest distances away are the best matches.

Using Multi-Song Matching With the Weighting Vector

The weighting vector that has been used in song-to-song matching must be incorporated into this system alongside the 1/σ^2 terms. Assuming that they are multiplied together so that the new weight vector elements are simply:

New weight=w_i/σ_i^2

A problem that arises with this formula is that when σ²is zero the new weight becomes infinitely large. Because there is some noise in the rated gene values, σ²can be thought of as never truly being equal to zero. For this reason a minimum value is added to it in order to take this variation into account. The revised distance function becomes:

distance_t=Σ[(w_i*0.25/(σ_i^2+0.25))*(μ_i−t_i)^2]

Other weighting vectors may be appropriate for multi-song matching of this sort. Different multi-song weighting vector may be established, or the (0.5)²constant may be modified to fit with empirically observed matching results.

Taste Portraits

Groups with a coherent, consistent set of tracks will have both a known center vector and a tightly defined deviation vector. This simple vector pair scheme will breakdown, however, when there are several centers of musical style within the collection. In this case we need to describe the set of songs as a set of two or more vector pairs.

As shown in FIG. 15, the song group can be described with two vector pairs. By matching songs to one OR the other of the vector pairs, we will be able to locate songs that fit well with the set. If we were to try to force all of the songs to be described by a single pair, we would return songs in the center of the large ellipse that would not be well matched to either cluster of songs.

Ideally there will be a small number of such clusters, each with a large number of closely packed elements. We can then choose to match to a single cluster at a time. In applications where we are permitted several matching results, we can choose to return a few from each cluster according to cluster size.

Returning to “Generate or Modify Playlist” step 1204 in FIG. 12, FIG. 16 shows a more detailed flow diagram for one or more embodiments of this step.

In “Identify Characteristics” step 1604 in FIG. 16, characteristics that correspond to the input seed are identified. As stated previously, characteristics may include, for example, gender of lead vocalist, level of distortion on the electric guitar, type of background vocals, etc. Characteristics may also include, for example, other types of musicological attributes such as syncopation, which is a shift of accent in a musical piece that occurs when a normally weak beat is stressed. In one or more embodiments of the invention, such characteristics are retrieved from one or more items corresponding to the input seed in a Music Genome Project database.

FIG. 17 shows a more detailed flow diagram for one embodiment of the “Identify Characteristics” step 1604 (FIG. 16). As indicated previously, “Identify Characteristics” step 1604 as well as all of the other steps in FIG. 16, can be executed on, for example, the servers in FIG. 1.

In order to identify characteristics corresponding to the input seed, the input seed itself must first be analyzed as shown in “Input Seed Analysis” step 1702. Accordingly, database 112 in FIG. 1, which may be a Music Genome Project database, is accessed to first identify whether the input seed is an item in database 112. To the extent the input seed is not an item in the database, the user may be asked for more information in an attempt to determine, for example, whether the input seed was inputted wrong (e.g., “Beetles” instead of “Beatles”) or whether the input seed goes by another name in database (e.g., “I feel fine” instead of “She's in love with me”). Alternatively, close matches to the input seed may be retrieved from the database and displayed to the user for selection.

If the input seed is in the database, the input seed is then categorized. In the embodiment shown in FIG. 17, the input seed is categorized as either a “Song Name” or “Artist Name.” Such categorization is realized by, for example, retrieving “Song Name” or “Artist Name” information associated with the input seed from the database. Alternatively, such categorization is realized by asking the user whether the input seed is a “Song Name” or “Artist Name.”

If the input seed is a song name, then “Retrieve Characteristics” step 1704 is executed. In “Retrieve Characteristics” step 1704, a song vector “S” that corresponds to the song is retrieved from the database for later comparison to another song vector. As stated previously, in one embodiment the song vector contains approximately 150 characteristics, and may have 400 or more characteristics:

Song S=(s₁, s₂, s₃, . . . s_n)

Each characteristic “s” of this vector has a value selected from a range of values established for that particular characteristic. For example, the value of the “syncopation” characteristic may be any integer or half-integer between 0 and 5. As an empirical example, the value of the syncopation characteristic for most “Pink Floyd” songs is 2 or 2.5. The range of values for characteristics may vary and is not limited to just integers or half-integers between 0 and 5.

If the input seed is an artist name, then (in the embodiment of FIG. 17) “Generate Average” step 1706 is executed. In one embodiment of “Generate Average” step 1706, song vectors S₁to S_n, which each correspond to one of n songs in the database by the artist that is the subject of the input seed, are retrieved. Alternatively, and as stated previously, song vectors S₁to S_ncould correspond to one of n songs in the database on a particular album by the artist.

After song vectors S₁to S_nhave been retrieved, an average of all values for each characteristic of every song vector S₁to S_nis calculated and populated into a “center” or virtual song vector:

Center vector C=(μ₁, μ₂, . . . μ_n)
μ₁=(s_1,1+s_2,1+ . . . s_n,1)/n

Of course, other statistical methods besides computing an average could be used to populate center vector “C.” Center vector “C” is then used for later comparison to another song vector as a representation of, for example, the average of all songs by the artist. In one embodiment of the invention, center vector “C₁” corresponding to a first artist may be compared to center vector “C₂” corresponding to a second artist.

After song vectors S₁to S_nhave been retrieved, “assign confidence factor” step 1708 is executed. In “assign confidence factor” step 1708, a deviation vector “D” is calculated:

Deviation Vector D=(σ₁, σ₂, . . . σ_n)
σ₁=sqrt(((s_1,1−μ₁)^2+(s_2,1−μ₁)^2+(s_n,1−μ₁)^2)/(n−1))

that shows how similar or dissimilar are the characteristics among each of song vectors S₁to S_n. While one embodiment of the invention contemplates populating the deviation vector by determining the standard deviation of all values for each characteristic of every song vector S₁to S_n, other statistical methods could also be used. As an empirical example of the use of standard deviation to calculate the deviation vector, the value of the syncopation characteristic for most “Pink Floyd” songs is 2 or 2.5, which results in a smaller standard deviation value (e.g., 0.035) than if a standard deviation value were calculated for a characteristic having more divergent values (e.g., if the value of the syncopation characteristic for all songs by Pink Floyd was more widely dispersed between 0 and 5).

To the extent a standard deviation value for a certain characteristic is larger, the averaged value of that characteristic in the virtual song vector is considered to be a less reliable indicator of similarity when the virtual song vector is compared to another song vector. Accordingly, as indicated previously, the values of the deviation vector serve as “confidence factors” that emphasize values in the virtual song vector depending on their respective reliabilities. One way to implement the confidence factor is by multiplying the result of a comparison between the center vector and another song vector by the inverse of the standard deviation value. Thus, for example, the confidence factor could have a value of 0.25/(σ_i^2+0.25). The “0.25” is put into the equation to avoid a mathematically undefined result in the event σ_i^2 is 0 (i.e., the confidence factor avoids “divide by zero” situations).

Returning to FIG. 16, “Identify Focus Traits” step 1606 identifies focus traits based on the values of characteristics of song vector (or virtual song vector) S. As stated previously, focus traits are specific combinations of characteristics (or even a single notable characteristic) representing significantly discernable attributes of a song. As such, focus traits are the kernel of what makes one song actually sound different, or like, another song. Focus traits may be created and defined in many ways, including by having trained musicologists determine what actually makes one song sound different from another, or else having users identify personal preferences (e.g., receiving input from a user stating that he/she likes songs with male lead vocals). Exemplary focus traits include “male lead vocal” or “Middle Eastern influence.” There can be 1, 10, 1000 or more than 1000 focus traits, depending on the desired complexity of the system.

In one embodiment of the invention, a set of rules known as “triggers” is applied to certain characteristics of song vector S to identify focus traits. For example, the trigger for the focus trait “male lead vocal” may require the characteristic “lead vocal present in song” to have a value of 5 on a scale of 0 to 5, and the characteristic “gender” to also have a value of 5 on a scale of 0 to 5 (where “0” is female and “5” is male). If both characteristic values are 5, then the “male lead vocal” focus trait is identified. This process is repeated for each focus trait. Thereafter, any identified focus traits may be presented to the user through the user interface.

Now that focus traits have been identified, “Weighting Factor Assignment” step 1608 is executed. In “weighting factor assignment” step 1608, comparative emphasis is placed on some or all of focus traits by assigning “weighting factors” to characteristics that triggered the focus traits. Alternatively, “weighting factors” could be applied directly to certain characteristics.

Accordingly, musicological attributes that actually make one song sound different from another are “weighted” such that a comparison with another song having those same or similar values of characteristics will produce a “closer” match. In one embodiment of the invention, weighting factors are assigned based on a focus trait weighting vector W, where w₁, w₂and w_ncorrespond to characteristics s₁, s₂and s_nof song vector S.

Weighting Vector W=(w₁, w₂, w₃, . . . , w_n)

In one embodiment of the invention, weighting vector W can be implemented into the comparison of songs having and song vectors “S” and “T” by the following formula:

distance(W, S, T)=Σw*(s−t)^2

As described previously, one way to calculate weighting factors is through scaling functions. For example, assume as before that the trigger for the focus trait “male lead vocal” requires the characteristic “lead vocal present in song” to have a value of 5 on a scale of 0 to 5, and the characteristic “gender” to also have a value of 5 on a scale of 0 to 5 (where “0” is female and “5” is male).

Now assume the song “Yesterday” by the Beatles corresponds to song vector S and has an s₁value of 5 for the characteristic “lead vocal present in song” and an s₂value of 5 for the characteristic “gender.” According to the exemplary trigger rules discussed previously, “Yesterday” would trigger the focus trait “male lead vocal.” By contrast, assume the song “Respect” by Aretha Franklin corresponds to song vector T and has a t₁value of 5 for the characteristic “lead vocal present in song” and a t₂value of 0 for the characteristic “gender.” These values do not trigger the focus trait “male lead vocal” because the value of the characteristic “gender” is 0. Because a focus trait has been identified for characteristics corresponding to s₁and s₂, weighting vector W is populated with weighting factors of, for example, 100 for w₁and w₂. Alternatively, weighting vector W could receive different weighting factors for w₁and w₂(e.g., 10 and 1000, respectively).

In “Compare Weighted Characteristics” step 1610, the actual comparison of song vector (or center vector) S is made to another song vector T. Applying a comparison formula without a weighting factor, such as the formula distance(S, T)=(s−t)^2, song vectors S and T would have a distance value of (s₁−t₁)^2+(s₂−t₂)^2, which is (5−5)^2+(5−0)^2, or 25. In one embodiment of the invention, a distance value of 25 indicates a close match.

By contrast, applying a comparison formula featuring weighting vector W produces a different result. Specifically, the weighting vector W may multiply every difference in characteristics that trigger a particular focus trait by 100. Accordingly the equation becomes w₁(s₁−t₁)^2+w₂(s₂−t₂)^2, which is 100(5−5)^2+100(5−0)^2, or 2500. The distance of 2500 is much further away than 25 and skews the result such that songs having a different gender of the lead vocalist are much less likely to match. By contrast, if song vector T corresponded to another song that did trigger the focus trait “male lead vocal” (e.g., it is “All I Want Is You” by U2), then the equation becomes 100(5−5)^2+100(5−5)^2, or 0, indicating a very close match.

As another example of one embodiment of the invention, a weighting vector value of 1,000,000 in this circumstance would effectively eviscerate any other unweighted matches of characteristics and means that, in most circumstances, two songs would never turn up as being similar.

As indicated previously, it is also possible for one or more values of the weighting vector to be assigned based on preferences of the user. Thus, for example, a user could identify a “male lead vocal” as being the single-most important aspect of songs that he/she prefers. In doing so, a weighting vector value of 10,000 may be applied to the comparison of the characteristics associated with the “male lead vocal” focus trait. As before, doing so in one embodiment of the invention will drown out other comparisons.

In one embodiment of the invention, one weighting vector is calculated for each focus trait identified in a song. For example, if 10 focus traits are identified in a song (e.g., “male lead vocalist” and 9 other focus traits), then 10 weighting vectors are calculated. Each of the 10 weighting vectors is stored for potential use during “Compare Weighted Characteristics” step 1610. In one embodiment of the invention, users can select which focus traits are important to them and only weighting vectors corresponding to those focus traits will be used during “Compare Weighted Characteristics” step 1610. Alternatively, weighting vectors themselves could be weighted to more precisely match songs and generate playlists.

In “Select Items” step 1612, the closest songs are selected for the playlist based on the comparison performed in “Compare Weighted Characteristics” step 1610. In one embodiment of the invention, the 20 “closest” songs are preliminary selected for the playlist and placed into a playlist set. Individual songs are then chosen for the playlist. One way to choose songs for the playlist is by random selection. For example, 3 of the 20 songs can be randomly chosen from the set. In one embodiment of the invention, another song by the same artist as the input seed is selected for the playlist before any other songs are chosen from the playlist. One way to do so is to limit the universe of songs in the database to only songs by a particular artist and then to execute the playlist generating method.

To the extent a set of weighted song vectors was obtained, a plurality of sets of closest songs are obtained. For example, if a song has 10 focus traits and the 20 closest songs are preliminarily selected for the playlist, then 10 different sets of 20 songs each (200 songs total) will be preliminarily selected. Songs can be selected for the playlist from each of the sets by, for example, random selection. Alternatively, each set can have songs be selected for the playlist in order corresponding to the significance of a particular focus trait.

As an alternative, or in addition to, randomly selecting songs for the playlist, rules may be implemented to govern the selection behavior. For example, aesthetic criteria may be established to prevent the same artist's songs from being played back-to-back after the first two songs, or to prevent song repetition within 4 hours.

Moreover, regulatory criteria may be established to comply with, for example, copyright license agreements (e.g., to prevent the same artist's songs from being played more than 4 times in 3 hours). To implement such criteria, a history of songs that have been played may be stored along with the time such songs were played.

Accordingly, songs are selected for the playlist from one or more playlist sets according to random selection, aesthetic criteria and/or regulatory criteria. To discern the actual order of songs in the playlist, focus traits can be ranked (e.g., start with all selected songs from the playlist set deriving from the “male lead vocal” focus trait and then move to the next focus trait). Alternatively, or in addition, the user can emphasize or de-emphasize particular playlist sets. If, for example, a user decides that he/she does not like songs having the focus trait of “male lead vocal,” songs in that playlist set can be limited in the playlist.

A number of songs are selected from the Set List and played in sequence as a Set. Selection is random, but limited to satisfy aesthetic and business interests, (e.g. play duration of a particular range of minutes, limits on the number of repetitions of a particular Song or performing artist within a time interval). A typical Set of music might consist of 3 to 5 Songs, playing for 10 to 20 minutes, with sets further limited such that there are no song repetitions within 4 hours and no more than 4 artist repetitions within 3 hours.

In one embodiment of the invention, the playlist features identifiers that correspond to, for example, song names. The identifiers may be index fields or other handles for content database 120 on content server 118. After the playlist has been generated, playlist server 108 may send an identifier corresponding to the input seed to the user at terminal 102, 104 or 106. To the extent the input seed was an artist name requiring the creation of a “center vector,” playlist server 108 may, for example, send an identifier corresponding to a song that is the closest match to the “center vector.” In one embodiment of the invention, a set of identifiers may be sent to terminal 102, 104 or 106 (or to multiple terminals) at once.

After an identifier is remotely provided to terminal 102, 104 or 106, the player on terminal 102, 104 or 106 proceeds to associate a graphic element (such as first graphic element 314 in FIG. 3) with the identifier. For example, content server 118 may store song name 316, artist name 318 and content art 320 in connection with a corresponding content object in content database 120. Accordingly, the player on terminal 102, 104 or 106 may request song name 316, artist name 318 and content art 320 that corresponds to the input seed or identifier from content server 118. Content server 118 then provides, in encrypted form, song name 316, artist name 318 and content art 320 to the player on terminal 102, 104 or 106.

In “Display Graphic Element” step 1208, first graphic element 314 appears in graphical user interface 208 as discussed previously. Song name 316, artist name 318 and content art 320 may be provided within first graphic element 314.

In “Provide Content Object” step 1210, a content object corresponding to the identifier or input seed is provided. For example, the player in terminal 102, 104 or 106 may send the identifier received from playlist server 108 to content server 118. In response, content server 118 may provide a content object corresponding to the identifier to the player on terminal 102, 104 or 106 and thus to the user.

Content server 118 may provide a content object to the user in several ways. For example, content server 118 may stream content object to the user through well-known streaming techniques and protocols such as User Datagram Protocol (UDP), Real Time Transport Protocol (RTP), Real Time Streaming Protocol (RTSP), Real Time Control Protocol (RTCP) and Transmission Control Protocol (TCP). As another example, content server 118 may provide a content object to the user through downloading. Thus, the content object is downloaded fully to terminal 102, 104 or 106 before it is provided to the user. As yet another example, the content object may be provided to the user through a hybrid method of streaming and downloading. In an embodiment of the invention, content server 118 may provide a content object at a rate of 10 to 20 times that of the playback rate. Portions of the content object that have not been played are cached in memory on terminal 102, 104 or 106.

In “Obtain Feedback” step 1212, the user selectively provides feedback about a content object through graphical user interface 208 in the manner discussed previously. In one embodiment of the invention, feedback that has been selectively provided by the user is sent to playlist server 108. If the feedback about a content object is negative, then the playlist may be modified as discussed previously. For example, the user may selectively provide feedback that is negative about a song with a focus trait of “male lead vocal.” In response, a new playlist is generated by playlist server 108 (i.e., the existing playlist is modified) that accounts for the negative feedback. In one embodiment of the invention, a weighting value or scaling function corresponding to the focus trait of “male lead vocal” may be adjusted such that songs having strong focus traits of “male lead vocal” are less likely to match with the input seed originally provided by the user.

As another example, the user may selectively provide feedback that he or she does not like “jazz” music. “Jazz” may be a characteristic stored with regard to various songs in database 112. A weighting value of 1/1,000,000,000 is then assigned to the characteristic “jazz,” which means that a match between the input seed and “jazz” songs is unlikely to result from a comparison of the input seed and database items. Accordingly, the playlist will be modified to remove jazz songs.

Using Contextual Information to Generate and Modify Playlists

FIG. 18 shows a flow diagram of a method of generating a playlist of content objects in accordance with aspects of the invention. As explained above for “Obtain Feedback” step 1212 in FIG. 12, feedback about a content object may be obtained from a user and sent to playlist server 108. In “Store Feedback” step 1802, feedback from the user may be stored in memory on playlist server 108 (e.g., in database 112)(FIG. 1). Alternatively, the feedback may be stored in memory on a content server 118. One of skill in the art will appreciate that the feedback may be stored on any computing device containing memory that is accessible from network 110. For example, a separate feedback server and/or database may be beneficial in some configurations familiar to those of skill in the art.

The feedback stored in “Store Feedback” step 1802 may be positive, negative, or neutral. Numerous examples of negative feedback and positive feedback have been provided above. Meanwhile, in accordance with aspects of the invention, instances when the user refuses to give feedback or simply fails to give feedback are stored as neutral (or null) feedback. Neutral feedback tracks the number of occurrence of the absence of feedback. Therefore, in one aspect of the invention, the total number of times a particular song is played (i.e., “spins” of that song) is equal to the sum of the quantity of neutral feedbacks, positive feedbacks, and negative feedbacks stored for that song. One skilled in the art will appreciate that if the total number of spins, total number of positive feedback, and total number of negative feedback are stored for a song, then simple mathematics can be used to calculate the total number of neutral feedback. Therefore, the total number of each type of feedback need not necessarily be stored in accordance with aspects of the invention. At least one benefit of storing neutral feedback is that it may be useful in determining the weight to accord to feedback in the generation of playlists.

Furthermore, contextual information relating to the feedback is stored in “Store Contextual Information” step 1804. Similar to the storing of feedback, the contextual information may also be stored in memory on playlist server 108. Alternatively, the contextual information may be stored in memory on a content server 118. One of skill in the art will appreciate that the contextual information may be stored on any computing device containing memory that is accessible from network 110. For example, it may be beneficial in some configuration to setup a separate server and/or database for feedback and contextual information. FIG. 19, which is discussed in detail below, depicts an example of feedback and contextual information stored together in a database.

Each time a content object is presented to the user, feedback from the user (e.g., positive, negative, neutral) is stored along with the context (i.e., contextual information) in which the content object was presented. Examples of contextual information include, but are not limited to, the station on which the current song is playing, the song played immediately prior to the current song, the artist of the song playing immediately prior to the current song, one or more musicological characteristics of the prior song(s), the artist of the current song, the album containing the current song, time of day, day of week, calendar day (i.e., date), location of user (e.g., work, home, car, zip code, country, etc.), and user demographics (e.g., age, gender). Some contextual information may be related to the current song in the context of an extrinsic factors, such as location of user (i.e., geography), user demographics, and/or temporal (e.g., time of day, day of week, calendar date). Meanwhile, some contextual information may be related to the current song in the context of at least one of the following: particular artist, particular album, and/or particular station. In addition, some contextual information may be related to the current song in the context of a second content object (e.g., an immediately prior song). Moreover, some contextual information may be related to the current song in the context of characteristics of a second content object (e.g., characteristics of an immediately prior song such as treble, bass, vocals, etc.). Examples of each of the various types of contextual information will be clear to one of skill in the art after thorough review of the entirety of the disclosure.

Continuing with an earlier example where a user selectively provides feedback that is negative about a song (e.g., “With or Without You” by U2), contextual information relating to that feedback is automatically obtained and stored in memory. For example, the particular station (e.g., “Pet Shop Boys” Station) the user was listening to when the “With or Without You” song played, the particular artist (e.g., “Pet Shop Boys”) the user had provided as an input seed, and the time of day (e.g., 9 a.m.) and day of week (e.g., Monday) when the “With or Without You” song played may be automatically obtained and stored in memory as contextual information relating to the negative feedback. In another example, the fact that the user giving feedback was a 28-year old male located in Virginia may be stored as contextual information relating to the feedback.

In accordance with aspects of the invention, stored feedback and contextual information is retrieved in “Retrieve Feedback and Contextual Information” step 1806. In one example in accordance with aspects of the invention, when a user provides the artist/band “Pet Shop Boys” as an input seed, the stored feedback and contextual information related to the “Pet Shop Boys” Station is retrieved and used in generating a playlist of content objects (e.g., songs). In various embodiments in accordance with the invention, the feedback and contextual information are used in generating a playlist only after the quantity of feedback has exceeded a statistical threshold. In examples where the threshold has not been met, the generation of playlists may be similar to step 1204. In one example, the feedback and contextual information are used in playlist generation and/or optimization only after at least one hundred spins of a song in a particular context (e.g., the song “With or Without You” playing on “Pet Shop Boys” Station). In another example, the statistical threshold value may be set to 1,000 spins or 10,000 spins. One of skill in the art will appreciate that a larger threshold value may provide a higher level of confidence in the statistical reliability of the information collected, but may delay the resulting playlist optimizations.

Once the statistical threshold has been met, in “Generate Playlist Using Feedback and Contextual Information” step 1808, a playlist is generated by playlist server 108 that accounts for negative, positive, and neutral feedback provided in that particular context. Unlike the generation and modification of a playlist in step 1204, this step uses feedback with contextual information to deliver an enhanced playlist. In one example, the context in which a song is played may be a station having an input seed of artist “U2” (i.e., in the context of songs played on the “U2” Station). The feedback and contextual information stored for that particular context is depicted by the appropriate portion of database table 1900 depicted in FIG. 19.

Database table 1900 in FIG. 19 stores contextual information and feedback provided by users in the context of stations. In this example, for practical purposes, database table 1900 shows only some of the entries stored for a “U2” Station (i.e., a station based on an artist input seed) and a “Sweet Child of Mine” Station (i.e., a station based on a song input seed). Database table 1900 contains ten entries for each station, where each entry corresponds to a song that was played in the context of the “Sweet Child of Mine” Station or “U2” Station. In one example, the number of entries in database table 1900 may dynamically grow as different songs are played on that station and added to database table 1900. Alternatively, database table 1900 may be prepopulated with an entry corresponding to every available song. One skilled in the art will recognize that prepopulating database table 1900 may undesirably result in extremely large database tables in memory.

By way of example, database entry 1902 corresponds to the feedback provided by users listening to the “U2” Station in response to hearing artist U2's song “With or Without You.” In database table 1900, the “Artist Name” column contains “U2” and the “Song Name” column contains “With or Without You”. Other relevant portions of database table 1900 for entry 1902 are as follows: the “Spins” column contains 31,271 (i.e., the total number of times the song “With or Without You” has played on a “U2” Station), the “Positive” column contains the number of times a user gave positive feedback (e.g., by selecting “I Like It” menu choice 810 (FIG. 8) for the song) for the song, and the “Negative” column contains the number of times a user gave positive feedback (e.g., by selecting “I Don't Like It” menu choice 812 (FIG. 8) for the song) for the song. Meanwhile, as explained earlier, the quantity of neutral feedback can be obtained by simple arithmetic (i.e., Spins minus Positive minus Negative). In addition, the “Feedback” column is a total of positive and negative feedback. One skilled in the art will recognize that the “Feedback” column may be calculated using other columns in database table 1900 and need not be present in all embodiments.

In addition, database entry 1902 contains a “Song Q” column that stores values indicating the suitability of its respective content object in that particular context. In one example, the suitability quotient “Q” may be expressed as a numerical value between negative one and positive one. Negative “Q” values may be used to indicate that a particular content object (e.g., the song “With or Without You”) is less suitable in the particular context (e.g., on “Sweet Child of Mine” Station that song receives a negative 0.064 “Q” value). Meanwhile, a positive “Q” value may be used to indicate that a particular content object (e.g., the song “With or Without You”) is more suitable in the particular context (e.g., on “U2” Station that song receives a positive 0.045 “Q” value). In one embodiment, the “Q” value may be recalculated and updated in database table 1900 each time a song is played in the context of a particular station. One skilled in the art will appreciate that this may result in a great computational load on the relevant computing machines. Alternatively, feedback and contextual information may be collected and the corresponding “Q” values recalculated and updated only at regular intervals (e.g., 30 minutes or after 100 new spins).

The suitability quotient “Q” for a content object in a particular context is calculated using the function:

Q=((ΣF_pos)−(ΣF_neg))/(total # of spins)

where F_posis the sum of all positive feedback for the content object, F_negis the sum of all negative feedback for the content object, and “total # of spins” is the total number of times that a content object was performed in that particular context. For example, database entry 1902 shows that the song “With or Without You” by U2 was played on the “U2” Station 31,271 times. Of those times, the song received positive feedback 1,500 times and negative feedback 96 times. Using the suitability quotient function above, the “Q” value for the song “With or Without You” in the context of the “U2” Station is 0.045 (i.e., 1,500 minus 96, divided by 31,271). Therefore, a positive “Q” value for that song in that context will increase the likelihood that it will be found in the playlist generated in step 1808.

In one example, a weighting value or scaling function as discussed previously and that is appropriate for the suitability quotient “Q” value may be used to optimize the comparison performed by the matching algorithm. The matching algorithm was discussed extensively above. For example, according to the illustrative data in database table 1900 under the “U2” Station context, the song “Age of Consent” by New Order has a more favorable suitability quotient “Q” value than the song “We Are One” and is thus more likely to be selected for the playlist during a comparison.

In accordance with aspects of the invention, a number of content objects (e.g., songs) may be selected and played in a sequence determined, at least in part, using each song's respective “Q” value in the particular context. For example, according to the illustrative data in database table 1900 under the “U2” Station context, the song “Age of Consent” by New Order has a more favorable suitability quotient “Q” value than the song “We Are One” and is thus more likely to be selected for the playlist during a comparison.

In another example, the “Q” may be used to optimize the generation of a pleasing sequence of music (e.g., content objects) in a particular context. In accordance with aspects of the invention, a number of content objects (e.g., songs) may be selected and played in a sequence determined, at least in part, using each song's respective “Q” value in the particular context. For example, according to the illustrative data in database table 1900 under the “U2” Station context, the song “Age of Consent” by New Order has a more favorable suitability quotient “Q” value than the song “We Are One” and is thus more likely to be selected from a playlist to be played.

FIG. 20 depicts another flow diagram of a method of generating a playlist of content objects in accordance with aspects of the invention. In step 2002, an input seed is compared to a first database item corresponding to a first content object (i.e., song). The comparison may use the matching algorithm discussed above to identify a playlist of one or more songs that sound alike (e.g., are closely related to a source song or group of songs based on their characteristics and weighted comparisons of these characteristics). For example, a user may enter the artist “Massive Attack” as an input seed and be presented with one or more database items corresponding to content objects (e.g., the song “With or Without You”). In some examples a database item may be simply a unique identifier for a particular song.

In step 2004, contextual information relating to a first content object (e.g., the song “With or Without You”) is retrieved from memory. Many examples of contextual information were provided above. In addition, the suitability quotient “Q” calculated for the song “With or Without You” on the “Massive Attack” Station may be retrieved. The retrieving performed in step 2004 is similar to the retrieving performed in step 1806. As discussed earlier, the suitability quotient “Q” may optimize the actual order and/or placement of the songs in the playlist.

In step 2006, the contextual information relating to the first content object (e.g., the song “With or Without You”) is used to determine whether to select that object for the playlist. Step 2006, which is an enhancement of step 1612 (FIG. 16), uses retrieved contextual information in addition to the comparison algorithm used in step 1612 to select content objects for the playlist. For example, step 2006 may show that the song “With or Without You” corresponds to a negative “Q” value when played after the song “Angel”. Such information may be stored in a table in memory like table 1900 in FIG. 19. However, in this example the context in which the feedback was obtained would relate to the prior content object (e.g., the song “Angel”) and not the station, as was the case in a prior example.

The invention has been described with respect to specific examples including presently preferred modes of carrying out the invention. Those skilled in the art will appreciate that there are numerous variations and permutations of the above described systems and techniques, for example, that would be used with videos, wine, films, books and video games, that fall within the spirit and scope of the invention as set forth in the appended claims. The use of ordinal syntax such as “first” and “second” in this and related applications is intended for comprehension and readability purposes and is not intended to be limiting in the specification or in and/or between claims. For example, a first content object does not necessarily require the content object to come before a second content object.

Claims

1. A tangible computer-readable medium having computer-executable instructions that causes one or more processors to perform a method comprising: storing, in an electronic memory, feedback from a plurality of users about a first content object, wherein the first content object is stored in an electronic content server;storing, in the electronic memory, contextual information relating to context in which the feedback about the first content object was provided, where the contextual information is independent of characteristics of the first content object;calculating a suitability quotient of the first content object based on the contextual information, wherein the suitability quotient is: a sum of feedback provided about the first content object based on the contextual information where the feedback is positive,less a sum of feedback provided about the first content object based on the contextual information where the feedback is negative,divided by a total number of times the first content object was transmitted to a user terminal;storing, in the electronic memory, the suitability quotient;utilizing the feedback, the contextual information, and the suitability quotient to generate a playlist of content objects; andtransmitting from the electronic content server each of the contents objects to a user terminal, wherein the transmitting is in response to the user terminal requesting content.
2. The computer-readable medium of claim 1 wherein the feedback comprises positive, negative, and neutral feedback, and the threshold amount is one thousand.
3. The computer-readable medium of claim 1 wherein the contextual information comprises information relating to the first content object in the context of at least one of the following: particular artist, particular album, and particular station.
4. The computer-readable medium of claim 1 wherein the contextual information comprises information relating to the first content object in the context of characteristics of a second content object.
5. The computer-readable medium of claim 1 wherein the contextual information comprises information relating to the first content object in the context of an extrinsic factor, wherein the extrinsic factor comprises at least one of the following: temporal factor, geographic factor, and demographic factor.
6. The computer-readable medium of claim 1 wherein the contextual information comprises at least one of the following: station on which the first content object was playing when the feedback was provided, name of a second content object played immediately prior to the first content object when the feedback was provided, artist of the second content object played immediately prior to the first content object when the feedback was provided, and a musicological characteristic of the second content object played immediately prior to the first content object when the feedback was provided, location of a user when the feedback was provided, age of the user when the feedback was provided, gender of the user when the feedback was provided, a time of day when the feedback was provided, and a day of week when the feedback was provided.
7. A computer-implemented method of generating a playlist at an electronic playlist server, comprising: comparing, using a processor, an input seed, which is sent from a user terminal, to a first database item stored in the electronic playlist server, wherein the first database item corresponds to a first content object stored in an electronic content server;retrieving from the electronic playlist server feedback that is associated with contextual information related to the first content object, wherein the feedback includes feedback provided about a plurality of content objects;retrieving values indicating suitability of each of the plurality of content objects in the context of the first content object, wherein the value indicating suitability is: a sum of feedback provided about the particular content object in the context of the first content object where the feedback is positive,less a sum of feedback provided about the particular content object in the context of the first content object where the feedback is negative,divided by a sum of the sum of feedback where the feedback is positive and the sum of feedback where the feedback is negative;selecting more than one content objects from the plurality of content objects for the playlist based on at least the values indicating suitability, wherein sequence of playback of the more than one content objects of the playlist is determined using at least the values indicating suitability of each of the more than one content objects of the playlist; andtransmitting from the electronic content server a first of the more than one content objects of the playlist to a player at the user terminal in accordance with the sequence of playback.
8. The method of claim 7 wherein the contextual information comprises information relating to the at least one of the following: particular artist, and particular album of the first content object.
9. The method of claim 7 wherein the contextual information comprises information relating to the first content object in the context of a second content object.
10. The method of claim 7 wherein the contextual information comprises information relating to the first content object in the context of characteristics of a second content object.
11. The method of claim 7 wherein the contextual information comprises information relating to the first content object in the context of at least one extrinsic factor, where the at least one extrinsic factor comprises at least one of the following: temporal, geographic, and demographic factors.
12. A method comprising: storing, in a first computer memory, feedback about a first content object from at least one user;storing, in a second computer memory, contextual information relating to context in which the feedback about the first content object was provided, where the contextual information is independent of characteristics of the first content object and the at least one user providing the feedback;retrieving, using a processor in an electronic playlist server, the feedback in the first computer memory and contextual information in the second computer memory;generating, using the processor in the electronic playlist server, a playlist of a plurality of content objects using at least the feedback, wherein order of playback of the first content object of the plurality of content objects in the playlist is determined using at least the contextual information;transmitting from an electronic content server using a content engine each of the plurality of content objects to a player in accordance with the order of playback;storing a suitability quotient of the first content object based on at least the feedback and contextual information relating to a particular context in which the feedback was provided, wherein the suitability quotient is: a sum of all feedback provided about the first content object while in the particular context where all the feedback is positive,less a sum of all feedback provided about the first content object while in the particular context-where all the feedback is negative,divided by a total number of times the first content object was transmitted to a user terminal; andretrieving the suitability quotient;wherein the generating a playlist of content objects further includes using the suitability quotient.
13. A computerized apparatus, comprising: a computer memory configured to store feedback from a plurality of users about a first content object and contextual information relating to a context in which the feedback about the first content object was provided;an electronic playlist component comprising a processor configured to: calculate and store a suitability quotient of the first content object based on the contextual information, wherein the suitability quotient is: a sum of feedback provided about the first content object based on the contextual information where the feedback is positive,less a sum of feedback provided about the first content object based on the contextual information where the feedback is negative,divided by a sum of the sum of feedback where the feedback is positive and the sum of feedback where the feedback is negative;retrieve the feedback, the contextual information, and the suitability quotient for use in generating a playlist, if the sum of positive feedback plus the sum of negative feedback exceeds a threshold amount; andgenerate an playlist of content objects; andan electronic content component comprising a content engine configured to transmit each of the content objects of the playlist of content objects to a media player.
14. The computerized apparatus of claim 13, wherein the first content object of the playlist of content objects is transmitted in accordance with an order of playback determined using at least the contextual information.

Parent Case Info

This application is a continuation-in-part of U.S. patent application Ser. No. 11/279,567, filed Apr. 13, 2006, which is a continuation-in-part of U.S. patent application Ser. No. 11/295,339, filed Dec. 6, 2005, which is a continuation-in-part of U.S. patent application Ser. No. 10/150,876, filed May 16, 2002, now U.S. Pat. No. 7,003,515. This application also claims priority to provisional U.S. Patent Application Ser. No. 60/291,821, filed May 16, 2001. The entire disclosures of U.S. patent application Ser. Nos. 11/279,567, 11/295,339, 10/150,876 and 60/291,821 are hereby incorporated by reference.

US Referenced Citations (353)

Number	Name	Date	Kind
3935379	Thornburg	Jan 1976	A
3947882	Lightner	Mar 1976	A
4061890	Froeschle	Dec 1977	A
4158756	Keezer	Jun 1979	A
4191472	Mason	Mar 1980	A
4227220	Brown	Oct 1980	A
4513315	Dekker et al.	Apr 1985	A
4546342	Weaver	Oct 1985	A
4549631	Bose	Oct 1985	A
4577069	Keezer	Mar 1986	A
4703465	Parker	Oct 1987	A
4729016	Alkofer	Mar 1988	A
4739514	Short	Apr 1988	A
4761642	Huntzinger	Aug 1988	A
4775935	Yourick	Oct 1988	A
4780758	Lin et al.	Oct 1988	A
4788675	Jones	Nov 1988	A
4789980	Darcie et al.	Dec 1988	A
4792968	Katz	Dec 1988	A
4851931	Parker	Jul 1989	A
4852910	Taffer	Aug 1989	A
4866515	Tagawa et al.	Sep 1989	A
4870515	Stokes	Sep 1989	A
4885747	Foglia	Dec 1989	A
4890320	Monslow et al.	Dec 1989	A
4891633	Imazeki et al.	Jan 1990	A
4937807	Weitz	Jun 1990	A
4939714	Yamagishi	Jul 1990	A
4974173	Stefik et al.	Nov 1990	A
4975690	Torres	Dec 1990	A
4996642	Hey	Feb 1991	A
5001554	Johnson et al.	Mar 1991	A
5041972	Frost	Aug 1991	A
5054360	Lisle	Oct 1991	A
5072412	Henderson, Jr. et al.	Dec 1991	A
5092424	Schreiber	Mar 1992	A
5121478	Rao	Jun 1992	A
5124911	Sack	Jun 1992	A
5131048	Farenelli	Jul 1992	A
5132992	Yurt	Jul 1992	A
5168481	Culbertson	Dec 1992	A
5197101	Mok	Mar 1993	A
5210820	Kenyon	May 1993	A
5237157	Kaplan	Aug 1993	A
5250745	Tsumura	Oct 1993	A
5261823	Kurokawa	Nov 1993	A
5272700	Hansen et al.	Dec 1993	A
5274836	Lux	Dec 1993	A
5278751	Adiano et al.	Jan 1994	A
5291395	Abecassis	Mar 1994	A
5298671	Bliss	Mar 1994	A
5303302	Burrows	Apr 1994	A
5333135	Wendorf	Jul 1994	A
5351234	Beierle et al.	Sep 1994	A
5355302	Martin	Oct 1994	A
5365264	Inoue et al.	Nov 1994	A
5371551	Logan et al.	Dec 1994	A
5408630	Moss	Apr 1995	A
5410344	Graves et al.	Apr 1995	A
5418713	Allen	May 1995	A
5441415	Lee et al.	Aug 1995	A
5444489	Truong et al.	Aug 1995	A
5445295	Brown	Aug 1995	A
5446891	Kaplan et al.	Aug 1995	A
5469206	Strubbe et al.	Nov 1995	A
5469219	Mortensen	Nov 1995	A
5481509	Knowles	Jan 1996	A
5483278	Strubbe et al.	Jan 1996	A
5485221	Banker et al.	Jan 1996	A
5485518	Hunter	Jan 1996	A
5486645	Suh et al.	Jan 1996	A
5499047	Terry et al.	Mar 1996	A
5502601	Scheffler	Mar 1996	A
5508984	Goto	Apr 1996	A
5510573	Cho	Apr 1996	A
5533183	Henderson, Jr. et al.	Jul 1996	A
5534911	Levitan	Jul 1996	A
5539477	Miyajima	Jul 1996	A
5541638	Story	Jul 1996	A
5541919	Yong et al.	Jul 1996	A
5550575	West	Aug 1996	A
5550746	Jacobs	Aug 1996	A
5557541	Schulhof	Sep 1996	A
5564002	Brown	Oct 1996	A
5565910	Rowse et al.	Oct 1996	A
5573953	Marnie et al.	Nov 1996	A
5581795	Maupin	Dec 1996	A
5583868	Rashid et al.	Dec 1996	A
5586121	Moura et al.	Dec 1996	A
5592511	Schoen	Jan 1997	A
5594601	Mimick	Jan 1997	A
5594726	Thompson et al.	Jan 1997	A
5594792	Chouraki et al.	Jan 1997	A
5608446	Carr et al.	Mar 1997	A
5610774	Hayashi	Mar 1997	A
5610893	Soga	Mar 1997	A
5611607	Kuzara	Mar 1997	A
5616876	Cluts	Apr 1997	A
5619250	McClellan et al.	Apr 1997	A
5619425	Funahashi	Apr 1997	A
5625608	Grewe	Apr 1997	A
5633839	Alexander	May 1997	A
5634021	Rosenberg et al.	May 1997	A
5634051	Thomson	May 1997	A
5634101	Blau	May 1997	A
5635980	Lin et al.	Jun 1997	A
5636276	Brugger	Jun 1997	A
5648628	Ng	Jul 1997	A
5652627	Allen	Jul 1997	A
5652749	Davenport et al.	Jul 1997	A
5668948	Belknap et al.	Sep 1997	A
5668997	Lynch-Freshner et al.	Sep 1997	A
5670730	Grewe	Sep 1997	A
5675734	Hair	Oct 1997	A
5675784	Maxwell et al.	Oct 1997	A
5679911	Moriyama	Oct 1997	A
5682550	Brown et al.	Oct 1997	A
5695400	Fennell, Jr. et al.	Dec 1997	A
5696965	Dedrick	Dec 1997	A
5708845	Wistendahl et al.	Jan 1998	A
5708961	Hylton et al.	Jan 1998	A
5717923	Dedrick	Feb 1998	A
5719344	Pawate	Feb 1998	A
5719786	Nelson et al.	Feb 1998	A
5721878	Otlesen et al.	Feb 1998	A
5722041	Freadman	Feb 1998	A
5724567	Rose et al.	Mar 1998	A
5726909	Krikorian	Mar 1998	A
5732216	Logan et al.	Mar 1998	A
5734119	France	Mar 1998	A
5734719	Tsevdos	Mar 1998	A
5734720	Salganicoff	Mar 1998	A
5737747	Vishlitzky et al.	Apr 1998	A
5739451	Winksy	Apr 1998	A
5740134	Peterson	Apr 1998	A
5740549	Reilly et al.	Apr 1998	A
5745095	Parchem et al.	Apr 1998	A
5745685	Kirchner et al.	Apr 1998	A
5749081	Whiteis	May 1998	A
5754771	Epperson et al.	May 1998	A
5754773	Ozden et al.	May 1998	A
5754938	Herz et al.	May 1998	A
5754939	Herz et al.	May 1998	A
5758257	Herz et al.	May 1998	A
5760822	Coutinho	Jun 1998	A
5768280	Way	Jun 1998	A
5781227	Goode et al.	Jul 1998	A
5781449	Rosborough	Jul 1998	A
5781734	Ohno et al.	Jul 1998	A
5781889	Martin	Jul 1998	A
5793980	Glaser et al.	Aug 1998	A
5798923	Laskowski	Aug 1998	A
5801747	Bedard	Sep 1998	A
5805804	Laursen et al.	Sep 1998	A
5809246	Goldman	Sep 1998	A
5812123	Rowe et al.	Sep 1998	A
5819160	Foladare	Oct 1998	A
5819273	Vora et al.	Oct 1998	A
5822524	Chen et al.	Oct 1998	A
5822543	Dunn et al.	Oct 1998	A
5822744	Kesel	Oct 1998	A
5825829	Borazjani et al.	Oct 1998	A
5835087	Herz et al.	Nov 1998	A
5835727	Wong et al.	Nov 1998	A
5841979	Schulhof	Nov 1998	A
5848396	Gerace	Dec 1998	A
5848404	Hafner et al.	Dec 1998	A
5850340	York	Dec 1998	A
5850433	Rondeau	Dec 1998	A
5855015	Shoham	Dec 1998	A
5857177	Alstr.o slashed.m et al.	Jan 1999	A
5864672	Bodeep et al.	Jan 1999	A
5864682	Porter et al.	Jan 1999	A
5864868	Contois	Jan 1999	A
5870723	Pare, Jr. et al.	Feb 1999	A
5882262	Balhorn	Mar 1999	A
5889765	Gibbs	Mar 1999	A
5889949	Charles	Mar 1999	A
5890152	Rapaport et al.	Mar 1999	A
5893095	Jain et al.	Apr 1999	A
5896179	Eglit	Apr 1999	A
5897639	Greef et al.	Apr 1999	A
5907843	Cleron et al.	May 1999	A
5911131	Vig	Jun 1999	A
5912676	Malladi et al.	Jun 1999	A
5913204	Kelly	Jun 1999	A
5915094	Kouloheris et al.	Jun 1999	A
5917810	De Bot	Jun 1999	A
5918223	Blum et al.	Jun 1999	A
5920856	Syeda-Mahmood	Jul 1999	A
5923385	Mills et al.	Jul 1999	A
5923627	Miwa et al.	Jul 1999	A
5926207	Vaughan et al.	Jul 1999	A
5926624	Katz	Jul 1999	A
5929850	Broadwin et al.	Jul 1999	A
5931901	Wolf et al.	Aug 1999	A
5936660	Gurantz	Aug 1999	A
5945988	Williams et al.	Aug 1999	A
5953044	Kato et al.	Sep 1999	A
5953348	Barn	Sep 1999	A
5956716	Kenner et al.	Sep 1999	A
5959945	Kleiman	Sep 1999	A
5960411	Hartman et al.	Sep 1999	A
5960445	Tamori et al.	Sep 1999	A
5963916	Kaplan	Oct 1999	A
5963957	Hoffberg	Oct 1999	A
5966440	Hair	Oct 1999	A
5969283	Looney et al.	Oct 1999	A
5973683	Cragun et al.	Oct 1999	A
5974441	Rogers et al.	Oct 1999	A
5982363	Naiff	Nov 1999	A
5983200	Stotznick	Nov 1999	A
5983218	Syeda-Mahmood	Nov 1999	A
5986200	Curtain	Nov 1999	A
5987525	Roberts	Nov 1999	A
5991374	Hazenfield	Nov 1999	A
5991735	Gerace	Nov 1999	A
6009422	Ciccarelli	Dec 1999	A
6009465	Decker et al.	Dec 1999	A
6014706	Cannon et al.	Jan 2000	A
6017219	Adams, Jr. et al.	Jan 2000	A
6018343	Wang et al.	Jan 2000	A
6018768	Ullman et al.	Jan 2000	A
6020883	Herz et al.	Feb 2000	A
6026388	Liddy et al.	Feb 2000	A
6026398	Brown et al.	Feb 2000	A
6029165	Gable	Feb 2000	A
6029195	Herz	Feb 2000	A
6031795	Wehmeyer	Feb 2000	A
6031797	Van Ryzin	Feb 2000	A
6031818	Lo et al.	Feb 2000	A
6038591	Wolfe et al.	Mar 2000	A
6038610	Belfiore et al.	Mar 2000	A
6041311	Chislenko et al.	Mar 2000	A
6047327	Tso et al.	Apr 2000	A
6049797	Guha et al.	Apr 2000	A
6052819	Barker et al.	Apr 2000	A
6060997	Taubenheim et al.	May 2000	A
6061680	Scherf	May 2000	A
6064379	DeMoney	May 2000	A
6070160	Geary	May 2000	A
6084553	Walls et al.	Jul 2000	A
6085185	Matsuzawa et al.	Jul 2000	A
6088722	Herz et al.	Jul 2000	A
6091725	Cheriton et al.	Jul 2000	A
6093880	Arnalds	Jul 2000	A
6108686	Williams et al.	Aug 2000	A
6118450	Proehl	Sep 2000	A
6125387	Simonoff et al.	Sep 2000	A
6128255	Yankowski	Oct 2000	A
6134547	Huxley	Oct 2000	A
6134590	Perlman	Oct 2000	A
6154773	Roberts	Nov 2000	A
6161142	Wolfe et al.	Dec 2000	A
6182122	Berstis	Jan 2001	B1
6182126	Nathan	Jan 2001	B1
6186794	Brown et al.	Feb 2001	B1
6192340	Abecassis	Feb 2001	B1
6199076	Logan et al.	Mar 2001	B1
6223210	Hickey	Apr 2001	B1
6230200	Forecast et al.	May 2001	B1
6232539	Looney et al.	May 2001	B1
6237786	Ginter et al.	May 2001	B1
6240423	Hirata	May 2001	B1
6240550	Nathan	May 2001	B1
6243725	Hempleman	Jun 2001	B1
6269275	Slade	Jul 2001	B1
6288991	Kajiyama et al.	Sep 2001	B1
6292440	Lee	Sep 2001	B1
6295555	Goldman	Sep 2001	B1
6313833	Knight	Nov 2001	B1
6314094	Boys	Nov 2001	B1
6338044	Cook et al.	Jan 2002	B1
6345256	Milsted et al.	Feb 2002	B1
6346951	Mastronardi	Feb 2002	B1
6349339	Williams	Feb 2002	B1
6351736	Weisberg et al.	Feb 2002	B1
6353822	Lieberman	Mar 2002	B1
6385596	Wiser et al.	May 2002	B1
6389403	Dorak, Jr.	May 2002	B1
6397189	Martin	May 2002	B1
6411724	Vaithilingam et al.	Jun 2002	B1
6418421	Hurtado et al.	Jul 2002	B1
6434621	Pezzillo et al.	Aug 2002	B1
6446080	Van Ryzin	Sep 2002	B1
6526411	Ward	Feb 2003	B1
6571390	Dunn et al.	May 2003	B1
6587127	Leeke et al.	Jul 2003	B1
6587837	Spagna et al.	Jul 2003	B1
6588015	Eyer et al.	Jul 2003	B1
6657117	Weare et al.	Dec 2003	B2
6662195	Langseth et al.	Dec 2003	B1
6741869	Lehr	May 2004	B1
6748427	Drosset et al.	Jun 2004	B2
6763345	Hempleman	Jul 2004	B1
6769009	Reisman	Jul 2004	B1
6774926	Ellis et al.	Aug 2004	B1
6813711	Dimenstein	Nov 2004	B1
6819963	Riley	Nov 2004	B2
6820063	England et al.	Nov 2004	B1
6879963	Rosenberg	Apr 2005	B1
6931451	Logan et al.	Aug 2005	B1
6933433	Porteus	Aug 2005	B1
6953886	Looney et al.	Oct 2005	B1
6983371	Hurtado et al.	Jan 2006	B1
6993290	Gebis et al.	Jan 2006	B1
6993532	Platt	Jan 2006	B1
7022905	Hinman	Apr 2006	B1
7028082	Rosenberg et al.	Apr 2006	B1
7072846	Robinson	Jul 2006	B1
7072932	Stahl	Jul 2006	B1
7076561	Rosenberg et al.	Jul 2006	B1
7133924	Rosenberg et al.	Nov 2006	B1
7158169	Farber et al.	Jan 2007	B1
7185355	Ellis et al.	Feb 2007	B1
7194687	Sezan et al.	Mar 2007	B2
7205471	Looney et al.	Apr 2007	B2
7206748	Gruse et al.	Apr 2007	B1
7216299	Knight	May 2007	B2
7231175	Ellis	Jun 2007	B2
7269564	Milsted et al.	Sep 2007	B1
7275256	Del Beccaro et al.	Sep 2007	B1
7320025	Steinberg et al.	Jan 2008	B1
7321923	Rosenberg et al.	Jan 2008	B1
7325043	Rosenberg et al.	Jan 2008	B1
7346558	Rosenberg	Mar 2008	B2
7555539	Rosenberg et al.	Jun 2009	B1
20010013123	Freeman et al.	Aug 2001	A1
20010018858	Dwek	Sep 2001	A1
20020010759	Hitson et al.	Jan 2002	A1
20020037083	Weare et al.	Mar 2002	A1
20020041692	Seto et al.	Apr 2002	A1
20020082901	Dunning et al.	Jun 2002	A1
20020107941	Katz et al.	Aug 2002	A1
20020199186	Ali et al.	Dec 2002	A1
20030055516	Gang et al.	Mar 2003	A1
20030089218	Gang et al.	May 2003	A1
20030105718	Hurtado et al.	Jun 2003	A1
20030135464	Mourad et al.	Jul 2003	A1
20030236582	Zamir et al.	Dec 2003	A1
20050210101	Janik	Sep 2005	A1
20060173838	Garg et al.	Aug 2006	A1
20060184431	Rosenberg	Aug 2006	A1
20070058042	Farber	Mar 2007	A1
20070079327	Khoo et al.	Apr 2007	A1
20070180063	Qureshey et al.	Aug 2007	A1
20070256021	Prager et al.	Nov 2007	A1
20070282708	Rosenberg	Dec 2007	A1
20080046958	Del Beccaro et al.	Feb 2008	A1
20080104106	Rosenberg et al.	May 2008	A1
20080140239	Rosenberg et al.	Jun 2008	A1
20080140717	Rosenberg et al.	Jun 2008	A1
20080196070	White et al.	Aug 2008	A1

Foreign Referenced Citations (16)

Number	Date	Country
739924	Jul 1998	AU
1 657 721	May 2006	EP
1 705 661	Sep 2006	EP
2305339	Feb 1997	GB
9318465	Sep 1993	WO
9612255	Apr 1996	WO
9612256	Apr 1996	WO
9612257	Apr 1996	WO
9612258	Apr 1996	WO
9612259	Apr 1996	WO
9617451	Jun 1996	WO
9702537	Jan 1997	WO
9833320	Jul 1998	WO
9848532	Oct 1998	WO
9908193	Feb 1999	WO
9939466	Aug 1999	WO

Related Publications (1)

	Number	Date	Country
	20060212444 A1	Sep 2006	US

Provisional Applications (1)

	Number	Date	Country
	60291821	May 2001	US

Continuation in Parts (3)

	Number	Date	Country
Parent	11279567	Apr 2006	US
Child	11380563		US
Parent	11295339	Dec 2005	US
Child	11279567		US
Parent	10150876	May 2002	US
Child	11295339		US

Methods and systems for utilizing contextual feedback to generate and modify playlists

Information

Patent Number

Date Filed

Date Issued

Inventors

Original Assignees

Examiners

Agents

CPC

US Classifications

Field of Search

US

International Classifications

Term Extension

Abstract