Author:
Slimani Sarra,Hamrouni Tarek,Charrada Faouzi Ben
Reference28 articles.
1. A. Inokuchi, T.W., Motoda, H., 2000. An apriori-based algorithm for mining frequent substructures from graph data, in: Proceedings of PKDD, pp. 13–23.
2. Arthur-Durett, K., Carroll, T.E., Chikkagoudar, S., 2018. Discovering significant co-occurrences to characterize network behaviors, in: 20th International Conference on Human Interface and the Management of Information. Interaction, Visualization, and Analytics, HIMI, Las Vegas, NV, USA, pp. 609–623.
3. Ayed, R., HACID, M., HAQUE, R., 2016. A list of fsm algorithms and available implementations in centralized graph transaction databases. Technical Report.
4. An updated dashboard of complete search fsm implementations in centralized graph transaction databases;Ayed;Journal of Intelligent Information Systems,2019
5. Bahl, P., Chandra, R., Greenberg, A., Kandula, S., Maltz, D., Zhang, M., 2007. Towards highly reliable enterprise network services via inference of multi-level dependencies, in: SIGCOMM.
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献