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

2011 Fiscal Year Final Research Report

Mining Structural Changes

Research Project

  • PDF
Project/Area Number 21300047
Research Category

Grant-in-Aid for Scientific Research (B)

Allocation TypeSingle-year Grants
Section一般
Research Field Intelligent informatics
Research InstitutionHokkaido University

Principal Investigator

HARAGUCHI Makoto  北海道大学, 大学院・情報科学研究科, 教授 (40128450)

Co-Investigator(Kenkyū-buntansha) TOMITA Etsuji  電気通信大学, 名誉教授 (40016598)
OKUBO Yoshiaki  北海道大学, 大学院・情報科学研究科, 助教 (40271639)
Project Period (FY) 2009 – 2011
Keywords変化検出問題 / 情報量差分 / 制約マイニング
Research Abstract

We have targeted patterns of variables whose correlations get increased after an event, while the correlations are uncorrelated before the event. To take into account positive, negative and even partial correlations among variables, we adopt Kullback-Leibler divergence for two contexts, before and after the event, and take their difference as the measure of changes. To reduce the computational cost for set partitioning, we implemented two strategies, Double Clique Constraints and Jumping Emerging Correlation Change, and showed that the correlation change problem can be solved efficiently even for large data sets.

  • Research Products

    (26 results)

All 2012 2011 2010 2009

