A Extraction Method of Overlapping Cluster Based on Network Structure Analysis
Takaki, M.; Tamura, K.; Mori, Y.; Kitakami, H.
Web Intelligence and Intelligent Agent Technology Workshops, 2007 IEEE/WIC/ACM International Conferences on
Volume , Issue , 5-12 Nov. 2007 Page(s):212 - 216
Digital Object Identifier   10.1109/WI-IATW.2007.37
Summary: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.

» View citation and abstract

Log in by entering your IEEE Web Account Username and Password.

IEEE Communications Society members: If you subscribe to the IEEE Electronic Periodicals Package or IEEE Electronic Periodicals Package Plus, you must access your subscription at www.comsoc.org.

Check with your librarian, information professional, or system manager to determine if you need to log in. Please complete the online Technical Support Form if you need assistance.

Select the Purchase History link to access the document. You will have 5 Days after purchase to access the Full Text PDF. Please complete the online Technical Support Form if you need assistance.

• Search and access Abstract records free of charge
• Register for table of contents alerts
• Purchase Full Text PDF documents

» Learn more about subscription options or how to become an IEEE Member.