Presentation	2006-07-14 Web Community Extraction Using Link Structure Koji OHTSUKA, Shinichiro OMACHI, Hirotomo ASO,
PDF Download Page	PDF download Page Link
Abstract(in Japanese)	(See Japanese page)
Abstract(in English)	A web community is a set of web pages about a common topic. HITS (Hyperlink-Induced Topic Search) algorithm is a method for extracting web communities. HITS algorithm presumes that a web community consists of bipartite link structure of authority nodes and hub nodes. However, a web community usually has more complex structure. In this paper, we propose an algorithm for extracting web communities by presuming that a web community consists of n-layer structure and by introducing medium nodes (a page to which many pages links to and from which there are many links to other pages). Experimental results show pages that are hard to be extracted by HITS algorithm can be extracted by the proposed method.
Keyword(in Japanese)	(See Japanese page)
Keyword(in English)	web community / web graph / HITS algorithm
Paper #	DE2006-104
Date of Issue

Conference Information
Committee	DE
Conference Date	2006/7/7(1days)
Place (in Japanese)	(See Japanese page)
Place (in English)
Topics (in Japanese)	(See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To	Data Engineering (DE)
Language	JPN
Title (in Japanese)	(See Japanese page)
Sub Title (in Japanese)	(See Japanese page)
Title (in English)	Web Community Extraction Using Link Structure
Sub Title (in English)
Keyword(1)	web community
Keyword(2)	web graph
Keyword(3)	HITS algorithm
1st Author's Name	Koji OHTSUKA
1st Author's Affiliation	Gradurate School of Engineering, Tohoku University()
2nd Author's Name	Shinichiro OMACHI
2nd Author's Affiliation	Gradurate School of Engineering, Tohoku University
3rd Author's Name	Hirotomo ASO
3rd Author's Affiliation	Gradurate School of Engineering, Tohoku University
Date	2006-07-14
Paper #	DE2006-104
Volume (vol)	vol.106
Number (no)	150
Page	pp.pp.-
#Pages	6
Date of Issue