Abstract
This paper deals with the problem of identifying the of small sparsely linked collections of Web documents (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 descriptive words, descriptive of the collection, ordered in the decreasing order of relevance. The set of most relevant words, which can be aptly called the subject set, provides a close approximation of the topic that the collection deals with. The set of the first few results from a Web search could be used to further refine Web search. It could greatly simplify the Web search process by indexing web communities. It could well be used for parental monitoring systems, where the set of the collection of pages browsed by the child could point out intentions of the Web usage by the child.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
