CONTENT MANAGEMENT PLATFORM APPARATUS, METHODS, AND SYSTEMS

• US 20140223099A1
• Filed: 02/06/2013
• Published: 08/07/2014
• Est. Priority Date: 02/06/2013
• Status: Abandoned Application

• Current Assignee: Kidron, Adam
• Original Assignee: Kidron, Adam
• Inventors: Kidron, Adam
• Application Number:
  US13/760,859
• Publication Number:
  US 20140223099A1
• Time in Patent Office: Days
• US Class Current: 711/118
• CPC Class Codes: G06F 12/0806 Multiuser, multiprocessor or multiprocessing cache systems
• CPC Class Codes: G06F 16/435 Filtering based on additional data, e.g. user or group profiles
• CPC Class Codes: G06Q 30/00 Commerce
• CPC Class Codes: G06Q 50/01 Social networking
• CPC Class Codes: H04N 21/252 Processing of multiple end-users' preferences to derive collaborative data
• CPC Class Codes: H04N 21/25891 being end-user preferences retrieval of video data in a video database based on user preferences G06F16/739; arrangements for recognizing users' preferences H04H60/46; user profiles in network data switching protocols H04L67/306; processing of user preferences or user profiles in wireless networks H04W8/18
• CPC Class Codes: H04N 21/26258 for generating a list of items to be played back in a given order, e.g. playlist, or scheduling item distribution according to such list retrieval of multimedia data based on playlists G06F16/40
• CPC Class Codes: H04N 21/4825 using a list of items to be played back in a given order, e.g. playlists
• CPC Class Codes: H04N 21/4826 using recommendation lists, e.g. of programs or channels sorted out according to their score
• CPC Class Codes: H04N 21/632 using a connection between clients on a wide area network, e.g. setting up a peer-to-peer communication via Internet for retrieving video segments from the hard-disk of other client devices broadcast-related systems characterised by transmission among terminal devices H04H60/80; distributed application using peer-to-peer [P2P] networks H04L67/104

Abstract

The CONTENT MANAGEMENT PLATFORM APPARATUSES, METHODS AND SYSTEMS (“CMP”) transform content seed selections and recommendations via CMP components such as discovery and social influence into events and discovery of other contents for users and revenue for right-holders. In one embodiment, the CMP may obtain content discovery supportive information for a universally resolvable user. The CMP may then determine apportionment heuristics among the obtained information for the user. In one implementation, the CMP may identify a first set of universally resolvable content items based on the determined apportionment heuristics and may create a caching queue that includes the identified first set of universally resolvable content items. The first set of universally resolvable content items in the caching queue may then be provided to the user.

Claims

1. An apportionment heuristics based caching processor-implemented method, comprising the steps of:

obtaining content discovery supportive information for a universally resolvable user;

determining apportionment heuristics among the obtained information for the user;

identifying a first set of universally resolvable content items based on the determined apportionment heuristics;

creating a caching queue that includes the identified first set of universally resolvable content items; and

providing the first set of universally resolvable content items in the caching queue to the user.

2. The method of claim 1, wherein:

said step of providing the first set of universally resolvable content items is in response to a request for transmission that is triggered when a client device bandwidth usage is below a pre-determined threshold.

3. The method of claim 1, wherein:

said step of providing the first set of universally resolvable content items is in response to a request for transmission that is triggered in accordance with user specified caching criteria.

4. The method of claim 1, wherein the first set of universally resolvable content items are arranged in a predefined download order in the caching queue.

5. The method of claim 1, wherein the apportionment heuristics includes the user'"'"'s entity graph.

6. The method of claim 5, wherein the user'"'"'s entity graph includes at least one of a social graph and an interest graph.

7. The method of claim 1, wherein the apportionment heuristics includes user-specific usage.

8. The method of claim 1, wherein the apportionment heuristics includes aggregate usage.

9. The method of claim 1, wherein the apportionment heuristics includes preference profile.

10. The method of claim 9, wherein the preference profile is associated with at least one of a user or a group of users, and indicative of preference for at least one of:

(i) genres, (ii) artists, (iii) albums, (iv) tracks, (v) music attributes, (vi) location based preferences, and (vii) time based preferences.

11. The method of claim 1, wherein the apportionment heuristics includes social recommendations.

12. The method of claim 1, wherein the content discovery supportive information is updated based on an activity associated with one or more users.

13. The method of claim 12, further comprising:

obtaining the updated content discovery supportive information for the universally resolvable content user;

determining updated apportionment heuristics among the obtained updated information for the user;

identifying a second set of universally resolvable content items based on the determined updated apportionment heuristics;

updating the caching queue that includes the identified second set of universally resolvable content items; and

providing the second set of universally resolvable content items in the updated caching queue to the user.

14. The method of claim 13, wherein the second set of universally resolvable content items includes at least one content item from the first set of universally resolvable content items.

15. The method of claim 1, wherein the content discovery supportive information includes at least one of:

most frequently played content item, content item rated high, content item rated low, content item shared and content item bookmarked.

16. An apportionment heuristics based caching system, comprising:

a memory;

a processor disposed in communication with said memory, and configured to issue a plurality of processing instructions stored in the memory, wherein the processor issues instructions to;

obtain content discovery supportive information for a universally resolvable user;

determine apportionment heuristics among the obtained information for the user;

identify a first set of universally resolvable content items based on the determined apportionment heuristics;

create a caching queue that includes the identified first set of universally resolvable content items; and

provide the first set of universally resolvable content items in the caching queue to the user.

17. An apportionment heuristics based caching processor-readable medium storing processor-issuable instructions, said instructions comprising:

obtain content discovery supportive information for a universally resolvable user;

determine apportionment heuristics among the obtained information for the user;

identify a first set of universally resolvable content items based on the determined apportionment heuristics;

create a caching queue that includes the identified first set of universally resolvable content items; and

provide the first set of universally resolvable content items in the caching queue to the user.

18. An apportionment heuristics based caching apparatus, comprising:

a memory;

a processor disposed in communication with said memory, and configured to issue a plurality of processing instructions stored in the memory, wherein the processor issues instructions to;

obtain content discovery supportive information for a universally resolvable user;

determine apportionment heuristics among the obtained information for the user;

identify a first set of universally resolvable content items based on the determined apportionment heuristics;

create a caching queue that includes the identified first set of universally resolvable content items; and

provide the first set of universally resolvable content items in the caching queue to the user.

19. An apportionment heuristics based caching processor-implemented method, comprising:

providing content discovery supportive information for a universally resolvable user;

providing an indication of apportionment heuristics among the obtained information for the user;

obtaining an identification of a first set of universally resolvable content items based on the determined apportionment heuristics;

obtaining an indication of creation of a caching queue that includes the identified first set of universally resolvable content items; and

obtaining the first set of universally resolvable content items in the caching queue to the user.

20. The method of claim 19, wherein obtaining the first set of universally resolvable content items is in response to a request for transmission that is triggered when a client device bandwidth usage is below a pre-determined threshold.