Akihiro Yamamoto

According to our database1, Akihiro Yamamoto authored at least 119 papers between 1987 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Concept Lattice Reduction Using Integer Programming.
J. Inf. Process., 2024

Implementing Derivations of Definite Logic Programs with Self-Attention Networks.
CoRR, 2024

BERT4FCA: A Method for Bipartite Link Prediction using Formal Concept Analysis and BERT.
CoRR, 2024

2023
Z-TCA: Fast Algorithm for Triadic Concept Analysis Using Zero-suppressed Decision Diagrams.
J. Inf. Process., 2023

2022
Robustness Evaluation of Text Classification Models Using Mathematical Optimization and Its Application to Adversarial Training.
Proceedings of the Findings of the Association for Computational Linguistics: AACL-IJCNLP 2022, 2022

Event Time Extraction from Japanese News Archives.
Proceedings of the IEEE International Conference on Big Data, 2022

2021
HTML-LSTM: Information Extraction from HTML Tables in Web Pages Using Tree-Structured LSTM.
Proceedings of the Discovery Science - 24th International Conference, 2021

Differentiable Inductive Logic Programming for Structured Examples.
Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

2020
Guest Editorial: Special issue on Discovery Science.
Mach. Learn., 2020

Metric Learning for Ordered Labeled Trees with pq-grams.
Proceedings of the ECAI 2020 - 24th European Conference on Artificial Intelligence, 29 August-8 September 2020, Santiago de Compostela, Spain, August 29 - September 8, 2020, 2020

Mining Disjoint Sequential Pattern Pairs from Tourist Trajectory Data.
Proceedings of the Discovery Science - 23rd International Conference, 2020

2019
Effects of Blade Tip Profile on In-Plane Tensile Properties of Wedge-Notched Polypropylene Sheet.
Int. J. Autom. Technol., 2019

Automatic Source Code Summarization with Extended Tree-LSTM.
Proceedings of the International Joint Conference on Neural Networks, 2019

Algorithms and Hardness Results for the Maximum Balanced Connected Subgraph Problem.
Proceedings of the Combinatorial Optimization and Applications, 2019

2018
Using Binary Decision Diagrams to Enumerate Inductive Logic Programming Solutions.
Proceedings of the Up-and-Coming and Short Papers of the 28th International Conference on Inductive Logic Programming (ILP 2018), 2018

2017
Special issue on inductive logic programming.
Mach. Learn., 2017

Extending Various Thesauri by Finding Synonym Sets from a Formal Concept Lattice.
Inf. Media Technol., 2017

Outlier detection using binary decision diagrams.
Data Min. Knowl. Discov., 2017

Learning concepts and their unions from positive data with refinement operators.
Ann. Math. Artif. Intell., 2017

Improved Methods for Computing Distances Between Unordered Trees Using Integer Programming.
Proceedings of the Combinatorial Optimization and Applications, 2017

Protein-Protein Interaction Extraction from Text by Selecting Linguistic Features.
Proceedings of the 17th IEEE International Conference on Bioinformatics and Bioengineering, 2017

On the Sizes of Decision Diagrams Representing the Set of All Parse Trees of a Context-free Grammar.
Proceedings of the 3rd Workshop on Advanced Methodologies for Bayesian Networks, 2017

2016
Abstraction and refinement of mathematical functions toward SMT-based test-case generation.
Int. J. Softw. Tools Technol. Transf., 2016

3D Quasi-Passive Walker of Bipedal Robot with Flat Feet Gait Analysis of 3D Quasi-Passive Walking.
Proceedings of the International Conference on Multimedia Systems and Signal Processing, 2016

Inductive Logic Programming: Challenges.
Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, 2016

2015
Edit Operations on Lattices for MDL-based Pattern Summarization.
Proceedings of the International Workshop on Formal Concept Analysis and Applications, 2015

Tree PCA for Extracting Dominant Substructures from Labeled Rooted Trees.
Proceedings of the Discovery Science - 18th International Conference, 2015

Periodical Skeletonization for Partially Periodic Pattern Mining.
Proceedings of the Discovery Science - 18th International Conference, 2015

