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

Developing the Foundation of Optimization Methods for Community Detection in Networks

Research Project

Project/Area Number 17H07357
Research Category

Grant-in-Aid for Research Activity Start-up

Allocation TypeSingle-year Grants
Research Field Mathematical informatics
Research InstitutionInstitute of Physical and Chemical Research

Principal Investigator

Miyauchi Atsushi  国立研究開発法人理化学研究所, 革新知能統合研究センター, 特別研究員 (80804202)

Project Period (FY) 2017-08-25 – 2019-03-31
Project Status Completed (Fiscal Year 2018)
Budget Amount *help
¥2,990,000 (Direct Cost: ¥2,300,000、Indirect Cost: ¥690,000)
Fiscal Year 2018: ¥1,560,000 (Direct Cost: ¥1,200,000、Indirect Cost: ¥360,000)
Fiscal Year 2017: ¥1,430,000 (Direct Cost: ¥1,100,000、Indirect Cost: ¥330,000)
Keywords複雑ネットワーク / コミュニティ検出 / モデル化 / アルゴリズム設計 / 数理最適化
Outline of Final Research Achievements

Community detection is a fundamental primitive in network analysis, which has a wide variety of applications in diverse domains. In this research project, we have developed the foundation of optimization methods for community detection. Specifically, we provided several frameworks for the modeling and the design of algorithms for community detection, enabling us to detect community structure with higher accuracy compared with existing methods.

Academic Significance and Societal Importance of the Research Achievements

ネットワーク上のコミュニティ検出は,ネットワーク科学の分野で最も活発に研究されているトピックの一つである.学術的に重要なだけでなく,実社会での様々な応用が知られている.たとえば,ウェブグラフ上でコミュニティ検出を行うと,類似トピックを扱うウェブページの集合や,スパムリンクファームと呼ばれる不正リンクを多量にもつウェブページの集合を検出することができ,検索エンジンの精度向上に貢献することができる.

Report

(3 results)
  • 2018 Annual Research Report   Final Research Report ( PDF )
  • 2017 Annual Research Report
  • Research Products

    (16 results)

All 2019 2018 2017 Other

All Int'l Joint Research (2 results) Journal Article (4 results) (of which Peer Reviewed: 4 results,  Open Access: 1 results) Presentation (10 results) (of which Int'l Joint Research: 5 results,  Invited: 4 results)

  • [Int'l Joint Research] ISI Foundation(イタリア)

    • Related Report
      2018 Annual Research Report
  • [Int'l Joint Research] メルボルン大学(オーストラリア)

    • Related Report
      2017 Annual Research Report
  • [Journal Article] Finding a Dense Subgraph with Sparse Cut2018

    • Author(s)
      Atsushi Miyauchi and Naonori Kakimura
    • Journal Title

      Proceedings of the 27th ACM International Conference on Information and Knowledge Management (CIKM 2018)

      Volume: - Pages: 547-556

    • DOI

      10.1145/3269206.3271720

    • Related Report
      2018 Annual Research Report
    • Peer Reviewed
  • [Journal Article] Robust densest subgraph discovery2018

    • Author(s)
      Atsushi Miyauchi and Akiko Takeda
    • Journal Title

      Proceedings of the 18th IEEE International Conference on Data Mining (ICDM 2018)

      Volume: -

    • DOI

      10.1109/icdm.2018.00157

    • Related Report
      2018 Annual Research Report
    • Peer Reviewed
  • [Journal Article] Exact clustering via integer programming and maximum satisfiability2018

    • Author(s)
      Atsushi Miyauchi, Tomohiro Sonobe, and Noriyoshi Sukegawa
    • Journal Title

      Proceedings of the 32nd AAAI Conference on Artificial Intelligence (AAAI 2018)

      Volume: -

    • Related Report
      2017 Annual Research Report
    • Peer Reviewed / Open Access
  • [Journal Article] The densest subgraph problem with a convex/concave size function2017

    • Author(s)
      Yasushi Kawase and Atsushi Miyauchi
    • Journal Title

      Algorithmica

      Volume: 印刷中 Issue: 12 Pages: 3461-3480

    • DOI

      10.1007/s00453-017-0400-7

    • Related Report
      2017 Annual Research Report
    • Peer Reviewed
  • [Presentation] ロバスト最密部分グラフ抽出2019

    • Author(s)
      宮内 敦史,武田 朗子
    • Organizer
      日本オペレーションズ・リサーチ学会 2019 年春季研究発表会
    • Related Report
      2018 Annual Research Report
  • [Presentation] サイズ関数を一般化した最密部分グラフ問題2019

    • Author(s)
      河瀬 康志,宮内 敦史
    • Organizer
      電子情報通信学会 2019 年総合大会 COMP 学生シンポジウム
    • Related Report
      2018 Annual Research Report
    • Invited
  • [Presentation] Exact clustering via integer programming and maximum satisfiability2018

    • Author(s)
      宮内 敦史,薗部 知大,鮏川 矩義
    • Organizer
      第 17 回情報科学技術フォーラム (FIT 2018)
    • Related Report
      2018 Annual Research Report
  • [Presentation] Finding a dense subgraph with sparse cut2018

    • Author(s)
      Atsushi Miyauchi and Naonori Kakimura
    • Organizer
      The 27th ACM International Conference on Information and Knowledge Management (CIKM 2018)
    • Related Report
      2018 Annual Research Report
    • Int'l Joint Research
  • [Presentation] Very recent developments in dense subgraph discovery2018

    • Author(s)
      Atsushi Miyauchi
    • Organizer
      Seminar at Algorithmic Data Analytics Group, ISI Foundation
    • Related Report
      2018 Annual Research Report
    • Int'l Joint Research / Invited
  • [Presentation] Robust densest subgraph discovery2018

    • Author(s)
      Atsushi Miyauchi and Akiko Takeda
    • Organizer
      The 18th IEEE International Conference on Data Mining (ICDM 2018)
    • Related Report
      2018 Annual Research Report
    • Int'l Joint Research
  • [Presentation] Robust densest subgraph discovery2018

    • Author(s)
      宮内 敦史,武田 朗子
    • Organizer
      情報系 Winter Festa Episode 4
    • Related Report
      2018 Annual Research Report
  • [Presentation] Exact clustering via integer programming and maximum satisfiability2018

    • Author(s)
      Atsushi Miyauchi, Tomohiro Sonobe, and Noriyoshi Sukegawa
    • Organizer
      The 32nd AAAI Conference on Artificial Intelligence (AAAI 2018)
    • Related Report
      2017 Annual Research Report
    • Int'l Joint Research
  • [Presentation] Graph clustering with theoretical performance guarantees: Mathematical programming approaches2018

    • Author(s)
      Atsushi Miyauchi
    • Organizer
      Seminar at the Department of Computer Science, School of Engineering, Virginia Commonwealth University
    • Related Report
      2017 Annual Research Report
    • Int'l Joint Research / Invited
  • [Presentation] ネットワーク科学における数理最適化:モデル化とアルゴリズム設計2017

    • Author(s)
      宮内 敦史
    • Organizer
      ネットワーク科学セミナー 2017
    • Related Report
      2017 Annual Research Report
    • Invited

URL: 

Published: 2017-08-25   Modified: 2020-03-30  

Information User Guide FAQ News Terms of Use Attribution of KAKENHI

Powered by NII kakenhi