ACM Home Page
Please provide us with feedback. Feedback
Creating a Web community chart for navigating related communities
Full text PdfPdf (277 KB)
Source Conference on Hypertext and Hypermedia archive
Proceedings of the 12th ACM conference on Hypertext and Hypermedia table of contents
Århus, none, Denmark
Session: 3a---Tools for Organization table of contents
Pages: 103 - 112  
Year of Publication: 2001
ISBN:1-59113-420-7
Authors
Masashi Toyoda  Institute of Industrial Science, University of Tokyo, 4-6-1 Komaba Meguro-ku, Tokyo, JAPAN
Masaru Kitsuregawa  Institute of Industrial Science, University of Tokyo, 4-6-1 Komaba Meguro-ku, Tokyo, JAPAN
Sponsors
SIGWEB: ACM Special Interest Group on Hypertext, Hypermedia, and Web
AIAS : Alexandra Instituttet A/S
HYPE : Hypergenic
CCTAS : Costas Computer Technology A/S
JDI : Journal of Digital Information
SA : Scandinavian Airlines
UAARHUS : University of Aarhus
DANSKEB : Danske Bank
TT : Tool-tribe
ARHUSK : Arhus Kommune
ARHUSA : Arhus Amt
WMD : WM-Data
KSI : Knowledge Systems Inc.
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 12,   Downloads (12 Months): 56,   Citation Count: 12
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/504216.504244
What is a DOI?

ABSTRACT

Recent research on link analysis has shown the existence of numerous web communities on the Web. A web community is a collection of web pages created by individuals or any kind of associations that have a common interest on a specific topic. In this paper, we propose a technique to create a web community chart, that connects related web communities, from thousands of seed pages. This allows the user to navigate through related web communities, and can be used for a `What's Related Community' service that provides not only the web community including a given page but also related web communities. Our technique is based on a related page algorithm that gives related pages to a given page using only link analysis. We show that the algorithm can be used for creating the chart by applying the algorithm to each seed, then using similarities of the results to classify seeds into clusters and to deduce their relationships. We perform experiments to create a web community chart of companies and organizations from thousands of seed pages. First, we improve the precision of an existing related page algorithm, Companion, and evaluated the improved version, Companion-, by an user study. Then the chart is created using Companion-. The result chart consists of web communities including related pages, and paths between related web communities. From the chart, we can find many web communities of companies classified by their category of business, and relationships between the communities.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
2
 
3
 
4
 
5
 
6
7
8
 
9
 
10
11
 
12

CITED BY  12

Collaborative Colleagues:
Masashi Toyoda: colleagues
Masaru Kitsuregawa: colleagues