PERSONAL MUSIC RECOMMENDATION MAPPING
First Claim
Patent Images
1. A method for analysis and visualization mapping of music data comprising the steps of:
- (a) receiving a playlist comprising track ids for the corresponding tracks;
(b) accessing a recommender database or service, and retrieving a predetermined number of recommended track ids responsive to the playlist track ids, each recommended track id including respective strength metrics, the playlist ids and the recommended ids together forming a dataset;
(c) removing recommendation track ids that do not share at least a predetermined minimum number of occurrences within the dataset neighborhood, so as to reduce the dataset to a manageable proportion for visualization display;
(d) sorting the recommended track ids by popularity;
(e) retaining only a predetermined number of the overall most popular recommendation tracks to reduce the size of the dataset for visualization display;
(f) constructing a matrix from the pair-wise recommendation strengths between each pair of tracks in the reduced dataset, wherein the diagonal of the matrix is that track'"'"'s overall popularity as indicated in a selected resource;
(g) calculating a row-wise Euclidean distance across the matrix;
(h) applying a metric MDS (multi-dimensional scaling) method to the matrix to determine the predominate eigenvectors (dimensions) of the matrix;
(i) based on the predominate eigenvectors, determining a 2-dimensional map position for each of the playlist tracks and the recommended tracks; and
(j) plotting a visualization map of the reduced dataset on a graphic display screen in accordance with the 2-dimensional map position for each track.
5 Assignments
0 Petitions
Accused Products
Abstract
Scale free network datasets, such as music tracks, playlists and other media item recommendations are analyzed and presented in a graphic map display (FIG. 1) for visualization, preferably in an interactive environment (FIG. 2). A plotting and visualization system generally comprises a network extraction routine, coupled with a high performance eigendecomposition (map layout calculation) algorithm, and a novel visualization interaction methodology.
119 Citations
20 Claims
-
1. A method for analysis and visualization mapping of music data comprising the steps of:
-
(a) receiving a playlist comprising track ids for the corresponding tracks; (b) accessing a recommender database or service, and retrieving a predetermined number of recommended track ids responsive to the playlist track ids, each recommended track id including respective strength metrics, the playlist ids and the recommended ids together forming a dataset; (c) removing recommendation track ids that do not share at least a predetermined minimum number of occurrences within the dataset neighborhood, so as to reduce the dataset to a manageable proportion for visualization display; (d) sorting the recommended track ids by popularity; (e) retaining only a predetermined number of the overall most popular recommendation tracks to reduce the size of the dataset for visualization display; (f) constructing a matrix from the pair-wise recommendation strengths between each pair of tracks in the reduced dataset, wherein the diagonal of the matrix is that track'"'"'s overall popularity as indicated in a selected resource; (g) calculating a row-wise Euclidean distance across the matrix; (h) applying a metric MDS (multi-dimensional scaling) method to the matrix to determine the predominate eigenvectors (dimensions) of the matrix; (i) based on the predominate eigenvectors, determining a 2-dimensional map position for each of the playlist tracks and the recommended tracks; and (j) plotting a visualization map of the reduced dataset on a graphic display screen in accordance with the 2-dimensional map position for each track. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9)
-
-
10. A method for analysis and mapping of a network dataset comprising the steps of:
-
(a) accessing a stored digital network dataset in which nodes correspond to individual media items, the weights of connections between network nodes indicate the strength of the connection according to at least one predetermined characteristic; (b) retrieving a selected neighborhood subset of the network dataset so as to form a neighborhood matrix; (c) applying a weighting function to neighborhood matrix, the weighting function selected so as to preserve the variance of each node'"'"'s edge weight distribution; (d) applying a selected Euclidean distance calculation across the matrix so as to make the matrix symmetric; and (e) plotting the resulting matrix data on a graphics display screen apparatus so as to form a 2-dimensional visualization map of the selected neighborhood subset of the network dataset. - View Dependent Claims (11, 12, 13, 14, 15, 16, 17, 18, 19, 20)
-
Specification