Author of the publication

Iterative Feature Selection Based on Binary Consistency.

, and . IIAI-AAI, page 397-400. IEEE Computer Society, (2017)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

No persons found for author name Hirata, Kouichi
add a person with the name Hirata, Kouichi
 

Other publications of authors with the same name

Multi-Agent Based Modeling and Simulation of Consensus Formations in Arguments., , and . ICITA (1), page 264-267. IEEE Computer Society, (2005)An Isolated-Subtree Inclusion for Unordered Trees., , , and . IIAI-AAI, page 345-350. IEEE Computer Society, (2012)Extracting Minimal and Closed Monotone DNF Formulas., , , and . Discovery Science, volume 3245 of Lecture Notes in Computer Science, page 298-305. Springer, (2004)Extracting Mutually Dependent Multisets., , and . DS, volume 10558 of Lecture Notes in Computer Science, page 267-280. Springer, (2017)Earth Mover's Distance Between Rooted Labeled Unordered Trees Formulated from Complete Subtrees., , and . ICPRAM (Revised Selected Papers), volume 11351 of Lecture Notes in Computer Science, page 65-88. Springer, (2018)Exploring social context from buzz marketing site - Community mapping based on tree edit distance -., , , and . PerCom Workshops, page 187-192. IEEE Computer Society, (2013)Path Histogram Distance for Rooted Labeled Caterpillars., , and . ACIIDS (1), volume 10751 of Lecture Notes in Computer Science, page 276-286. Springer, (2018)A Polynomial-Delay Polynomial-Space Algorithm for Extracting Frequent Diamond Episodes from Event Sequences., , and . PAKDD, volume 5476 of Lecture Notes in Computer Science, page 172-183. Springer, (2009)A Simple Characterization on Serially Constructible Episodes., and . PAKDD, volume 5012 of Lecture Notes in Computer Science, page 600-607. Springer, (2008)Prediction-hardness of acyclic conjunctive queries.. Theor. Comput. Sci., 348 (1): 84-94 (2005)