Unsupervised user segment discovery system
AssigneeContent Square SAS
InventorsMohammad Reza Loghmani, Mouad Antari
Life of this patent
Estimating the term…
Abstract
A computing system generates and a plurality of clusters by clustering the session representations based on similarity between session representations, the plurality of clusters comprising an optimal number of clusters based on key performance indicators corresponding to each cluster of the plurality of clusters. The computing system determines a medoid of each of the plurality of clusters, and then for each session representation generated for each of a second plurality of sessions, the computing system computes a distance between the session representation and each medoid to determine a nearest medoid and assigns the session representation to a cluster associated with the nearest medoid.
Claims20
A computer-implemented method, comprising:
- generating, for each of a first plurality of sessions, a session representation indicating an order through which a user navigated through a plurality of webpages during the session;
- generating a plurality of clusters by clustering the session representations based on similarity between session representations, the plurality of clusters comprising an optimal number of clusters based on key performance indicators corresponding to each cluster of the plurality of clusters;
- generating, for each of a second plurality of sessions, a session representation indicating an order through which a user navigated through a plurality of webpages during the session;
- determining a medoid of each of the plurality of clusters;
- and
- for each session representation generated for each of the second plurality of sessions, performing operations comprising:
- computing a distance between the session representation and each medoid to determine a nearest medoid;
- and
- assigning the session representation to a cluster associated with the nearest medoid.
A computing system comprising:
- a processor;
- and
- a memory storing instructions that, when executed by the processor, configure the computing system to perform operations comprising:
- generating, for each of a first plurality of sessions, a session representation indicating an order through which a user navigated through a plurality of webpages during the session;
- generating a plurality of clusters by clustering the session representations based on similarity between session representations, the plurality of clusters comprising an optimal number of clusters based on key performance indicators corresponding to each cluster of the plurality of clusters;
- generating, for each of a second plurality of sessions, a session representation indicating an order through which a user navigated through a plurality of webpages during the session;
- determining a medoid of each of the plurality of clusters;
- and
- for each session representation generated for each of the second plurality of sessions, performing operations comprising:
- computing a distance between the session representation and each medoid to determine a nearest medoid;
- and
- assigning the session representation to a cluster associated with the nearest medoid.
A non-transitory computer-readable storage medium including instructions that, when processed by a computer, configure the computer to perform operations comprising:
- generating, for each of a first plurality of sessions, a session representation indicating an order through which a user navigated through a plurality of webpages during the session;
- generating a plurality of clusters by clustering the session representations based on similarity between session representations, the plurality of clusters comprising an optimal number of clusters based on key performance indicators corresponding to each cluster of the plurality of clusters;
- generating, for each of a second plurality of sessions, a session representation indicating an order through which a user navigated through a plurality of webpages during the session;
- determining a medoid of each of the plurality of clusters;
- and
- for each session representation generated for each of the second plurality of sessions, performing operations comprising:
- computing a distance between the session representation and each medoid to determine a nearest medoid;
- and
- assigning the session representation to a cluster associated with the nearest medoid.
Dependencies are inferred from the claim text.