Abstract:
This thesis uses the link structure of the World Wide Web as a basis to create better search engines. It focuses on the HITS algorithm, which was the first algorithm to up the link topology. HITS is implemented with slight modifications and tested with variations of its input parameters. It is also used in order to discover emerging communities in cyberspace. Other related algorithms, which use the link structure of the web as an undirected graph are described and compared with HITS. Finally, an attempt to combine link-based with text-based analysis in order to create more accurate search methods is examined.
Description:
M.S. -- Faculty of Natural and Applied Sciences, Notre Dame University, Louaize, 2001; "A thesis submitted in partial fulfillment of the requirements for the degree of Master of Science in Computer Science, Department of Computer Science, Faculty of Natural and Applied Sciences"; Includes bibliographical references (leaf 52).