default search action
Yoshiaki Okubo
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2018
- [c36]Hongjie Zhai, Makoto Haraguchi, Yoshiaki Okubo, HeYu Liu:
Finding Concepts with Unexpected Multi-Label Objects Based on Shared Subspace Method. CLA 2018: 93-104 - [c35]Makoto Haraguchi, Yoshiaki Okubo:
Finding Concepts of Music Objects with Unexpected Multi-labels Based on Shared Subspace Method. IIAI-AAI 2018: 43-48 - 2017
- [c34]Yoshiaki Okubo, Makoto Haraguchi:
Mining Frequent Closed Set Distinguishing One Dataset from Another from a Viewpoint of Structural Index. MLDM 2017: 417-430 - 2016
- [j8]Hongjie Zhai, Makoto Haraguchi, Yoshiaki Okubo, Etsuji Tomita:
A fast and complete algorithm for enumerating pseudo-cliques in large graphs. Int. J. Data Sci. Anal. 2(3-4): 145-158 (2016) - [c33]Yoshiaki Okubo, Makoto Haraguchi, Etsuji Tomita:
Enumerating Maximal Isolated Cliques Based on Vertex-Dependent Connection Lower Bound. MLDM 2016: 569-583 - [c32]Hongjie Zhai, Makoto Haraguchi, Yoshiaki Okubo, Etsuji Tomita:
A Fast and Complete Enumeration of Pseudo-Cliques for Large Graphs. PAKDD (1) 2016: 423-435 - 2015
- [c31]Hongjie Zhai, Makoto Haraguchi, Yoshiaki Okubo, Etsuji Tomita:
Enumerating Maximal Clique Sets with Pseudo-Clique Constraint. Discovery Science 2015: 324-339 - 2014
- [c30]Yoshiaki Okubo, Masanobu Matsudaira, Makoto Haraguchi:
Detecting Maximum k-Plex with Iterative Proper ℓ-Plex Search. Discovery Science 2014: 240-251 - 2013
- [c29]Yoshiaki Okubo, Makoto Haraguchi, Etsuji Tomita:
Relational Change Pattern Mining Based on Modularity Difference. MIWAI 2013: 187-198 - [c28]Hongjie Zhai, Makoto Haraguchi, Yoshiaki Okubo, Kiyota Hashimoto
, Sachio Hirokawa
Shifting Concepts to Their Associative Concepts via Bridges. MLDM 2013: 586-600 - 2012
- [j7]Aixiang Li, Makoto Haraguchi, Yoshiaki Okubo:
Contrasting Correlations by an Efficient Double-Clique Condition. Trans. Mach. Learn. Data Min. 5(1): 3-22 (2012) - [c27]Yoshiaki Okubo, Makoto Haraguchi, Etsuji Tomita:
Structural Change Pattern Mining Based on Constrained Maximal k-Plex Search. Discovery Science 2012: 284-298 - [c26]Yoshiaki Okubo, Makoto Haraguchi:
Finding Top-N Colossal Patterns Based on Clique Search with Dynamic Update of Graph. ICFCA 2012: 244-259 - [c25]Aixiang Li, Makoto Haraguchi, Yoshiaki Okubo, Etsuji Tomita:
Finding What Changes for Two Graphs Constructed from Different Time Intervals. IIAI-AAI 2012: 48-53 - [c24]Aixiang Li, Makoto Haraguchi, Yoshiaki Okubo:
Top-N Minimization Approach for Indicative Correlation Change Mining. MLDM 2012: 102-116 - 2011
- [c23]Yoshiaki Okubo, Makoto Haraguchi, Sachio Hirokawa
Finding Top-N Chance Patterns with KeyGraph $^{\tiny \textregistered}$ -Based Importance. KES (2) 2011: 457-468 - [c22]Aixiang Li, Makoto Haraguchi, Yoshiaki Okubo:
Contrasting Correlations by an Efficient Double-Clique Condition. MLDM 2011: 469-483 - 2010
- [c21]Yoshiaki Okubo, Makoto Haraguchi, Takeshi Nakajima:
Finding Rare Patterns with Weak Correlation Constraint. ICDM Workshops 2010: 822-829 - [c20]Yoshiaki Okubo, Makoto Haraguchi:
An Algorithm for Extracting Rare Concepts with Concise Intents. ICFCA 2010: 145-160
2000 – 2009
- 2009
- [c19]Yoshiaki Okubo, Makoto Haraguchi:
Finding Top-N Pseudo Formal Concepts with Core Intents. MLDM 2009: 479-493 - 2008
- [c18]Aixiang Li, Makoto Haraguchi, Yoshiaki Okubo:
Implicit Groups of Web Pages as Constrained Top N Concepts. Web Intelligence/IAT Workshops 2008: 190-194 - 2007
- [c17]Kenji Sato, Yoshiaki Okubo, Makoto Haraguchi, Susumu Kunifuji:
Data Mining of Time-Series Medical Data by Formal Concept Analysis. KES (2) 2007: 1214-1221 - 2006
- [c16]Makoto Haraguchi, Yoshiaki Okubo:
An Extended Branch and Bound Search Algorithm for Finding Top- N Formal Concepts of Documents. JSAI 2006: 276-288 - [c15]Yoshiaki Okubo, Makoto Haraguchi:
Finding Conceptual Document Clusters with Improved Top-N Formal Concept Search. Web Intelligence 2006: 347-351 - 2005
- [c14]Makoto Haraguchi, Yoshiaki Okubo:
A Method for Pinpoint Clustering of Web Pages with Pseudo-Clique Search. Federation over the Web 2005: 59-78 - [c13]Yoshiaki Okubo, Makoto Haraguchi, Bin Shi:
Finding Significant Web Pages with Lower Ranks by Pseudo-Clique Search. Discovery Science 2005: 346-353 - [c12]Tsuyoshi Taniguchi, Makoto Haraguchi, Yoshiaki Okubo:
Discovery of Hidden Correlations in a Local Transaction Database Based on Differences of Correlations. MLDM 2005: 537-548 - 2003
- [j6]Yoshimitsu Kudoh, Makoto Haraguchi, Yoshiaki Okubo:
Data abstractions for decision tree induction. Theor. Comput. Sci. 292(2): 387-416 (2003) - [c11]Yoshiaki Okubo, Makoto Haraguchi:
Creating Abstract Concepts for Classification by Finding Top- N Maximal Weighted Cliques. Discovery Science 2003: 418-425 - 2002
- [c10]Masaaki Narita, Makoto Haraguchi, Yoshiaki Okubo:
Data Abstractions for Numerical Attributes in Data Mining. IDEAL 2002: 35-42 - [c9]Yoshiaki Okubo, Xiaobo Li:
Learning Semi-Lattice Codebooks for Image Compression. SARA 2002: 342-343 - 2001
- [c8]Kouta Kanda, Makoto Haraguchi, Yoshiaki Okubo:
Constructing Approximate Informative Basis of Association Rules. Discovery Science 2001: 141-154 - [c7]Yoshiaki Okubo, Yoshimitsu Kudoh, Makoto Haraguchi:
Constructing Appropriate Data Abstractions for Mining Classification Knowledge. INAP 2001: 275-284 - [c6]Yoshiaki Okubo, Yoshimitsu Kudoh, Makoto Haraguchi:
Constructing Appropriate Data Abstractions for Mining Classification Knowledge. INAP (LNCS Volume) 2001: 276-289 - 2000
- [j5]Makoto Haraguchi, Yoshiaki Okubo, Tokuyasu Kakuta:
A Logical Foundation of Metaphoric Search Based on Abstraction Approach. Electron. Trans. Artif. Intell. 4(B): 53-81 (2000) - [c5]Yoshiaki Okubo, Makoto Haraguchi, Yan Fang Zheng:
A Method for Finding Consistent Hypotheses Using Abstraction. SARA 2000: 313-316
1990 – 1999
- 1999
- [c4]Nobuhiro Morita, Makoto Haraguchi, Yoshiaki Okubo:
A Method of Similarity-Driven Knowledge Revision for Type Specializations. ALT 1999: 194-205 - 1998
- [j4]Yoshiaki Okubo, Makoto Haraguchi:
Constructing Predicate Mappings for Goal-Dependent Abstraction. Ann. Math. Artif. Intell. 23(1-2): 169-197 (1998) - 1997
- [j3]Tokuyasu Kakuta, Makoto Haraguchi, Yoshiaki Okubo:
A Goal-Dependent Abstraction for Legal Reasoning by Analogy. Artif. Intell. Law 5(1-2): 97-118 (1997) - [j2]Yoshiaki Okubo, Makoto Haraguchi:
Attacking Legal Argument by Pointing Out the Incoherence of Interpretation of Statute. J. Adv. Comput. Intell. Intell. Informatics 1(2): 104-113 (1997) - [c3]Yoshiaki Okubo, Makoto Haraguchi:
Attacking Legal Argument by Examining Stability of Case Citation with Goal-Dependent Abstraction. ICAIL 1997: 190-197 - 1994
- [j1]Yoshiaki Okubo, Makoto Haraguchi:
Planning with Abstraction Based on Partial Predicate Mappings. New Gener. Comput. 12(4): 409-437 (1994) - [c2]Yoshiaki Okubo, Makoto Haraguchi:
Constructing Predicate Mappings for Goal-Dependent Abstraction. AII/ALT 1994: 516-531 - 1992
- [c1]Yoshiaki Okubo, Makoto Haraguchi:
Planning with Abstraction Based on Partial Predicate Mappings. ALT 1992: 183-194
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:55 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: