Identifying the subject of small, sparsely linked collections from a web community

Authors:
Deepak P.;Jyothi John
Affiliations:
Model Engineering College, Kochi, Kerala, India.;Model Engineering College, Kochi, Kerala, India
Venue:
International Journal of Web Based Communities
Year:
2004

Citing 4
Cited 0

Inferring Web communities from link topology

Proceedings of the ninth ACM conference on Hypertext and hypermedia : links, objects, time and space---structure in hypermedia systems: links, objects, time and space---structure in hypermedia systems
Authoritative sources in a hyperlinked environment

Journal of the ACM (JACM)
An Approach to Relate the Web Communities through Bipartite Graphs

WISE '01 Proceedings of the Second International Conference on Web Information Systems Engineering (WISE'01) Volume 1 - Volume 1
The web as a graph: measurements, models, and methods

COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics

Quantified Score

Hi-index	0.00

Visualization

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.