 |
|
|
|
|
|
 Title: |
US6473757:
System and method for constraint based sequential pattern mining[En]
[ Derwent Title ]
|
| Country: |
US United States of America
|
| |
| Inventor: |
Garofalakis, Minos N.; Chatham Township, NJ
Rastogi, Rajeev; New Providence, NJ
Shim, Kyuseok; Basking Ridge, NJ
|
| Assignee: |
Lucent Technologies Inc., Murray Hill, NJ
other patents from LUCENT TECHNOLOGIES INC. (722326) (approx. 6,959)
News, Profiles, Stocks and More about this company
|
| Published / Filed: |
2002-10-29
/ 2000-03-28
|
| Application Number: |
US2000000537082
|
| IPC Code: |
Advanced:
G06F 7/00;
G06F 17/30;
Core:
more...
IPC-7:
G06F 7/00;
G06F 17/30;
|
| ECLA Code: |
G06F17/30S4F9; G06F17/30S4P8D; G06F17/30S4P8Q;
|
| U.S. Class: |
707/006;
|
| Field of Search: |
707/002,6,9,10
|
| Priority Number: |
| 2000-03-28 |
US2000000537082 |
|
| Abstract: |
The present invention provides a method and system for sequential pattern mining with a given constraint. A Regular Expression (RE) is used for identifying the family of interesting frequent patterns. A family of methods that enforce the RE constraint to different degrees within the generating and pruning of candidate patterns during the mining process is utilized. This is accomplished by employing different relaxations of the RE constraint in the mining loop. Those sequences which satisfy the given constraint are thus identified most expeditiously.
[En]
|
| Attorney, Agent or Firm: |
Ference & Associates ;
|
| Primary / Asst. Examiners: |
Breene, John; Rayyan, Susan
|
| INPADOC Legal Status: |
Show legal status actions
|
| Family: |
None
|
First Claim:
Show all 18 claims |
What is claimed is:
1. A method for sequential pattern mining using a given constraint, said method comprising the steps of:
- selecting a second constraint less restrictive than the given constraint;
- identifying a set of frequent items which satisfy the second less restrictive constraint;
- producing a set of candidate sequences that satisfy the second less restrictive constraint;
- removing from the set of candidate sequences those sequences containing at least one subsequence that satisfies the second less restrictive constraint and is not frequent;
- counting support for all remaining candidate sequences; and
- continuing to successively produce a set of candidate sequences that satisfy the second less restrictive constraint, remove from the set of candidate sequences those sequences containing at least one subsequence that satisfies the second less restrictive constraint and is not frequent, and count support for all remaining candidate sequences until a given terminating condition is satisfied.
|
| Background / Summary: |
Show background / summary
|
| Drawing Descriptions: |
Show drawing descriptions
|
| Description: |
Show description
|
| Forward References: |
Show 22 U.S. patent(s) that reference this one
|
