| CPC G06N 5/01 (2023.01) [G06F 16/24564 (2019.01)] | 17 Claims |
|
1. A method comprising:
receiving a generalization lattice and one or more scoring functions;
selecting a start node and an end node in the generalization lattice;
for each of the one or more scoring functions, computing, with a processing device, a path through the generalization lattice from the start node to the end node that traverses the generalization lattice, wherein a plurality of levels in the generalization lattice each represent a different level of generalization of N columns of quasi-identifier data, wherein the computing of the path comprises:
computing one or more first values, using the scoring function, from a first node on a first level of the generalization lattice to one or more second neighboring nodes on a second level of the generalization lattice;
adding, from the one or more second neighboring nodes, a best node from the second level to the path based on the one or more first values;
computing one or more second values, using the scoring function, from the best node on the second level to one or more third neighboring nodes on a third level of the generalization lattice; and
adding, from the one or more third neighboring nodes, a best node from the third level to the path based on the one or more second values, wherein, at a completion of the computing for each of the plurality of levels, the path comprises one node added from each of the plurality of levels between the start node and the end node;
determining an optimal path node from each of the one or more paths; and
selecting an optimal node from the one or more optimal path nodes.
|