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
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
An improved algorithm for extracting research communities from bibliographic data
DASFAA'10 Proceedings of the 15th international conference on Database systems for advanced applications
Extracting research communities from bibliographic data
International Journal of Knowledge-based and Intelligent Engineering Systems - Intelligent Information Processing: Techniques and Applications
Hi-index | 0.00 |
In this paper we propose an algorithm, which is an improvement of identification of web communities by [1], to extract research communities from bibliography data. Web graph is huge graph structure consisting nodes and edges, which represent web pages and hyperlinks. An web community is considered to be a set of web pages holding a common topic, in other words, it is a dense subgraph of web graph. Such subgraphs obtained by the max-flow algorithm [1] are called max-flow communities . We then improve this algorithm by introducing the strategy for selection of community nodes. The effectiveness of our improvement is shown by experiments on finding research communities from CiteSeer bibliography data.