Method and apparatus for information factoring

• US 20040163044A1
• Filed: 02/14/2003
• Published: 08/19/2004
• Est. Priority Date: 02/14/2003
• Status: Abandoned Application

• Current Assignee: Nahava, Inc.
• Original Assignee: Nahava, Inc.
• Inventors: Nakano, Russell Toshio
• Application Number:
  US10/368,060
• Publication Number:
  US 20040163044A1
• Time in Patent Office: Days
• US Class Current: 715/513
• CPC Class Codes: H03M 7/30 Compression speech analysis-synthesis for redundancy reduction G10L19/00; for image communication H04N; Expansion; Suppression of unnecessary data, e.g. redundancy reduction

Abstract

A method and apparatus for information factoring have been disclosed by representing a source information asset as a point in a metric space and rendering said source information asset in a second form.

Claims

1. A method comprising:

representing a source information asset as a point in a metric space; and

rendering said source information asset in a second form.

2. The method of claim 1 wherein said second form is substantially redundant information contained in said source information asset.

3. The method of claim 1 wherein said second form is substantially non-redundant information contained in said source information asset.

4. The method of claim 1 wherein said rendering is language neutral.

5. The method of claim 1 wherein said second form conforms substantially to the extensible markup language (XML).

6. The method of claim 1 further comprising generating a directed acyclic graph (DAG) of said source information asset.

7. The method of claim 1 wherein said source information asset comprises one or more web pages.

8. A machine-readable medium having stored thereon instructions, which when executed performs the method of claim 1.

9. A system comprising a processor coupled to a memory, which when executing a set of instructions performs the method of claim 1.

10. The method of claim 1 further comprising communicating a payment and/or credit.

23. A system comprising a processor coupled to a memory, which when executing a set of instructions performs the method of claim 1.

24. The method of claim 1 wherein after (g) determining said specific optimum cut-point, said information is factored out of N leaving N′

information assets and applying (a)-(g) of claim 1 to said N′

as if they were N.

11. A method for information factoring comprising:

receiving one or more information assets;

representing said one or more information assets in a tree topology;

extracting from said one or more information assets a list of one or more different parameters;

calculating probabilities associated with each said one or more different parameters for each said one or more information assets;

(a) calculating for selected nodes in said tree topology a first metric and a second metric;

(b) combining said first metric and said second metric to derive a third metric;

repeating (a) and (b) thus generating a plurality of said third metrics; and

determining a specific optimum cut-point based upon said plurality of third metrics.

12. The method of claim 11 wherein said determining said specific optimum cut-point further comprises preference relating to an effectiveness parameter.

13. The method of claim 11 wherein said determining said specific optimum cut-point further comprises preference relating to an information content parameter.

14. The method of claim 11 wherein said selected nodes is each node.

15. The method of claim 11 wherein said set of nodes is every node.

16. The method of claim 11 wherein calculating probabilities further comprises traversing over each said one or more information assets as represented in said tree topology.

17. The method of claim 11 wherein said (a) calculating for selected nodes in said tree topology a first metric and a second metric comprises (a) calculating for selected nodes in said tree topology a first metric based upon nodes above a cut-point and a second metric based upon nodes below said cut-point.

18. The method of claim 17 wherein said (b) combining said first metric and said second metric to derive a third metric comprises (b) combining said first metric and said second metric to derive a third metric for said cut-point in said tree topology;

19. The method claim 18 wherein said repeating (a) and (b) thus generating a plurality of said third metrics comprises moving said cut-point between a set of nodes in said tree topology and repeating (a) and (b) thus generating a plurality of said third metrics.

20. The method of claim 19 wherein said set of nodes is every node.

21. The method claim 18 wherein said repeating (a) and (b) thus generating a plurality of said third metrics comprises moving said cut-point between every possible set of nodes in said tree topology by traversing said tree topology from root downward and repeating (a) and (b) thus generating a plurality of said third metrics.

22. A method for information factoring comprising:

(a) receiving N information assets capable of being represented in a tree topology;

(b) extracting from said N information assets a list of one or more different parameters;

(c) traversing over each said N information assets and calculating probabilities associated with each said one or more different parameters for each said N information assets;

(d) calculating for each node in said tree topology a first metric based upon nodes above a cut-point and a second metric based upon nodes below said cut-point;

