Finding Web Communities by Maximum Flow Algorithm Using Well-Assigned Edge Capacities

IEICE Transactions on Information and Systems

Volumn E87-D, Issue 2, 2004, Pages 407-415

  Imafuji, Noriko ^a   Kitsuregawa, Masaru ^a  

^a INSTITUTE OF INDUSTRIAL SCIENCE   (Japan)

Author keywords

HITS; Maximum flow algorithm; Web community; Web graph

Indexed keywords

ALGORITHMS; DATA FLOW ANALYSIS; GRAPH THEORY; INFORMATION ANALYSIS; WEBSITES;

HITS; HYPERLINKS; MAXIMUM FLOW ALGORITHM; WEB COMMUNITY; WEB GRAPHS;

ELECTRONIC COMMUNITIES;

EID: 1442339468     PISSN: 09168532     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (18)

1. R.K. Ahuja, T.L. Magnanti, and J.B. Orlin, "Network flows: Theory, algorithms, and applications," in Algorithms, and Applications, Prentice Hall, Englewood eliffs, NJ, 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," Proc. 10th International World Wide Web Conference, pp.415-429, 2001.
3. A. Broder, R. Kumar, F. Maghoul, P. Raghavan, S. Rajagopalan, R. Stata, A. Tomkins, and J. Wiener, "Graph structure in the web: Experiments and models," Proc. 7th International World Wide Web Conference, pp.309-320, 2000.
4. S. Chakrabarti, B. Dom, D. Gibson, J. Kleinberg, P. Raghavan, and S. Rajagopalan, "Automatic resource list compilation by analyzing hyperlink structure and associated text," Proc. 7th International World Wide Web Conference, pp.65-74, 1998.
5. J. Dean and M.R. Henzinger, "Finding related pages in the World Wide Web," Proc. 8th International World Wide Web Conference, pp.1467-1479, 1999.
6. J. Edmonds and R. Karp, "Theoretical improvements in algorithmic efficiency for network flow problems," J. ACM, vol.19, no.2, pp.248-264, 1972.
7. G. Flake, S. Lawrence, and C.L. Giles, "Efficient identification of web communities," 6th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 150-160, 2000.
8. G.W. Flake, S. Lawrence, C.L. Giles, and F. Coetzee, "Self-organization of the web and identification of communities," Computer, vol.35, no.3, pp.66-71, 2002.
9. D. Gibson, J.M. Kleinberg, and P. Raghavan, "Inferring web communities from link topology," UK Conference on Hypertext, pp.225-234, 1998.
10. A.V. Goldberg and R.E. Tarjan, "A new approach to the maximal flow problem," J. ACM, vol.35, no.4, pp.921-940, 1988.
11. N. Imafuji and M. Kitsuregawa, "Effects of maximum flow algorithm on identifying web community," 4th International Workshop on Web Information and Data Management, pp.43-48, 2002.
12. N. Imafuji and M. Kitsuregawa, "Finding a web community by maximum flow algorithm with hits score based capacity," 8th International Conference on Database Systems for Advanced Applications, pp.101-106, 2003.
13. L.R. Ford and D.R. Fulkerson, "Maximal flow through a network, " Can. J. Math., vol.8, pp.399-404, 1956.
14. J.M. Kleinberg, "Authoritative sources in a hyperlinked environment," J. ACM, vol.46, no.5, pp.604-632, 1999.
15. R. Kumar, P. Raghavan, S. Rajagopalan, and A. Tomkins, "Trawling the web for emerging cyber-communities," Proc. 8th International World Wide Web Conference, pp.1481-1493, 1999.
16. S.R. Kumar, P. Raghavan, S. Rajagopalan, and A. Tomkins, "Extracting large-scale knowledge bases from the web," VLDB J., pp.639-650, 1999.
17. L. Page, S. Brin, R. Motwani, and T. Winograd, "The PageRank citation ranking: Bringing order to the web," Stanford Digital Libraries Working Paper, 1998.
18. M. Toyoda and M. Kitsuregawa, "Creating a web community chart for navigating related communities," 12th ACM Hypertext, pp. 103-112, 2001.