Graph-based Relational Learning with Application to Security

• Autorzy: Holder L. , Cook D. , Coble J. , Mukherjee M.
• Języki publikacji: EN

Abstrakty

EN

We describe an approach to learning patterns in relational data represented as a graph. The approach, implemented in the Subdue system, searches for patterns that maximally compress the input graph. Subdue can be used for supervised learning, as well as unsupervised pattern discovery and clustering. We apply Subdue in domains related to homeland security and social network analysis.

Słowa kluczowe

EN

graph theory; relational learning; security

• Wydawca: IOS Press
• Czasopismo: Fundamenta Informaticae
• Rocznik: 2005
• Tom: Vol. 66, nr 1,2
• Strony: 83--101
• Opis fizyczny: Bibliogr. 27 poz., tab., wykr.

Twórcy

autor

Holder L.

• Department of Computer Science and Engineering, University of Texas at Arlington Box 19015, Arlington, TX 76019, USA

autor

Cook D.

• Department of Computer Science and Engineering, University of Texas at Arlington Box 19015, Arlington, TX 76019, USA

autor

Coble J.

• Department of Computer Science and Engineering, University of Texas at Arlington Box 19015, Arlington, TX 76019, USA

autor

Mukherjee M.

• Department of Computer Science and Engineering, University of Texas at Arlington Box 19015, Arlington, TX 76019, USA

Bibliografia

• [1] Agrawal, R., Srikant, R.: Fast Algorithms for Mining Association Rules, Proceedings of the Twentieth Conference on Very Large Databases, 1994.
• [2] Cameron-Jones, R. M., Quinlan, J. R.: Efficient Top-Down Induction of Logic Programs, SIGART Bulletin, 5(1), 1994, 33–42.
• [3] Cook, D., Holder, L.: Graph-Based Data Mining, IEEE Intelligent Systems, 15(2), 2000, 32–41.
• [4] Cook, D. J., Holder, L. B.: Substructure Discovery Using Minimum Description Length and Background Knowledge, Journal of Artificial Intelligence Research, 1, 1994, 231–255.
• [5] Dehaspe, L., Toivonen, H., King, R. D.: Finding Frequent Substructures in Chemical Compounds, Proceedings of the Fourth International Conference on Knowledge Discovery and Data Mining, 1998.
• [6] Doshi, S., Huang, F., Oates, T.: Inferring the Structure of Graph Grammars from Data, Proceedings of the International Conference on Knowledge-Based Computer Systems, 2002.
• [7] Dzeroski, S., Lavrac, N., Eds.: Relational Data Mining, Springer, 2001.
• [8] Ehrig, H., Engels, G., Kreowski, H., Rozenberg, G., Eds.: Handbook of Graph Grammars and Computing by Graph Transformation: Applications, Languages and Tools, World Scientific, 1999.
• [9] Gansner, E., Koutsofios, E., North, S.: Drawing Graphs with dot, AT&T Bell Labs, February 2002.
• [10] Gonzalez, J., Holder, L., Cook, D.: Graph-Based Relational Concept Learning, Proceedings of the Nineteenth International Conference on Machine Learning, 2002.
• [11] Holder, L., Cook, D.: Graph-based Relational Learning: Current and Future Directions, ACM SIGKDD Explorations, 5(1), 2003, 90–93.
• [12] Inokuchi, A., Washio, T., Motoda, H.: Complete Mining of Frequent Patterns from Graphs: Mining Graph Data, Machine Learning, 50(3), 2003, 321–354.
• [13] Jonyer, I., Cook, D., Holder, L.: Graph-Based Hierarchical Conceptual Clustering, Journal of Machine Learning Research, 2, 2001, 19–43.
• [14] Jonyer, I., Holder, L., Cook, D.: Concept Formation Using Graph Grammars, Proceedings of the KDD Workshop on Multi-Relational Data Mining, 2002.
• [15] Kashima, H., Inokuchi, A.: Kernels for Graph Classification, Proceedings of the International Workshop on Active Mining, 2002.
• [16] Kuramochi, M., Karypis, G.: Frequent Subgraph Discovery, Proceedings of the First IEEE Conference on Data Mining, 2001.
• [17] Muggleton, S., Ed.: Inductive Logic Programming, Academic Press, 1992.
• [18] Muggleton, S.: Inverse Entailment and Progol, New Generation Computing, 13, 1995, 245–286.
• [19] Page, D., Craven, M.: Biological Applications of Multi-Relational Data Mining, ACM SIGKDD Explorations, 5(1), 2003, 69–79.
• [20] Rissanen, J.: Stochastic Complexity in Statistical Inquiry, World Scientific, 1989.
• [21] Senate, U., on Intelligence, H. C.: Joint Inquiry into Intelligence Community Activities Before and After the Terrorist Attacks of September 11, 2001, December 2002.
• [22] Slattery, S., Craven, M.: Combining Statistical and Relational Methods for Learning in Hypertext Domains, Proceedings of the Eighth International Conference on Inductive Logic Programming, 1998.
• [23] Srinivasan, A.,Muggleton, S., King, R., Sternberg, M.: Mutagenesis: ILP Experiments in a Non-Determinate Biological Domain, Proceedings of the Fourth International Conference on Inductive Logic Programming, 1994.
• [24] Turcotte, M., Muggleton, S. H., Sternberg, M. J. E.: Application of Inductive Logic Programming to Discover Rules Governing the Three-Dimensional Topology of Protein Structure, Proceedings of the Eighth International Conference on Inductive Logic Programming, 1998.
• [25] Wasserman, S., Faust, K.: Social Network Analysis, Cambridge University Press, 1994.
• [26] Yan, X., Han, J.: gSpan: Graph-Based Substructure Pattern Mining, Proceedings of the International Conference on Data Mining, 2002.
• [27] Yoshida, K., Motoda, H., Indurkhya, N.: Graph-Based Induction as a Unified Learning Framework, Journal of Applied Intelligence, 4, 1994, 297–328.