IP Library Granted Patent US 12,346,362
Granted Patent B2
US 12,346,362 · App. 18/378,812 · Granted Jul 1, 2025

Mapping webpages to page groups

Inventors: Slim Frikha (Paris, FR); Michael Snellman (Paris, FR)
Assignee: Content Square SAS
G06F16/35G06F16/3334G06F16/955
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 12,346,362
App. No.
18/378,812
Granted
Jul 1, 2025
Kind
B2
Abstract

Aspects of the present disclosure involve a system comprising a computer-readable storage medium storing a program and method for mapping webpages to page groups. The program and method provide for receiving plural Uniform Resource Locators (URLs), each URL of the plural URLs corresponding to a respective webpage of a website; generating a distance matrix with pairwise distances between the plural URLs; performing hierarchical clustering based on the distance matrix, to generate a dendrogram in which the plural URLs are arranged in hierarchical clusters; and determining, based on the dendrogram, a predicted page group for each of the plural URLs.

Claims (80)

1. A method, comprising:

receiving plural Uniform Resource Locators (URLs), each URL of the plural URLs corresponding to a respective webpage of a website;

accessing, from a database, a set of terms, the set of terms having been predetermined as prioritized;

extracting distinct terms corresponding to a path level, a query key and a cvar key for the plural URLs;

computing a similarity score of the distinct terms with the set of terms;

identifying, based on the computing, URLs of the plural URLs having at least one term appearing within the set of terms;

applying weights to the identified URLs, to prioritize the identified URLs relative to other URLs of the plural URLs;

performing, based on applying the weights, hierarchical clustering with respect to the plural URLs, to generate a dendrogram in which the plural URLs are arranged in hierarchical clusters;

storing a representation of the dendrogram;

automatically determining, based on the stored representation of the dendrogram, a predicted page group for each of the plural URLs; and

causing, based on determining the predicted page group for each of the plural URLs, display of metrics corresponding to the website.

2. The method of claim 1 , further comprising:

computing URL patterns and conditions for each cluster within the hierarchical clusters.

3. The method of claim 1 , wherein the hierarchical clusters comprise agglomerative hierarchical clusters.

4. The method of claim 1 , wherein computing the similarity score corresponds to calculating a respective levenshtein ratio for the path level, the query key and the cvar key for the plural URLs, and

wherein the identifying comprises selecting URLs of the plural URLs with levenshtein ratios exceeding a predefined value with respect to the path level, the query key and the cvar key.

5. The method of claim 1 , wherein arranging the plural URLs into hierarchical clusters comprises:

performing grid searching with respect to a preset range of clusters;

computing a silhouette score for each cluster within the preset range of clusters; and

determining the hierarchical clusters based on the computed silhouette scores.

6. The method of claim 1 , further comprising:

generating, based on applying the weights, a distance matrix with pairwise distances between the plural URLs,

wherein the arranging comprises performing hierarchical clustering based on the distance matrix, to generate a dendrogram in which the plural URLs are arranged in hierarchical clusters, and

wherein the determining is based on a stored representation of the dendrogram.

7. The method of claim 6 , further comprising:

accessing, from a database, a set of terms, the set of terms having been predetermined as prioritized,

wherein determining the hierarchical clusters is further based on identifying nodes within the dendrogram having conditions that include at least one term within the set of terms.

8. A system comprising:

at least one processor; and

a memory storing instructions that, when executed by the at least one processor, configure the at least one processor to perform operations comprising:

receiving plural Uniform Resource Locators (URLs), each URL of the plural URLs corresponding to a respective webpage of a website;

accessing, from a database, a set of terms, the set of terms having been predetermined as prioritized;

extracting distinct terms corresponding to a path level, a query key and a cvar key for the plural URLs;

computing a similarity score of the distinct terms with the set of terms;

identifying, based on the computing, URLs of the plural URLs having at least one term appearing within the set of terms;

applying weights to the identified URLs, to prioritize the identified URLs relative to other URLs of the plural URLs;

performing, based on applying the weights, hierarchical clustering with respect to the plural URLs, to generate a dendrogram in which the plural URLs are arranged in hierarchical clusters;

storing a representation of the dendrogram;

automatically determining, based on a stored representation of the dendrogram, a predicted page group for each of the plural URLs; and

causing, based on determining the predicted page group for each of the plural URLs, display of metrics corresponding to the website.

9. The system of claim 8 , the operations further comprising:

computing URL patterns and conditions for each cluster within the hierarchical clusters.

10. The system of claim 8 , wherein the hierarchical clusters comprise agglomerative hierarchical clusters.

11. The system of claim 8 , wherein computing the similarity score corresponds to calculating a respective levenshtein ratio for the path level, the query key and the cvar key for the plural URLs, and

wherein the identifying comprises selecting URLs of the plural URLs with levenshtein ratios exceeding a predefined value with respect to the path level, the query key and the cvar key.

12. The system of claim 8 , wherein arranging the plural URLs into hierarchical clusters comprises:

performing grid searching with respect to a preset range of clusters;

computing a silhouette score for each cluster within the preset range of clusters; and

determining the hierarchical clusters based on the computed silhouette scores.

13. The system of claim 8 , the operations further comprising:

generating, based on applying the weights, a distance matrix with pairwise distances between the plural URLs,

wherein the arranging comprises performing hierarchical clustering based on the distance matrix, to generate a dendrogram in which the plural URLs are arranged in hierarchical clusters, and

