Patent US7089250B2 successfully refreshed from Google Patents.
← Back to Patent Explorer
US7089250B2 Expired / Lapsed US ⏱️ 0.0 years remaining

Method and system for associating events

Assignee: International Business Machines Corp
•
Filing: 2003-10-08
•
Granted: 2006-08-08
•
Expires: 2023-10-08
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract A method, system, and computer program product for associating events. A provided event dataset includes events occurring in each of N successive time intervals (N≧3). Association rules pertaining to successive events in the event dataset are deduced. Sequences of events are generated from the association rules. Clusters of the sequences of events are formed. Sequences of the clusters are created. The clusters of the sequences may be used: to identify at least one event occurring in a time interval of the N time intervals as being a probable cause of at least one event occurring in a later-occurring time interval of the N time intervals; or to predict an occurrence of at least one event in a time interval occurring after the N time intervals, wherein the at least one event had occurred within the N time intervals.

Inventors

  • 👤 Yurdaer N. Doganata
  • 👤 Youssef Drissi
  • 👤 Tong-haing Fin
  • 👤 Jun-Jang Jeng
  • 👤 Moon J. Kim
  • 👤 Lev Kozakov

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-10-30 17:20
CPC Classifications
G; G06; G06F; G06F11/00; G06F11/07; G06F11/0703; G06F11/0706; G06F11/0709; G06F11/079; G06F11/22; G06F11/2257; Y; Y10; Y10S; Y10S707/00; Y10S707/99941; Y10S707/99943

Claims Analysis

