Name
Playground
About
FAQ
GitHub
Playground
Shortest Path Finder
Community Detector
Connected Papers
Author Trending
Gabriela B. Alves
Daniel P. Kennedy
Roland Zumkeller
Maximilian Dürr
Dong Zhang
Dan Graur
Liangliang Shang
Chen Ma
Barbara Aquilani
Minghu Zhang
Home
/
Author
/
AKIHIRO YAMAMOTO
Author Info
Open Visualization
Name
Affiliation
Papers
AKIHIRO YAMAMOTO
Graduate School of Informatics, Kyoto University, Yoshida Honmachi, Sakyo-ku, Kyoto, Japan
65
Collaborators
Citations
PageRank
56
135
26.84
Referers
Referees
References
213
881
669
Search Limit
100
881
Publications (65 rows)
Collaborators (56 rows)
Referers (100 rows)
Referees (100 rows)
Title
Citations
PageRank
Year
Differentiable Inductive Logic Programming For Structured Examples
0
0.34
2021
Using Binary Decision Diagrams to Enumerate Inductive Logic Programming Solutions.
0
0.34
2018
Learning concepts and their unions from positive data with refinement operators
0
0.34
2017
Protein-Protein Interaction Extraction from Text by Selecting Linguistic Features
0
0.34
2017
On the Sizes of Decision Diagrams Representing the Set of All Parse Trees of a Context-free Grammar.
0
0.34
2017
Outlier detection using binary decision diagrams.
2
0.37
2017
Inductive Logic Programming: Challenges.
0
0.34
2016
Periodical Skeletonization For Partially Periodic Pattern Mining
0
0.34
2015
Tree Pca For Extracting Dominant Substructures From Labeled Rooted Trees
0
0.34
2015
Edit Operations on Lattices for MDL-based Pattern Summarization.
0
0.34
2015
Formal Concept Analysis for Process Enhancement Based on a Pair of Perspectives.
0
0.34
2014
Local Feature Selection by Formal Concept Analysis for Multi-class Classification.
0
0.34
2014
A parameter-free approach for one-class classification using binary decision diagrams
2
0.39
2014
Pattern Structures for Understanding Episode Patterns.
1
0.37
2014
Semi-supervised learning on closed set lattices
1
0.36
2013
Learning figures with the Hausdorff metric by fractals—towards computable binary classification
1
0.39
2013
Efficient Mining Of Closed Tree Patterns From Large Tree Databases With Subtree Constraint
1
0.36
2012
Privacy Preserving Using Dummy Data For Set Operations In Itemset Mining Implemented With Zdds
0
0.34
2012
Mining of closed frequent subtrees from frequently updated databases
3
0.42
2012
Learning families of closed sets in matroids
3
0.42
2012
Learning from graph data by putting graphs on the lattice
3
0.37
2012
Discovering Ligands for TRP Ion Channels Using Formal Concept Analysis.
0
0.34
2011
Knowledge-leveraged Computational Thinking through Natural Language Processing and Statistical Logic (NII Shonan Meeting 2011-4).
0
0.34
2011
A Fast and Flexible Clustering Algorithm Using Binary Discretization
4
0.42
2011
The minimum code length for clustering using the gray code
0
0.34
2011
Semi-supervised learning for mixed-type data via formal concept analysis
0
0.34
2011
Latest Trends in Deburring Technology.
0
0.34
2010
Semantics of a graphical model for representing hypotheses and a system supporting the management of hypotheses
0
0.34
2010
The Coding Divergence for Measuring the Complexity of Separating Two Sets
0
0.34
2010
Mind change complexity of inferring unbounded unions of restricted pattern languages from positive data
4
0.50
2010
Frequent Closed Itemset Mining with Privacy Preserving for Distributed Databases
1
0.37
2010
Incremental mining of closed frequent subtrees
2
0.37
2010
Topological properties of concept spaces (full version)
15
0.88
2010
The Coding Divergence for Measuring the Complexity of Separating Two Sets
2
0.36
2010
Learning figures with the hausdorff metric by fractals
1
0.34
2010
The sixth workshop on learning with logics and logics for learning (LLLL2009)
0
0.34
2009
Learning from positive data based on the MINL strategy with refinement operators
2
0.40
2009
Discovering the Structures of Open Source Programs from Their Developer Mailing Lists
0
0.34
2009
Sigma^0_alpha - Admissible Representations (Extended Abstract)
1
0.39
2009
Topological Properties of Concept Spaces
7
0.59
2008
Kernel Functions Based on Derivation
0
0.34
2008
Learning Bounded Unions of Noetherian Closed Set Systems Via Characteristic Sets
1
0.36
2008
Finding Frequent Patterns from Compressed Tree-Structured Data
1
0.35
2008
Learning semantic categories for 3D model retrieval
20
1.00
2007
Computing characteristic sets of bounded unions of polynomial ideals
2
0.40
2007
Data prefetching and address pre-calculation through instruction pre-execution with two-step physical register deallocation
7
0.46
2007
Comparison of Dimension Reduction Methods for Database-Adaptive 3D Model Retrieval
3
0.37
2007
An intentional kernel function for RNA classification
1
0.36
2007
Mind change complexity of inferring unbounded unions of pattern languages from positive data
6
0.65
2006
Hypothesis finding with proof theoretical appropriateness criteria
0
0.34
2006
1
2
50 / page