(e) combining for each node in said tree topology said first metric and said second metric to derive a third metric for said cut-point in said tree topology;

(f) moving said cut-point between every possible set of nodes in said tree topology by traversing said tree topology from root downward and repeating (d) and (e) thus generating a plurality of said third metrics;

(g) determining a specific optimum cut-point by calculating which of the plurality of cut-points has a highest rate of change in said plurality of third metrics.

25. A method comprising:

representing one or more XML web assets as one or more points in a metric space;

rendering one or more XML data elements in said metric space;

determining statistical properties of said metric space;

computing one or more distance metrics in terms of said statistical properties of said metric space; and

determining an optimum of said one or more computed distance metrics.

26. The method of claim 25 wherein rendering one or more XML data elements further comprises using a presentation template as multiplication in said metric space.

27. The method of claim 26 wherein said presentation template is a XSL.

28. The method of claim 26 wherein determining an optimum of said one or more computed distance metrics further comprises:

obtaining a factoring between template and content to solve min(xp, sum(xi contained in S, ∥

xi−

xp*xci∥

))

where;

xp denotes said presentation template,

S denotes a set of points in said metric space,

xi denotes said XML data elements, and

xci denotes extracted content.

29. An apparatus comprising:

means for representing a source information asset as a point in a metric space; and

means for rendering said source information asset in a second form.

30. A machine-readable medium having stored thereon information representing the apparatus of claim 29.

31. A method for factoring information, the method comprising:

receiving information to be factored;

converting said information into one or more directed acyclic graphs (DAGs);

extracting for each node in said one or more DAGs an effectiveness and information content metric; and

choosing one or more factor points based upon said effectiveness and information content metrics.

32. A machine-readable medium having stored thereon instructions, which when executed performs the method of claim 31.

33. A system comprising a processor coupled to a memory, which when executing a set of instructions performs the method of claim 31.

34. A method of information factoring comprising:

(a) receiving pages (yi), said pages having tags (tj) within each page;

(b) traversing all said pages yi, and compiling details on all possible tags (tij);

(c) traversing over said all possible tags tij for each page yi and obtaining probabilities of the tag values;

(d) computing for each node in a tree for page yi, the residual as if that node and nodes above were to be considered part of a template, and everything below that node would be part of an extraction, and would not contribute to a residual.

(e) taking the potential residuals computed in (d) over all the pages, and computing the residual associated with a node and everything below it;

(f) determining a best cut point by looking at the rate of change of the total residual below each candidate cut point considering the total sum of residuals for all nodes that have the cut point as a direct or indirect parent node and picking an optimal cut point as a point (or points) that define a “

knee”

in the residual curve, plotted as a function of sorted potential cut points.

35. The method of claim 34 further comprising:

(g) removing that residual from the total for all the pages if that node were chosen as the template denoting this a new residual; and

repeating (b)-(f) with said new residual.

36. The method of claim 34 wherein determining the best cut point further comprises calculating the following ratio:

Goodness=pct/(1−

pct),

where pct=the percentage of the contribution that a given node makes to the total lower-residual of its parent.

37. The method of claim 35 wherein reconstructing the original received pages comprises summing all the residuals.

38. A method comprising:

computing a digest of node names and content text for one or more XML expressions;

tallying said XML expressions according to a cut-point algorithm;

separating each XML expression into a content part and a template part using said cut-point algorithm;

gathering for each said one or more XML expressions said content parts directly or indirectly derived from each said one or more XML expressions;

identifying all distinct digests into one or more same-digest sets;

for each same-digest set;

identifying all XML template parts associated with said same-digest set; and

summing residuals for said same-digest set content parts;

sorting said same-digest sets based on said same-digest sets'"'"' residual; and

selecting N top said sorted same-digest sets.

39. The method of claim 38 wherein said computing a digest of node names and content text for one or more XML expressions further comprises traversing each said one or more XML expressions in canonical order.

40. The method of claim 38 wherein said same-digest sets is defined as one or more XML expressions having a same digest

41. A machine-readable medium having stored thereon instructions, which when executed performs the method of claim 38.

42. A system comprising a processor coupled to a memory, which when executing a set of instructions performs the method of claim 38.