2014
A parameter-free approach for one-class classification using binary decision diagrams.
Intell. Data Anal., 2014

Causal Discovery in a Binary Exclusive-or Skew Acyclic Model: BExSAM.
CoRR, 2014

Outlier Detection Based on Leave-One-Out Density Using Binary Decision Diagrams.
Proceedings of the Advances in Knowledge Discovery and Data Mining, 2014

Local Feature Selection by Formal Concept Analysis for Multi-class Classification.
Proceedings of the Trends and Applications in Knowledge Discovery and Data Mining, 2014

A Sufficient Condition for Learning Unbounded Unions of Languages with Refinement Operators.
Proceedings of the International Symposium on Artificial Intelligence and Mathematics, 2014

Fast Computation of the Tree Edit Distance between Unordered Trees Using IP Solvers.
Proceedings of the Discovery Science - 17th International Conference, 2014

Pattern Structures for Understanding Episode Patterns.
Proceedings of the Eleventh International Conference on Concept Lattices and Their Applications, 2014

Formal Concept Analysis for Process Enhancement Based on a Pair of Perspectives.
Proceedings of the Eleventh International Conference on Concept Lattices and Their Applications, 2014

A Sparse Parameter Learning Method for Probabilistic Logic Programs.
Proceedings of the Statistical Relational Artificial Intelligence, 2014

2013
Learning figures with the Hausdorff metric by fractals - towards computable binary classification.
Mach. Learn., 2013

Semi-supervised learning on closed set lattices.
Intell. Data Anal., 2013

Predicate-argument Structure based Textual Entailment Recognition System of KYOTO Team for NTCIR-10 RITE-2.
Proceedings of the 10th NTCIR Conference on Evaluation of Information Access Technologies, 2013

Visual Odometry by Multi-frame Feature Integration.
Proceedings of the 2013 IEEE International Conference on Computer Vision Workshops, 2013

Modular home robot system based on the MMM concept-design instance with detachable symmetric arm module.
Proceedings of the 2013 IEEE/ASME International Conference on Advanced Intelligent Mechatronics, 2013

2012
Estimation of Generating Processes of Strings Represented with Patterns and Refinements.
Proceedings of the Eleventh International Conference on Grammatical Inference, 2012

Semi-Supervised Ligand Finding Using Formal Concept Analysis.
Inf. Media Technol., 2012

Efficient Mining of Closed Tree Patterns from Large Tree Databases with Subtree Constraint.
Int. J. Artif. Intell. Tools, 2012

Privacy Preserving Using Dummy Data for Set Operations in Itemset Mining Implemented with ZDDs.
IEICE Trans. Inf. Syst., 2012

Mining of closed frequent subtrees from frequently updated databases.
Intell. Data Anal., 2012

Learning from graph data by putting graphs on the lattice.
Expert Syst. Appl., 2012

Learning Families of Closed Sets in Matroids.
Proceedings of the Computation, Physics and Beyond, 2012

2011
Knowledge-leveraged Computational Thinking through Natural Language Processing and Statistical Logic (NII Shonan Meeting 2011-4).
NII Shonan Meet. Rep., 2011

Discovering causal structures in binary exclusive-or skew acyclic models.
Proceedings of the UAI 2011, 2011

The Minimum Code Length for Clustering Using the Gray Code.
Proceedings of the Machine Learning and Knowledge Discovery in Databases, 2011

Mining Closed Weighted Itemsets for Numerical Transaction Databases.
Proceedings of the New Frontiers in Artificial Intelligence, 2011

Discovering Ligands for TRP Ion Channels Using Formal Concept Analysis.
Proceedings of the Latest Advances in Inductive Logic Programming, 2011

A Fast and Flexible Clustering Algorithm Using Binary Discretization.
Proceedings of the 11th IEEE International Conference on Data Mining, 2011

Semi-supervised Learning for Mixed-Type Data via Formal Concept Analysis.
Proceedings of the Conceptual Structures for Discovering Knowledge, 2011

2010
Mind change complexity of inferring unbounded unions of restricted pattern languages from positive data.
Theor. Comput. Sci., 2010

Sound source tracking considering obstacle avoidance for a mobile robot.
Robotica, 2010

