10 citations · 17 across the 4 of their papers we have counts for
5 papers
Differentiable Inductive Logic Programming for Structured Examples
Hikaru Shindo, Masaaki Nishino, Akihiro Yamamoto
The differentiable implementation of logic yields a seamless combination of symbolic reasoning and deep neural networks. Recent research, which has developed a differentiable frame…
Metric Learning for Ordered Labeled Trees with pq-grams
Hikaru Shindo, Masaaki Nishino, Yasuaki Kobayashi +1
Computing the similarity between two data points plays a vital role in many machine learning algorithms. Metric learning has the aim of learning a good metric automatically from da…
Algorithms and Hardness Results for the Maximum Balanced Connected Subgraph Problem
Yasuaki Kobayashi, Kensuke Kojima, Norihide Matsubara +2
The Balanced Connected Subgraph problem (BCS) was recently introduced by Bhore et al. (CALDAM 2019). In this problem, we are given a graph whose vertices are colored by red or…
Automatic Source Code Summarization with Extended Tree-LSTM
Yusuke Shido, Yasuaki Kobayashi, Akihiro Yamamoto +2
Neural machine translation models are used to automatically generate a document from given source code since this can be regarded as a machine translation task. Source code summari…
Improved Methods for Computing Distances between Unordered Trees Using Integer Programming
Eunpyeong Hong, Yasuaki Kobayashi, Akihiro Yamamoto
Kondo et al. (DS 2014) proposed methods for computing distances between unordered rooted trees by transforming an instance of the distance computing problem into an instance of the…