← Back to Patent Explorer
US6415283B1 Expired / Lapsed US ⏱️ 0.0 years remaining

Methods and apparatus for determining focal points of clusters in a tree structure

Assignee: Oracle International Corp
•
Filing: 1998-10-13
•
Granted: 2002-07-02
•
Expires: 2018-10-13
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract A cluster processing system determines at least one focal node on a hierarchically arranged tree structure of nodes based on attributes of a data set. The data set comprises a plurality of data set attributes with associated weight values. The cluster processing system selects a set of nodes from the tree structure with tree structure attributes that correspond with the data set attributes, and then assigns quantitative values to nodes in the set of nodes from the weight values in the data set. At least one cluster of nodes are selected, based on proximity in the tree structure, and at least one focal node on the tree structure for the cluster of nodes is selected. The focal node comprises an attribute most representative of the data set attributes. A terminological system learns the meaning of terms (attributes of a data set) by identifying categories (nodes) from a knowledge catalog (trees structure).

Inventors

  • 👤 James Conklin

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-11-10 02:14
CPC Classifications
G; G06; G06F; G06F16/00; G06F16/90; G06F16/901; G06F16/9027; Y; Y10; Y10S; Y10S707/00; Y10S707/99931; Y10S707/99933; Y10S707/99941; Y10S707/99942; Y10S707/99944; Y10S707/99945

Claims Analysis

