Patent US2361820A successfully refreshed from Google Patents.
Patent US4231887A successfully refreshed from Google Patents.
Patent US6487539B1 successfully refreshed from Google Patents.
US6487539B1
Expired / Lapsed
US
⏱️ 0.0 years remaining
Semantic based collaborative filtering
Assignee: eBay Inc
•
Filing: 1999-08-06
•
Granted: 2002-11-26
•
Expires: 2019-08-06
Abstract
Abstract A method for providing product recommendations to customers in an e-commerce environment includes the step of generating content and compatibility representations of products corresponding to a plurality of customers. A similarity function is calculated between pairs of content attributes corresponding to the products. A similarity function is calculated between pairs of compatibility attributes corresponding to the products. The plurality of customers are clustered into a plurality of peer groups. For a given customer, a closest peer group of the plurality of peer groups is determined. At least one potential recommendation is then generated for the given customer based on the closest peer group.
Inventors
- 👤 Charu C. Aggarwal
- 👤 Philip S. Yu
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-28 20:48
CPC Classifications
G; G06; G06Q; G06Q30/00; G06Q30/02; G06Q30/0207; G06Q30/0222; G06Q30/0224
Claims Analysis
Total Claims: 28
Claim 1
Independent Claim
124 words
A method for providing product recommendations to customers in an e-commerce environment, comprising the steps of: extracting content information from products corresponding to a plurality of customers; generating content representations of the products from the content information; generating compatibility representations of the products; calculating a similarity function between pairs of content attributes corresponding to the products; calculating a similarity function between pairs of compatibility attributes corresponding to the products; clustering the plurality of customers into a plurality of peer groups; for a given customer, determining a closest peer group of the plurality of peer groups based on the similarity functions; and generating at least one potential recommendation for the given customer based on the closest peer group and an absence of explicit customer ratings.
Claim 2
Independent Claim
124 words
A method for providing product recommendations to customers in an e-commerce environment, comprising the steps of: extracting content information from products corresponding to a plurality of customers; generating content representations of the products from the content information; generating compatibility representations of the products; calculating a similarity function between pairs of content attributes corresponding to the products; calculating a similarity function between pairs of compatibility attributes corresponding to the products; clustering the plurality of customers into a plurality of peer groups; for a given customer, determining a closest peer group of the plurality of peer groups based on the similarity functions; and generating at least one potential recommendation for the given customer based on the closest peer group and an absence of explicit customer ratings.
Claim 3
Dependent Claim
40 words
The method according to claim 1 , wherein said step of generating the content representations comprises the steps of: concatenating product descriptions of the products bought by an individual customer; and calculating a content vector from the concatenated product descriptions.
Claim 4
Dependent Claim
37 words
The method according to claim 1 , wherein said step of generating the content representations further comprises the steps of extracting the product descriptions, when the individual customer at least one of browses and purchases the products.
Claim 5
Dependent Claim
45 words
The method according to claim 1 , wherein said step of generating the compatibility representations further comprises the steps of: calculating a fraction of time that a categorical attribute takes on a given value; and calculating a compatibility vector from the calculated fraction of time.
Claim 6
Dependent Claim
38 words
The method according to claim 1 , wherein said clustering step comprises the step of calculating a similarity function between a pair of categorical values as a predefined function of a support of the pair of categorical values.
Claim 7
Dependent Claim
54 words
The method according to claim 1 , wherein said clustering step comprises the steps of: calculating a content-similarity between a content vector of a particular customer and content centroids of the plurality of customers; and calculating a compatibility-similarity between a compatibility vector of the particular customer and compatibility centroids of the plurality of customers.
Claim 8
Dependent Claim
44 words
The method according to claim 1 , wherein said step of determining the closest peer group comprises the steps of: determining a predetermined number of closest clusters to the given customer; and designating a union of the closest clusters as the closest peer group.
Claim 9
Dependent Claim
50 words
The method according to claim 1 , wherein said step of generating the at least one potential recommendation comprises the steps of: determining most frequently bought products by the customers in the closest peer group; and recommending at least one of the most frequently bought products to the given customer.
Claim 10
Dependent Claim
23 words
The method according to claim 1 , further comprising the step of filtering the at least one potential recommendation using domain specific rules.
Claim 11
Dependent Claim
90 words
The method according to claim 9 , wherein said filtering step comprises the steps of: determining whether any of the domain specific rules are relevant to the given customer and the at least one potential recommendation; determining whether any of the relevant domain specific rules are violated, when any of the domain specific rules are relevant to the given customer and the at least one potential recommendation; and providing the at least one potential recommendation to the given customer, when any of the relevant domain specific rules are not violated.
Claim 12
Dependent Claim
47 words
The method according to claim 10 , wherein said filtering step further comprises the step of providing the at least one potential recommendation to the given customer, when none of the domain specific rules are relevant to the given customer and the at least one potential recommendation.
Claim 13
Dependent Claim
54 words
The method according to claim 10 , wherein a domain specific rule is relevant for the given customer and the at least one potential recommendation when antecedent conditions of the domain specific rule match a buying history of the given customer and a result of the rule satisfies the at least one potential recommendation.
Claim 14
Dependent Claim
46 words
The method according to claim 10 , wherein a domain specific rule is violated when the domain specific rules is relevant to the given customer and the at least one potential recommendation, but a key compatibility attribute does not match the at least one potential recommendation.
Claim 15
Dependent Claim
128 words
A program storage device readable by machine, tangibly embodying a program of instructions executable by the machine to perform steps for providing product recommendations to customers in an e-commerce environment, said method steps comprising: generating content and compatibility representations of products corresponding to a plurality of customers; calculating a similarity function between pairs of content attributes corresponding to the products; calculating a similarity function between pairs of compatibility attributes corresponding to the products; clustering the plurality of customers into a plurality of peer groups; for a given customer, determining a closest peer group of the plurality of peer groups based on the similarity functions; and generating at least one potential recommendation for the given customer based on the closest peer group and an absence of explicit customer ratings.
Claim 16
Dependent Claim
128 words
A program storage device readable by machine, tangibly embodying a program of instructions executable by the machine to perform steps for providing product recommendations to customers in an e-commerce environment, said method steps comprising: generating content and compatibility representations of products corresponding to a plurality of customers; calculating a similarity function between pairs of content attributes corresponding to the products; calculating a similarity function between pairs of compatibility attributes corresponding to the products; clustering the plurality of customers into a plurality of peer groups; for a given customer, determining a closest peer group of the plurality of peer groups based on the similarity functions; and generating at least one potential recommendation for the given customer based on the closest peer group and an absence of explicit customer ratings.
Claim 17
Dependent Claim
42 words
The program storage device according to claim 14 , wherein said step of generating the content representations comprises the steps of: concatenating product descriptions of the products bought by an individual customer; and calculating a content vector from the concatenated product descriptions.
Claim 18
Dependent Claim
39 words
The program storage device according to claim 14 , wherein said step of generating the content representations further comprises the steps of extracting the product descriptions, when the individual customer at least one of browses and purchases the products.
Claim 19
Dependent Claim
47 words
The program storage device according to claim 14 , wherein said step of generating the compatibility representations further comprises the steps of: calculating a fraction of time that a categorical attribute takes on a given value; and calculating a compatibility vector from the calculated fraction of time.
Claim 20
Dependent Claim
40 words
The program storage device according to claim 14 , wherein said clustering step comprises the step of calculating a similarity function between a pair of categorical values as a predefined function of a support of the pair of categorical values.
Claim 21
Dependent Claim
56 words
The program storage device according to claim 14 , wherein said clustering step comprises the steps of: calculating a content-similarity between a content vector of a particular customer and content centroids of the plurality of customers; and calculating a compatibility-similarity between a compatibility vector of the particular customer and compatibility centroids of the plurality of customers.
Claim 22
Dependent Claim
46 words
The program storage device according to claim 14 , wherein said step of determining the closest peer group comprises the steps of: determining a predetermined number of closest clusters to the given customer; and designating a union of the closest clusters as the closest peer group.
Claim 23
Dependent Claim
52 words
The program storage device according to claim 14 , wherein said step of generating the at least one potential recommendation comprises the steps of: determining most frequently bought products by the customers in the closest peer group; and recommending at least one of the most frequently bought products to the given customer.
Claim 24
Dependent Claim
25 words
The program storage device according to claim 14 , further comprising the step of filtering the at least one potential recommendation using domain specific rules.
Claim 25
Dependent Claim
92 words
The program storage device according to claim 22 , wherein said filtering step comprises the steps of: determining whether any of the domain specific rules are relevant to the given customer and the at least one potential recommendation; determining whether any of the relevant domain specific rules are violated, when any of the domain specific rules are relevant to the given customer and the at least one potential recommendation; and providing the at least one potential recommendation to the given customer, when any of the relevant domain specific rules are not violated.
Claim 26
Dependent Claim
49 words
The program storage device according to claim 23 , wherein said filtering step further comprises the step of providing the at least one potential recommendation to the given customer, when none of the domain specific rules are relevant to the given customer and the at least one potential recommendation.
Claim 27
Dependent Claim
56 words
The program storage device according to claim 23 , wherein a domain specific rule is relevant for the given customer and the at least one potential recommendation when antecedent conditions of the domain specific rule match a buying history of the given customer and a result of the rule satisfies the at least one potential recommendation.
Claim 28
Dependent Claim
48 words
The program storage device according to claim 23 , wherein a domain specific rule is violated when the domain specific rules is relevant to the given customer and the at least one potential recommendation, but a key compatibility attribute does not match the at least one potential recommendation.
References Cited (Backward Citations)
US5754938A
Cited
US5835087A
Cited
EP0751471A1
Cited
US5983214A
Cited
WO1998033135A1
Cited
US5924116A
Cited
US6263327B1
Cited
US6307965B1
Cited
US6236975B1
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2005-11-25 | 2006-05-27 | 2006-11-26 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2009-11-25 | 2010-05-27 | 2010-11-26 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2013-11-25 | 2014-05-27 | 2014-11-26 | $7700.00 | Window Closed / Lapsed |