Author:
Wang Xin,Xiang Mingyue,Zhan Huayi,Lan Zhuo,He Yuang,He Yanxiao,Sha Yuji
Publisher
Springer International Publishing
Reference33 articles.
1. Amazon. http://snap.stanford.edu/data/amazon-meta.html
2. Pokec social network. http://snap.stanford.edu/data/soc-pokec.html
3. Abdelhamid, E., Abdelaziz, I., Kalnis, P., Khayyat, Z., Jamour, F.T.: ScaleMine: scalable parallel frequent subgraph mining in a single large graph. In: West, J., Pancake, C.M. (eds.) Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis, SC, pp. 716–727. IEEE Computer Society (2016)
4. Abdelhamid, E., Canim, M., Sadoghi, M., Bhattacharjee, B., Chang, Y., Kalnis, P.: Incremental frequent subgraph mining on large evolving graphs. IEEE Trans. Knowl. Data Eng. 29(12), 2710–2723 (2017)
5. Ashraf, N., et al.: WeFreS: weighted frequent subgraph mining in a single large graph. In: Perner, P. (ed.) Advances in Data Mining - Applications and Theoretical Aspects, 19th Industrial Conference, ICDM, pp. 201–215. IBAI publishing (2019)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献