TECHNIQUE FOR AGGREGATING CONTENT FROM A COMMON GRAPH EDGE

Described herein are techniques for processing content items for presentation via a content feed of an online service. Upon receiving a request associated with a particular end-user of an online service for a content feed, a connection graph is analyzed to identify a plurality of content items that...

Full description

Saved in:
Bibliographic Details
Main Authors HU, Kangning, LIU, Heyang, LIN, Xiang, WELSON, Garrett Gabriel, XUAN, Ying, CHOI, Samson Hin-Leung, YEN, Collin Dang, QIU, Fangbing, Hung, James, SHARMA, Diya Dutt, JIANG, Yanbin, SOMAIYA, Manas Haribhai
Format Patent
LanguageEnglish
Published 16.06.2022
Subjects
CALCULATING
COMPUTING
COUNTING
ELECTRIC DIGITAL DATA PROCESSING
PHYSICS
Online AccessGet full text

Cover

More Information
Summary:Described herein are techniques for processing content items for presentation via a content feed of an online service. Upon receiving a request associated with a particular end-user of an online service for a content feed, a connection graph is analyzed to identify a plurality of content items that are eligible for presentation to the end-user. Some subset of content items that share a common relationship with the end-user, as indicated by a common edge in the connection graph, are identified. This subset of content items is then grouped together for presentation within the content feed in a content carousel, where the content carousel is positioned within the content feed, relative to other content items, based on the highest ranking content item presented via the content carousel.
Bibliography:Application Number: US202017118368