All Journal Article (12 results) (of which Peer Reviewed: 12 results) Presentation (13 results) Book (1 results)

  • [Journal Article] Contrasting Correlations by an Efficient Double-Clique Condition2012

    • Author(s)
      A. Li, M. Haraguchi and Y. Okubo
    • Journal Title

      Transactions on Machine Learning and Data Mining

      Volume: 5(1) Pages: 3-22

    • Peer Reviewed
  • [Journal Article] Top-N Minimization Approach for Indicative Correlation Change Mining2012

    • Author(s)
      A. Li, M. Haraguchi and Y. Okubo
    • Journal Title

      Proc. of the 8th Int'l Conf. on Machine Learning and Data Mining in Pattern Recognition-MLDM'12

    • Peer Reviewed
  • [Journal Article] Correlations by an Efficient Double-Clique Condition2011

    • Author(s)
      A. Li, M. Haraguchi and Y. Okubo
    • Journal Title

      Proc. of the 7th Int'l Conf. on Machine Learning and Data Mining in Pattern Recognition-MLDM'11

      Pages: 469-483

    • Peer Reviewed
  • [Journal Article] An Algorithm for Finding Indicative Concepts Connecting Larger Concepts Based on Structural Constraints Contributions to ICFCA 20112011

    • Author(s)
      Y. Okubo and M. Haraguchi
    • Journal Title

      The 9thInt'l Conf. on Formal Concept Analysis-ICFCA'11

      Pages: 53-68

    • Peer Reviewed
  • [Journal Article] An Algorithm for Finding Conceptual Document Clusters Based on Top-N Formal Concept Search : Pruning Mechanism and Empirical Effectiveness2011

    • Author(s)
      Y. Okubo and M. Haraguchi
    • Journal Title

      Search Algorithms and Applications

      Pages: 385-408

    • Peer Reviewed
  • [Journal Article] Biomedical Engineering, Trends in Electronics2011

    • Author(s)
      E. Tomita, T. Akutsu and T. Matsunaga
    • Journal Title

      Communications and Software Anthony N. Laskovski (ed.)

      Pages: 625-640

    • Peer Reviewed
  • [Journal Article] Pinpoint Clustering of Web Pages and Mining Implicit Crossover Concepts2010

    • Author(s)
      M. Haraguchi and Y. Okubo
    • Journal Title

      Web Intelligence and Intelligent Agents

      Pages: 391-410

    • Peer Reviewed
  • [Journal Article] Finding Rare Patterns with Weak Correlation Constraint2010

    • Author(s)
      Y. Okubo, M. Haraguchi and T. Nakajima
    • Journal Title

      Proc. of the2010 IEEE Int'l Conf. on Data MiningWorkshops-ICDMW'10

      Pages: 822-829

    • Peer Reviewed
  • [Journal Article] 最大クリーク問題の多項式時間的可解性の一結果2010

    • Author(s)
      中西裕陽, 富田悦次
    • Journal Title

      電子情報通信学会論文誌D

      Volume: J93-D Pages: 417-425

    • Peer Reviewed
  • [Journal Article] An Algorithm for Extracting Rare Concepts with Concise Intents2010

    • Author(s)
      Y. Okubo and M. Haraguchi
    • Journal Title

      Proc. of the 8th Int'l Conf. on Formal Concept Analysis-ICFCA'10

      Pages: 145-160

    • Peer Reviewed
  • [Journal Article] A Simple and Faster Branch-and-Bound Algorithm for Finding a Maximum Clique2010

    • Author(s)
      E. Tomita, Y. Sutani, T. Higashi, S.Takahashi and M. Wakatsuki
    • Journal Title

      Proc. of International Workshop on Algorithms and Computation

      Pages: 191-203

    • Peer Reviewed
  • [Journal Article] Finding Top-N Pseudo Formal Concepts with CoreIntents2009

    • Author(s)
      Y. Okubo and M. Haraguchi
    • Journal Title

      Proc. of the 6th Int'l Conf. on Machine Learning and Data Mining inPattern Recognition-MLDM'09

      Pages: 479-493

    • Peer Reviewed
  • [Presentation] クリーク全列挙に基づく構造変化検出アルゴリズム2012

    • Author(s)
      エラウィンディサラ・原口誠・大久保好章・富田悦次
    • Organizer
      情報処理学会数理モデル化と問題解決研究会
    • Place of Presentation
      指宿市民会館(鹿児島県指宿市)
    • Year and Date
      2012-03-02
  • [Presentation] 変化検出のための極大整合連結集合2011

    • Author(s)
      原口誠・大久保好章・富田悦次・吉岡真治
    • Organizer
      人工知能学会基本問題研究会
    • Place of Presentation
      慶応義塾大学(神奈川県横浜市)
    • Year and Date
      2011-12-15
  • [Presentation] モデュラリティの差異に基づくコントラスト法2011

    • Author(s)
      鶴田哲章・原口誠
    • Organizer
      人工知能学会全国大会(第25回)
    • Place of Presentation
      アイーナいわて(岩手県盛岡市)
    • Year and Date
      2011-06-02
  • [Presentation] 接続概念間の構造制約に基づくレア概念抽出2011

    • Author(s)
      大久保好章・原口誠
    • Organizer
      情報処理学会数理モデル化と問題解決研究会
    • Place of Presentation
      青島パームビーチホテル(宮崎県宮崎市)
    • Year and Date
      2011-03-07
  • [Presentation] Contrasting Correlations by an Efficient Double-Clique Search Method2010

    • Author(s)
      A. Li and M. Haraguchi
    • Organizer
      Poster Abstract of the 2nd Asian, Conf. on Machine Learning-ACML'10
    • Place of Presentation
      東京工業大学(東京都目黒区)
    • Year and Date
      2010-11-10
  • [Presentation] Contrasting Correlations Based on Double-Clique Search2010

    • Author(s)
      A. Li and M. Haraguchi
    • Organizer
      第9回情報科学技術フォーラム(FIT2010)
    • Place of Presentation
      九州大学(福岡県福岡市)
    • Year and Date
      2010-09-07
  • [Presentation] PLENARY LECTURE, The Maximum Clique Problem (招待講演)2010

    • Author(s)
      E. Tomita
    • Organizer
      The 14th WSEAS International Conference on Computers
    • Place of Presentation
      Corfu Island, Greece
    • Year and Date
      2010-07-23
  • [Presentation] 萌芽的概念抽出のための局所分枝限定探索を用いた概念プール掘削法2010

    • Author(s)
      中島健志・原口誠・大久保好章
    • Organizer
      人工知能学会全国大会(第24回)
    • Place of Presentation
      長崎ブリックホール(長崎県長崎市)
    • Year and Date
      2010-06-09
  • [Presentation] Extracting Approximate Biclusters/Patterns from Time Series Medical Data Using Suffix Trees2010

    • Author(s)
      S. Muwazi Simona and M. Haraguchi
    • Organizer
      人工知能学会全国大会(第24回)
    • Place of Presentation
      長崎ブリックホール(長崎県長崎市)
    • Year and Date
      2010-06-09
  • [Presentation] 局所分枝限定探索による概念プール更新操作に基づく萌芽的概念のボトムアップ抽出2010

    • Author(s)
      中島健志・原口誠・大久保好章
    • Organizer
      情報処理学会数理モデル化と問題解決研究会
    • Place of Presentation
      群馬大学(群馬県前橋市)
    • Year and Date
      2010-05-21
  • [Presentation] A Simple and Faster Algorithm for Finding a Maximum Clique2010

    • Author(s)
      E. Tomita, Y. Sutani, T. Higashi, S.Takahashi, M. Wakatsuki
    • Organizer
      情報処理学会研究報告アルゴリズム研究会
    • Place of Presentation
      九州大学(福岡県福岡市)
    • Year and Date
      2010-01-26
  • [Presentation] 萌芽的閉包を枚挙する分枝限定法について2009

    • Author(s)
      中島健志・原口誠・大久保好章
    • Organizer
      情報処理学会数理モデル化と問題解決研究会
    • Place of Presentation
      電気通信大学(東京都調布市)
    • Year and Date
      2009-12-17
  • [Presentation] 相関コントラストの最適化2009

    • Author(s)
      李愛香・原口誠・大久保好章
    • Organizer
      人工知能学会全国大会(第23回)
    • Place of Presentation
      サンポートホール高松(香川県高松市)
    • Year and Date
      2009-06-19
  • [Book] 現代数理科学辞典第2版2009

    • Author(s)
      富田悦次(広中平祐編,分担執筆)
    • Total Pages
      1450

URL: 

Published: 2013-07-31  

Information User Guide FAQ News Terms of Use Attribution of KAKENHI

Powered by NII kakenhi