A New Algorithm for Privacy-Preserving Horizontally Partitioned Linear Programs
In a linear programming for horizontally partitioned data, the equality constraint matrix is divided into groups of rows. Each group of the matrix rows and the corresponding right-hand side vector are owned by different entities, and these entities are reluctant to disclose their own groups of rows...
Saved in:
| Main Authors: | Chengxue Zhang, Debin Kong, Peng Pan, Mingyuan Zhou |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2021-01-01
|
| Series: | Journal of Mathematics |
| Online Access: | http://dx.doi.org/10.1155/2021/6651480 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Privacy-Preserving Hierarchical-k-Means Clustering on Horizontally Partitioned Data
by: Anrong Xue, et al.
Published: (2009-01-01) -
Personalized trajectory privacy preserving method based on graph partition
by: Jing YANG, et al.
Published: (2015-03-01) -
MPDP -medoids: Multiple partition differential privacy preserving -medoids clustering for data publishing in the Internet of Medical Things
by: Zekun Zhang, et al.
Published: (2021-10-01) -
Research on data integration privacy preservation mechanism for DaaS
by: Zhi-gang ZHOU, et al.
Published: (2016-04-01) -
Exponential networks for linear partitions
by: Sibasish Banerjee, Mauricio Romo, Raphael Senghaas, Johannes Walcher
Published: (2025-04-01)