Total Claims: 17
Claim 1
Independent Claim 172 words
A method for learning a context of a term from a plurality of terms, said method comprising the steps of: storing a knowledge base comprising a plurality of nodes of categories, arranged in a hierarchy to depict relationships among said categories, that represent concepts; receiving a plurality of base terms with associated weight values; receiving a term to learn a context of said term from said base terms; selecting a set of nodes from said knowledge base with concepts that correspond with said base terms; assigning quantitative values to nodes in said set of nodes from said weight values in said base terms; selecting at least one cluster of categories of nodes from said knowledge base based on said quantitative values and said relationships of said categories in said knowledge base; and selecting a focal point category for said cluster of nodes that represents a concept most representative of said term to learn based on said weight values of said nodes, wherein said focal point category identifies a concept for said term.
Claim 2
Independent Claim 172 words
A method for learning a context of a term from a plurality of terms, said method comprising the steps of: storing a knowledge base comprising a plurality of nodes of categories, arranged in a hierarchy to depict relationships among said categories, that represent concepts; receiving a plurality of base terms with associated weight values; receiving a term to learn a context of said term from said base terms; selecting a set of nodes from said knowledge base with concepts that correspond with said base terms; assigning quantitative values to nodes in said set of nodes from said weight values in said base terms; selecting at least one cluster of categories of nodes from said knowledge base based on said quantitative values and said relationships of said categories in said knowledge base; and selecting a focal point category for said cluster of nodes that represents a concept most representative of said term to learn based on said weight values of said nodes, wherein said focal point category identifies a concept for said term.
Claim 3
Dependent Claim 20 words
The method as set forth in claim 1 , wherein said base terms comprise themes from a corpus of documents.
Claim 4
Independent Claim 211 words
A method for determining at least one focal node on a hierarchically arranged tree structure of nodes for attributes of a data set, said method comprising the steps of: storing a tree structure comprising a plurality of nodes of tree structure attributes, arranged in a hierarchy, to depict relationships among said tree structure attributes; receiving a data set comprising a plurality of data set attributes with associated weight values; selecting a set of nodes from said tree structure with tree structure attributes that correspond with said data set attributes; assigning quantitative values to nodes in said set of nodes from said weight values in said data set; selecting at least one cluster of nodes, based on close proximity of said nodes in said tree structure; and selecting a focal node on said tree structure for said cluster of nodes based on said data set attributes, said focal node comprising tree structure attributes most representative of said data set attributes, wherein selection of said focal node includes evaluating attributes of said nodes of said cluster starting from a node at the top of said hierarchy of said tree structure and analyzing downward to select said focal node based on said quantitative values and said relationships of said attributes in said tree structure.
Claim 5
Independent Claim 211 words
A method for determining at least one focal node on a hierarchically arranged tree structure of nodes for attributes of a data set, said method comprising the steps of: storing a tree structure comprising a plurality of nodes of tree structure attributes, arranged in a hierarchy, to depict relationships among said tree structure attributes; receiving a data set comprising a plurality of data set attributes with associated weight values; selecting a set of nodes from said tree structure with tree structure attributes that correspond with said data set attributes; assigning quantitative values to nodes in said set of nodes from said weight values in said data set; selecting at least one cluster of nodes, based on close proximity of said nodes in said tree structure; and selecting a focal node on said tree structure for said cluster of nodes based on said data set attributes, said focal node comprising tree structure attributes most representative of said data set attributes, wherein selection of said focal node includes evaluating attributes of said nodes of said cluster starting from a node at the top of said hierarchy of said tree structure and analyzing downward to select said focal node based on said quantitative values and said relationships of said attributes in said tree structure.
Claim 6
Dependent Claim 62 words
The method as set forth in claim 1 , wherein the step of assigning quantitative values to nodes in said set of nodes from said weight values in said data set comprises the step of generating a raw weight for a node of said tree structure by summing weights for values of each attribute of said data set with a corresponding attribute.
Claim 7
Dependent Claim 54 words
The method as set forth in claim 1 , wherein the step of assigning quantitative values to nodes in said set of nodes from said weight values in said data set comprises the step of summing weight values for a node in said set of nodes for all nodes that descend from said node.
Claim 8
Dependent Claim 63 words
The method as set forth in claim 1 , wherein the step of assigning quantitative values to nodes in said set of nodes from said weight values in said data set comprises the step of dividing a weight value for a node in said set from a parent node proportionally among its child nodes based upon relative weight values of said child nodes.
Claim 9
Dependent Claim 62 words
The method as set forth in claim 1 , wherein the step of selecting one or more clusters of nodes from said set of nodes based on said quantitative values and said relationships in said tree structure comprises the step of applying a breadth cut-off percent to determine how broadly across said tree structure to select nodes as part of a cluster.
Claim 10
Dependent Claim 48 words
The method as set forth in claim 1 , wherein the step of selecting at least one focal point node for said cluster of nodes comprises the step of applying a depth cut-off percent to determine how far down in said hierarchy to select said focal point node.
Claim 11
Dependent Claim 228 words
A computer readable medium comprising a plurality of instructions, which when executed, cases the computer to determine at least one focal node on a hierarchically arranged tree structure of nodes for attributes of a data set, said instructions causing the computer to perform the steps of: storing a tree structure comprising a plurality of nodes of tree structure attributes, arranged in a hierarchy, to depict relationships among said tree structure attributes; receiving a data set comprising a plurality of data set attributes with associated weight values; selecting a set of nodes from said tree structure with tree structure attributes that correspond with said data set attributes; assigning quantitative values to nodes in said set of nodes from said weight values in said data set; selecting at least one cluster of nodes, based on close proximity of said nodes in said tree structure; and selecting a focal node on said tree structure for said cluster of nodes based on said data set attributes, said focal node comprising tree structure attributes most representative of said data set attributes, wherein selection of said focal node includes evaluating attributes of said nodes of said cluster starting from a node at the top of said hierarchy of said tree structure and analyzing downward to select said focal node based on said quantitative values and said relationships of said attributes in said tree structure.
Claim 12
Dependent Claim 228 words
A computer readable medium comprising a plurality of instructions, which when executed, cases the computer to determine at least one focal node on a hierarchically arranged tree structure of nodes for attributes of a data set, said instructions causing the computer to perform the steps of: storing a tree structure comprising a plurality of nodes of tree structure attributes, arranged in a hierarchy, to depict relationships among said tree structure attributes; receiving a data set comprising a plurality of data set attributes with associated weight values; selecting a set of nodes from said tree structure with tree structure attributes that correspond with said data set attributes; assigning quantitative values to nodes in said set of nodes from said weight values in said data set; selecting at least one cluster of nodes, based on close proximity of said nodes in said tree structure; and selecting a focal node on said tree structure for said cluster of nodes based on said data set attributes, said focal node comprising tree structure attributes most representative of said data set attributes, wherein selection of said focal node includes evaluating attributes of said nodes of said cluster starting from a node at the top of said hierarchy of said tree structure and analyzing downward to select said focal node based on said quantitative values and said relationships of said attributes in said tree structure.
Claim 13
Dependent Claim 64 words
The computer readable medium as set forth in claim 9 , wherein the step of assigning quantitative values to nodes in said set of nodes from said weight values in said data set comprises the step of generating a raw weight for a node of said tree structure by summing weights for values of each attribute of said data set with a corresponding attribute.
Claim 14
Dependent Claim 56 words
The computer readable medium as set forth in claim 9 , wherein the step of assigning quantitative values to nodes in said set of nodes from said weight values in said data set comprises the step of summing weight values for a node in said set of nodes for all nodes that descend from said node.
Claim 15
Dependent Claim 65 words
The computer readable medium as set forth in claim 9 , wherein the step of assigning quantitative values to nodes in said set of nodes from said weight values in said data set comprises the step of dividing a weight value for a node in said set from a parent node proportionally among its child nodes based upon relative weight values of said child nodes.
Claim 16
Dependent Claim 64 words
The computer readable medium as set forth in claim 9 , wherein the step of selecting one or more clusters of nodes from said set of nodes based on said quantitative values and said relationships in said tree structure comprises the step of applying a breadth cut-off percent to determine how broadly across said tree structure to select nodes as part of a cluster.
Claim 17
Dependent Claim 50 words
The computer readable medium as set forth in claim 9 , wherein the step of selecting at least one focal point node for said cluster of nodes comprises the step of applying a depth cut-off percent to determine how far down in said hierarchy to select said focal point node.

USPTO Annuity & Maintenance Windows

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

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag