Examples of RDFWLBiSubTreeKernel

org.data2semantics.proppred.kernels.rdfgraphkernels.RDFWLBiSubTreeKernel
This class implements a WL kernel directly on an RDF graph. The difference with a normal WL kernel is that subgraphs are not explicitly extracted. However we use the idea of subgraph implicitly by tracking for each vertex/edge the distance from an instance vertex. For one thing, this leads to the fact that 1 black list is applied to the entire RDF graph, instead of 1 (small) blacklist per graph. @author Gerben

Examples of org.data2semantics.proppred.kernels.rdfgraphkernels.RDFWLBiSubTreeKernel

    resTable.setDigits(2);


    for (int depth : depths) {
      resTable.newRow("WL RDF Bi, depth="+depth);
      for (int it : iterations) {
        RDFOldKernelExperiment exp = new RDFOldKernelExperiment(new RDFWLBiSubTreeKernel(it, depth, inference, true), seeds, svmParms, dataset, instances, labels, blackList);


        
        System.out.println("Running WL RDF Bi: " + depth + " " + it);
        exp.run();

View Full Code Here

TOP

All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.