Kouichi Hirata - Citegraph

Author Info

Name	Affiliation	Papers
KOUICHI HIRATA	Department of Artificial Intelligence, Kyushu Institute of Technology, Kawazu 680-4, Iizuka, 820-8502 Japan	81
Collaborators	Citations	PageRank
91	130	32.04
Referers	Referees	References
173	573	635

Search Limit

100573

Publications (81 rows)

Collaborators (91 rows)

Referers (100 rows)

Referees (100 rows)

Title	Citations	PageRank	Year
Path histogram distance and complete subtree histogram distance for rooted labelled caterpillars.	0	0.34	2020
Alignment for Rooted Labeled Caterpillars.	0	0.34	2019
Introducing Fluctuation into Increasing Order of Symmetric Uncertainty for Consistency-Based Feature Selection.	0	0.34	2019
Annealing By Increasing Resampling	0	0.34	2019
Annealing By Increasing Resampling In The Unified View Of Simulated Annealing	0	0.34	2019
Fast Filtering for Nearest Neighbor Search by Sketch Enumeration Without Using Matching.	0	0.34	2019
Bipartite Edge Correlation Clustering: Finding An Edge Biclique Partition From A Bipartite Graph With Minimum Disagreement	0	0.34	2019
Fast Nearest Neighbor Search With Narrow 16-Bit Sketch	0	0.34	2019
Vertical And Horizontal Distances To Approximate Edit Distance For Rooted Labeled Caterpillars	1	0.38	2019
Computing Edit Distance between Rooted Labeled Caterpillars.	0	0.34	2018
Earth Mover's Distance Between Rooted Labeled Unordered Trees Formulated from Complete Subtrees.	0	0.34	2018
LCA Histogram Distance for Rooted Labeled Caterpillars.	0	0.34	2018
Path Histogram Distance For Rooted Labeled Caterpillars	0	0.34	2018
Tai Mapping Hierarchy for Rooted Labeled Trees Through Common Subforest.	3	0.44	2017
Pivot Selection for Dimension Reduction using Annealing by Increasing Resampling.	0	0.34	2017
Extracting Mutually Dependent Multisets	0	0.34	2017
Iterative Feature Selection Based on Binary Consistency	0	0.34	2017
Anchored Alignment Distance between Rooted Labeled Unordered Trees.	0	0.34	2017
Fast Hilbert Sort Algorithm Without Using Hilbert Indices.	0	0.34	2016
Alignment of Cyclically Ordered Trees	0	0.34	2015
Classifying Nucleotide Sequences and their Positions of Influenza A Viruses through Several Kernels	0	0.34	2015
Extracting Propagation Patterns from Bacterial Culture Data in Medical Facility	0	0.34	2015
High Dimensional Similarity Search with Bundled Query Processing on Hilbert R-Tree.	0	0.34	2015
Central Point Selection in Dimension Reduction Projection Simple-Map with Binary Quantization.	0	0.34	2014
Mapping Kernels Between Rooted Labeled Trees Beyond Ordered Trees.	0	0.34	2014
Tractable And Intractable Variations Of Unordered Tree Edit Distance	1	0.38	2014
Anchored Alignment Problem for Rooted Labeled Trees.	0	0.34	2014
A Dynamic Programming A* Algorithm for Computing Unordered Tree Edit Distance	0	0.34	2013
Clustering of Positions in Nucleotide Sequences by Trim Distance	1	0.36	2013
Polynomial Delay And Space Discovery Of Connected And Acyclic Sub-Hypergraphs In A Hypergraph	0	0.34	2013
Development of Flexible User Need's Investigation System Based on XML Conversions	1	0.63	2013
Agreement Subtree Mapping Kernel for Phylogenetic Trees.	0	0.34	2013
Exploring social context from buzz marketing site - Community mapping based on tree edit distance -.	0	0.34	2013
Faster Algorithms for Tree Similarity Based on Compressed Enumeration of Bounded-Sized Ordered Subtrees.	0	0.34	2013
Translating XML Documents Through Dyck-Typed Regular Translation Elementary Formal Systems	1	0.40	2012
Segmental Mapping and Distance for Rooted Labeled Ordered Trees	1	0.35	2012
A trim distance between positions as packaging signals in H3N2 influenza viruses	1	0.36	2012
An Isolated-Subtree Inclusion for Unordered Trees	0	0.34	2012
A Trim Distance between Positions in Nucleotide Sequences.	3	0.83	2012
On Computing Tractable Variations of Unordered Tree Edit Distance with Network Algorithms.	2	0.40	2011
Improved MAX SNP-hard results for finding an edit distance between unordered trees	15	0.72	2011
An A* Algorithm for Computing Edit Distance between Rooted Labeled Unordered Trees.	3	0.42	2011
The sixth workshop on learning with logics and logics for learning (LLLL2009)	0	0.34	2009
On Generating All Maximal Acyclic Subhypergraphs with Polynomial Delay	1	0.35	2009
Approximating Tree Edit Distance through String Edit Distance for Binary Tree Codes	1	0.37	2009
A Polynomial-Delay Polynomial-Space Algorithm for Extracting Frequent Diamond Episodes from Event Sequences	3	0.40	2009
Mining frequent k-partite episodes from event sequences	3	0.40	2009
Mining Frequent Bipartite Episode from Event Sequences	1	0.37	2009
Discovering Networks for Global Propagation of Influenza A (H3N2) Viruses by Clustering	0	0.34	2009
A Tree Distance Function Based on Multi-sets	8	0.58	2008

1
2
50 / page