• Search Research Projects
  • Search Researchers
  • How to Use
  1. Back to previous page

Extracting Hierarchical Knowledge Structures in Logical Analysis of Data

Research Project

Project/Area Number 18700014
Research Category

Grant-in-Aid for Young Scientists (B)

Allocation TypeSingle-year Grants
Research Field Fundamental theory of informatics
Research InstitutionKyushu University

Principal Investigator

HIROTAKA Ono  Kyushu University, 大学院・システム情報科学研究院, 助教 (00346826)

Project Period (FY) 2006 – 2008
Project Status Completed (Fiscal Year 2008)
Budget Amount *help
¥2,840,000 (Direct Cost: ¥2,600,000、Indirect Cost: ¥240,000)
Fiscal Year 2008: ¥1,040,000 (Direct Cost: ¥800,000、Indirect Cost: ¥240,000)
Fiscal Year 2007: ¥900,000 (Direct Cost: ¥900,000)
Fiscal Year 2006: ¥900,000 (Direct Cost: ¥900,000)
Keywordsデータ解析 / 論理関数 / 知識階層 / 最適化問題 / グラフモデル / 近似精度保証 / グラフアルゴリズム / 演繹推論 / ホーン
Research Abstract

本研究課題のテーマはデータからの知識獲得について,特に知識の持つ階層構造の抽出の立場から高性能アルゴリズムの開発,もしくは計算複雑度の解明を明らかにすることにある.人間が理解しやすい構造(たとえば階層性)を持った知識はある特別なクラスに属する論理関数の抽出問題として捉えることができる反面,それらを的確かつ厳密に捉えるアルゴリズムの構築は理論上・実際上難しいものであった(計算困難).本研究ではこれらの計算困難な知識抽出にまつわる問題群に対し,現実的な制約の下でなら,もしくは厳密ではなく近似的にならば、これらの問題が実際上・また理論上十分高速に解決可能であることを示した.

Report

(4 results)
  • 2008 Annual Research Report   Final Research Report ( PDF )
  • 2007 Annual Research Report
  • 2006 Annual Research Report
  • Research Products

    (47 results)

All 2009 2008 2007 2006 Other

