Discovering cyber communities from the WWW

Author

Hu, Xiaohua ; Han, Jianchoa ; Cercone, Nick

Author_Institution

Coll. of Inf. Sci., Drexel Univ., Philadelphia, PA, USA

fYear

2003

fDate

3-6 Nov. 2003

Firstpage

590

Lastpage

594

Abstract

In this paper we present a novel method to discover cyber communities from the WWW. A cyber community is a set of highly connected web pages in the WWW, which share the similar topics or interests. The WWW can be modeled as a huge scale-free network graph. Discovering cyber communities is converted to trawling the corresponding web graph to search for approximate p-quasi complete graph. The algorithm presented in this paper considers the characteristics of the scale-free network graphs and is based on the neighborhood information of the vertex in the p-quasi complete graph in the web graph.

Keywords

Internet; Web sites; content-based retrieval; information use; online front-ends; Web graph; Web site; World Wide Web; approximate p-quasi complete graph; connected Web pages; cyber communities; cyber community; huge scale-free network graph; information sharing; interest sharing; neighborhood information; topic sharing; Clustering algorithms; Computer science; Educational institutions; Information science; Joining processes; Search engines; Web pages; Web search; Web sites; World Wide Web;

fLanguage

English

Publisher

ieee

Conference_Titel

Computer Software and Applications Conference, 2003. COMPSAC 2003. Proceedings. 27th Annual International

ISSN

0730-3157

Print_ISBN

0-7695-2020-0

Type

conf

DOI

10.1109/CMPSAC.2003.1245400

Filename

1245400