Disjoint partial-area based taxonomy abstraction network
AssigneesNew Jersey Institute of Technology, Kean University
InventorsYehoshua Perl, James Geller, Michael Howard Halper, Joyce Wang
Life of this patent
Estimating the term…
Abstract
A disjoint partial-area taxonomy abstraction network and methods of producing same for a hierarchy, which partitions overlapping concepts into singly-rooted disjoint groups that are more manageable to work with and comprehend. This provides abstract models for summarizing overlapping concepts which permit enhanced, high-level display for users at a user interface.
Claims15
A method of providing disjoint partial-area taxonomy, comprising:
- deriving an area taxonomy from a given hierarchy, comprising identifying sets of concepts in the hierarchy that have identical relationships, replacing each set of the concepts with a single area, representing every area as a node connected to other nodes by links representing child-of hierarchical relationships, reflecting hierarchical (IS-A) relationships by identifying root concepts of an area, and connecting areas so that all IS-A relationships from the root concept of the area to a concept in another area results in a child-of hierarchical link to the second area;
- dividing all concepts in each area such that all descendant concepts of a single root form a partial-area;
- representing each partial-area as a smaller item within each representation of an area;
- and
- partitioning and generating a diagram separating the partial-areas into base partial-areas without overlaps and disjoint partial-areas containing overlapping concepts.
An apparatus, including a processor operating to perform actions in response to executing computer program instructions, the actions comprising:
- deriving an area taxonomy from a given hierarchy, comprising identifying sets of concepts in the hierarchy that have identical relationships, replacing each set of the concepts with a single area, representing every area as a node connected to other nodes by links representing child-of hierarchical relationships, reflecting hierarchical (IS-A) relationships by identifying root concepts, and connecting areas so that all IS-A relationships from the root concept of the area to a concept in another area results in a child-of hierarchical link to the second area;
- dividing all concepts in each area such that all descendant concepts of a single root form a partial-area;
- representing each partial-area as a smaller item within each representation of an area;
- and
- partitioning and generating a diagram separating the partial-areas into base partial-areas without overlaps and disjoint partial-areas containing overlapping concepts.
A non-transitory, computer readable storage medium containing a computer program, which when executed by a computer processor causes the computer processor to perform actions, the actions comprising:
- deriving an area taxonomy from a given hierarchy, comprising identifying sets of concepts in the hierarchy that have identical relationships, replacing each set of the concepts with a single area, representing every area as a node connected to other nodes by links representing child-of hierarchical relationships, reflecting concepts by hierarchical (IS-A) relationships by identifying root concepts, and connecting areas so that all IS-A relationships from the root concept of the area to a concept in another area results in a child-of hierarchical link to the second area;
- dividing all concepts in each area, such that all descendant concepts of a single root form a partial-area;
- representing each partial-area as a smaller item within each representation of an area;
- partitioning and generating a diagram separating the partial-areas into base partial-areas without overlaps and disjoint partial-areas containing overlapping sets.
Dependencies are inferred from the claim text.