Structure induction by lossless graph compression
暂无分享,去创建一个
[1] Harold Neil Gabow,et al. Implementation of algorithms for maximum matching on nonbipartite graphs , 1973 .
[2] Andreas Stolcke,et al. Hidden Markov Model} Induction by Bayesian Model Merging , 1992, NIPS.
[3] Lawrence B. Holder,et al. Substructure Discovery Using Minimum Description Length and Background Knowledge , 1993, J. Artif. Intell. Res..
[4] Ian H. Witten,et al. Identifying Hierarchical Structure in Sequences: A linear-time algorithm , 1997, J. Artif. Intell. Res..
[5] Grzegorz Rozenberg,et al. Handbook of Graph Grammars and Computing by Graph Transformations, Volume 1: Foundations , 1997 .
[6] Hartmut Ehrig,et al. Handbook of graph grammars and computing by graph transformation: vol. 3: concurrency, parallelism, and distribution , 1999 .
[7] Stefano Lonardi,et al. Compression of biological sequences by greedy off-line textual substitution , 2000, Proceedings DCC 2000. Data Compression Conference.
[8] A. Apostolico,et al. Off-line compression by greedy textual substitution , 2000, Proceedings of the IEEE.
[9] S. Shen-Orr,et al. Network motifs in the transcriptional regulation network of Escherichia coli , 2002, Nature Genetics.
[10] Abhi Shelat,et al. Approximation algorithms for grammar-based compression , 2002, SODA '02.
[11] Emden R. Gansner,et al. Graphviz and Dynagraph – Static and Dynamic Graph Drawing Tools , 2003 .
[12] Eytan Ruppin,et al. Unsupervised learning of natural languages , 2006 .