Hierarchical rule clustering
AssigneeHewlett Packard Enterprise Development LP
InventorsDavid Subiros Perez, Luis Miguel Vaquero Gonzalez
Life of this patent
Estimating the term…
Abstract
Example embodiments relate to hierarchical rule clustering. The examples disclosed herein access information about a set of rules, where information for an individual rule comprises information about a set of hypershapes associated with the individual rule. A respective hypervolume for each set of hypershapes associated with each individual rule may be calculated based on the accessed information. A first rule and a second rule may be combined as a new individual rule in the set of rules based on overlaps between the calculated hypervolumes.
Claims15
A system for hierarchical rule clustering, comprising a physical processor that implements machine readable instructions that cause the system to:
- access information about a set of rules, where information for an individual rule comprises information about a set of hypershapes associated with the individual rule;
- calculate, based on the accessed information, a respective hypervolume for each set of hypershapes associated with each individual rule;
- and
- combine, based on overlaps between the calculated hypervolumes, a first rule and a second rule as a new individual rule in the set of rules.
A method of hierarchical rule clustering, the method being implemented by a computer system comprising a physical processor implementing machine readable instructions, the method comprising:
- iteratively combining pairs of rules in a set of rules by:
- accessing information about the set of rules, where information for an individual rule comprises information about a set of hypershapes associated with the individual rule;
- calculating, based on the accessed information, a respective hypervolume for each set of hypershapes associated with each individual rule;
- and
- combining a first rule and a second rule as a new individual rule in the set of rules based on overlaps between the calculated hypervolumes.
A non-transitory machine-readable storage medium for hierarchical rule clustering, encoded with machine-readable instructions executable by the physical processor that cause the system to:
- access information about a set of rules, where information for an individual rule comprises information about a set of hypershapes associated with the individual rule;
- calculate, based on the accessed information, a respective hypervolume for each set of hypershapes associated with each individual rule;
- determine, based on the calculated respective hypervolumes, a respective pair overlap for each pair of rules in the set of rules;
- and
- combine, based on determined pair overlaps, a first rule and a second rule as a new individual rule in the set of rules.
Dependencies are inferred from the claim text.