Efficient and Flexible Compression of Very Sparse Networks of Big Data-Reference-Cited by-同舟云学术

Efficient and Flexible Compression of Very Sparse Networks of Big Data

Published:2021 Issue: Volume: Page:167-195
ISSN:2190-5428
Container-title:Lecture Notes in Social Networks
language:
Short-container-title:

Author:

Leung Carson K.^ORCID,Jiang Fan,Zhang Yibin

Publisher

Springer International Publishing

Link

https://link.springer.com/content/pdf/10.1007/978-3-030-67044-3_9

Reference50 articles.

1. Xylogiannopoulos, K. F., Karampelas, P., & Alhajj, R. (2019). Multivariate motif detection in local weather big data. In IEEE/ACM ASONAM 2019 (pp. 749–756). ACM.

2. Han, K., et al. (2019). Efficient and effective algorithms for clustering uncertain graphs. Proceedings of the VLDB Endowment, 12(6), 667–680.

3. Ke, X., Khan, A., & Quan, L. L. H. (2019). An in-depth comparison of s-t reliability algorithms over uncertain graphs. Proceedings of the VLDB Endowment, 12(8), 864–876.

4. Leung, C. K. (2014). Uncertain frequent pattern mining. In Frequent pattern mining (pp. 417–453).

5. Leung, C. K., Mateo, M. A. F., & Brajczuk, D. A. (2008). A tree-based approach for frequent pattern mining from uncertain data. In PAKDD 2008. LNCS (LNAI) (Vol. 5012, pp. 653–661).

Cited by 3 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. From the Connected Individual to the Tired Individual: Social Network Fatigue in the Age of Digital Communication;Selçuk İletişim;2023-10-15

2. A mathematical model for friend discovery from dynamic social graphs;Proceedings of the 2021 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining;2021-11-08

3. Compressing and mining social network data;Proceedings of the 2021 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining;2021-11-08