The Coding Divergence for Measuring the Complexity of Separating Two Sets.
Proceedings of the 2nd Asian Conference on Machine Learning, 2010

Latest Trends in Deburring Technology.
Int. J. Autom. Technol., 2010

Topological properties of concept spaces (full version).
Inf. Comput., 2010

Semantics of a Graphical Model for Representing Hypotheses and a System Supporting the Management of Hypotheses.
Proceedings of the Knowledge, Information, and Creativity Support Systems, 2010

Frequent Closed Itemset Mining with Privacy Preserving for Distributed Databases.
Proceedings of the ICDMW 2010, 2010

Incremental Mining of Closed Frequent Subtrees.
Proceedings of the Discovery Science - 13th International Conference, 2010

SOC for car navigation system with a 55.3GOPS image recognition engine.
Proceedings of the 15th Asia South Pacific Design Automation Conference, 2010

Learning Figures with the Hausdorff Metric by Fractals.
Proceedings of the Algorithmic Learning Theory, 21st International Conference, 2010

2009
The Sixth Workshop on Learning with Logics and Logics for Learning (LLLL2009).
Proceedings of the New Frontiers in Artificial Intelligence, 2009

Learning from Positive Data Based on the MINL Strategy with Refinement Operators.
Proceedings of the New Frontiers in Artificial Intelligence, 2009

SoC for car navigation systems with a 53.3 GOPS image recognition engine.
Proceedings of the 2009 IEEE Hot Chips 21 Symposium (HCS), 2009

Sound Source Tracking and Obstacle Avoidance for a Mobile Robot.
Proceedings of 12th IEEE International Conference on Emerging Technologies and Factory Automation, 2009

Discovering the Structures of Open Source Programs from Their Developer Mailing Lists.
Proceedings of the Discovery Science, 12th International Conference, 2009

Sigma^0_alpha - Admissible Representations (Extended Abstract).
Proceedings of the Sixth International Conference on Computability and Complexity in Analysis, 2009

2008
Two-Step Physical Register Deallocation for Data Prefetching and Address Pre-Calculation.
Inf. Media Technol., 2008

SHREC'08 entry: Semi-supervised learning for semantic 3D model retrieval.
Proceedings of the 2008 International Conference on Shape Modeling and Applications (SMI 2008), 2008

Kernel Functions Based on Derivation.
Proceedings of the New Frontiers in Applied Data Mining, 2008

Learning Bounded Unions of Noetherian Closed Set Systems Via Characteristic Sets.
Proceedings of the Grammatical Inference: Algorithms and Applications, 2008

Finding Frequent Patterns from Compressed Tree-Structured Data.
Proceedings of the Discovery Science, 11th International Conference, 2008

Topological Properties of Concept Spaces.
Proceedings of the Algorithmic Learning Theory, 19th International Conference, 2008

2007
Learning semantic categories for 3D model retrieval.
Proceedings of the 9th ACM SIGMM International Workshop on Multimedia Information Retrieval, 2007

Data prefetching and address pre-calculation through instruction pre-execution with two-step physical register deallocation.
Proceedings of the 2007 workshop on MEmory performance, 2007

The Fifth Workshop on Learning with Logics and Logics for Learning (LLLL2007).
Proceedings of the New Frontiers in Artificial Intelligence, 2007

Computing Characteristic Sets of Bounded Unions of Polynomial Ideals.
Proceedings of the New Frontiers in Artificial Intelligence, 2007

An Intentional Kernel Function for RNA Classification.
Proceedings of the Discovery Science, 10th International Conference, 2007

Comparison of Dimension Reduction Methods for Database-Adaptive 3D Model Retrieval.
Proceedings of the Adaptive Multimedial Retrieval: Retrieval, 2007

2006
Hypothesis finding with proof theoretical appropriateness criteria.
Theor. Comput. Sci., 2006

Foreword.
Mach. Learn., 2006

The Fourth Workshop on Learning with Logics and Logics for Learning (LLLL2006).
Proceedings of the New Frontiers in Artificial Intelligence, 2006

Inferability of Closed Set Systems from Positive Data.
Proceedings of the New Frontiers in Artificial Intelligence, 2006