wherein the determining is based on a stored representation of the dendrogram.

14. The system of claim 13 , the operations further comprising:

accessing, from a database, a set of terms, the set of terms having been predetermined as prioritized,

wherein determining the hierarchical clusters is further based on identifying nodes within the dendrogram having conditions that include at least one term within the set of terms.

15. A non-transitory computer-readable storage medium, the computer-readable storage medium including instructions that when executed by a computer, cause the computer to perform operations comprising:

receiving plural Uniform Resource Locators (URLs), each URL of the plural URLs corresponding to a respective webpage of a website;

accessing, from a database, a set of terms, the set of terms having been predetermined as prioritized;

extracting distinct terms corresponding to a path level, a query key and a cvar key for the plural URLs;

computing a similarity score of the distinct terms with the set of terms;

identifying, based on the computing, URLs of the plural URLs having at least one term appearing within the set of terms;

applying weights to the identified URLs, to prioritize the identified URLs relative to other URLs of the plural URLs;

performing, based on applying the weights, hierarchical clustering with respect to the plural URLs, to generate a dendrogram in which the plural URLs are arranged in hierarchical clusters;

storing a representation of the dendrogram;

automatically determining, based on a stored representation of the dendrogram, a predicted page group for each of the plural URLs; and

causing, based on determining the predicted page group for each of the plural URLs, display of metrics corresponding to the website.

16. The non-transitory computer-readable storage medium of claim 15 , the operations further comprising:

computing URL patterns and conditions for each cluster within the hierarchical clusters.

17. The non-transitory computer-readable storage medium of claim 15 , wherein the hierarchical clusters comprise agglomerative hierarchical clusters.

18. The non-transitory computer-readable storage medium of claim 15 , wherein computing the similarity score corresponds to calculating a respective levenshtein ratio for the path level, the query key and the cvar key for the plural URLs, and

wherein the identifying comprises selecting URLs of the plural URLs with levenshtein ratios exceeding a predefined value with respect to the path level, the query key and the cvar key.

19. The non-transitory computer-readable storage medium of claim 15 , wherein arranging the plural URLs into hierarchical clusters comprises:

performing grid searching with respect to a preset range of clusters;

computing a silhouette score for each cluster within the preset range of clusters; and

determining the hierarchical clusters based on the computed silhouette scores.

20. The non-transitory computer-readable storage medium of claim 15 , the operations further comprising:

generating, based on applying the weights, a distance matrix with pairwise distances between the plural URLs,

wherein the arranging comprises performing hierarchical clustering based on the distance matrix, to generate a dendrogram in which the plural URLs are arranged in hierarchical clusters, and

wherein the determining is based on a stored representation of the dendrogram.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Feb 13, 2024
From: FRIKHA, SLIM; SNELLMAN, MICHAEL
To: CONTENT SQUARE SAS
Reel/Frame 066450/0074 →
Continuity (3)
Continuation 17877691 · Jul 29, 2022
Provisional Application 63336780 · Apr 29, 2022
Related Publication 20240037130A1 · Feb 1, 2024
References Cited (21)
US 11841891B2 · Frikha et al. · 2023 [cited by applicant]
US 20080010292A1 · Poola · 2008 [cited by applicant]
US 20080114800A1 · Gazen et al. · 2008 [cited by applicant]
US 20090049062A1 · Chitrapura et al. · 2009 [cited by applicant]
US 20140365475A1 · Harendra et al. · 2014 [cited by applicant]
US 20200159925A1 · Parlak et al. · 2020 [cited by applicant]
US 20200380254A1 · Zeng et al. · 2020 [cited by applicant]
US 20200387583A1 · Drey · 2020 [cited by applicant]
US 20220171749A1 · Le Huerou et al. · 2022 [cited by applicant]
US 20220245091A1 · Batsakis · 2022 [cited by examiner]
US 20230350933A1 · Frikha et al. · 2023 [cited by applicant]
WO 2023209642 · 2023 [cited by applicant]
“U.S. Appl. No. 17/877,691, Non Final Office Action mailed Oct. 19, 2022”, 12 pgs. [cited by applicant]
“U.S. Appl. No. 17/877,691, Response filed Jan. 19, 2023 to Non Final Office Action mailed Oct. 19, 2022”, 8 pgs. [cited by applicant]
“U.S. Appl. No. 17/877,691, Final Office Action mailed Feb. 7, 2023”, 13 pgs. [cited by applicant]
“U.S. Appl. No. 17/877,691, Response filed May 8, 2023 to Final Office Action mailed Feb. 7, 2023”, 9 pgs. [cited by applicant]
“U.S. Appl. No. 17/877,691, Notice of Allowance mailed Jun. 15, 2023”, 17 pgs. [cited by applicant]
“International Application Serial No. PCT/IB2023/054395, International Search Report mailed Sep. 8, 2023”, 4 pgs. [cited by applicant]
“International Application Serial No. PCT/IB2023/054395, Written Opinion mailed Sep. 8, 2023”, 8 pgs. [cited by applicant]
Anonymous, “Cluster analysis”, Wikipedia, [Online]. Retrieved from the Internet: <https://en.Wikipedia.org/w/index.php?title=Cluster_analysis&oldid=576544197>, (May 10, 2013), 23 pgs. [cited by applicant]
“U.S. Appl. No. 17/877,691, Corrected Notice of Allowability mailed Oct. 17, 2023”, 2 pgs. [cited by applicant]
Cited By (1)
US 12,388,862