Planning with Abstraction Based on Partial Predicate Mappings. - Yoshiaki Okubo; Makoto Haraguchi (New Gener. Comput., 1994)

Attacking Legal Argument by Examining Stability of Case Citation with Goal-Dependent Abstraction. - Yoshiaki Okubo; Makoto Haraguchi (ICAIL, 1997)

A Goal-Dependent Abstraction for Legal Reasoning by Analogy. - Tokuyasu Kakuta; Makoto Haraguchi; Yoshiaki Okubo (Artif. Intell. Law, 1997)

Attacking Legal Argument by Pointing Out the Incoherence of Interpretation of Statute. - Yoshiaki Okubo; Makoto Haraguchi (J. Adv. Comput. Intell. Intell. Informatics, 1997)

Constructing Predicate Mappings for Goal-Dependent Abstraction. - Yoshiaki Okubo; Makoto Haraguchi (Ann. Math. Artif. Intell., 1998)

A Method of Similarity-Driven Knowledge Revision for Type Specializations. - Nobuhiro Morita; Makoto Haraguchi; Yoshiaki Okubo (ALT, 1999)

A Method for Finding Consistent Hypotheses Using Abstraction. - Yoshiaki Okubo; Makoto Haraguchi; Yan Fang Zheng (SARA, 2000)

A Logical Foundation of Metaphoric Search Based on Abstraction Approach. - Makoto Haraguchi; Yoshiaki Okubo; Tokuyasu Kakuta (Electron. Trans. Artif. Intell., 2000)

Constructing Approximate Informative Basis of Association Rules. - Kouta Kanda; Makoto Haraguchi; Yoshiaki Okubo (Discovery Science, 2001)

Constructing Appropriate Data Abstractions for Mining Classification Knowledge. - Yoshiaki Okubo; Yoshimitsu Kudoh; Makoto Haraguchi (INAP (LNCS Volume), 2001)

Data Abstractions for Numerical Attributes in Data Mining. - Masaaki Narita; Makoto Haraguchi; Yoshiaki Okubo (IDEAL, 2002)

Learning Semi-Lattice Codebooks for Image Compression. - Yoshiaki Okubo; Xiaobo Li 001 (SARA, 2002)

Creating Abstract Concepts for Classification by Finding Top- N Maximal Weighted Cliques. - Yoshiaki Okubo; Makoto Haraguchi (Discovery Science, 2003)

Data abstractions for decision tree induction. - Yoshimitsu Kudoh; Makoto Haraguchi; Yoshiaki Okubo (Theor. Comput. Sci., 2003)

A Method for Pinpoint Clustering of Web Pages with Pseudo-Clique Search. - Makoto Haraguchi; Yoshiaki Okubo (Federation over the Web, 2005)

Finding Significant Web Pages with Lower Ranks by Pseudo-Clique Search. - Yoshiaki Okubo; Makoto Haraguchi; Bin Shi (Discovery Science, 2005)

Discovery of Hidden Correlations in a Local Transaction Database Based on Differences of Correlations. - Tsuyoshi Taniguchi; Makoto Haraguchi; Yoshiaki Okubo (MLDM, 2005)

An Extended Branch and Bound Search Algorithm for Finding Top- N Formal Concepts of Documents. - Makoto Haraguchi; Yoshiaki Okubo (JSAI, 2006)

Finding Conceptual Document Clusters with Improved Top-N Formal Concept Search. - Yoshiaki Okubo; Makoto Haraguchi (Web Intelligence, 2006)

Data Mining of Time-Series Medical Data by Formal Concept Analysis. - Kenji Sato; Yoshiaki Okubo; Makoto Haraguchi; Susumu Kunifuji (KES (2), 2007)

Implicit Groups of Web Pages as Constrained Top N Concepts. - Aixiang Li; Makoto Haraguchi; Yoshiaki Okubo (Web Intelligence/IAT Workshops, 2008)

Finding Top-N Pseudo Formal Concepts with Core Intents. - Yoshiaki Okubo; Makoto Haraguchi (MLDM, 2009)

Finding Rare Patterns with Weak Correlation Constraint. - Yoshiaki Okubo; Makoto Haraguchi; Takeshi Nakajima (ICDM Workshops, 2010)

An Algorithm for Extracting Rare Concepts with Concise Intents. - Yoshiaki Okubo; Makoto Haraguchi (ICFCA, 2010)

Finding Top-N Chance Patterns with KeyGraph $^{ tiny textregistered}$ -Based Importance. - Yoshiaki Okubo; Makoto Haraguchi; Sachio Hirokawa (KES (2), 2011)

Structural Change Pattern Mining Based on Constrained Maximal k-Plex Search. - Yoshiaki Okubo; Makoto Haraguchi; Etsuji Tomita (Discovery Science, 2012)

Finding Top-N Colossal Patterns Based on Clique Search with Dynamic Update of Graph. - Yoshiaki Okubo; Makoto Haraguchi (ICFCA, 2012)

Finding What Changes for Two Graphs Constructed from Different Time Intervals. - Aixiang Li; Makoto Haraguchi; Yoshiaki Okubo; Etsuji Tomita (IIAI-AAI, 2012)

Top-N Minimization Approach for Indicative Correlation Change Mining. - Aixiang Li; Makoto Haraguchi; Yoshiaki Okubo (MLDM, 2012)

Contrasting Correlations by an Efficient Double-Clique Condition. - Aixiang Li; Makoto Haraguchi; Yoshiaki Okubo (Trans. Mach. Learn. Data Min., 2012)

Relational Change Pattern Mining Based on Modularity Difference. - Yoshiaki Okubo; Makoto Haraguchi; Etsuji Tomita (MIWAI, 2013)

Shifting Concepts to Their Associative Concepts via Bridges. - Hongjie Zhai; Makoto Haraguchi; Yoshiaki Okubo; Kiyota Hashimoto; Sachio Hirokawa (MLDM, 2013)

Detecting Maximum k-Plex with Iterative Proper ℓ-Plex Search. - Yoshiaki Okubo; Masanobu Matsudaira; Makoto Haraguchi (Discovery Science, 2014)

Enumerating Maximal Clique Sets with Pseudo-Clique Constraint. - Hongjie Zhai; Makoto Haraguchi; Yoshiaki Okubo; Etsuji Tomita (Discovery Science, 2015)

Enumerating Maximal Isolated Cliques Based on Vertex-Dependent Connection Lower Bound. - Yoshiaki Okubo; Makoto Haraguchi; Etsuji Tomita (MLDM, 2016)

A Fast and Complete Enumeration of Pseudo-Cliques for Large Graphs. - Hongjie Zhai; Makoto Haraguchi; Yoshiaki Okubo; Etsuji Tomita (PAKDD (1), 2016)

A fast and complete algorithm for enumerating pseudo-cliques in large graphs. - Hongjie Zhai; Makoto Haraguchi; Yoshiaki Okubo; Etsuji Tomita (Int. J. Data Sci. Anal., 2016)

Mining Frequent Closed Set Distinguishing One Dataset from Another from a Viewpoint of Structural Index. - Yoshiaki Okubo; Makoto Haraguchi (MLDM, 2017)

Finding Concepts with Unexpected Multi-Label Objects Based on Shared Subspace Method. - Hongjie Zhai; Makoto Haraguchi; Yoshiaki Okubo; HeYu Liu (CLA, 2018)

Finding Concepts of Music Objects with Unexpected Multi-labels Based on Shared Subspace Method. - Makoto Haraguchi; Yoshiaki Okubo (IIAI-AAI, 2018)