Graph kernel: Difference between revisions

Content deleted Content added
m "molecule kernels" placed such that they belong to chemoinformatics (not to bioinformatics)
not all molecule kernels are graph kernels
Line 13:
|url=http://jmlr.csail.mit.edu/papers/volume11/vishwanathan10a/vishwanathan10a.pdf
}}</ref>
Graph kernels can be intuitively understood as functions measuring the similarity of pairs of graphs. They allow [[Kernel trick|kernelized]] learning algorithms such as [[support vector machine]]s to work directly on graphs, without having to do [[feature extraction]] to transform them to fixed-length, real-valued [[feature vector]]s. They find applications in [[bioinformatics]], in [[chemoinformatics]] (as '''a type of [[molecule kernel''']]s<ref name="Ralaivola2005">{{cite journal | author author1=L. Ralaivola, |author2=S. J. Swamidass, |author3=S. Hiroto and |author4=P. Baldi| |title =Graph kernels for chemical informatics | journal = Neural Networks | year = 2005 | volume = 18 | pages = 1093-11101093–1110 | url = http://www.sciencedirect.com/science/article/pii/S0893608005001693}}</ref>), and in [[social network analysis]].<ref name="Vishwanathan"/>
 
Graph kernels were first described in 2002 by R. I. Kondor and [[John Lafferty]]<ref>{{cite conference