Identifying the subject of small, sparsely linked collections from a web community
by Deepak P., Jyothi John
International Journal of Web Based Communities (IJWBC), Vol. 1, No. 1, 2004

Abstract: This work deals with the problem of identifying the subject of small, sparsely linked collections of web documents from a web community. In the course of attempts to find solutions for many problems concerning the web, we are often left with a handful of pages dealing with something in common, but with very few links within them. This paper presents algorithms which work on such collections and output a set of words ordered in the decreasing order of relevance. The most relevant words provide a close approximation of the topic that the collection deals with.

Online publication date: Wed, 07-Jul-2004

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Web Based Communities (IJWBC):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com