Abstract
The cyclic pattern kernel (CPK) is a powerful graph kernel based on patterns formed by simple cycles of labeled graphs. In a recent work, we proposed a method for computing CPK which is restricted to graphs containing polynomial number of simple cycles. In this work, we present two approaches relaxing this limitation. We first show that for graphs of bounded treewidth, CPK can be computed in time polynomial in the number of cyclic patterns, which in turn can be exponentially smaller than that of simple cycles. We then propose an alternative CPK based on the set of relevant cycles which is known to be enumerable with polynomial delay and its cardinality is typically only cubic in the number of vertices. Empirical results on the NCI-HIV dataset indicate that there is no significant difference in predictive performance between CPK based on simple cycles and that based on relevant cycles.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Barrett, C., Jacob, R., Marathe, M.: Formal-language-constrained path problems. SIAM Journal on Computing 30(3), 809–837 (2000)
Bodlaender, H.L.: A tourist guide through treewidth. Acta Cybernetica 11(1-2), 1–22 (1993)
Bodlaender, H.L.: A partial k-arboretum of graphs with bounded treewidth. Theoretical Computer Science 209(1–2), 1–45 (1998)
Bradley, A.: The use of the area under the ROC curve in the evaluation of machine learning algorithms. Pattern Recognition 30(7), 1145–1159 (1997)
Deshpande, M., Kuramochi, M., Karypis, G.: Frequent sub-structure based approaches for classifying chemical compounds. In: Proc. of the 3rd IEEE Int. Conf. on Data Mining, pp. 35–42. IEEE Computer Society, Los Alamitos (2003)
Diestel, R.: Graph theory, 2nd edn. Springer, New York (2000)
Flum, Grohe: The parameterized complexity of counting problems. SIAM Journal on Computing 33(4), 892–922 (2004)
Gärtner, T.: A survey of kernels for structured data. SIGKDD Explorations 5(1), 49–58 (2003)
Gleiss, P.M., Stadler, P.F.: Relevant cycles in biopolymers and random graph. In: Proc. of the 4th Slovene Int. Conf. in Graph Theory (1999)
Horváth, T., Gärtner, T., Wrobel, S.: Cyclic pattern kernels for predictive graph mining. In: Proc. of the 10th ACM SIGKDD Int. Conf. on Knowledge Discovery and Data Mining, pp. 158–167 (2004)
Joachims, T.: Making large–scale SVM learning practical. In: Schölkopf, B., Burges, C.J.C., Smola, A.J. (eds.) Advances in Kernel Methods — Support Vector Learning, pp. 169–184. MIT Press, Cambridge (1999)
Lewis, H., Papadimitriou, C.: Elements of the Theory of Computation, 2nd edn. Prentice Hall, New York (1997)
Mendelzon, A.O., Wood, P.T.: Finding regular simple paths in graph databases. SIAM Journal on Computing 24(6), 1235–1258 (1995)
Plotkin, M.: Mathematical basis of ring-finding algorithms at CIDS. J. Chem. Doc. 11, 60–63 (1971)
Read, R.C., Tarjan, R.E.: Bounds on backtrack algorithms for listing cycles, paths, and spanning trees. Networks 5(3), 237–252 (1975)
Robertson, N., Seymour, P.D.: Graph minors. II. Algorithmic Aspects of Tree-Width. J. Algorithms 7(3), 309–322 (1986)
Shawe-Taylor, J., Cristianini, N.: Kernel Methods for Pattern Analysis. Cambridge University Press, Cambridge (2004)
Tarjan, R.: Depth-first search and linear graph algorithms. SIAM Journal on Computing 1(2), 146–160 (1972)
Valiant, L.G.: The complexity of enumeration and reliability problems. SIAM Journal on Computing 8(3), 410–421 (1979)
Vapnik, V.: Statistical Learning Theory. John Wiley, Chichester (1998)
Vismara, P.: Union of all the minimum cycle bases of a graph. The Electronic Journal of Combinatorics 4(1), 73–87 (1997)
Zaki, M.: Efficiently mining frequent trees in a forest. In: Proc. of the 8th ACM SIGKDD Int. Conf. on Knowledge Discovery and Data Mining, pp. 71–80. ACM Press, New York (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Horváth, T. (2005). Cyclic Pattern Kernels Revisited. In: Ho, T.B., Cheung, D., Liu, H. (eds) Advances in Knowledge Discovery and Data Mining. PAKDD 2005. Lecture Notes in Computer Science(), vol 3518. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11430919_93
Download citation
DOI: https://doi.org/10.1007/11430919_93
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-26076-9
Online ISBN: 978-3-540-31935-1
eBook Packages: Computer ScienceComputer Science (R0)