Total Claims: 33
Claim 1
Independent Claim 269 words
A method for associating events, comprising the steps of: providing an event dataset that includes a plurality of events occurring in each of N successive time intervals, said N≧3, said event dataset being stored on a computer readable medium; deducing from the event dataset a plurality of association rules, each association rule E K E L of the plurality of association rules expressing an association between events E K and E L respectively occurring in two successive time intervals of the N time intervals, said events E K and E L being in the event dataset; generating a plurality of sequences of events, each sequence of the plurality of sequences being generated from at least two sequentially ordered association rules of the plurality of association rules; forming a plurality of clusters from the plurality of sequences in accordance with a clustering algorithm, each cluster of the plurality of clusters including at least two sequences of the plurality of sequences; creating S C sequences of clusters from the plurality of clusters, said S C ≧1, each sequence of the S C sequences including at least two clusters of the plurality of clusters; and after the creating step, at least one of: identifying at least one event occurring in a first time interval of the N time intervals as being a probable cause of at least one event occurring in a later-occurring time interval of the N time intervals; and predicting an occurrence of at least one event in a time interval occurring after the N time intervals, wherein the at least one event had occurred within the N time intervals.
Claim 2
Independent Claim 269 words
A method for associating events, comprising the steps of: providing an event dataset that includes a plurality of events occurring in each of N successive time intervals, said N≧3, said event dataset being stored on a computer readable medium; deducing from the event dataset a plurality of association rules, each association rule E K E L of the plurality of association rules expressing an association between events E K and E L respectively occurring in two successive time intervals of the N time intervals, said events E K and E L being in the event dataset; generating a plurality of sequences of events, each sequence of the plurality of sequences being generated from at least two sequentially ordered association rules of the plurality of association rules; forming a plurality of clusters from the plurality of sequences in accordance with a clustering algorithm, each cluster of the plurality of clusters including at least two sequences of the plurality of sequences; creating S C sequences of clusters from the plurality of clusters, said S C ≧1, each sequence of the S C sequences including at least two clusters of the plurality of clusters; and after the creating step, at least one of: identifying at least one event occurring in a first time interval of the N time intervals as being a probable cause of at least one event occurring in a later-occurring time interval of the N time intervals; and predicting an occurrence of at least one event in a time interval occurring after the N time intervals, wherein the at least one event had occurred within the N time intervals.
Claim 3
Dependent Claim 47 words
The method of claim 1 , wherein each pair of sequentially ordered association rules of the plurality of association rules consists of a first association rule and a second association rule, and wherein the first association rule and the second association rule are independent of each other.
Claim 4
Dependent Claim 41 words
The method of claim 1 , wherein the association rules from which a first sequence of the plurality of sequences has been generated include a pair of consecutively ordered first and second association rules which are not independent of each other.
Claim 5
Dependent Claim 14 words
The method of claim 1 , wherein the N time intervals are contiguously sequenced.
Claim 6
Dependent Claim 15 words
The method of claim 1 , wherein the N time intervals are not contiguously sequenced.
Claim 7
Dependent Claim 64 words
The method of claim 1 , wherein each sequence of the plurality of sequences is of the form E 1 →E 2 →E 3 → . . . E 1−1 →E 1 in relation to sequentially ordered association rules E 1 E 2 , E 3 , . . . , E I−1 E I of the plurality of association rules, and wherein I≧3.
Claim 8
Dependent Claim 49 words
The method of claim 1 , wherein said each association rule satisfies a condition of α≦P KL <1, wherein P KL is the probability that E K and E L respectively occur in the two successive time intervals, and wherein α is a predetermined positive real number satisfying α<1.
Claim 9
Dependent Claim 49 words
The method of claim 7 , wherein α is within a range selected from the group consisting of a first range of 0.50≦α<1, a second range of 0.60≦α<1, a third range of 0.70≦α<1, a fourth range of 0.80≦α<1, a fifth range of 0.90≦α<1, and a sixth range of 0.95≦α<1.
Claim 10
Dependent Claim 34 words
The method of claim 7 , wherein each sequence of the plurality of sequences has a probability of occurrence no less than β, and wherein β is a predetermined positive real number satisfying β<α.
Claim 11
Dependent Claim 49 words
The method of claim 9 , wherein β is within a range selected from the group consisting of a first range of 0.20≦β<α, a second range of 0.30≦β<α, a third range of 0.40≦β<α, a fourth range of 0.50≦β<α, a fifth range of 0.60β≦α, and a sixth range of 0.70≦β<α.
Claim 12
Independent Claim 299 words
A system for associating events, comprising the steps of: means for providing an event dataset that includes a plurality of events occurring in each of N successive time intervals, said N≧3, said event dataset being stored on a computer readable medium; means for deducing, from the event dataset, a plurality of association rules, each association rule E K E L of the plurality of association rules expressing an association between events E K and E L respectively occurring in two successive time intervals of the N time intervals, said events E K and E L being in the event dataset; means for generating a plurality of sequences of events, each sequence of the plurality of sequences being generated from at least two sequentially ordered association rules of the plurality of association rules; means for forming a plurality of clusters from the plurality of sequences in accordance with a clustering algorithm, each cluster of the plurality of clusters including at least two sequences of the plurality of sequences; means for creating S C sequences of clusters from the plurality of clusters, said S C ≧1, each sequence of the S C sequences including at least two clusters of the plurality of; and at least one of: means for using at least one sequence of the S C sequences to identify at least one event occurring in a first time interval of the N time intervals as being a probable cause of at least one event occurring in a later-occurring time interval of the N time intervals; and means for using a first sequence of the S C sequences to predict an occurrence of at least one event in a time interval occurring after the N time intervals, wherein the at least one event had occurred within the N time intervals.
Claim 13
Independent Claim 299 words
A system for associating events, comprising the steps of: means for providing an event dataset that includes a plurality of events occurring in each of N successive time intervals, said N≧3, said event dataset being stored on a computer readable medium; means for deducing, from the event dataset, a plurality of association rules, each association rule E K E L of the plurality of association rules expressing an association between events E K and E L respectively occurring in two successive time intervals of the N time intervals, said events E K and E L being in the event dataset; means for generating a plurality of sequences of events, each sequence of the plurality of sequences being generated from at least two sequentially ordered association rules of the plurality of association rules; means for forming a plurality of clusters from the plurality of sequences in accordance with a clustering algorithm, each cluster of the plurality of clusters including at least two sequences of the plurality of sequences; means for creating S C sequences of clusters from the plurality of clusters, said S C ≧1, each sequence of the S C sequences including at least two clusters of the plurality of; and at least one of: means for using at least one sequence of the S C sequences to identify at least one event occurring in a first time interval of the N time intervals as being a probable cause of at least one event occurring in a later-occurring time interval of the N time intervals; and means for using a first sequence of the S C sequences to predict an occurrence of at least one event in a time interval occurring after the N time intervals, wherein the at least one event had occurred within the N time intervals.
Claim 14
Dependent Claim 47 words
The system of claim 11 , wherein each pair of sequentially ordered association rules of the plurality of association rules consists of a first association rule and a second association rule, and wherein the first association rule and the second association rule are independent of each other.
Claim 15
Dependent Claim 45 words
The system of claim 11 , wherein the association rules from which a first sequence of the plurality of sequences is generated by said means for generating include a pair of consecutively ordered first and second association rules which are not independent of each other.
Claim 16
Dependent Claim 14 words
The system of claim 11 , wherein the N time intervals are contiguously sequenced.
Claim 17
Dependent Claim 15 words
The system of claim 11 , wherein the N time intervals are not contiguously sequenced.
Claim 18
Dependent Claim 66 words
The system of claim 11 , wherein each sequence of the plurality of sequences is of the form E 1 →E 2 →E 3 → . . . E I−1 →E 1 in relation to sequentially ordered association rules E 1 E 2 , E 2 E 3 , . . . , E I−1 E 1 of the plurality of association rules, and wherein I≧3.
Claim 19
Dependent Claim 49 words
The system of claim 11 , wherein said each association rule satisfies a condition of α≦P KL <1, wherein P KL is the probability that E K and E L respectively occur in the two successive time intervals, and wherein α is a predetermined positive real number satisfying α<1.
Claim 20
Dependent Claim 49 words
The system of claim 17 , wherein α is within a range selected from the group consisting of a first range of 0.50≦α<1, a second range of 0.60≦α<1, a third range of 0.70≦α<1, a fourth range of 0.80≦α<1, a fifth range of 0.90≦α<1, and a sixth range of 0.95≦α<1.
Claim 21
Dependent Claim 34 words
The system of claim 17 , wherein each sequence of the plurality of sequences has a probability of occurrence no less than β, and wherein β is a predetermined positive real number satisfying β<α.
Claim 22
Dependent Claim 49 words
The system of claim 19 , wherein β is within a range selected from the group consisting of a first range of 0.20≦β<α, a second range of 0.30≦β<α, a third range of 0.40≦β<α, a fourth range of 0.50≦β<α, a fifth range of 0.60β≦α, and a sixth range of 0.70≦β<α.
Claim 23
Dependent Claim 300 words
A computer program product comprising a computer usable medium having a computer readable program embodied therein, said computer readable program adapted to access an event dataset that includes a plurality of events occurring in each of N successive time intervals, said event dataset being stored on a computer readable medium, said N≧3, said computer readable program further adapted execute a method for associating events, said method comprising the steps of: deducing from the event dataset a plurality of association rules, each association rule E K E L of the plurality of association rules expressing an association between events E K and E L respectively occurring in two successive time intervals of the N time intervals, said events E K and E L being in the event dataset; generating a plurality of sequences of events, each sequence of the plurality of sequences being generated from at least two sequentially ordered association rules of the plurality of association rules; forming a plurality of clusters from the plurality of sequences in accordance with a clustering algorithm, each cluster of the plurality of clusters including at least two sequences of the plurality of sequences; creating S C sequences of clusters from the plurality of clusters, said S C ≧1, each sequence of the S C sequences including at least two clusters of the plurality of clusters; and after the creating step, at least one of: identifying at least one event occurring in a first time interval of the N time intervals as being a probable cause of at least one event occurring in a later-occurring time interval of the N time intervals; and predicting an occurrence of at least one event in a time interval occurring after the N time intervals, wherein the at least one event had occurred within the N time intervals.
Claim 24
Dependent Claim 300 words
A computer program product comprising a computer usable medium having a computer readable program embodied therein, said computer readable program adapted to access an event dataset that includes a plurality of events occurring in each of N successive time intervals, said event dataset being stored on a computer readable medium, said N≧3, said computer readable program further adapted execute a method for associating events, said method comprising the steps of: deducing from the event dataset a plurality of association rules, each association rule E K E L of the plurality of association rules expressing an association between events E K and E L respectively occurring in two successive time intervals of the N time intervals, said events E K and E L being in the event dataset; generating a plurality of sequences of events, each sequence of the plurality of sequences being generated from at least two sequentially ordered association rules of the plurality of association rules; forming a plurality of clusters from the plurality of sequences in accordance with a clustering algorithm, each cluster of the plurality of clusters including at least two sequences of the plurality of sequences; creating S C sequences of clusters from the plurality of clusters, said S C ≧1, each sequence of the S C sequences including at least two clusters of the plurality of clusters; and after the creating step, at least one of: identifying at least one event occurring in a first time interval of the N time intervals as being a probable cause of at least one event occurring in a later-occurring time interval of the N time intervals; and predicting an occurrence of at least one event in a time interval occurring after the N time intervals, wherein the at least one event had occurred within the N time intervals.
Claim 25
Dependent Claim 49 words
The computer program product of claim 21 , wherein each pair of sequentially ordered association rules of the plurality of association rules consists of a first association rule and a second association rule, and wherein the first association rule and the second association rule are independent of each other.
Claim 26
Dependent Claim 43 words
The computer program product of claim 21 , wherein the association rules from which a first sequence of the plurality of sequences has been generated include a pair of consecutively ordered first and second association rules which are not independent of each other.
Claim 27
Dependent Claim 16 words
The computer program product of claim 21 , wherein the N time intervals are contiguously sequenced.
Claim 28
Dependent Claim 17 words
The computer program product of claim 21 , wherein the N time intervals are not contiguously sequenced.
Claim 29
Dependent Claim 69 words
The computer program product of claim 21 , wherein each sequence of the plurality of sequences is of the form E 1 →E 2 →E 3 → . . . . E I−1 →E 1 in relation to sequentially ordered association rules E 1 E 2 , E 2 E 3 , . . . , E I−1 E 1 of the plurality of association rules, and wherein I≧3.
Claim 30
Dependent Claim 51 words
The computer program product of claim 21 , wherein said each association rule satisfies a condition of α≦P KL <1, wherein P KL is the probability that E K and E L respectively occur in the two successive time intervals, and wherein α is a predetermined positive real number satisfying α<1.
Claim 31
Dependent Claim 52 words
The computer program product of claim 27 , wherein α is within a range selected from the group consisting of a first range of 0.50≦α<1, a second range of 0.60≦α<1, a third range of 0.70≦α<1, a fourth range of 0.80≦α<1, a fifth range of 0.90≦α<1, and a sixth range of 0.95 ≦α<1.
Claim 32
Dependent Claim 36 words
The computer program product of claim 27 , wherein each sequence of the plurality of sequences has a probability of occurrence no less than β, and wherein β is a predetermined positive real number satisfying β<α.
Claim 33
Dependent Claim 51 words
The computer program product of claim 29 , wherein β is within a range selected from the group consisting of a first range of 0.20≦β<α, a second range of 0.30≦β<α, a third range of 0.40≦β<α, a fourth range of 0.50≦β<α, a fifth range of 0.60β≦α, and a sixth range of 0.70≦β<α.

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 2009-08-07 2010-02-06 2010-08-08 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 2013-08-07 2014-02-06 2014-08-08 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2017-08-07 2018-02-06 2018-08-08 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag