# US 2025/0061507 A1 · Method for obtaining recommended explanation, device, and computer readable medium

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2025/0061507 A1
- Document ID: US20250061507A1
- Status: Published application
- Kind: A1
- Application number: 18/722,879
- Filed: 2023-01-04
- Published: 2025-02-20
- Earliest claimed: 2022-01-27
- Applicants: Beijing Youzhuju Network Technology Co., Ltd.; Lemon Inc.
- Inventors: Yuanshun YAO; Chong WANG; Hang LI
- Web page: https://patentgrep.com/patent/US20250061507A1

## CPC

- G06Q 30/0631: {Recommending goods or services}
- G06Q: INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR

## Abstract

The present disclosure provides a method for obtaining a recommended explanation, a device, and a computer readable medium. The method includes: generating a recommended item by a recommendation model; calculating a similarity between a plurality of explanatory items and the recommended item; obtaining a predetermined number of explanatory items from the plurality of explanatory items, as a recommended explanation of the recommended item, wherein a similarity between the predetermined number of explanatory items and the recommended item is greater than a similarity between other explanatory items and the recommended item; and outputting identification information of the predetermined number of explanatory items.

## Claims

### Claim 1

A method for obtaining a recommended explanation, comprising:
generating a recommended item by a recommendation model;
calculating a similarity between a plurality of explanatory items and the recommended item;
obtaining a predetermined number of explanatory items from the plurality of explanatory items, as a recommended explanation of the recommended item, wherein a similarity between the predetermined number of explanatory items and the recommended item is greater than a similarity between other explanatory items and the recommended item; and
outputting identification information of the predetermined number of explanatory items.

### Claim 2 (depends on 1)

The method according to claim 1, wherein the calculating of the similarity between the plurality of explanatory items and the recommended item comprises:
characterizing the similarity between the plurality of explanatory items and the recommended item by a counterfactual proximity.

### Claim 3 (depends on 2)

The method according to claim 2, further comprising:
before calculating the similarity between the plurality of explanatory items and the recommended item, removing at least a portion of the plurality of explanatory items from a training set, and training the recommendation model by remaining items in the training set;
calculating a loss function value of the recommendation model during each training process; and
determining a recommendation model with a smallest loss function value as a trained recommendation model.

### Claim 4 (depends on 3)

The method according to claim 3, wherein the characterizing of the similarity between the plurality of explanatory items and the recommended item by the counterfactual proximity comprises:
calculating the counterfactual proximity Pc between the plurality of explanatory items and the recommended item by the trained recommendation model:
P
C
=
max
j
∈
I
\
{
i
}
f
⁡
(
j
;
θ
′
)
-
f
⁡
(
i
;
θ
′
)
,
wherein i is the recommended item, I is a set of all items in a system where the recommendation model is located, I\{i} is a set of remaining items in the set I of all items except the recommended item i, f(j; θ′) is a predicted recommendation score for an item j calculated by a recommendation model θ′, f(i; θ′) is a predicted recommendation score for an item i calculated by the recommendation model θ′, and θ′ is the trained recommendation model.

### Claim 5 (depends on 4)

The method according to claim 4, wherein the obtaining of the predetermined number of explanatory items from the plurality of explanatory items comprises:
in response to the predetermined number |Eu,i| of the explanatory items being fixed, traversing C|Iu||Eu,i| combinations of explanatory items, calculating the counterfactual proximity corresponding to each combination of explanatory items, and obtaining a combination of explanatory items with a largest counterfactual proximity, wherein Iu is the set of all items that an user u interacts with, and Eu,i is a set of a part of the items that the user interacts with.

### Claim 6 (depends on 3)

The method according to claim 3, wherein the calculating of the similarity between the plurality of explanatory items and the recommended item comprises:
obtaining a feature vector of each of the plurality of explanatory items and a feature vector of the recommended item from the recommendation model;
calculating a Euclidean distance between the feature vector of each of the plurality of explanatory items and the feature vector of the recommended item;
selecting a fixed number of explanatory items from the plurality of explanatory items as a candidate explanatory item set, wherein a Euclidean distance between a feature vector of each of explanatory items in the candidate explanatory item set and the feature vector of the recommended item is less than a Euclidean distance between a feature vector of each of explanation items other than the candidate explanatory item set in the plurality of explanatory items and the feature vector of the recommended item; and
calculating the counterfactual proximity between explanatory items in the candidate explanatory item set and the recommended item by the trained recommendation model.

### Claim 7 (depends on 6)

The method according to claim 6, wherein the obtaining of the predetermined number of explanatory items from the plurality of explanatory items comprises:
in response to the predetermined number |Eu,i| of the explanatory items being fixed, traversing C|Ic||Eu,i| combinations of explanatory items, calculating the counterfactual proximity corresponding to each combination of explanatory items, and obtaining a combination of explanatory items with a largest counterfactual proximity, wherein Ic is the candidate explanatory item set, and Eu,i is a set of a part of the items that the user interacts with.

### Claim 8 (depends on 5)

The method according to claim 5, further comprising:
outputting a maximum value of the counterfactual proximity.

