US6230153B1 — Association rule ranker for web site emulation

Claim 1

Independent Claim 62 words

A method for sorting data mining association rules, the method comprising: identifying statistically significant relationships within a cumulated distribution of data, the significant relationships represented by association rules; and separating meaningful association rules from unmeaningful association rules using an emulated distribution of the data as a reference, wherein said emulated distribution is based upon emulated events that are different than actual events.

Claim 2

Independent Claim 62 words

A method for sorting data mining association rules, the method comprising: identifying statistically significant relationships within a cumulated distribution of data, the significant relationships represented by association rules; and separating meaningful association rules from unmeaningful association rules using an emulated distribution of the data as a reference, wherein said emulated distribution is based upon emulated events that are different than actual events.

Claim 3

Dependent Claim 27 words

The method recited in claim 1 , separating meaningful association rules from unmeaningful association rules by sorting the rules by their support within the distribution of data.

Claim 4

Dependent Claim 27 words

The method recited in claim 1 , separating meaningful association rules from unmeaningful association rules by sorting the rules by their confidence within the distribution of data.

Claim 5

Dependent Claim 125 words

The method recited in claim 2 , wherein the association rules are sorted in sets of rules for different systems of events, where C represents an emulated system of events for a web site and B represents an actual system of events for the same web site data, and where if K(P AC :R AC )>K(P AB :R AB ), the association rules applied to the emulated system of events C have greater relevance then the association rules applied to the actual system of events B, and where P is a probability distribution for an association rule for the actual system of events, and R is an emulated support for an association rule for the emulated system of events, and wherein K is a constant.

Claim 6

Dependent Claim 22 words

The method recited in claim 4 , wherein P is measured by an association rule's support in a respective system of events.

Claim 7

Dependent Claim 61 words

The method recited in claim 5 , wherein P AB =P(A, B 1 ), P(A, B 2 ), . . . P(A, B n ) and R AB =R(A, B 1 ), R(A, B 2 ) . . . R(A, B n ), and P AC =P(A, C 1 ), P(A, C 2 ), . . . P(A, B n ).

Claim 8

Dependent Claim 18 words

The method recited in claim 2 , wherein the association rules are sorted in descending order of support.

Claim 9

Dependent Claim 136 words

The method recited in claim 7 , where P(A,B 1 )/R(A,B 1 ), P(A,B 2 )/R(A,B 2 ), . . . P(A,B n )/R(A,B n ), where B represents an event in an actual system of events, and where the association rules pertaining to the actual system of events have equal support as association rules pertaining to an emulated system of events if P AB /R AB =1, where P is a probability distribution for an association rule for the actual system of events, and R is an emulated support for an association rule for the emulated system of events, and where P AB has lesser support than R AB as P AB →0 and R AB →∞, and where P AB has greater support than R AB as R AB →0 and P AB →∞.

Claim 10

Dependent Claim 18 words

The method recited in claim 2 , wherein the association rules are sorted in ascending order of support.

Claim 11

Dependent Claim 134 words

The method recited in claim 9 , where R(A,B 1 )/P(A,B 1 ), R(A,B 2 )/P(A,B 2 ), . . . R(A,B n )/P(A,B n ), where B represents an actual system of events, and where the association rules pertaining to the actual system of events have equal support as the association rules pertaining to an emulated system of events if R AB /P AB =1 where R is an emulated support for an association rule for an emulated system of events, and P is a probability distribution for an association rule for the actual system of events, and where R AB has lesser support than P AB as R AB →0 and P AB →∞, and where R AB has greater support than P AB as P AB →0 and R AB →∞.

Claim 12

Dependent Claim 40 words

The method recited in claim 2 , wherein the association rules are further sorted where P(A,B 1 )log(P(A,B 1 )/R(A,B 1 )), P(A,B 2 )log(P(A,B 2 )/R(A,B 2 )), . . . , P(A,B n )log(P(A,B n )/R(A,B n )).