An Efficient Algorithm for Computing Kernel Function Defined with Anti-unification.
Proceedings of the Inductive Logic Programming, 16th International Conference, 2006

Mind Change Complexity of Inferring Unbounded Unions of Pattern Languages from Positive Data.
Proceedings of the Algorithmic Learning Theory, 17th International Conference, 2006

2005
Workshop on Learning with Logics and Logics for Learning (LLLL).
Proceedings of the New Frontiers in Artificial Intelligence, 2005

Inductive Logic Programming: Yet Another Application of Logic.
Proceedings of the Declarative Programming for Knowledge Management, 2005

2004
Similarity of Documents Based on the Vector Sequence Model.
Proceedings of the Intuitive Human Interfaces for Organizing and Accessing Intellectual Assets, 2004

2003
Hypothesis finding based on upward refinement of residue hypotheses.
Theor. Comput. Sci., 2003

Finding Similar Stories by Using Sequences of Occurence Vectors.
Proceedings of the Information Modelling and Knowledge Bases XV, 2003

2002
A Theory of Hypothesis Finding in Clausal Logic.
Proceedings of the Progress in Discovery Science, 2002

Minimised Residue Hypotheses in Relevant Logic.
Proceedings of the Algorithmic Learning Theory, 13th International Conference, 2002

2001
Modelling Semi-structured Documents with Hedges for Deduction and Induction.
Proceedings of the Inductive Logic Programming, 11th International Conference, 2001

2000
New Conditions for the Existence of Least Generalizations under Relative Subsumption.
Proceedings of the Inductive Logic Programming, 10th International Conference, 2000

Hypotheses Finding via Residue Hypotheses with the Resolution Principle.
Proceedings of the Algorithmic Learning Theory, 11th International Conference, 2000

1999
Revising the Logical Foundations of Inductive Logic Programming Systems with Ground Reduced Program.
New Gener. Comput., 1999

An Inference Method for the Complete Inverse of Relative Subsumption.
New Gener. Comput., 1999

1998
A Digital Watermark based on the Wavelet Transform and its Robustness on Image Compression.
Proceedings of the 1998 IEEE International Conference on Image Processing, 1998

Finding Hypotheses from Examples by Computing the Least Generalization of Bottom Clauses.
Proceedings of the Discovery Science, 1998

Logical Aspects of Several Bottom-Up Fittings.
Proceedings of the Algorithmic Learning Theory, 9th International Conference, 1998

1997
Generalization in Typed Equational Programming and Their Application to Learning Functions.
New Gener. Comput., 1997

Which Hypotheses Can Be Found with Inverse Entailment?
Proceedings of the Inductive Logic Programming, 7th International Workshop, 1997

1995
Rotation Measurement and Control of Optically Trapped Particles.
J. Robotics Mechatronics, 1995

Learning Logic Programs Using Definite Equality Theories as Background Knowledge.
IEICE Trans. Inf. Syst., 1995

1994
Learning from Examples with Typed Equational Programming.
Proceedings of the Algorithmic Learning Theory, 1994

1993
Parity-scan design to reduce the cost of test application.
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 1993

Generalized Unification as Background Knowledge in Learning Logic Programs.
Proceedings of the Algorithmic Learning Theory, 4th International Workshop, 1993

1992
Learning Elementary Formal Systems.
Theor. Comput. Sci., 1992

Short Note: Procedural Semantics and Negative Information of Elementary Formal System.
J. Log. Program., 1992

Polynomial-Time MAT Learning of Multilinear Logic Programs.
Proceedings of the Algorithmic Learning Theory, Third Workshop, 1992

1989
Elementary Formal System as a Logic Programming Language.
Proceedings of the Logic Programming '89, 1989

Elementary Formal System as a Unifying Framework for Language Learning.
Proceedings of the Second Annual Workshop on Computational Learning Theory, 1989

1988
Completeness of Extending Unification Based on Basic Narrowing.
Proceedings of the Logic Programming '88, 1988

1987
A Theoretical Combination of SLD-Resolution and Narrowing.
Proceedings of the Logic Programming, 1987


  Loading...