### Claim 9 (depends on 1)

The method according to claim 1, further comprising:
outputting the similarity between the predetermined number of explanatory items and the recommended item.

### Claim 10 (depends on 9)

The method according to claim 9, wherein the calculating of the similarity between the plurality of explanatory items and the recommended item comprises:
obtaining a feature vector of each of the plurality of explanatory items and a feature vector of the recommended item from the recommendation model; and
calculating a Euclidean distance between the feature vector of each of the plurality of explanatory items and the feature vector of the recommended item, the similarity between the each of the plurality of explanatory items and the recommended item being characterized by the Euclidean distance, wherein the less the Euclidean distance, the greater the similarity.

### Claim 11 (depends on 10)

The method according to claim 10, wherein the obtaining of the predetermined number of explanatory items from the plurality of explanatory items comprises:
selecting the predetermined number of explanatory items from the plurality of explanatory items, wherein a Euclidean distance between a feature vector of each of the predetermined number of explanatory items and the feature vector of the recommended item is less than a Euclidean distance between a feature vector of each of other explanatory items and the feature vector of the recommended item.

### Claim 12 (depends on 11)

The method according to claim 11, wherein the outputting of the similarity between the predetermined number of explanatory items and the recommended item comprises:
calculating an average of Euclidean distances between feature vectors of the predetermined number of explanatory items and the feature vector of the recommended item; and
outputting the average of Euclidean distances.

### Claim 13 (depends on 1)

The method according to claim 1, wherein the similarity between the plurality of explanatory items and the recommended item comprises:
a similarity between tags of the plurality of explanatory items and a tag of the recommended item, a similarity between features of the plurality of explanatory items and a feature of the recommended item, a similarity between reviews of the plurality of explanatory items and a review of the recommended item, or a similarity of user feedback information of the plurality of explanatory items and user feedback information of the recommended item.

### Claim 14

(canceled)

### Claim 15

An electronic device, comprising:
a memory; and
a processor coupled to the memory having stored therein instructions that, when executed by the processor, cause the electronic device to:
generate a recommended item by a recommendation model;
calculate a similarity between a plurality of explanatory items and the recommended item;
obtain a predetermined number of explanatory items from the plurality of explanatory items, as a recommended explanation of the recommended item, wherein a similarity between the predetermined number of explanatory items and the recommended item is greater than a similarity between other explanatory items and the recommended item; and
output identification information of the predetermined number of explanatory items.

### Claim 16

A non-transitory computer readable storage medium having stored thereon computer program which, when executed by a processor, causes the processor to:
generate a recommended item by a recommendation model;
calculate a similarity between a plurality of explanatory items and the recommended item;
obtain a predetermined number of explanatory items from the plurality of explanatory items, as a recommended explanation of the recommended item, wherein a similarity between the predetermined number of explanatory items and the recommended item is greater than a similarity between other explanatory items and the recommended item; and
output identification information of the predetermined number of explanatory items.

### Claim 17

(canceled)

### Claim 18 (depends on 15)

The electronic device according to claim 15, wherein the instructions, when executed by the processor, cause the electronic device to characterize the similarity between the plurality of explanatory items and the recommended item by a counterfactual proximity.

### Claim 19 (depends on 18)

The electronic device according to claim 18, wherein the instructions, when executed by the processor, further cause the electronic device to:
before calculating the similarity between the plurality of explanatory items and the recommended item, remove at least a portion of the plurality of explanatory items from a training set, and train the recommendation model by remaining items in the training set;
calculate a loss function value of the recommendation model during each training process; and
determine a recommendation model with a smallest loss function value as a trained recommendation model.

### Claim 20 (depends on 19)

The electronic device according to claim 19, wherein the instructions, when executed by the processor, cause the electronic device to calculate the counterfactual proximity Pc between the plurality of explanatory items and the recommended item by the trained recommendation model:
P
C
=
max
j
∈
I
\
{
i
}
f
⁡
(
j
;
θ
′
)
-
f
⁡
(
i
;
θ
′
)
,
wherein i is the recommended item, I is a set of all items in a system where the recommendation model is located, I\{i} is a set of remaining items in the set I of all items except the recommended item i, f(j; θ′) is a predicted recommendation score for an item j calculated by a recommendation model θ′, f(i; θ′) is a predicted recommendation score for an item i calculated by the recommendation model θ′, and θ′ is the trained recommendation model.

### Claim 21 (depends on 16)

The non-transitory computer readable storage medium according to claim 16, wherein the computer program, when executed by a processor, causes the processor to characterize the similarity between the plurality of explanatory items and the recommended item by a counterfactual proximity.

### Claim 22 (depends on 21)

The non-transitory computer readable storage medium according to claim 21, wherein the computer program, when executed by a processor, further causes the processor to:
before calculating the similarity between the plurality of explanatory items and the recommended item, remove at least a portion of the plurality of explanatory items from a training set, and train the recommendation model by remaining items in the training set;
calculate a loss function value of the recommendation model during each training process; and
determine a recommendation model with a smallest loss function value as a trained recommendation model.
