CONTENT IDENTIFICATION WITH PRIVACY AND SECURITY
Disclosed examples can relate to obtaining identifications of content (e.g., content recommendations) while keeping at least some interaction data locally private. For a given user and device, content items for which the user may have an affinity can be predicted based on the interactions of the user with other content items. Respective interaction data for respective content items can stay local to the user device by transforming the respective content items into content codes (e.g., determined based on a codebook generated by clustering perceptual values). The affinity for content codes can be transmitted to the server for use in determining identifications of content items to provide to the device.
1 . A computer-implemented method for generating an affinity vector, the computer-implemented method comprising:
receiving, by one or more processors, a set of content items from a device;
determining, by one or more processors, an affinity value for each content item in the set of content items, wherein the affinity value represents a user preference for each content item;
determining, by the one or more processors, a classification code for each content item in the set of content items based on a perceptual value;
creating, by the one or more processors, an affinity vector relating the affinity value to the classification code for each content item in the set of content items;
obscuring, by the one or more processors, the affinity vector by performing one or more differential privacy operations; and
transmitting, by the one or more processors, the obscured affinity vector to a server.
2 . The computer-implemented method of claim 1 , wherein the user preference is indicated by a user interaction with a respective content item of the set of content items, wherein the user interaction represents an indication of like or dislike of the respective content item.
3 . The computer-implemented method of claim 1 , wherein the perceptual value represents a projection of each content item onto a lower-order perceptual space.
4 . The computer-implemented method of claim 1 , wherein the determining the classification code includes utilizing a codebook to determine the perceptual value.
5 . The computer-implemented method of claim 1 , further compromising:
generating, by the one or more processors, a code-affinity data set based on the classification code and the affinity value, wherein the code-affinity data set corresponds to an affinity amount for content items having the classification code.
6 . The computer-implemented method of claim 5 , wherein the code-affinity data set includes a vector of length k, wherein k represents a number of individual classification codes.
7 . The computer-implemented method of claim 1 , further comprising:
creating, by the one or more processors, one or more content-type specific affinity vectors; and
combining, by the one or more processors, at least two of the one or more content-type specific affinity vectors to concatenate different content-types.
8 . The computer-implemented method of claim 1 , the obscuring further comprising:
adding, by the one or more processors, noise to the affinity vector to prevent recognition of individual content items.
9 . A system for generating an affinity vector, the system comprising:
a processor; and
a non-transitory computer readable medium having program instructions stored thereon, which, when executed by the processor, cause the system to perform operations comprising:
receiving, by the processor, a set of content items from a device;
determining, by the processor, an affinity value for each content item in the set of content items, wherein the affinity value represents a user preference for each content item;
determining, by the processor, a classification code for each content item in the set of content items based on a perceptual value;
creating, by the one or more processors, an affinity vector relating the affinity value to the classification code for each content item in the set of content items;
obscuring, by the processor, the affinity vector by performing one or more differential privacy operations; and
transmitting, by the processor, the obscured affinity vector to a server.
10 . The system of claim 9 , wherein the user preference is indicated by a user interaction with a respective content item of the set of content items, wherein the user interaction represents an indication of like or dislike of the respective content item.
11 . The system of claim 9 , wherein the perceptual value represents a projection of each content item onto a lower-order perceptual space.
12 . The system of claim 9 , wherein the determining the classification code includes utilizing a codebook to determine the perceptual value.
13 . The system of claim 9 , further comprising:
generating, by the processor, a code-affinity data set based on the classification code and the affinity value, wherein the code-affinity data set corresponds to an affinity amount for content items having the classification code.
14 . The system of claim 13 , wherein the code-affinity data set includes a vector of length k, wherein k represents a number of individual classification codes.
15 . The system of claim 9 , further comprising:
creating, by the processor, one or more content-type specific affinity vectors; and
combining, by the processor, at least two of the one or more content-type specific affinity vectors to concatenate different content-types.
16 . The system of claim 9 , the obscuring further comprising:
adding, by the processor, noise to the affinity vector to prevent recognition of individual content items.
17 . A non-transitory computer-readable medium configured to store processor-readable instructions for generating an affinity vector, wherein when executed by a processor, the instructions perform operations comprising:
receiving, by a processor, a set of content items from a device;
determining, by the processor, an affinity value for each content item in the set of content items, wherein the affinity value represents a user preference for each content item;
determining, by the processor, a classification code for each content item in the set of content items based on a perceptual value;
creating, by the one or more processors, an affinity vector relating the affinity value to the classification code for each content item in the set of content items;
obscuring, by the processor, the affinity vector by performing one or more differential privacy operations; and
transmitting, by the processor, the obscured affinity vector to a server.
18 . The non-transitory computer-readable medium of claim 17 , wherein the user preference is indicated by a user interaction with a respective content item of the set of content items, wherein the user interaction represents an indication of like or dislike of the respective content item.
19 . The non-transitory computer-readable medium of claim 17 , wherein the perceptual value represents a projection of each respective content item onto a lower-order perceptual space.
20 . The non-transitory computer-readable medium of claim 17 , wherein the determining the classification code includes utilizing a codebook to determine the perceptual value.