Abstract is missing.
- A Polynomial-time Metric for Outerplanar GraphsLeander Schietgat, Jan Ramon, Maurice Bruynooghe. [doi]
- Learning and Charting Chemical Space with Strings and Graphs: Challenges and Opportunities for AI and Machine LearningPierre Baldi. [doi]
- Support Computation for Mining Frequent Subgraphs in a Single GraphMathias Fiedler, Christian Borgelt. [doi]
- Speeding Up Graph Edit Distance Computation with a Bipartite HeuristicKaspar Riesen, Stefan Fankhauser, Horst Bunke. [doi]
- Learning and Inference in Massive Social NetworksShawndra Hill, Foster J. Provost, Chris Volinsky. [doi]
- Comparative Evaluation of PL languagesManfred Jaeger, Petr Lidman, Juan L. Mateo. [doi]
- Inferring Vertex Properties from Topology in Large NetworksJanne Sinkkonen, Janne Aukia, Samuel Kaski. [doi]
- Abductive Stochastic Logic Programs for Metabolic Network Inhibition LearningJianzhong Chen, Stephen Muggleton, Jose Santos. [doi]
- Graph IdentificationLise Getoor. [doi]
- A Universal Kernel for Learning Regular LanguagesLeonid Kontorovich. [doi]
- ProbLog and its Application to Link Mining in Biological NetworksLuc De Raedt. [doi]
- Weighted Substructure Mining for Image AnalysisSebastian Nowozin, Koji Tsuda, Takeaki Uno, Taku Kudo, Gökhan H. Bakir. [doi]
- DIGDAG, a First Algorithm to Mine Closed Frequent Embedded Sub-DAGsAlexandre Termier, Yoshinori Tamada, Kazuyuki Numata, Seiya Imoto, Takashi Washio, Tomoyuki Higuchi. [doi]
- Transductive Rademacher Complexities for Learning Over a GraphKristiaan Pelckmans, Johan A. K. Suykens. [doi]
- General Graph Refinement with Polynomial DelayJan Ramon, Siegfried Nijssen. [doi]
- Fast Inference in Infinite Hidden Relational ModelsZhao Xu, Volker Tresp, Shipeng Yu, Kai Yu, Hans-Peter Kriegel. [doi]
- Efficient Closed Pattern Mining in Strongly Accessible Set SystemsMario Boley, Tamás Horváth, Axel Poigné, Stefan Wrobel. [doi]
- Web Graph Parameters and the Pagerank DistributionYana Volkovich, Nelly Litvak, Debora Donato. [doi]
- Improving Frequent Subgraph Mining in the Presence of SymmetryChristian Desrosiers, Philippe Galinier, Pierre Hansen, Alain Hertz. [doi]
- Augmenting the Distributed Evaluation of Path Queries on Data-Graphs with Information GranulesDavide Bacciu, Alessio Botta, Dan Stefanescu. [doi]
- Semidefinite Ranking on GraphsShankar Vembu, Thomas Gärtner, Stefan Wrobel. [doi]
- Graphs, Hypergraphs, and Inductive Logic ProgrammingHendrik Blockeel, Tijn Witsenburg, Joost N. Kok. [doi]
- An Efficient Sampling Scheme For Comparison of Large GraphsKarsten M. Borgwardt, Tobias Petri, S. V. N. Vishwanathan, Hans-Peter Kriegel. [doi]
- Efficient Kernel Methods for GraphsThomas Gärtner. [doi]
- Learning Graph MatchingAlex J. Smola. [doi]
- Support Vector Machines for Collective InferenceUlf Brefeld, Thoralf Klein, Tobias Scheffer. [doi]
- The Cost of Learning Directed CutsThomas Gärtner, Gemma C. Garriga. [doi]
- Mining, Indexing, and Searching Graphs in Large Data SetsJiawei Han. [doi]