All Journal Article (23 results) (of which Peer Reviewed: 10 results) Presentation (23 results) Remarks (1 results)

  • [Journal Article] Drawing Borders Efficiently2009

    • Author(s)
      K. Iwama, E. Miyano, H. One
    • Journal Title

      Theory of Computing Systems, 44(2)

      Pages: 230-244

    • Related Report
      2008 Annual Research Report
    • Peer Reviewed
  • [Journal Article] Deductive Inference for the Interiors and Exteriors of Horn Theories, the Proceedings of Algorithms and Computation, 19th International Symposium, ISAAC20082008

    • Author(s)
      K. Makino, H. Ono
    • Journal Title

      Lecture Notes in Computer Science 5369

      Pages: 390-401

    • Related Report
      2008 Final Research Report
  • [Journal Article] The Balanced Edge Cover Problem, the Proceedings of Algorithms and Computation, 19th International Symposium, ISAAC20082008

    • Author(s)
      Y. Harada, H. Ono, K. Sadakane, M. Yamashita
    • Journal Title

      Lecture Notes in Computer Science 5369

      Pages: 246-257

    • Related Report
      2008 Final Research Report
  • [Journal Article] An O(n^{1.75}) Algorithm for L(2, 1)-Labeling of Trees, Proceedings of 11th Scandinavian Workshop on Algorithm Theory, SWAT20082008

    • Author(s)
      T. Hasunuma, T. Ishii, H. Ono, Y. Uno
    • Journal Title

      Lecture Notes in Computer Science 512

      Pages: 185-197

    • Related Report
      2008 Final Research Report
  • [Journal Article] Graph Classes and the Complexity of the Graph Orientation Minimizing the Maximum Weighted Outdegree, Proceedings of Computing: the Twelfth Australasian Theory Symposium (CATS 2008)2008

    • Author(s)
      Y. Asahiro, E. Miyano and H. Ono
    • Journal Title

      Wollongong, NSW, Australia. CRPIT, 77. Harland, J. and Manyem, P., Eds., ACS.

      Pages: 97-106

    • Related Report
      2008 Final Research Report
  • [Journal Article] An O(n^{1.75}) Algorithm for L(2, 1)-Labeling of Trees2008

    • Author(s)
      T. Hasunuma, T. Ishii, H. Ono, Y. Uno
    • Journal Title

      SWAT2008, Lecture Notes in Computer Science 5124

      Pages: 185-197

    • NAID

      120006654464

    • Related Report
      2008 Annual Research Report
    • Peer Reviewed
  • [Journal Article] A Counting-Based Approximation of the Distribution Function of the Lo ngest Path Length in Directed Acyclic Graphs2008

    • Author(s)
      E. Ando, H. Ono, K. Sadakane, M. Yamashita
    • Journal Title

      FIT2008(第7回情報科学技術フォーラム) (CD-ROM)

    • Related Report
      2008 Annual Research Report
    • Peer Reviewed
  • [Journal Article] An O(n log^2 n) Algorithm for L(2, 1)-labeling of Trees2008

    • Author(s)
      T. Hasunuma, T. Ishii, H. Ono, Y. Uno
    • Journal Title

      FIT2008(第7回情報科学技術フォーラム) (CD-ROM)

    • Related Report
      2008 Annual Research Report
    • Peer Reviewed
  • [Journal Article] The Balanced Edge Cover Problem2008

    • Author(s)
      Y. Harada, H. Ono, K. Sadakane., M. Yamashita
    • Journal Title

      ISAAC2008, Lecture Notes in Computer Science 5369

      Pages: 246-257

    • Related Report
      2008 Annual Research Report
    • Peer Reviewed
  • [Journal Article] Deductive Inference for the Interiors and Exteriors of Horn Theories2008

    • Author(s)
      K. Makino, H. Ono
    • Journal Title

      ISAAC2008, Lecture Notes in Computer Science 5369

      Pages: 390-401

    • NAID

      110006343679

    • Related Report
      2008 Annual Research Report
    • Peer Reviewed
  • [Journal Article] On Approximation of Bookmark Assignments, Proceedings of 32nd International Symposium on Mathematical Foundations of Computer Science, MFCS 20072007

    • Author(s)
      Y. Asahiro, E. Miyano, T. Murata and H. Ono
    • Journal Title

      Lecture Notes in Computer Science 4708

      Pages: 115-124

    • Related Report
      2008 Final Research Report
  • [Journal Article] Approximation Algorithms for the Graph Orientation Minimizing the Maximum Weighted Outdegree, Proceedings of The Third International Conference on Algorithmic Aspects in Information and Management, AAIM 20072007

    • Author(s)
      Y. Asahiro, J. Jansson, E. Miyano, H. Ono and K. Zenmyo
    • Journal Title

      Lecture Notes in Computer Science 4508

      Pages: 167-177

    • Related Report
      2008 Final Research Report
  • [Journal Article] Graph Orientation Algorithms to minimize the Maximum Outdegree2007

    • Author(s)
      Y. Asahiro, E. Miyano, H. Ono, K. Zenmyo
    • Journal Title

      International Journal Foundation Computer Science 18(2)

      Pages: 197-215

    • NAID

      120001364333

    • Related Report
      2008 Final Research Report
  • [Journal Article] Approximation Algorithms for the Graph Orientation Minimizing the Maximum Weighted Outdegree2007

    • Author(s)
      Yuichi, Asahiro・Jesper, Jansson・Eiji, Miyano・Hirotaka, Ono・Kouhei, Zenmyo
    • Journal Title

      Algorithmic Aspects in Information and Management, Third International Conference, AAIM 2007

      Pages: 167-177

    • Related Report
      2007 Annual Research Report
    • Peer Reviewed
  • [Journal Article] Drawing Borders Efficiently2007

    • Author(s)
      Kazuo, Iwama・Eiji, Miyano・Hirotaka, Ono
    • Journal Title

      Fun with Algorithms, 4th International Conference, FUN 2007

      Pages: 213-226

    • NAID

      120001361177

    • Related Report
      2007 Annual Research Report
    • Peer Reviewed
  • [Journal Article] Approximation Algorithms for Constructing Evolutionary Trees from Rooted Tripltes2007

    • Author(s)
      Kazuya, Maemura・Jesper, Jansson・Hirotaka, Ono・Kunihiko, Sadakane・Masafumi, Yamashita
    • Journal Title

      2007 Korea-Japan Joint Workshop on Algorithms and Computation

      Pages: 56-63

    • Related Report
      2007 Annual Research Report
    • Peer Reviewed
  • [Journal Article] On Approximation of Bookmark Assignments″2007

    • Author(s)
      Yuichi, Asahiro・Eiji, Miyano・Toshihide, Murata・irotaka, Ono
    • Journal Title

      Mathematical Foundations of Computer Science 2007, 32nd International Symposium, MFCS 2007

      Pages: 115-124

    • NAID

      120006654477

    • Related Report
      2007 Annual Research Report
    • Peer Reviewed
  • [Journal Article] Graph orientation algorithms to minimize the maximum outdegree2007

    • Author(s)
      Asahiro, E.Miyano, H.Ono, K.Zenmyo
    • Journal Title

      International Journal of Foundation of Computer Science (未定)(掲載決定)

    • NAID

      120001364333

    • Related Report
      2006 Annual Research Report
  • [Journal Article] Drawing Borders Efficiently2007

    • Author(s)
      K.Iwama, E.Miyano, H.Ono
    • Journal Title

      Proceedings of Fourth International Conference on FUN WITH ALGORITHMS (FUN 2007) (未定)(掲載決定)

    • NAID

      120001361177

    • Related Report
      2006 Annual Research Report
  • [Journal Article] Approximation Algorithms for the Graph Orientation Minimizing the Maximum Weighted Outdegree2007

    • Author(s)
      Y.Asahiro, J.Jansson, E.Miyano, H.Ono, Z.Kouhei
    • Journal Title

      Proceedings of the Third International Conference on Algorithmic Aspects in Information and Management (AAIM 2007) (未定)(掲載決定)

    • Related Report
      2006 Annual Research Report
  • [Journal Article] How to Collect Balls Moving in the Euclidean Plane2006

    • Author(s)
      Y. Asahiro, T. Horiyama, K. Makino, H. Ono, T. Sakuma, and M. Yamashita
    • Journal Title

      Discrete Applied Mathematics Vol。154, no. 16

      Pages: 2247-2262

    • Related Report
      2008 Final Research Report
  • [Journal Article] DNA Sequence Design by Dynamic Neighborhood Searches2006

    • Author(s)
      Suguru Kawashimo, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita
    • Journal Title

      Revised Selected Papers of the 12th International Meeting on DNA Computing, DNA12, Lecture Notes in Computer Science 4287

      Pages: 157-171

    • NAID

      110004741455

    • Related Report
      2006 Annual Research Report
  • [Journal Article] How to Collect Balls Moving in the Euclidean Plane2006

    • Author(s)
      Y.Asahiro, T.Horiyama, K.Makino, H.Ono, T.Sakuma, M.Yamashita
    • Journal Title

      Discrete Applied Mathematics Vol 154, no. 16

      Pages: 2247-2262

    • Related Report
      2006 Annual Research Report
  • [Presentation] 高速復元可能な接尾辞配列圧縮法2009

    • Author(s)
      田中洋輔, 小野廣隆, 定兼邦彦, 山下雅史
    • Organizer
      火の国情報シンポジウム2009
    • Place of Presentation
      九州産業大学(福岡)
    • Year and Date
      2009-03-14
    • Related Report
      2008 Annual Research Report
  • [Presentation] 頻出属性検出ポピュレーションプロトコルの設計と解析2009

    • Author(s)
      溝口隆, 小野廣隆, 定兼邦彦, 山下雅史
    • Organizer
      火の国情報シンポジウム2009
    • Place of Presentation
      九州産業大学(福岡)
    • Year and Date
      2009-03-14
    • Related Report
      2008 Annual Research Report
  • [Presentation] 可変長近傍局所探索に基づく最長路発見アルゴリズム2009

    • Author(s)
      山下健司, 小野廣隆, 定兼邦彦, 山下雅史
    • Organizer
      火の国情報シンポジウム2009
    • Place of Presentation
      九州産業大学(福岡)
    • Year and Date
      2009-03-14
    • Related Report
      2008 Annual Research Report
  • [Presentation] 確率重み付きグラフの最短路長分布の近似2009

    • Author(s)
      兼田康弘, 安藤映, 小野廣隆, 定兼邦彦, 山下雅史
    • Organizer
      火の国情報シンポジウム2009
    • Place of Presentation
      九州産業大学(福岡)
    • Year and Date
      2009-03-14
    • Related Report
      2008 Annual Research Report
  • [Presentation] 不完全情報渋滞ゲームの近似的ナッシュ遷移の収束性2009

    • Author(s)
      山田陽介, 小野廣隆, 定兼邦彦, 山下雅史)
    • Organizer
      火の国情報シンポジウム2009
    • Place of Presentation
      九州産業大学(福岡)
    • Year and Date
      2009-03-14
    • Related Report
      2008 Annual Research Report
  • [Presentation] より簡潔な全二分木の表現2009

    • Author(s)
      馬場雅大, 小野廣隆, 定兼邦彦, 山下雅史
    • Organizer
      火の国情報シンポジウム2009
    • Place of Presentation
      九州産業大学(福岡)
    • Year and Date
      2009-03-13
    • Related Report
      2008 Annual Research Report
  • [Presentation] 指数分布枝重み付DAGに対する最長路長さ分布の厳密計算2009

    • Author(s)
      安藤映, 小野廣隆, 定兼邦彦, 山下雅史
    • Organizer
      冬のLAシンポジウム2009
    • Place of Presentation
      京都大学
    • Year and Date
      2009-02-04
    • Related Report
      2008 Annual Research Report
  • [Presentation] 木のL(2, 1)・ラベリングに対する高速アルゴリズム2008

    • Author(s)
      小野廣隆
    • Organizer
      日本オペレーションズ・リサーチ学会「計算と最適化」研究部会(S@CO)第13回研究会
    • Place of Presentation
      秋葉原
    • Year and Date
      2008-11-01
    • Related Report
      2008 Annual Research Report
  • [Presentation] A Linear Algorithm for L(2,1)-labeling of Trees2008

    • Author(s)
      小野廣隆,蓮沼徹,石井利昌,宇野裕之
    • Organizer
      日本応用数理学会2008年度年会
    • Place of Presentation
      東京大学柏キャンパス
    • Year and Date
      2008-09-17
    • Related Report
      2008 Final Research Report
  • [Presentation] A Linear Algorithm for L(2, 1)-labeling of Trees2008

    • Author(s)
      小野廣隆, 蓮沼徹, 石井利昌, 宇野裕之
    • Organizer
      日本応用数理学会2008年度年会
    • Place of Presentation
      東京大学柏キャンパス
    • Year and Date
      2008-09-17
    • Related Report
      2008 Annual Research Report
  • [Presentation] An O(n log^2 n) Algorithm for L(2,1)-labeling of Trees2008

    • Author(s)
      小野廣隆,蓮沼徹,石井利昌,宇野裕之
    • Organizer
      日本オペレーションズ・リサーチ学会平成20 年度秋季研究発表会
    • Place of Presentation
      北海道
    • Year and Date
      2008-09-11
    • Related Report
      2008 Final Research Report
  • [Presentation] An O(n log^2 n) Algorithm for L(2, 1)-labeling of Trees2008

    • Author(s)
      小野廣隆, 蓮沼徹, 石井利昌, 宇野裕之
    • Organizer
      日本オペレーションズ・リサーチ学会平成20年度秋季研究発表会
    • Place of Presentation
      北海道
    • Year and Date
      2008-09-11
    • Related Report
      2008 Annual Research Report
  • [Presentation] Approximation Algorithms for Constructing Evolutionary Trees from Rooted Triplte2008

    • Author(s)
      K. Maemura, J. Jansson, H. Ono, K. Sadakane and M. Yamashita
    • Organizer
      2007 Korea-Japan Joint Workshop on Algorithms and Computation
    • Year and Date
      2008-08-11
    • Related Report
      2008 Final Research Report
  • [Presentation] DAGにおける確率的最長路問題の多項式時間解法2008

    • Author(s)
      安藤映, 小野廣隆, 定兼邦彦, 山下雅史
    • Organizer
      夏のLAシンポジウム2008
    • Place of Presentation
      国民休暇村南紀勝浦(和歌山)
    • Year and Date
      2008-07-24
    • Related Report
      2008 Annual Research Report
  • [Presentation] 近傍ハッシュ法によるエラー許容頻出パターン列挙2008

    • Author(s)
      橋本英樹,小野廣隆,宇野毅明,漆原秀子,柳浦睦憲
    • Organizer
      情報処理学会研究報告第13回バイオ情報学研究会
    • Place of Presentation
      琉球大学
    • Year and Date
      2008-06-27
    • Related Report
      2008 Annual Research Report 2008 Final Research Report
  • [Presentation] 最小重み負荷分散枝被覆について2008

    • Author(s)
      小野廣隆, 原田雄太, 定兼邦彦, 山下雅史
    • Organizer
      情報処理学会研究報告. A5L
    • Place of Presentation
      東京農工大
    • Year and Date
      2008-05-27
    • Related Report
      2008 Annual Research Report
  • [Presentation] An $0(n^{1.75})$-time Algorithm for L(2, 1)-labeling of Trees2008

    • Author(s)
      H. Ono, T. Hasunuma, T. Ishii, Y. Uno
    • Organizer
      電子情報通信学会コンピュテーション研究会
    • Place of Presentation
      九州産業大学(福岡)
    • Year and Date
      2008-05-13
    • Related Report
      2008 Annual Research Report
  • [Presentation] On the Distribution of the Longest Path Length in a Directed Acyclic Graph with Exponentially Distributed Edge Weights2008

    • Author(s)
      E. Ando, H. Ono, K. Sadakane, M. Yamashita
    • Organizer
      The First AAAC Annual Meeting AAAC08
    • Place of Presentation
      香港
    • Year and Date
      2008-04-27
    • Related Report
      2008 Annual Research Report
  • [Presentation] An Efficient Algorithm for L(2,1)-Labeling of Trees2008

    • Author(s)
      H. Ono(T. Hasunuma, T. Ishii, , Y. Uno)
    • Organizer
      The First AAAC Annual Meeting AAAC08
    • Place of Presentation
      香港
    • Year and Date
      2008-04-26
    • Related Report
      2008 Final Research Report
  • [Presentation] An Efficient Algorithm for L(2, 1)-Labeling of Trees2008

    • Author(s)
      H. Ono, T. Hasunuma, T. Ishii, Y. Uno
    • Organizer
      The First AAAC Annual Meeting AAACO8
    • Place of Presentation
      香港
    • Year and Date
      2008-04-26
    • Related Report
      2008 Annual Research Report
  • [Presentation] Connectedness of domino tilings with impurities2007

    • Author(s)
      ○Hirotaka, Ono・Taizo, Sadahiro
    • Organizer
      コンピュテーション研究会
    • Place of Presentation
      東北大学
    • Year and Date
      2007-10-16
    • Related Report
      2007 Annual Research Report
  • [Presentation] Deductive Inference for the Interiors and Exteriors of Horn Theories2007

    • Author(s)
      Kazuhisa, Makino・○Hirotaka, Ono
    • Organizer
      コンピュテーション研究会
    • Place of Presentation
      北海道大学
    • Year and Date
      2007-06-29
    • Related Report
      2007 Annual Research Report
  • [Presentation] Optimality and Algorithms for the Balanced Edge Cover Problem2007

    • Author(s)
      ○原田雄太 小野魔隆 定兼邦彦 山下雅史
    • Organizer
      コンピュテーション研究会
    • Place of Presentation
      九州大学
    • Year and Date
      2007-05-25
    • Related Report
      2007 Annual Research Report
  • [Remarks]

    • URL

      http://hyoka.ofc.kyushu-u.ac.jp/search/details/KOOO224/index.html

    • Related Report
      2008 Annual Research Report

URL: 

Published: 2006-04-01   Modified: 2016-04-21  

Information User Guide FAQ News Terms of Use Attribution of KAKENHI

Powered by NII kakenhi