Claim 13

Dependent Claim 40 words

The method recited in claim 8 , wherein the association rules are farther sorted where P(A,B 1 )log(P(A,B 1 )/R(A,B 1 ), P(A,B 2 )log(P(A,B 2 )/R(A,B 2 )), . . . , P(A,B n )log(P(A,B n )/R(A,B n )).

Claim 14

Dependent Claim 40 words

The method recited in claim 10 , wherein the association rules are further sorted where P(A,B 1 )log(P(A,B 1 )/R(A,B 1 ), P(A,B 2 )log(P(A,B 2 )/R(A,B 2 )), . . . , P(A,B n )log(P(A,B n )/R(A,B n ).

Claim 15

Dependent Claim 93 words

The method recited in claim 2 , wherein event D 1 corresponds to a set of uniform resource locator data, and event D 1 corresponds to all other sets of uniform resource locators not in set D 1 , and where D={D 1 , D 2 , . . . , D m }, where the uniform resource locator data sets do not comprise a system of events and {(P(A,D i )/R(A,D i )÷P(A,D i )/R(A,D i ))/2}, i=1, 2, . . . , m, where i=1, 2, . . . , m.

Claim 16

Dependent Claim 41 words

The method recited in claim 14 , sorting further comprising {P(A,D i )log(P(A,D i )/R(A,D i ))÷P(A,D i )log(P(A,D i )/R(A,D i ))}, i=1,2, . . . , m, {P(A,D i )/R(A,D i )}, i=1, 2, . . . , m.

Claim 17

Dependent Claim 55 words

The method recited in claim 2 , wherein association rules having high levels of support compared to the emulated distribution are ranked highest, regardless of whether the association rules are highly supported in the uniform resource locator data as determined by P, and where P is a probability of an occurrence of the association rule.

Claim 18

Dependent Claim 39 words

The method recited in claim 16 , wherein two association rules with identical P values are further sorted so that the rule with greater support in the emulated data is sorted higher than the rule with the lesser support.

Claim 19

Independent Claim 110 words

A method for sorting data mining association rules, the method comprising: identifying statistically significant relationships within a cumulated distribution of data, the significant relationships represented by association rules; and separating meaningful association rules from unmeaningful association rules using an emulated distribution of the data as a reference by sorting the rules by their support within the distribution of data, wherein the uniform resource locator data does not comprise a system of events and is sorted by m sets of uniform resource locator data, where {P(A,D i )/R(A,D i )}, i=], 2, . . . , m, and D i corresponds to sets of uniform resource locator data 1 to m.

Claim 20

Independent Claim 110 words

A method for sorting data mining association rules, the method comprising: identifying statistically significant relationships within a cumulated distribution of data, the significant relationships represented by association rules; and separating meaningful association rules from unmeaningful association rules using an emulated distribution of the data as a reference by sorting the rules by their support within the distribution of data, wherein the uniform resource locator data does not comprise a system of events and is sorted by m sets of uniform resource locator data, where {P(A,D i )/R(A,D i )}, i=], 2, . . . , m, and D i corresponds to sets of uniform resource locator data 1 to m.

Claim 21

Dependent Claim 29 words

The method recited in claim 18 , wherein the association rules are further sorted where {P(A,D i )log(P(A,D i )/R(A,D i ))}, i=1, 2, . . . , m.

Claim 22

Independent Claim 129 words

A method for sorting data mining association rules, the method comprising: identifying statistically significant relationships within a cumulated distribution of data, the significant relationships represented by association rules; and separating meaningful association rules from unmeaningful association rules using an emulated distribution of the data as a reference by sorting the rules by their confidence within the distribution of data, sorting of the association rules comprising ranking the rules by their confidence, where {P(A|D i )/R(A|D i )}, i=1, 2, . . . , m, where P is a probability of an occurrence of an association rule, and where two association rules with identical P values are further sorted so that the rule with greater support in the emulated data is sorted higher than the rule with the lesser support.

Claim 23

Independent Claim 129 words

A method for sorting data mining association rules, the method comprising: identifying statistically significant relationships within a cumulated distribution of data, the significant relationships represented by association rules; and separating meaningful association rules from unmeaningful association rules using an emulated distribution of the data as a reference by sorting the rules by their confidence within the distribution of data, sorting of the association rules comprising ranking the rules by their confidence, where {P(A|D i )/R(A|D i )}, i=1, 2, . . . , m, where P is a probability of an occurrence of an association rule, and where two association rules with identical P values are further sorted so that the rule with greater support in the emulated data is sorted higher than the rule with the lesser support.

Claim 24

Dependent Claim 29 words

The method recited in claim 20 , wherein the association rules are further sorted where {P(A,D i )log(P(A|D i )/R(A|D i ))}, i=1, 2, . . . , m.

Claim 25

Dependent Claim 92 words

An article of manufacture comprising a data storage medium tangibly embodying a program of machine-readable instructions executable by a digital processing apparatus to perform a method for sorting data mining association rules, the method comprising: identifying statistically significant relationships within a cumulated distribution of uniform resource locator data, the significant relationships represented by association rules; and separating meaningful association rules from unmeaningful association rules using an emulated distribution of the uniform resource locator data as a reference, wherein said emulated distribution is based upon emulated events that are different than actual events.

Claim 26

Dependent Claim 92 words

An article of manufacture comprising a data storage medium tangibly embodying a program of machine-readable instructions executable by a digital processing apparatus to perform a method for sorting data mining association rules, the method comprising: identifying statistically significant relationships within a cumulated distribution of uniform resource locator data, the significant relationships represented by association rules; and separating meaningful association rules from unmeaningful association rules using an emulated distribution of the uniform resource locator data as a reference, wherein said emulated distribution is based upon emulated events that are different than actual events.

Claim 27

Dependent Claim 30 words

The article recited in claim 22 , separating meaningful association rules from unmeaningful association rules by sorting the rules by their support within the distribution of uniform resource locator data.

Claim 28

Dependent Claim 32 words

The article recited in claim 22 , separating meaningful association rules from unmeaningful association rules by sorting the rules by their confidence for support within the distribution of uniform resource locator data.

Claim 29

Dependent Claim 125 words

The article recited in claim 22 , wherein the association rules are sorted in sets of rules for different systems of events, where C represents an emulated system of events for a web site and B represents an actual system of events for the same web site data, and where if K(P AC :R AC )>K(P AB :R AB ), the association rules applied to the emulated system of events C have greater relevance then the association rules applied to the actual system of events B, and where P is a probability distribution for an association rule for the actual system of events, and R is an emulated support for an association rule for the emulated system of events, and wherein K is a constant.

Claim 30

Dependent Claim 22 words

The article recited in claim 25 , wherein P is measured by an association rule's support in a respective system of events.

Claim 31

Dependent Claim 61 words

The article recited in claim 22 , wherein P AB =P(A, B 1 ), P(A, B 2 ), . . . P(A, B n ) and R AB =R(A, B 1 ), R(A, B 2 ) . . . R(A, B n ), and P AC =P(A, C 1 ), P(A, C 2 ), . . . P(A, B n ).

Claim 32

Dependent Claim 18 words

The article recited in claim 22 , wherein the association rules are sorted in descending order of support.

Claim 33

Dependent Claim 136 words

The article recited in claim 22 , where P(A,B 1 )/R(A,B 1 ), P(A,B 2 )/R(A,B 2 ), . . . P(A,B n )/R(A,B n ), where B represents an event in an actual system of events, and where the association rules pertaining to the actual system of events have equal support as association rules pertaining to an emulated system of events if P AB /R AB =1, where P is a probability distribution for an association rule for the actual system of events, and R is an emulated support for an association rule for the emulated system of events, and where P AB has lesser support than R AB as P AB →0 and R AB →∞, and where P AB has greater support than R AB as R AB →0 and P AB →∞.

Claim 34

Dependent Claim 18 words

The article recited in claim 22 , wherein the association rules are sorted in ascending order of support.

Claim 35

Dependent Claim 134 words

The article recited in claim 22 , where R(A,B 1 )/P(A,B 1 ), R(A,B 2 )/P(A,B 2 ), . . . R(A,B n )/P(A,B n ), where B represents an actual system of events, and where the association rules pertaining to the actual system of events have equal support as the association rules pertaining to an emulated system of events if R AB /P AB =1 where R is an emulated support for an association rule for an emulated system of events, and P is a probability distribution for an association rule for the actual system of events, and where R AB has lesser support than P AB as R AB →0 and P AB →∞, and where R AB has greater support than P AB as P AB →0 and R AB →∞.

Claim 36

Dependent Claim 40 words

The article recited in claim 22 , wherein the association rules are further sorted where P(A,B 1 )log(P(A,B 1 )/R(A,B 1 )), P(A,B 2 )log(P(A,B 2 )/R(A,B 2 )), . . . , P(A,B n )log(P(A,B n )/R(A,B n )).

Claim 37

Dependent Claim 40 words

An article recited in claim 29 , wherein the association rules are further sorted where P(A,B 1 )log(P(A,B 1 )/R(A,B 1 )), P(A,B 2 )log(P(A,B 2 )/R(A,B 2 )), . . . , P(A,B n )log(P(A,B n )/R(A,B n ).

Claim 38

Dependent Claim 40 words

An article recited in claim 31 , wherein the association rules are further sorted where P(A,B 1 )log(P(A,B 1 )/R(A,B 1 )), P(A,B 2 )log(P(A,B 2 )/R(A,B 2 )), . . . , P(A,B n )log(P(A,B n )/R(A,B n ).

Claim 39

Dependent Claim 93 words

The article recited in claim 22 , wherein event D 1 corresponds to a set of uniform resource locator data, and event D 1 corresponds to all other sets of uniform resource locators not in set D 1 , and where D={D 1 , D 2 , . . . , D m }, where the uniform resource locator data sets do not comprise a system of events and {(P(A,D i )/R(A,D i )+P(A,D i )/R(A,D i ))/2}, i=1, 2, . . . , m, where i=1, 2, . . . , m.

Claim 40

Dependent Claim 43 words

The article recited in claim 22 , the method steps further comprising: {(P(A,D i )log(P(A,D i )/R(A,D i ))÷P(A,D i )log(P(A,D i )/R(A,D i ))}, i=1,2, . . . , m, {P(A,D i )/R(A,D i )}, i=1, 2, . . . , m.

Claim 41

Dependent Claim 55 words

The article recited in claim 22 , wherein association rules having high levels of support compared to the emulated distribution are ranked highest, regardless of whether the association rules are highly supported in the uniform resource locator data as determined by P, and where P is a probability of an occurrence of the association rule.

Claim 42

Dependent Claim 39 words

The article recited in claim 22 , wherein two association rules with identical P values are further sorted so that the rule with greater support in the emulated data is sorted higher than the rule with the lesser support.

Claim 43

Dependent Claim 143 words

An article of manufacture comprising a data storage medium tangibly embodying a program of machine-readable instructions executable by a digital processing apparatus to perform a method for sorting data mining association rules, the method comprising: identifying statistically significant relationships within a cumulated distribution of uniform resource locator data, the significant relationships represented by association rules; and separating meaningful association rules from unmeaningful association rules using an emulated distribution of the uniform resource locator data as a reference, wherein said emulated distribution is based upon emulated events that are different than actual events; wherein the uniform resource located data does not comprise a system of events and is sorted by m sets of uniform resource locator data, where {P(A,D i )/R(A,D i )}, i=1, 2, . . . , m, and D i corresponds to sets of uniform resource locator data l to m.

Claim 44

Dependent Claim 143 words

An article of manufacture comprising a data storage medium tangibly embodying a program of machine-readable instructions executable by a digital processing apparatus to perform a method for sorting data mining association rules, the method comprising: identifying statistically significant relationships within a cumulated distribution of uniform resource locator data, the significant relationships represented by association rules; and separating meaningful association rules from unmeaningful association rules using an emulated distribution of the uniform resource locator data as a reference, wherein said emulated distribution is based upon emulated events that are different than actual events; wherein the uniform resource located data does not comprise a system of events and is sorted by m sets of uniform resource locator data, where {P(A,D i )/R(A,D i )}, i=1, 2, . . . , m, and D i corresponds to sets of uniform resource locator data l to m.

Claim 45

Dependent Claim 29 words

The article recited in claim 22 , wherein the association rules are further sorted where {P(A,D i )log(P(A,D i )/R(A,D i ))}, i=1, 2, . . . , m.

Claim 46

Dependent Claim 162 words

An article of manufacture comprising a data storage medium tangibly embodying a program of machine-readable instructions executable by a digital processing apparatus to perform a method for sorting data mining association rules, the method comprising: identifying statistically significant relationships within a cumulated distribution of uniform resource locator data, the significant relationships represented by association rules; and separating meaningful association rules from unmeaningful association rules using an emulated distribution of the uniform resource locator data as a reference, wherein said emulated distribution is based upon emulated events that are different than actual events; sorting of the association rules comprising ranking the rules by their confidence, where {P(A\D i )/R(A\D i )}, i=1, 2, . . . , m, where P is a probability of an occurrence of an association rule, and where two association rules with identical P values are further sorted so that the rule with greater support in the emulated data is sorted higher than the rule with the lesser support.

Claim 47

Dependent Claim 162 words

An article of manufacture comprising a data storage medium tangibly embodying a program of machine-readable instructions executable by a digital processing apparatus to perform a method for sorting data mining association rules, the method comprising: identifying statistically significant relationships within a cumulated distribution of uniform resource locator data, the significant relationships represented by association rules; and separating meaningful association rules from unmeaningful association rules using an emulated distribution of the uniform resource locator data as a reference, wherein said emulated distribution is based upon emulated events that are different than actual events; sorting of the association rules comprising ranking the rules by their confidence, where {P(A\D i )/R(A\D i )}, i=1, 2, . . . , m, where P is a probability of an occurrence of an association rule, and where two association rules with identical P values are further sorted so that the rule with greater support in the emulated data is sorted higher than the rule with the lesser support.

Claim 48

Dependent Claim 29 words

The article recited in claim 22 , wherein the association rules are further sorted where {P(A,D i )log(P(A|D i )/R(A|D i ))}, i=1, 2, . . . , m.

Claim 49

Independent Claim 95 words

An apparatus to sort data mining association rules, comprising: a processor; a database including URL data; circuitry to communicatively couple the processor to the database; storage communicatively accessible by the processor; the processor sorting mining association rules by: identifying statistically significant relationships within a cumulated distribution of uniform resource locator data, the significant relationships represented by association rules; and separating meaningful association rules from unmeaningful association rules using an emulated distribution of the uniform resource locator data as a reference, wherein said emulated distribution is based upon emulated events that are different than actual events.

Claim 50

Independent Claim 95 words

An apparatus to sort data mining association rules, comprising: a processor; a database including URL data; circuitry to communicatively couple the processor to the database; storage communicatively accessible by the processor; the processor sorting mining association rules by: identifying statistically significant relationships within a cumulated distribution of uniform resource locator data, the significant relationships represented by association rules; and separating meaningful association rules from unmeaningful association rules using an emulated distribution of the uniform resource locator data as a reference, wherein said emulated distribution is based upon emulated events that are different than actual events.

Claim 51

Dependent Claim 35 words

The apparatus recited in claim 43 , the processor further sorting by: separating meaningful association rules from unmeaningful association rules by sorting the rules by their support within the distribution of uniform resource locator data.

Claim 52

Dependent Claim 32 words

The apparatus recited in claim 43 , separating meaningful association rules from unmeaningful association rules by sorting the rules by their confidence for support within the distribution of uniform resource locator data.

Claim 53

Dependent Claim 125 words

The apparatus recited in claim 43 , wherein the association rules are sorted in sets of rules for different systems of events, where C represents an emulated system of events for a web site and B represents an actual system of events for the same web site data, and where if K(P AC :R AC )>K(P AB :R AB ), the association rules applied to the emulated system of events C have greater relevance then the association rules applied to the actual system of events B, and where P is a probability distribution for an association rule for the actual system of events, and R is an emulated support for an association rule for the emulated system of events, and wherein K is a constant.

Claim 54

Dependent Claim 22 words

The apparatus recited in claim 43 , wherein P is measured by an association rule's support in a respective system of events.

Claim 55

Dependent Claim 61 words

The apparatus recited in claim 43 , wherein P AB =P(A, B 1 ), P(A, B 2 ), . . . P(A, B n ) and R AB =R(A, B 1 ), R(A, B 2 ) . . . R(A, B n , and P AC =P(A, C 1 ), P(A, C 2 ), . . . P(A, B n ).

Claim 56

Dependent Claim 18 words

The apparatus recited in claim 43 , wherein the association rules are sorted in descending order of support.

Claim 57

Dependent Claim 136 words

The apparatus recited in claim 43 , where P(A,B 1 )/R(A,B 1 ), P(A,B 2 )/R(A,B 2 ), . . . P(A,B n )/R(A,B n ), where B represents an event in an actual system of events, and where the association rules pertaining to the actual system of events have equal support as association rules pertaining to an emulated system of events if P AB /R AB =1, where P is a probability, distribution for an association rule for the actual system of events, and R is an emulated support for an association rule for the emulated system of events, and where P AB has lesser support than R AB as P AB →0 and R AB →∞, and where P AB has greater support than R AB as R AB →0 and P AB →∞.

Claim 58

Dependent Claim 18 words

The apparatus recited in claim 43 , wherein the association rules are sorted in ascending order of support.

Claim 59

Dependent Claim 134 words

The apparatus recited in claim 43 , where R(A,B 1 )/P(A,B 1 ), R(A,B 2 )/P(A,B 2 ), . . . R(A,B n )/P(A,B n ), where B represents an actual system of events, and where the association rules pertaining to the actual system of events have equal support as the association rules pertaining to an emulated system of events if R AB /P AB =1 where R is an emulated support for an association rule for an emulated system of events, and P is a probability distribution for an association rule for the actual system of events, and where R AB has lesser support than P AB as R AB →0 and P AB →∞, and where R AB has greater support than P AB as P AB →0 and R AB →∞.

Claim 60

Dependent Claim 40 words

The apparatus recited in claim 43 , wherein the association rules are further sorted where P(A,B 1 )log(P(A,B 1 )/R(A,B 1 )), P(A,B 2 )log(P(A,B 2 )/R(A,B 2 )), . . . , P(A,B n )log(P(A,B n )/R(A,B n )).

Claim 61

Dependent Claim 48 words

The apparatus recited in claim 50 , wherein the association rules are further sorted where P(A, B 1 )log(P(A, B 1 )/R(A,B 1 )), P(A, B 2 )log(P(A, B 2 )/R(A, B 2 )), . . . , P(A, B n )log(P(A, B n )/R(A, B n )).

Claim 62

Dependent Claim 48 words

The apparatus recited in claim 52 , wherein the association rules are further sorted where P(A, B 1 )log(P(A, B 1 )/R(A,B 1 )), P(A, B 2 )log(P(A, B 2 )/R(A, B 2 )), . . . , P(A, B n )log(P(A, B n )/R(A, B n )).

Claim 63

Dependent Claim 93 words

The apparatus recited in claim 43 , wherein event D 1 corresponds to a set of uniform resource locator data, and event D 1 corresponds to all other sets of uniform resource locators not in set D 1 , and where D={D 1 , D 2 , . . . , D m }, where the uniform resource locator data sets do not comprise a system of events and {(P(A,D i )/R(A,D i )÷P(A,D i )/R(A,D i ))/2}, i=1, 2, . . . , m, where i=1, 2, . . . , m.

Claim 64

Dependent Claim 43 words

The apparatus recited in claim 43 , sorting further comprising {P(A,D i )log(P(A,D i )/R(A,D i ))÷P(A,D i )log(P(A,D i )/R(A,D i ))}, i =1, 2, . . . , m, {P(A,D i )/R(A,D i )}, i=1, 2, . . . , m.

Claim 65

Dependent Claim 57 words

The apparatus recited in claim 43 , wherein association rules having high levels of support compared to the emulated baseline reference distribution are ranked highest, regardless of whether the association rules are highly supported in the uniform resource locator data as determined by P, and where P is a probability of an occurrence of the association rule.

Claim 66

Dependent Claim 39 words

The apparatus recited in claim 43 , wherein two association rules with identical P values are further sorted so that the rule with greater support in the emulated data is sorted higher than the rule with the lesser support.

Claim 67

Independent Claim 145 words

An apparatus to sort data mining association rules, comprising: a processor; a database including URL data; circuitry to communicatively couple the processor to the database; storage communicatively accessible by the processor; the processor sorting mining association rules by: identifying statistically significant relationships within a cumulated distribution of uniform resource locator data, the significant relationships represented by association rules; and separating meaningful association rules from unmeaningful association rules using an emulated distribution of the uniform resource locator data as a reference, wherein said emulated distribution is based upon emulated events that are different than actual events; where the uniform resource locator data does not comprise a system of events and is sorted by m sets of uniform resource locator data, where {P(A,D i )/R(A,D i )}, i=1, 2, . . . , m, and D i corresponds to sets of uniform resource data l to m.

Claim 68

Independent Claim 145 words

An apparatus to sort data mining association rules, comprising: a processor; a database including URL data; circuitry to communicatively couple the processor to the database; storage communicatively accessible by the processor; the processor sorting mining association rules by: identifying statistically significant relationships within a cumulated distribution of uniform resource locator data, the significant relationships represented by association rules; and separating meaningful association rules from unmeaningful association rules using an emulated distribution of the uniform resource locator data as a reference, wherein said emulated distribution is based upon emulated events that are different than actual events; where the uniform resource locator data does not comprise a system of events and is sorted by m sets of uniform resource locator data, where {P(A,D i )/R(A,D i )}, i=1, 2, . . . , m, and D i corresponds to sets of uniform resource data l to m.

Claim 69

Dependent Claim 29 words

The apparatus recited in claim 43 , wherein the association rules are further sorted where {P(A,D i )log(P(A,D i )/R(A,D i ))}, i=1, 2, . . . , m.

Claim 70

Independent Claim 151 words

An apparatus to sort data mining association rules, comprising: a processor; a database including URL data; circuitry to communicatively couple the processor to the database; storage communicatively accessible by the processor; the processor sorting mining association rules by: identifying statistically significant relationships within a cumulated distribution of uniform resource locator data, the significant relationships represented by association rules; and separating meaningful association rules from unmeaningful association rules using an emulated distribution of the uniform resource locator data as a reference, wherein said emulated distribution is based upon emulated events that are different than actual events; sorting of the association rules comprising ranking the rules by their confidence, where {P(A\D i )/R(A\D i )}, i=1,2, . . . , m, where P is a probability of an occurrence of an association rule, and where two association rules with identical P values are further sorted higher than the rule with the lesser support.

Claim 71

Independent Claim 151 words

An apparatus to sort data mining association rules, comprising: a processor; a database including URL data; circuitry to communicatively couple the processor to the database; storage communicatively accessible by the processor; the processor sorting mining association rules by: identifying statistically significant relationships within a cumulated distribution of uniform resource locator data, the significant relationships represented by association rules; and separating meaningful association rules from unmeaningful association rules using an emulated distribution of the uniform resource locator data as a reference, wherein said emulated distribution is based upon emulated events that are different than actual events; sorting of the association rules comprising ranking the rules by their confidence, where {P(A\D i )/R(A\D i )}, i=1,2, . . . , m, where P is a probability of an occurrence of an association rule, and where two association rules with identical P values are further sorted higher than the rule with the lesser support.

Claim 72

Dependent Claim 30 words

The apparatus recited in claim 43 , wherein the association rules are further sorted where {P(A,D i )log(P(A|D i )/R(A|D i ))}, i =1, 2, . . . , m.

Claim 73

Independent Claim 78 words

An apparatus for sorting data mining association rules, comprising: means for storing URL data; means for processing the URL data by: identifying statistically significant relationships within a cumulated distribution of uniform resource locator data, the significant relationships represented by association rules; and separating meaningful association rules from unmeaningful association rules using an emulated distribution of the uniform resource locator data as a reference, wherein said emulated distribution is based upon emulated events that are different than actual events.

Claim 74

Independent Claim 78 words

An apparatus for sorting data mining association rules, comprising: means for storing URL data; means for processing the URL data by: identifying statistically significant relationships within a cumulated distribution of uniform resource locator data, the significant relationships represented by association rules; and separating meaningful association rules from unmeaningful association rules using an emulated distribution of the uniform resource locator data as a reference, wherein said emulated distribution is based upon emulated events that are different than actual events.

Claim 75

Dependent Claim 37 words

The apparatus recited in claim 64 , the processing means further sorting data by separating meaningful association rules from unmeaningful association rules by sorting the rules by their support within the distribution of uniform resource locator data.

Claim 76

Dependent Claim 39 words

The apparatus recited in claim 64 , the processing means further sorting data by separating meaningful association rules from unmeaningful association rules by sorting the rules by their confidence for support within the distribution of uniform resource locator data.

Claim 77

Dependent Claim 125 words

The apparatus recited in claim 64 , wherein the association rules are sorted in sets of rules for different systems of events, where C represents an emulated system of events for a web site and B represents an actual system of events for the same web site data, and where if K(P AC :R AC )>K(P AB :R AB ), the association rules applied to the emulated system of events C have greater relevance then the association rules applied to the actual system of events B, and where P is a probability distribution for an association rule for the actual system of events, and R is an emulated support for an association rule for the emulated system of events, and wherein K is a constant.

Claim 78

Dependent Claim 22 words

The apparatus recited in claim 64 , wherein P is measured by an association rule's support in a respective system of events.

Claim 79

Dependent Claim 61 words

The apparatus recited in claim 64 , wherein P AB =P(A, B 1 ), P(A, B 2 ), . . . P(A, B n ) and R AB =R(A, B 1 ), R(A, B 2 ) . . . R(A, B n ), and P AC =P(A, C 1 ), P(A, C 2 ), . . . P(A, B n ).

Annuity Stage	Window Opens	Payment Deadline	Surcharge Period Until	Estimated Fee	Status
3.5 Years (Year 4)	2004-05-07	2004-11-06	2005-05-08	$2000.00	Window Closed / Lapsed
7.5 Years (Year 8)	2008-05-07	2008-11-06	2009-05-08	$3760.00	Window Closed / Lapsed
11.5 Years (Year 12)	2012-05-07	2012-11-06	2013-05-08	$7700.00	Window Closed / Lapsed

Association rule ranker for web site emulation

Abstract

Inventors

Bibliographic Details

Claims Analysis

References Cited (Backward Citations)

USPTO Annuity & Maintenance Windows

Assigned Categories & Tags

Assign Category Tag