Author:
Sakurai Tetsuya,Futamura Yasunori,Imakura Akira,Ye Xiucai
Abstract
AbstractIn recent years, a vast amount of data has been accumulated across various fields in industry and academia, and with the rise of artificial intelligence and machine learning technologies, knowledge discovery and high-precision predictions through such data have been demanded. However, real-world data is diverse, including network data that represent relationships, data with multiple modalities or views, data that is distributed across multiple institutions and requires a certain level of information confidentiality.
Publisher
Springer Nature Singapore
Reference51 articles.
1. M. Belkin, P. Niyogi, Laplacian eigenmaps and spectral techniques for embedding and clustering. Adv. Neural Inf. Proc. Syst. 14, 585–591 (2001)
2. J. Chen, H.-R. Fang, Y. Saad, Fast approximate KNN graph construction for high dimensional data via recursive Lanczos bisection. J. Mach. Learn. Res. 10, 1989–2012 (2009)
3. I. Chillotti, N. Gama, M. Georgieva, M. Izabachene, Faster fully homomorphic encryption: bootstrapping in less than 0.1 seconds, in International Conference on the Theory and Application of Cryptology and Information Security (Springer, 2016), pp. 3–33
4. H. Cho, D.J. Wu, B. Berger, Secure genome-wide association analysis using multiparty computation. Nat. Biotechnol. 36(6), 547–551 (2018)
5. W. Dong, C. Moses, K. Li, Efficient k-nearest neighbor graph construction for generic similarity measures, in Proceedings of the 20th International Conference on World Wide Web (2011), pp. 577–586. https://doi.org/10.1145/1963405.1963487