Entire regularization paths for graph data

ACM International Conference Proceeding Series

Volumn 227, Issue , 2007, Pages 919-926

  Tsuda, Koji ^a  

^a MAX PLANCK INSTITUTE FOR BIOLOGICAL CYBERNETICS   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

CHEMICAL COMPOUNDS; DATA PROCESSING; MINING; STATISTICAL METHODS; TRACKING (POSITION); XML;

PATTERNS; REGULARIZATION PATHS;

GRAPH THEORY;

EID: 34547965333     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1273496.1273612     Document Type: Conference Paper

References (16)

1. Bringmann, B., Zimmermann, A., Raedt, L. D., & Nijssen, S. (2006). Don't be afraid of simpler patterns. 10th European Conference on Principles and Practice of Knowledge Discovery in Databases (PKDD) (pp. 55-66).
2. Efron, B., Hastie, T., Johnstone, I., & Tibshirani, R. (2004). Least angle regression. Ann. Statist., 32, 407-499.
3. Helma, C., Cramer, T., Kramer, S., & Raedt, L. (2004). Data mining and machine learning techniques for the identification of mutagenicity inducing substructures and structure activity relationships of noncongeneric compounds. J. Chem. Inf. Comput. Sci., 44, 1402-1411.
4. Kashima, H., Tsuda, K., & Inokuchi, A. (2003). Marginalized kernels between labeled graphs. Proceedings of the 20th International Conference on Machine Learning (pp. 321-328). Menlo Park, CA, AAAI Press.
5. Kazius, J., Nijssen, S., Kok, J., & Ijzerman, T. B. A. (2006). Substructure mining using elaborate chemical representation. J. Chem. Inf. Model., 46, 597-605.
6. Kohavi, R., & John, G. H. (1997). Wrappers for feature subset selection. Artificial Intelligence, 1-2, 273-324.
7. Kudo, T., Maeda, E., & Matsumoto, Y. (2005). An application of boosting to graph classification. In L. Saul, Y. Weiss and L. Bottou (Eds.), Advances in neural information processing systems 17, 729-736. Cambridge, MA: MIT Press.
8. Morishita, S., & Sese, J. (2000). Traversing itemset lattices with statistical metric learning. Proceedings of ACM SIGACT-SIGMOD-SIGART Symposium on Database Systems (PODS) (pp. 226-236).
9. Nijssen, S., & Kok, J. (2004). A quickstart in frequent structure mining can make a difference. Proceedings of the 10th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (pp. 647-652). New York: ACM Press.
10. Nowozin, S., Tsuda, K., Uno, T., Kudo, T., & Bakir, G. (2007). Weighted substructure mining for image analysis. CVPR '07: Proceedings of the 2007 IEEE Computer Society Conference on Computer Vision and Pattern Recognition. to appear.
11. Rosset, S., & Zhu, J. (2003). Piecewise linear regularized solution paths (Technical Report). Stanford University.
12. Saigo, H., Kadowaki, T., & Tsuda, K. (2006). A linear programming approach for molecular QSAR, analysis. International Workshop on Mining and Learning with Graphs (MLG) (pp. 85-96).
13. Sanfeliu, A., & Fu, K. (1983). A distance measure between attributed relational graphs for pattern recognition. IEEE Trans. Syst. Man Cybern., 13, 353-362.
14. Tibshirani, R. (1996). Regression shrinkage and selection via LASSO. J. R. Stat. Soc. Ser: B Stat. Methodol., 58, 267-288.
15. Yan, X., & Han, J. (2002a). gspan: Graph-based substructure pattern mining. Proceedings of the 2002 IEEE International Conference on Data Mining (ICDM) (pp. 721-724). IEEE Computer Society.
16. Yan, X., & Han, J. (2002b). gSpan: graph-based substructure pattern mining (Technical Report). Department of Computer Science, University of Illinois at Urbana-Champaign.