Robust Semantic Framework for web search engine
| ||International Journal of Computer Trends and Technology (IJCTT)|| |
|© - Issue 2012 by IJCTT Journal|
|Volume-3 Issue-5 |
|Year of Publication : 2012|
|Authors :V.Swamy Naidu, S.Narayana.|
V.Swamy Naidu, S.Narayana."Robust Semantic Framework for web search engine"International Journal of Computer Trends and Technology (IJCTT),V3(5):547-551 Issue 2012 .ISSN 2231-2803.www.ijcttjournal.org. Published by Seventh Sense Research Group.
Abstract: - The Semantic Web is the second-generation WWW, enriched by machine-processable information which supports the user in his tasks. Given the enormous size even of today’s Web, it is impossible to manually enrich all of these resources. Therefore, automated schemes for learning the relevant information are increasingly being used. Web Mining aims at discovering insights about the meaning of Web resources and their usage. Given the primarily syntactical nature of the data being mined, the discovery of meaning is impossible based on these data only. Therefore, formalizations of the semantics of Web sites and navigation behavior are becoming more and more common. Several search engines have been proposed, which allow increasing information retrieval accuracy by exploiting a key content of Semantic Web resources, that is, relations. However, in order to rank results, most of the existing solutions need to work on the whole annotated knowledge base. In the existing system a relation-based page rank algorithm to be used in conjunction with Semantic Web search engines that simply relies on information that could be extracted from user queries and on annotated resources. This system retrieves all matching results that are based on minimum spanning nodes and fails to represent the owl and rdf structure in graphical representation.Proposed system overcomes all the drawbacks by introducing a new framework to represent the web semantic results based on the query. This system uses OWL , logic programming in order to get effective semantic search results. This proposed system represents all the OWL structure relationships in graphical node representation.
B. Aleman-Meza, C. Halaschek, I. Arpinar, and A. Sheth, “A Context- Aware Semantic Association Ranking,” Proc. First Int’l Workshop Semantic Web and Databases (SWDB ’03), pp. 33-50, 2003.
 K. Anyanwu, A. Maduko, and A. Sheth, “SemRank: Ranking Complex Relation Search Results on the Semantic Web,” Proc. 14th Int’l Conf. World Wide Web (WWW ’05), pp. 117-127, 2005.
 R. Baeza-Yates, L. Caldero´n-Benavides, and C. Gonza´lez-Caro, “The Intention behind Web Queries,” Proc. 13th Int’l Conf. String Processing and Information Retrieval (SPIRE ’06), pp. 98-109, 2006.
 T. Berners-Lee and M. Fischetti, Weaving the Web. Harper Audio, 1999.
 Z. Gyongyi and H. Garcia-Molina, “Spam: It’s Not Just for Inboxes Anymore,” Computer, vol. 38, no. 10, pp. 28-34, Oct. 2005.
 C. Junghoo, H. Garcia-Molina, and L. Page, “Efficient Crawling through URL Ordering,” Computer Networks and ISDN Systems, vol. 30, no. 1, pp. 161-172, 1998.
KeywordsExtracting data, identifying duplication, deduplication, genetic programming.