Publicly Offered Research
Grant-in-Aid for Transformative Research Areas (A)
We will consider two LDP approaches which are 1) graph stability and 2) two-step publications. Approaches based on graph stability are not scalable, while solutions to the two-step publications are not precise. We aim to speed-up the graph stability approaches and improve the precision of results of the two-step publication. We proposed graph algorithms which are robust against attackers. We will use ideas there to speed up the graph stability approaches. For the approaches based on the two-step publication, some ideas will be from our previous works on star and triangle counting under LDP.
We conducted the following research on graph algorithms under local differential privacy.(1) We complete the research to show that the result of the spectral clustering is not significantly changed even when the graph is obfuscated under the local differential privacy. The result is published at https://arxiv.org/abs/2309.06867.(2) We present an algorithm that computes the number of paths and Katz centrality while adhering to local differential privacy standards. This work is among the first to incorporate global graph information into local differential privacy frameworks. The result is published at https://arxiv.org/abs/2310.14000. Additionally, the paper has been accepted through a peer review process and will be featured in the proceedings of UAI 2024.
2: Research has progressed on the whole more than it was originally planned.
We have conducted a research based on the plan, and have published the result at the refereed conference proceeding.
In fiscal year 2024, we have a plan to conduct the following two works:(1) We will develop local clustering algorithms under local differential privacy. Compared to the spectral clustering algorithm which we have analyze in fiscal year 2023, we believe that we can obtain a better result when focusing on the task of local clustering.(2) We will continue our work on subgraph counting problems. Specifically, we will work on the graph with small arboricity. While most of the current works focus on triangle counting, we plan to also work on the counting of larger subgraphs.
All 2023 Other
All Int'l Joint Research (2 results) Journal Article (3 results) (of which Int'l Joint Research: 3 results, Peer Reviewed: 3 results, Open Access: 1 results)
2023 IEEE 30th Symposium on Computer Arithmetic (ARITH)
Volume: 1 Pages: 48-59
10.1109/arith58626.2023.00034
23rd Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2023)
Volume: 1
Proceedings of the 29th ACM SIGKDD Conference on Knowledge Discovery and Data Mining
Volume: - Pages: 741-751
10.1145/3580305.3599537
