An improved algorithm for extracting research communities from bibliographic data

Authors:
Yushi Nakamura;Toshihiko Horiike;Yoshimasa Taira;Hiroshi Sakamoto
Affiliations:
Kyushu Institute of Technology, Iizuka-shi, Fukuoka, Japan;Kyushu Institute of Technology, Iizuka-shi, Fukuoka, Japan;Kyushu Institute of Technology, Iizuka-shi, Fukuoka, Japan;Kyushu Institute of Technology, Iizuka-shi, Fukuoka, Japan and PRESTO, JST, Kawaguchi-shi, Saitama, Japan
Venue:
DASFAA'10 Proceedings of the 15th international conference on Database systems for advanced applications
Year:
2010

Citing 15
Cited 1

A new approach to the maximum flow problem

STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Inferring Web communities from link topology

Proceedings of the ninth ACM conference on Hypertext and hypermedia : links, objects, time and space---structure in hypermedia systems: links, objects, time and space---structure in hypermedia systems
Automatic resource compilation by analyzing hyperlink structure and associated text

WWW7 Proceedings of the seventh international conference on World Wide Web 7
Finding related pages in the World Wide Web

WWW '99 Proceedings of the eighth international conference on World Wide Web
Trawling the Web for emerging cyber-communities

WWW '99 Proceedings of the eighth international conference on World Wide Web
Authoritative sources in a hyperlinked environment

Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems

Journal of the ACM (JACM)
Efficient identification of Web communities

Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining
Creating a Web community chart for navigating related communities

Proceedings of the 12th ACM conference on Hypertext and Hypermedia
Effects of maximum flow algorithm on identifying web community

Proceedings of the 4th international workshop on Web information and data management
Self-Organization and Identification of Web Communities

Computer
Extracting Large-Scale Knowledge Bases from the Web

VLDB '99 Proceedings of the 25th International Conference on Very Large Data Bases
Finding a Web Community by Maximum Flow Algorithm with HITS Score Based Capacity

DASFAA '03 Proceedings of the Eighth International Conference on Database Systems for Advanced Applications
Mining Communities on the Web Using a Max-Flow and a Site-Oriented Framework

IEICE - Transactions on Information and Systems
Extracting Research Communities by Improved Maximum Flow Algorithm

KES '09 Proceedings of the 13th International Conference on Knowledge-Based and Intelligent Information and Engineering Systems: Part II

Extracting research communities from bibliographic data

International Journal of Knowledge-based and Intelligent Engineering Systems - Intelligent Information Processing: Techniques and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we improve the performance of the community extraction algorithm in [1] from bibliographic data, which was originally proposed for web community discovery by [2]. A web community is considered to be a set of web pages holding a common topic, in other words, it is a dense subgraph induced in web graph. Such subgraphs obtained by the max-flow algorithm are called max-flow communities, and this algorithm was improved to obtain research communities from bibliographic data by the strategy for selection of community nodes in [1]. We propose an improvement of this algorithm by carefully selecting initial seed node, and show the performance of this algorithm by experiments for the list of many keywords frequently appearing in data.