Heuristic search for k-anonymization
摘要:
A device searches for an anonymization of a data set using a heuristic search. The device receives a generalization lattice and one or more scoring functions. The device further can include selecting a start node in the generalization lattice. For each of the one or more scoring functions, the device can further include computing a path the generalization lattice from the start node that traverses the generalization lattice. In addition, the device can include determining an optimal path node from each of the one or more paths. Furthermore, the method can include selecting an optimal node from the one or more optimal path nodes.
公开/授权文献
信息查询
0/0