An exhaustive and edge-removal algorithm to find cores in implicit communities

  • Authors:

  • Nan Yang;Songxiang Lin;Qiang Gao

  • Affiliations:

  • The School of Information, Renmin University of China, Beijing, China;The School of Information, Renmin University of China, Beijing, China;The School of Information, Renmin University of China, Beijing, China

  • Venue:
  • APWeb/WAIM'07 Proceedings of the joint 9th Asia-Pacific web and 8th international conference on web-age information management conference on Advances in data and web management
  • Year:
  • 2007

Quantified Score

Hi-index 0.01

Visualization

Abstract

Web community is intensely studied in web resource discovery. Many literatures use core as the signature of a community. A core is a complete bipartite graphs, denoted as Ci, j. But discovery of all possible Ci, j in the web is a challenging job. This work has been investigated by trawling [1][2]. Trawling employs repeated elimination/generation procedure until the graph is pruned to a satisfied state and then enumerate all possible Ci, j. We proposed a new method that uses exhaustive and edge removal method. Our algorithm avoids scanning dataset many times. Also, we improve crawling method by only recording potential fans to save disk space. The experiment result show that the new algorithm works properly and many new Ci, j can be found by our method.