IP Library Granted Patent US 12,632,370
Granted Patent B2
US 12,632,370 · App. 18/044,503 · Granted May 19, 2026

Secret decision tree test apparatus, secret decision tree test system, secret decision tree test method, and program

Inventor: Koki Hamada (Tokyo, JP)
Assignee: NTT, Inc.
G06F11/3698G06F11/3696
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 12,632,370
App. No.
18/044,503
Granted
May 19, 2026
Kind
B2
Abstract

A secret decision tree test device configured to evaluate a division condition at each of a plurality of nodes of a decision tree when learning of the decision tree is performed by secret calculation, the secret decision tree test device includes a memory; and a processor configured to execute inputting a numerical attribute value vector composed of specific numerical attribute values of items of data included in a data set for learning of the decision tree, a label value vector composed of label values of the items of the data, and a group information vector indicating grouping of the items of the data into the nodes; and calculating, using the numerical attribute value vector, the label value vector, and the group information vector, first to fourth frequencies, to evaluate the division condition using the first to fourth frequencies.

Claims (24)

1 . A secret decision tree test device configured to evaluate a division condition at each of a plurality of node of a decision tree when learning of the decision tree is performed by secret calculation, the secret decision tree test device comprising:

a memory; and

a processor configured to execute:

inputting a numerical attribute value vector composed of specific numerical attribute values of items of data included in a data set for learning of the decision tree, the specific numerical attribute values including three or more mutually different numerical attribute values that provide a plurality of threshold candidates, a label value vector composed of label values of the items of data, and a group information vector indicating grouping of the items of the data into the nodes;

calculating, using the numerical attribute value vector, the label value vector, and the group information vector, a first frequency of data belonging to each group, a second frequency of data for each of the label values in said each group, a third frequency of data belonging to a division group obtained by dividing said each group by a division condition indicating comparison between the numerical attribute value and a threshold value selected from the plurality of threshold candidates, and a fourth frequency of data for each of the label values in the division group; and

calculating an evaluation value for evaluating the division conditions using the first frequency, the second frequency, the third frequency, and the fourth frequency.

2 . The secret decision tree test device according to claim 1 , wherein the processor calculates the third frequency and the fourth frequency in each of a plurality of the division conditions for said each group.

3 . The secret decision tree test device according to claim 1 , wherein the processor further executes

rearranging numerical attribute values included in the numerical attribute value vector and label values included in the label value vector in ascending order of the numerical attribute values for said each group indicated in the group information vector;

creating, for each value that can be taken by the label value, a bit vector indicating a position of a label value that matches the value that can be taken by the label value, among the label values included in the label value vector;

calculating a first determination vector for determining a number of data items of numerical attribute values being less than or equal to the threshold value by performing an aggregation function cumulative sum operation of elements included in the bit vector for said each group indicated in the group information vector; and

calculating a second determination vector for determining a number of data items of numerical attribute values being greater than the threshold value by using the first determination vector and the bit vector,

wherein the processor calculates the fourth frequency using the first determination vector and the second determination vector.

4 . The secret decision tree test device according to claim 3 , wherein the processor calculates a total vector which is an element of a total for each group and calculates the second determination vector by subtracting the first determination vector from the total vector by performing an aggregate function summation operation of each element included in the bit vector in accordance with a group represented by the group information vector.

5 . A secret decision tree test system configured to evaluate a division condition at each of a plurality of nodes of a decision tree when learning of the decision tree is performed by secret calculation, the secret decision tree test system comprising:

a computer including a memory and a processor configured to execute:

inputting a numerical attribute value vector composed of specific numerical attribute values of each items of data included in a data set for learning of the decision tree, the specific numerical attribute values including three or more mutually different numerical attribute values that provide a plurality of threshold candidates, a label value vector composed of label values of the items of data, and a group information vector indicating grouping of the items of data into the nodes;

calculating, using the numerical attribute value vector, the label value vector, and the group information vector, a first frequency of data belonging to each group, a second frequency of data for each of the label values in said each group, a third frequency of data belonging to a division group obtained by dividing said each group by a division condition indicating comparison between the numerical attribute value and a threshold value selected from the plurality of threshold candidates, and a fourth frequency of data for each of the label values in the division group; and

calculating an evaluation value for evaluating the division condition using the first frequency, the second frequency, the third frequency, and the fourth frequency.

6 . A non-transitory computer-readable recording medium having computer-readable instructions stored thereon, which when executed, cause a computer to function as the secret decision tree test device according to claim 1 .

7 . A secret decision tree test method of evaluating a division condition at each of a plurality of nodes of a decision tree when learning of the decision tree is performed by secret calculation, executed by a computer including a memory and a processor, the secret decision tree test method comprising:

inputting a numerical attribute value vector composed of specific numerical attribute values of items of data included in a data set for learning of the decision tree, the specific numerical attribute values including three or more mutually different numerical attribute values that provide a plurality of threshold candidates, a label value vector composed of label values of the items of data, and a group information vector indicating grouping of the items of the data into the nodes;

calculating, using the numerical attribute value vector, the label value vector, and the group information vector, a first frequency of data belonging to each group, a second frequency of data for each of the label values in said each group, a third frequency of data belonging to a division group obtained by dividing said each group by a division condition indicating comparison between the numerical attribute value and a threshold value selected from the plurality of threshold candidates, and a fourth frequency of data for each of the label values in the division group; and

calculating an evaluation value for evaluating the division condition using the first frequency, the second frequency, the third frequency, and the fourth frequency.

Assignments (2)
CHANGE OF NAME Recorded Aug 15, 2025
From: NIPPON TELEGRAPH AND TELEPHONE CORPORATION
To: NTT, INC.
Reel/Frame 072490/0664 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Mar 8, 2023
From: HAMADA, KOKI
To: NIPPON TELEGRAPH AND TELEPHONE CORPORATION
Reel/Frame 062923/0150 →
Continuity (1)
Related Publication 20230325304A1 · Oct 12, 2023
References Cited (4)
US 20230034384A1 · Mao · 2023 [cited by examiner]
Gangrade et al: (“Privacy Preserving Two-Layer Decision Tree Classifier for Multiparty Databases”, Women in Research 2016, vol. 1, No. 1, Sep. 1, 2012 , hereinafter Gangrade) (Year: 2012). [cited by examiner]
Alka Gangrade et al: “Privacy Preserving Two-Layer Decision Tree Classifier for Multiparty Databases”, Women in Research 2016, vol. 1, No. 1, Sep. 1, 2012 (Sep. 1, 2012), pp. 77-82, XP055534527, 2 Penn Plaza, Suite 701 … [cited by applicant]
Koji Chida, Koki Hamada, Dai Ikarashi, Katsumi Takahashi, “Reconsideration of Light-Weight Verifiable Three-Party Secret Function Calculation,” In CSS, 2010. [cited by applicant]