-
公开(公告)号：US20240346334A1
公开(公告)日：2024-10-17
申请号：US18756936
申请日：2024-06-27
Applicant: SNOWFLAKE INC.
Inventor： David Jensen
IPC: G06N5/01 , G06F16/2455
CPC classification number: G06N5/01 , G06F16/24564
Abstract: An approach is disclosed that determines a path through multiple levels of a generalization lattice. The path includes multiple nodes corresponding to the multiple levels, and each of the nodes is determined from a scoring function that utilizes a corresponding parent node that was previously added to the path. The approach then selects an optimal node from the nodes in the path.
-
公开(公告)号：US12086287B2
公开(公告)日：2024-09-10
申请号：US17980371
申请日：2022-11-03
Applicant: SNOWFLAKE INC.
Inventor： David Jensen , Joseph David Jensen
CPC classification number: G06F21/6254 , G06F16/221 , G06F16/282 , G06F21/6227
Abstract: A method receives data from a data source. The method generates a plurality of generalizations of the data. The method sends the plurality of generalizations of the data to a plurality of execution nodes, wherein each of the plurality of execution nodes includes computational resources to compute a candidate generalization using an information loss scoring function. The method receives a candidate generalization from each of the plurality of execution nodes. The method selects a preferred generalization from the plurality of candidate generalizations. The method generates an anonymized view of the data set using the preferred generalization.
-
公开(公告)号：US11816582B2
公开(公告)日：2023-11-14
申请号：US17507691
申请日：2021-10-21
Applicant: SNOWFLAKE INC.
Inventor： David Jensen
IPC: G06N5/01 , G06F16/2455
CPC classification number: G06N5/01 , G06F16/24564
Abstract: 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.
-
公开(公告)号：US20240005175A1
公开(公告)日：2024-01-04
申请号：US18469356
申请日：2023-09-18
Applicant: SNOWFLAKE INC.
Inventor： David Jensen
IPC: G06N5/01 , G06F16/2455
CPC classification number: G06N5/01 , G06F16/24564
Abstract: An approach is disclosed that computes a path through a generalization lattice comprising a plurality of levels. For each of the levels, the approach uses a scoring function to compute one or more values from a node on a first level of the generalization lattice to one or more neighboring nodes on a second level of the generalization lattice. The approach then adds a best node from the neighboring nodes to the path based on the values. At the completion of computing scoring functions on the generalization lattice, the path comprises a best node from each of the plurality of levels. The approach then selects an optimal node from the best nodes in the path.
-
公开(公告)号：US11755778B2
公开(公告)日：2023-09-12
申请号：US17352218
申请日：2021-06-18
Applicant: SNOWFLAKE INC.
Inventor： David Jensen , Joseph David Jensen
CPC classification number: G06F21/6254 , G06F16/221 , G06F16/282 , G06F21/6227
Abstract: Generating an anonymized view for a data set is described. An example method can include receiving data from a data set, wherein the data is organized in a plurality of columns. The method may also include generating a plurality of generalizations of the data. The method may also further include selecting a generalization from the plurality of generalizations using an information loss scoring function based on at least a generalization information loss. Additionally, the method may also include generating an anonymized view of the data set from the selected generalization.
-
Patent Agency Ranking
公开(公告)号：US20230131743A1
公开(公告)日：2023-04-27
申请号：US17507691
申请日：2021-10-21
Applicant: SNOWFLAKE INC.
Inventor： David Jensen
IPC: G06N5/00 , G06F16/2455
Abstract: 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.
-
公开(公告)号：US11501021B1
公开(公告)日：2022-11-15
申请号：US17352217
申请日：2021-06-18
Applicant: SNOWFLAKE INC.
Inventor： David Jensen , Joseph David Jensen
Abstract: Generating an anonymized view for a data set is described. An example method can include receiving data from a data set, wherein the data is organized in a plurality of columns. The method may also include generating a plurality of generalizations of the data. The method may also further include selecting a generalization from the plurality of generalizations using an information loss scoring function based on at least a generalization information loss. Additionally, the method may also include generating an anonymized view of the data set from the selected generalization.
-
公开(公告)号：US12056619B2
公开(公告)日：2024-08-06
申请号：US18469356
申请日：2023-09-18
Applicant: SNOWFLAKE INC.
Inventor： David Jensen
IPC: G06N5/01 , G06F16/2455
CPC classification number: G06N5/01 , G06F16/24564
Abstract: An approach is disclosed that computes a path through a generalization lattice comprising a plurality of levels. For each of the levels, the approach uses a scoring function to compute one or more values from a node on a first level of the generalization lattice to one or more neighboring nodes on a second level of the generalization lattice. The approach then adds a best node from the neighboring nodes to the path based on the values. At the completion of computing scoring functions on the generalization lattice, the path comprises a best node from each of the plurality of levels. The approach then selects an optimal node from the best nodes in the path.
-
公开(公告)号：US20230050290A1
公开(公告)日：2023-02-16
申请号：US17980371
申请日：2022-11-03
Applicant: SNOWFLAKE INC.
Inventor： David Jensen , Joseph David Jensen
Abstract: A method receives data from a data source. The method generates a plurality of generalizations of the data. The method sends the plurality of generalizations of the data to a plurality of execution nodes, wherein each of the plurality of execution nodes includes computational resources to compute a candidate generalization using an information loss scoring function. The method receives a candidate generalization from each of the plurality of execution nodes. The method selects a preferred generalization from the plurality of candidate generalizations. The method generates an anonymized view of the data set using the preferred generalization.
-
公开(公告)号：US20220343019A1
公开(公告)日：2022-10-27
申请号：US17352217
申请日：2021-06-18
Applicant: SNOWFLAKE INC.
Inventor： David Jensen , Joseph David Jensen
Abstract: Generating an anonymized view for a data set is described. An example method can include receiving data from a data set, wherein the data is organized in a plurality of columns. The method may also include generating a plurality of generalizations of the data. The method may also further include selecting a generalization from the plurality of generalizations using an information loss scoring function based on at least a generalization information loss. Additionally, the method may also include generating an anonymized view of the data set from the selected generalization.
-
-
-
-
-
-
-
-
-
Search Results
11
records
(took 0.022 seconds)
