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

2008 Fiscal Year Final Research Report

Extracting Hierarchical Knowledge Structures in Logical Analysis of Data

Research Project

  • PDF
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
Keywordsデータ解析 / 論理関数 / 知識階層 / 最適化問題 / グラフモデル / 近似精度保証
Research Abstract

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

  • Research Products

    (13 results)

All 2008 2007 2006

All Journal Article (8 results) Presentation (5 results)

  • [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

  • [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

  • [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

  • [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

  • [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

  • [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

  • [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

  • [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

  • [Presentation] A Linear Algorithm for L(2,1)-labeling of Trees2008

    • Author(s)
      小野廣隆,蓮沼徹,石井利昌,宇野裕之
    • Organizer
      日本応用数理学会2008年度年会
    • Place of Presentation
      東京大学柏キャンパス
    • Year and Date
      2008-09-17
  • [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
  • [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
  • [Presentation] 近傍ハッシュ法によるエラー許容頻出パターン列挙2008

    • Author(s)
      橋本英樹,小野廣隆,宇野毅明,漆原秀子,柳浦睦憲
    • Organizer
      情報処理学会研究報告第13回バイオ情報学研究会
    • Place of Presentation
      琉球大学
    • Year and Date
      2008-06-27
  • [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

URL: 

Published: 2010-06-10   Modified: 2016-04-21  

Information User Guide FAQ News Terms of Use Attribution of KAKENHI

Powered by NII kakenhi