IP Library Granted Patent US 8,886,679
Granted Patent B2
US 8,886,679 · App. 13/271,036 · Granted Nov 11, 2014

Mining web applications

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 8,886,679
App. No.
13/271,036
Granted
Nov 11, 2014
Kind
B2
Abstract

Systems and methods of mining Web applications are disclosed. An example method may include selecting a distance measure between subtrees of the Web applications. The method may also include computing an edit distance for the subtrees. The method may also include finding sets of similar subtrees using the edit distance with a Similar Sibling-Trees-aware RTDM (SiSTeR) approach.

Claims (24)

1. A method of mining Web applications, the method stored as computer readable instructions on a computer readable media and executed by a processor, the method comprising:

selecting a distance measure between subtrees of the Web applications according to a bottom-up approach;

computing an edit distance for the subtrees; and

finding sets of similar subtrees using the edit distance with a Similar Sibling-Trees-aware Restricted Top-Down edit Metric (RTDM) (SiSTeR) approach, wherein the SiSTeR approach detects a plurality of lists of different length as similar while disregarding a number of entries within each of the plurality of lists individually, and wherein finding similar structures in the Web applications disregards dissimilarity affected only by a number of sibling sub-trees.

2. The method of claim 1 , further comprising finding repeating Document Object Model (DOM) subtrees.

3. The method of claim 1 , further comprising using a one-to-many replace operation.

4. The method of claim 3 , wherein the one-to-many replace operation is computed in a dynamic programming regime.

5. The method of claim 3 , wherein the many-to-one replace operation is computed in a dynamic programming regime.

6. The method of claim 1 , further comprising using a many-to-one replace operation.

7. The method of claim 1 , wherein a one-to-many replace operation and a many-to-one replace operation replaces a series of consecutive replaces of one subtree with many subtrees.

8. The method of claim 7 , wherein a cost of the replace operations is a sum of replaces.

9. The method of claim 7 , further comprising reducing a number of replace operations.

10. A system for mining Web applications, the system including computer readable instructions stored on a computer readable media and executed by a processor to:

select a distance measure between subtrees of the Web applications according to a bottom-up approach;

compute an edit distance for the subtrees; and

find sets of similar subtrees using the edit distance with a Similar Sibling-Trees-aware Restricted Top-Down edit Metric (RTDM) (SiSTeR) approach, wherein the SiSTeR approach detects a plurality of lists of different length as similar while disregarding a number of entries within each of the plurality of lists individually, and wherein finding similar structures in the Web applications disregards dissimilarity affected only by a number of sibling sub-trees.

11. The system of claim 10 , further comprising executing the instructions to find repeating Document Object Model (DOM) subtrees.

12. The system of claim 10 , further comprising executing the instructions using a one-to-many replace operation.

13. The system of claim 10 , further comprising executing the instructions many-to-one replace operation.

14. The system of claim 10 , further comprising executing the instructions in a dynamic programming regime.

15. The system of claim 10 , further comprising executing the instructions to reduce a number of replace operations.

16. The system of claim 10 , wherein a one-to-many replace operation and a many-to-one replace operation replaces a series of consecutive replaces of one subtree with many subtrees.

17. The system of claim 10 , wherein a cost of the replace operations is a sum of replaces.

18. The system of claim 10 , wherein the Web applications include at least search engines, video sites, and content pages.

Assignments (9)
RELEASE OF SECURITY INTEREST REEL/FRAME 044183/0577 Recorded Feb 2, 2023
From: JPMORGAN CHASE BANK, N.A.
To: MICRO FOCUS LLC (F/K/A ENTIT SOFTWARE LLC)
Reel/Frame 063560/0001 →
RELEASE OF SECURITY INTEREST REEL/FRAME 044183/0718 Recorded Feb 2, 2023
From: JPMORGAN CHASE BANK, N.A.
To: MICRO FOCUS LLC (F/K/A ENTIT SOFTWARE LLC); BORLAND SOFTWARE CORPORATION; MICRO FOCUS (US), INC.; SERENA SOFTWARE, INC; ATTACHMATE CORPORATION; MICRO FOCUS SOFTWARE INC. (F/K/A NOVELL, INC.); NETIQ CORPORATION
Reel/Frame 062746/0399 →
CHANGE OF NAME Recorded Aug 8, 2019
From: ENTIT SOFTWARE LLC
To: MICRO FOCUS LLC
Reel/Frame 050004/0001 →
SECURITY INTEREST Recorded Oct 11, 2017
From: ATTACHMATE CORPORATION; BORLAND SOFTWARE CORPORATION; NETIQ CORPORATION; MICRO FOCUS (US), INC.; MICRO FOCUS SOFTWARE, INC.; ENTIT SOFTWARE LLC; ARCSIGHT, LLC; SERENA SOFTWARE, INC.
To: JPMORGAN CHASE BANK, N.A.
Reel/Frame 044183/0718 →
SECURITY INTEREST Recorded Oct 11, 2017
From: ENTIT SOFTWARE LLC; ARCSIGHT, LLC
To: JPMORGAN CHASE BANK, N.A.
Reel/Frame 044183/0577 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jun 9, 2017
From: HEWLETT PACKARD ENTERPRISE DEVELOPMENT LP
To: ENTIT SOFTWARE LLC
Reel/Frame 042746/0130 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Nov 9, 2015
From: HEWLETT-PACKARD DEVELOPMENT COMPANY, L.P.
To: HEWLETT PACKARD ENTERPRISE DEVELOPMENT LP
Reel/Frame 037079/0001 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Sep 1, 2015
From: HEWLETT-PACKARD COMPANY
To: HEWLETT-PACKARD DEVELOPMENT COMPANY, L.P.
Reel/Frame 036518/0623 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Oct 12, 2011
From: BARKOL, OMER; BERGMAN, RUTH; GOLAN, SHAHAR
To: COMPANY, HEWLETT-PACKARD
Reel/Frame 027051/0136 →