You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Copy file name to clipboardExpand all lines: README.md
+1-1Lines changed: 1 addition & 1 deletion
Display the source diff
Display the rich diff
Original file line number
Diff line number
Diff line change
@@ -32,7 +32,7 @@ This paper describe how to train and predict with XGBoost algorothm in a secure
32
32
33
33
The performance seems good for ensemble trees with small depth.
34
34
35
-
The solution proposed by this paper can handle both Vertical and horizontal partitioned datasets. But if we can utilize the chracteristic of VFL, that the whole data vector of a specific feature is held by a party, some computation can be optimized out further.
35
+
The solution proposed by this paper can handle both Vertical and horizontal partitioned datasets. In pratice, the dataset is ofen vertical partitioned. So if we can utilize the chracteristic of VFL, that the WHOLE data vector of a specific FEATURE is held by ONE party, some computation can be optimized further.
0 commit comments