| References: [1] Gupta, P., McKeown, N. (2000). Classifying packets with hierarchical intelligent cuttings. IEEE Micro 20 (1) 34-41.
[2] Singh, S., Baboescu, F., Varghese, G., Wang, J. (2003). Packet classification using multidimensional cutting. In: Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications, 213-224. ACM.
[3] Kogan, K., Nikolenko, S. I., Rottenstreich, O., Culhane, W., Eugster, P. (2015). Exploiting order independence for scalable and expressive packet classification. IEEE/ACM Transactions on Networking, 24 (2) 1251-1264.
[4] Kogan, K., Nikolenko, S., Eugster, P., Ruan, E. (2014). Strategies for mitigating TCAM space bottlenecks. In: 2014 IEEE 22nd Annual Symposium on High-Performance Interconnects, p. 25-32. IEEE.
[5] Ganter, B., Kuznetsov, S. (2001). Pattern Structures and Their Projections, Proceedings 9th International Conference on Conceptual Structures, ICCS’01, G. Stumme and H. Delugach, Eds., Lecture Notes in Artificial Intelligence, 2120, 129-142.
[6] Kaytoue, M., Kuznetsov, S. O., Napoli, A., Duplessis, S. (2011). Mining gene expression data with pattern structures in formal concept analysis. Information Sciences, 181 (10) 1989-2001.
[7] Kuznetsov, S. O. (1999). Learning of simple conceptual graphs from positive and negative examples. European Conference on Principles of Data Mining and Knowledge Discovery. Springer, Berlin, Heidelberg, 1999, p. 384-391.
[8] Kuznetsov, S. O.(2001). Machine learning on the basis of formal concept analysis. Automation and Remote Control, 62 (10) 1543-1564
[9] Finn, V. K. (1991). Plausible reasoning in systems of JSM type. Itogi Nauki i Tekhniki, Seriya Informatika, 1991 [in Russian].
[10] Breiman, L., Friedman, J. H., Olshen, R. A., Stone, C. J. Classification and regression trees. Belmont, CA: Wadsworth. International Group, 432 (1984).
[11] ClassBench: A packet classification benchmark, http://www.arl.wustl.edu/classbench/. |
Author Rights 
