Enabling recommendations and community by massively-distributed nearest-neighbor searching

• US 20060020662A1
• Filed: 09/19/2005
• Published: 01/26/2006
• Est. Priority Date: 01/27/2004
• Status: Abandoned Application

• Current Assignee: Emergent Music LLC
• Original Assignee: Emergent Music LLC
• Inventors: Robinson, Gary
• Application Number:
  US11/230,274
• Publication Number:
  US 20060020662A1
• Time in Patent Office: Days
• US Class Current: 709/203
• CPC Class Codes: G06F 15/16 Combinations of two or more digital computers each having at least an arithmetic unit, a program unit and a register, e.g. for a simultaneous processing of several programs coordinating program control therefor G06F9/52; in regulating and control system G05B
• CPC Class Codes: G06Q 10/00 Administration; Management
• CPC Class Codes: G06Q 10/107 Computer-aided management of electronic mailing [e-mailing]
• CPC Class Codes: G06Q 30/02 Marketing; Price estimation or determination; Fundraising
• CPC Class Codes: H04L 12/00 Data switching networks interconnection of, or transfer of information or other signals between, memories, input/output devices or central processing units G06F13/00
• CPC Class Codes: H04L 12/1827 Network arrangements for conference optimisation or adaptation
• CPC Class Codes: H04L 12/185 with management of multicast group membership
• CPC Class Codes: H04L 12/4625 Single bridge functionality, e.g. connection of two networks over a single bridge
• CPC Class Codes: H04L 51/00 User-to-user messaging in packet-switching networks, transmitted according to store-and-forward or real-time protocols, e.g. e-mail
• CPC Class Codes: H04L 51/52 for supporting social networking services

Abstract

The computer associated with each of a potentially large number of end users is harnessed to provide a massively-distributed mechanism for finding the nearest neighbors of each user, according to tastes and/or interests. Once these nearest neighbors are determined, there taste or and/or interest profiles are leveraged for highly accurate recommendations, and their online addresses are leveraged for community purposes.

Claims

1. A networked computer system for supplying recommendations and taste-based community to a target user, comprising:

networked means for providing representations of nearest neighbor candidate taste profiles and associated user identifiers in an order such that said nearest neighbor candidate taste profiles tend to be at least as similar to a taste profile of the target user according to a predetermined similarity metric as are subsequently retrieved ones of said nearest neighbor candidate taste profiles,

means to receive said representations of nearest neighbor candidate taste profiles and associated user identifiers on at least one neighbor-finding user node,

said neighbor-finding user nodes each having at least one similarity metric calculator calculating said predetermined similarity metric based upon said representations of nearest neighbor candidate taste,

at least one selector residing on at least one of said neighbor-finding user nodes using the output of said at least one similarity metric calculator for building a list representing the nearest-neighbor users,

said list representing said nearest-neighbor users providing access to associated ones of said candidate profiles,

a nearest-neighbor based recommender which uses said associated ones of said candidate profiles to recommend items,

a display for viewing identifiers of recommended items,

a display for viewing identifiers of a plurality of nearest neighbor users,

means to select at least one of said nearest neighbor users from said display of identifiers of a plurality of nearest neighbor users,

a display of information relating to at least one of the items in said nearest neighbor user'"'"'s collection,

whereby massively distributed processing is harnessed in a bandwidth-conserving way for finding the best neighbors out of the entire population of users, and the same neighborhood is leveraged to provide recommendations as well as highly focused taste-based community for sharing the enjoyment of items including recommended items

2. The networked computer system of claim 1, further including means to facilitate communication with at least said nearest neighbor users where the type of communication comprises at least one selected from the group consisting of online chat, email, online discussion boards, voice, and video.

4. The networked computer system claim 1, further including a single downloadable file that contains software that executes all necessary non-server computer instructions.

3. A networked computer system for supplying recommendations and taste-based community to a target user, comprising

an ordered plurality of nearest neighbor candidate taste profiles and associated user identifiers such that said nearest neighbor candidate taste profiles tend to be at least as similar to a taste profile of the target user according to a predetermined similarity metric as are subsequently positioned ones of said nearest neighbor candidate taste profiles,

networked means to receive said nearest neighbor candidate taste profiles and associated user identifiers on at least one neighbor-finding user node,

said neighbor-finding user nodes each having at least one similarity metric calculator calculating said predetermined similarity metric,

at least one selector residing on at least one of said neighbor-finding user nodes using the output of said at least one similarity metric calculator for building a list representing the nearest-neighbor users,

said list representing said nearest-neighbor users providing access to associated ones of said candidate profiles,

a nearest-neighbor based recommender which uses said associated ones of said a nearest-neighbor based recommender which uses said associated ones of said candidate profiles to recommend items,

a display for viewing identifiers of recommended items,

a display for viewing identifiers of a plurality of nearest neighbor users,

means to select at least one of said nearest neighbor users from said display of identifiers of a plurality of nearest neighbor users,

a display of information relating to at least one of the items in said nearest neighbor user'"'"'s collection,

whereby massively distributed processing is harnessed in a bandwidth-conserving way for finding the best neighbors out of the entire population of users, and the same neighborhood is leveraged to provide recommendations as well as highly focused taste-based community for sharing the enjoyment of items including recommended items