• DocumentCode
    2732065
  • Title

    A Extraction Method of Overlapping Cluster Based on Network Structure Analysis

  • Author

    Takaki, Makoto ; Tamura, Keiichi ; Mori, Yasuma ; Kitakami, Hajime

  • Author_Institution
    Hiroshima City Univ., Hiroshima
  • fYear
    2007
  • fDate
    5-12 Nov. 2007
  • Firstpage
    212
  • Lastpage
    216
  • Abstract
    In this paper, we propose a method of overlapping clustering based on network structure analysis that improves the crisp clustering algorithm proposed by Newman et al. In the proposed technique, we cluster the nodes using Newman´s algorithm. We then make a contraction graph in which a cluster is considered as a node. In addition, we cluster the created contraction graph using Newman´s clustering algorithm again and identify the overlapping nodes. Overlapping clustering is more flexible than crisp clustering. The experimental results using the real network data and trackback data represented the efficacy of the proposed technique.
  • Keywords
    graph theory; network theory (graphs); pattern clustering; Newman algorithm; contraction graph; crisp clustering; extraction method; network data; network structure analysis; overlapping cluster; overlapping nodes; trackback data; Conferences; Intelligent agent; clusteringoverlap;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Web Intelligence and Intelligent Agent Technology Workshops, 2007 IEEE/WIC/ACM International Conferences on
  • Conference_Location
    Silicon Valley, CA
  • Print_ISBN
    0-7695-3028-1
  • Type

    conf

  • DOI
    10.1109/WI-IATW.2007.37
  • Filename
    4427574