Finding a Web community by maximum flow algorithm with HITS score based capacity

Proceedings - 8th International Conference on Database Systems for Advanced Applications, DASFAA 2003

Volumn , Issue , 2003, Pages 101-106

  Imafuji, N ^a   Kitsuregawa, M ^a  

^a INSTITUTE OF INDUSTRIAL SCIENCE   (Japan)

Author keywords

Bipartite graph; Database systems; Performance evaluation; Web pages

Indexed keywords

ALGORITHMS; DATABASE SYSTEMS; WEBSITES;

BIPARTITE GRAPHS; EDGE CAPACITY; MAXIMUM-FLOW ALGORITHM; PERFORMANCE EVALUATION; TOPIC DRIFT; WEB ARCHIVES; WEB COMMUNITY; WELL BALANCED;

WORLD WIDE WEB;

EID: 33645599280     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/DASFAA.2003.1192373     Document Type: Conference Paper

References (15)

1. R. K. Ahuja, T. L. Magnanti, and J. B. Orlin. Network flows: Theory, algorithms, and applications. Algorithms, and Applications, 1993.
2. A. Borodin, G. O. Roberts, J. S. Rosenthal, and P. Tsaparas. Finding authorities and hubs from link structures on the world wide web. In Proceedings of the 10th International World Wide Web Conference, pages 415-429, 2001.
3. S. Chakrabarti, B. Dom, D. Gibson, J. Kleinberg, P. Raghavan, and S. Rajagopalan. Automatic resource list compilation by analyzing hyperlink structure and associated text. In Proceedings of the 7th International World Wide Web Conference, 1998.
4. J. Dean and M. R. Henzinger. Finding related pages in the World Wide Web. In Proceedings of the 8th International World Wide Web Conference, pages 1467-1479, 1999.
5. J. Edmonds and R. Karp. Theoretical improvements in algorithmic efficiency for network flow problems. Journal of the ACM, 19(2):248-264, 1972.
6. G. Flake, S. Lawrence, and C. L. Giles. Efficient identification of web communities. In 6th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pages 150-160, 2000.
7. G. W. Flake, S. Lawrence, C. L. Giles, and F. Coetzee. Self-organization of the web and identification of communities. IEEE Computer, 35(3):66-71, 2002.
8. D. Gibson, J. M. Kleinberg, and P. Raghavan. Inferring web communities from link topology. In UK Conference on Hypertext, pages 225-234, 1998.
9. A. V. Goldberg and R. E. Tarjan. A new approach to the maximal flow problem. Journal of the ACM, 35(4):921-940, 1988.
10. N. Imafuji and M. Kitsuregawa. Effects of maximum flow algorithm on identifying web community. In 4th International Workshop on Web Information and Data Management, pages 43-48, 2002.
11. L. Jr. and D. R. Fulkerson. Maximal flow through a network. Canadian Journal of Mathematics, 8:399-404, 1956.
12. J. M. Kleinberg. Authoritative sources in a hyperlinked environment. Journal of the ACM, 46(5):604-632, 1999.
13. R. Kumar, P. Raghavan, S. Rajagopalan, and A. Tomkins. Trawling the Web for emerging cyber-communities. In Proceedings of the 8th International World Wide Web Conference, pages 1481-1493, 1999.
14. S. R. Kumar, P. Raghavan, S. Rajagopalan, and A. Tomkins. Extracting large-scale knowledge bases from the web. In The VLDB Journal, pages 639-650, 1999.
15. M. Toyoda and M. Kitsuregawa. Creating a web community chart for navigating related communities. In 12th ACM Hypertext, pages 103-112, 2001.