US6249779B1
Expired / Lapsed
US
⏱️ 0.0 years remaining
Adaptive fuzzy feature mapping
Assignee: Hanger Solutions LLC
•
Filing: 1998-05-13
•
Granted: 2001-06-19
•
Expires: 2018-05-13
Abstract
Abstract An adaptive fuzzy feature mapping (AFFM) technique provides a method for identifying and matching a new data pattern against a set of known data patterns using a combination of distance measurements and fuzzy logic functions. Known data patterns are stored as organized nodes in a pattern map wherein each organized node is defined by one or more attribute coefficients. As distance measurement is computed between a new data pattern and each organized node of the pattern map using distance measurement wherein the organized node having the smallest distance measurement to the new data pattern receives the highest ranking. Traversing the organized nodes according to the ranking, the new data pattern is compared to each organized node using fuzzy logic functions. If the new data pattern matches an organized node based on an acceptable degree of fuzziness, the attribute coefficients of the organized node are updated to reflect those coefficients of the new data pattern. If the new data pattern does not match any of the organized nodes in the pattern map, a new organized node is created in the pattern map representing the attribute coefficients of the new data pattern.
Inventors
- 👤 Ben A. Hitt
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-06 19:40
CPC Classifications
G; G06; G06N; G06N7/00; G06N7/02; Y; Y10; Y10S; Y10S706/00; Y10S706/90; Y10S707/00; Y10S707/99931; Y10S707/99933; Y10S707/99935; Y10S707/99936
Claims Analysis
Total Claims: 28
Claim 1
Independent Claim
145 words
A method for pattern matching a new data pattern using an adaptive fuzzy feature mapping having a pattern map storing one or more organized nodes, wherein each organized node represents a known data pattern defined by one or more attribute coefficients, comprising the steps of: a. computing a distance measurement between the new data pattern and each organized node of the pattern map; b. ranking each organized node of the pattern map according to said distance measurement computed in step ( 1 ) for said organized node, thereby creating an ordered pattern map; c. traversing the organized nodes of said ordered pattern map according to said ranking of step (b) by selecting a current organized node; and d. determining whether the new data pattern matches said current organized node of said ordered pattern map by using fuzzy logic techniques and an acceptable degree of fuzziness.
Claim 2
Independent Claim
145 words
A method for pattern matching a new data pattern using an adaptive fuzzy feature mapping having a pattern map storing one or more organized nodes, wherein each organized node represents a known data pattern defined by one or more attribute coefficients, comprising the steps of: a. computing a distance measurement between the new data pattern and each organized node of the pattern map; b. ranking each organized node of the pattern map according to said distance measurement computed in step ( 1 ) for said organized node, thereby creating an ordered pattern map; c. traversing the organized nodes of said ordered pattern map according to said ranking of step (b) by selecting a current organized node; and d. determining whether the new data pattern matches said current organized node of said ordered pattern map by using fuzzy logic techniques and an acceptable degree of fuzziness.
Claim 3
Dependent Claim
42 words
The method for pattern matching according to claim 1 , further comprising the step of: e. adjusting the attribute coefficients of said current organized node if it is determined in step (d) that the new data pattern matches said current organized node.
Claim 4
Dependent Claim
57 words
The method for pattern matching according to claim 1 , further comprising the step of: e. creating a new organized node in the pattern map, wherein said new organized node represents the new data pattern, if it is determined in step (d) that the new data pattern does not match any organized node in the pattern map.
Claim 5
Dependent Claim
79 words
The method for pattern matching according to claim 1 , wherein said step (b) ranks the organized nodes such that an organized node having a shortest distance to the new data pattern receives a highest rank, an organized node having a longest distance to the new data pattern receives a lowest rank, and the remaining organized nodes are ranked in between said highest rank and said lowest rank according to the respective said distance measurement of each organized node.
Claim 6
Dependent Claim
49 words
The method for pattern matching according to claim 4 , wherein said step (c) traverses said ordered pattern map starting with said organized node having said highest rank and continues through said ordered pattern map according to said ranking and ending with said organized node having said lowest rank.
Claim 7
Dependent Claim
20 words
The method for pattern matching according to claim 1 , wherein step (a) computes said distance measurement using Feature Mapping.
Claim 8
Dependent Claim
27 words
The method for pattern matching according to claim 1 , wherein step (d) determines whether the new data pattern matches said current organized node using Fuzzy ART.
Claim 9
Dependent Claim
37 words
The method for pattern matching according to claim 1 , further comprising the step of: (e) inputting said acceptable degree of fussiness by an operator for determining whether the new data pattern matches said current organized node.
Claim 10
Dependent Claim
36 words
The method for pattern matching of claim 1 , wherein said acceptable degree of fuzziness for determining whether the new data pattern matches said organized node using is a fixed set of one or more values.
Claim 11
Dependent Claim
21 words
The method for pattern matching according to claim 1 , further comprising the step of: e. inputting the new data pattern.
Claim 12
Dependent Claim
37 words
The method for pattern matching according to claim 1 , further comprising the steps of: e. receiving a data stream; f. identifying a new data pattern in said data stream; and g. inputting the new data pattern.
Claim 13
Independent Claim
149 words
A method for pattern matching a new data pattern using an adaptive fuzzy feature mapping having a pattern map storing one or more organized nodes, wherein each organized node represents a known data pattern defined by one or more attribute coefficients, comprising the steps of: a. comparing the new data pattern with each organized node of the pattern map using a first pattern matching technique, generating a comparison result for each organized node; b. ranking each organized node of the pattern map according to said comparison result computed in step (a) for said organized node, thereby creating an ordered pattern map; c. traversing the organized nodes of said ordered pattern map according to said ranking of step (b) by selecting a current organized node; and d. determining whether the new data pattern matches said current organized node of said ordered pattern map by using a second pattern matching technique.
Claim 14
Independent Claim
149 words
A method for pattern matching a new data pattern using an adaptive fuzzy feature mapping having a pattern map storing one or more organized nodes, wherein each organized node represents a known data pattern defined by one or more attribute coefficients, comprising the steps of: a. comparing the new data pattern with each organized node of the pattern map using a first pattern matching technique, generating a comparison result for each organized node; b. ranking each organized node of the pattern map according to said comparison result computed in step (a) for said organized node, thereby creating an ordered pattern map; c. traversing the organized nodes of said ordered pattern map according to said ranking of step (b) by selecting a current organized node; and d. determining whether the new data pattern matches said current organized node of said ordered pattern map by using a second pattern matching technique.
Claim 15
Dependent Claim
52 words
The method for pattern matching according to claim 12 , wherein said first pattern matching technique comprises distance based functions and said second pattern matching technique is a fuzzy logic technique, or said first pattern matching technique is a fuzzy logic technique and said second pattern matching technique comprises distance based functions.
Claim 16
Dependent Claim
26 words
The method for pattern matching according to claim 13 , wherein said distance based functions are Feature Mapping and said fuzzy logic technique if Fuzzy ART.
Claim 17
Dependent Claim
42 words
The method for pattern matching according to claim 12 , further comprising the step of: e. adjusting the attribute coefficients of said current organized node if it is determined in step (d) that the new data pattern matches said current organized node.
Claim 18
Dependent Claim
57 words
The method for pattern matching according to claim 12 , further comprising the step of: e. creating a new organized node in the pattern map, wherein said new organized node represents the new data pattern, if it is determined in step (d) that the new data pattern does not match any organized node in the pattern map.
Claim 19
Dependent Claim
191 words
A computer program product for use with a computer system, comprising: a computer usable medium having computer readable program code means embodied in said medium for pattern matching a new data pattern using an adaptive fuzzy feature mapping having a pattern map storing one or more organized nodes, wherein each organized node represents a known data pattern defined by one or more attribute coefficients, said computer readable program code means comprising: computing means for enabling a processor to compute a distance measurement between the new data pattern and each organized node of the pattern map; ranking means for enabling a processor to rank each organized node of the pattern map according to said distance measurement computed by said computing means for said organized node, thereby creating an ordered pattern map; traversing means for enabling a processor to traverse the organized nodes of said ordered pattern map according to said ranking by selecting a current organized node; and determining means for enabling a processor to determine whether the new data pattern matches said current organized node of said ordered pattern map by using fuzzy logic techniques and an acceptable degree of fuzziness.
Claim 20
Dependent Claim
191 words
A computer program product for use with a computer system, comprising: a computer usable medium having computer readable program code means embodied in said medium for pattern matching a new data pattern using an adaptive fuzzy feature mapping having a pattern map storing one or more organized nodes, wherein each organized node represents a known data pattern defined by one or more attribute coefficients, said computer readable program code means comprising: computing means for enabling a processor to compute a distance measurement between the new data pattern and each organized node of the pattern map; ranking means for enabling a processor to rank each organized node of the pattern map according to said distance measurement computed by said computing means for said organized node, thereby creating an ordered pattern map; traversing means for enabling a processor to traverse the organized nodes of said ordered pattern map according to said ranking by selecting a current organized node; and determining means for enabling a processor to determine whether the new data pattern matches said current organized node of said ordered pattern map by using fuzzy logic techniques and an acceptable degree of fuzziness.
Claim 21
Dependent Claim
47 words
The computer program product according to claim 17 , said computer readable program code means further comprising: adjusting means for adjusting the attribute coefficients of said current organized node if it is determined by said determining means that the new data pattern matches said current organized node.
Claim 22
Dependent Claim
62 words
The computer program product according to claim 17 , said computer readable program code means further comprising: creating means for creating a new organized node in the pattern map, wherein said new organized node represents the new data pattern, if it is determined by said determining means that the new data pattern does not match any organized node in the pattern map.
Claim 23
Dependent Claim
78 words
The computer program product according to claim 17 , wherein said ranking means ranks the organized nodes such that an organized node having a shortest distance to the new data pattern receives a highest rank, an organized node having a longest distance to the new data pattern receives a lowest rank, and the remaining organized nodes are ranked in between said highest rank and said lowest rank according to the respective said distance measurement of each organized node.
Claim 24
Dependent Claim
48 words
The computer program product according to claim 20 , wherein said traversing means traverses said ordered pattern map starting with said organized node having said highest rank and continues through said ordered pattern map according to said ranking and ending with said organized node having said lowest rank.
Claim 25
Dependent Claim
20 words
The computer program product according to claim 17 , wherein said computing means computes said distance measurement using Feature Mapping.
Claim 26
Dependent Claim
27 words
The computer program product according to claim 17 , wherein said determining means determines whether the new data pattern matches said current organized node using Fuzzy ART.
Claim 27
Dependent Claim
25 words
The computer program product according to claim 17 , said computer readable program code means further comprising: inputting means for inputting the new data pattern.
Claim 28
Dependent Claim
45 words
The computer program product according to claim 17 , said computer readable program code means further comprising: receiving means for receiving a data stream, identifying means for identifying a new data pattern in said data stream, and inputting means for inputting the new data pattern.
References Cited (Backward Citations)
US5127063A
Cited
US5046019A
Cited
US5638460A
Cited
US5515477A
Cited
US5499319A
Cited
US5606690A
Cited
US5531227A
Cited
US5537330A
Cited
US5706497A
Cited
US6018735A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2004-06-18 | 2004-12-18 | 2005-06-19 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2008-06-18 | 2008-12-18 | 2009-06-19 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2012-06-18 | 2012-12-18 | 2013-06-19 | $7700.00 | Window Closed / Lapsed |