Searching for just a few words should be enough to get started. If you need to make more complex queries, use the tips below to guide you.
Issue title: Advances in Mining Graphs, Trees and Sequences
Article type: Research Article
Authors: Holder, Lawrence | Cook, Diane | Coble, Jeff | Mukherjee, Maitrayee
Affiliations: Department of Computer Science and Engineering University of Texas at Arlington Box 19015, Arlington, TX 76019, USA. holder@cse.uta.edu; cook@cse.uta.edu; coble@cse.uta.edu; mukherje@cse.uta.edu
Note: [] Address for correspondence: Department of Computer Science and Engineering, University of Texas at Arlington, Box 19015, Arlington, TX 76019, USA
Abstract: 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.
Keywords: Graphs, relational learning, security
Journal: Fundamenta Informaticae, vol. 66, no. 1-2, pp. 83-101, 2005
IOS Press, Inc.
6751 Tepper Drive
Clifton, VA 20124
USA
Tel: +1 703 830 6300
Fax: +1 703 830 2300
sales@iospress.com
For editorial issues, like the status of your submitted paper or proposals, write to editorial@iospress.nl
IOS Press
Nieuwe Hemweg 6B
1013 BG Amsterdam
The Netherlands
Tel: +31 20 688 3355
Fax: +31 20 687 0091
info@iospress.nl
For editorial issues, permissions, book requests, submissions and proceedings, contact the Amsterdam office info@iospress.nl
Inspirees International (China Office)
Ciyunsi Beili 207(CapitaLand), Bld 1, 7-901
100025, Beijing
China
Free service line: 400 661 8717
Fax: +86 10 8446 7947
china@iospress.cn
For editorial issues, like the status of your submitted paper or proposals, write to editorial@iospress.nl
如果您在出版方面需要帮助或有任何建, 件至: editorial@iospress.nl