Abstract
The World Wide Web (WWW) is the repository of large number of web pages which can be accessed via Internet by multiple users at the same time and therefore it is Ubiquitous in nature. The search engine is a key application used to search the web pages from this huge repository, which uses the link analysis for ranking the web pages without considering the facts provided by them. A new application called Probability of Correctness of Facts(PCF)-Engine is proposed to find the accuracy of the facts provided by the web pages. It uses the Probability based similarity (SIM) function which performs the string matching between the true facts and the facts of web pages to find their probability of correctness. The existing semantic search engines, may give the relevant result to the user query but may not be 100% accurate. Our algorithm probes for the accuracy among the facts to rank the web pages. Simulation results show that our approach is efficient when compared with existing Voting [1] and Truthfinder [1] algorithms with respect to the trustworthiness of the websites.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Xiaoxin, Y., Jiawei, H., Philip, S.Y.: Truth Discovery with Multiple Conflicting Information Providers on the Web. Journal of IEEE Transactions on TKDE 20(6), 796–808 (2008)
Johns Hopkins University, http://www.library.jhu.edu/researchhelp/general/evaluating/
Brin, S., Page, L.: The Anatomy of a Large-Scale Hypertextual Web Search Engine. Journal of Computer Networks 30(7), 107–117 (1998)
Kleinberg, J.M.: Authoratative Sources in a Hyperlinked Environment. Journal of ACM 46(5), 604–632 (1999)
Xing, W., AliGhorbani: Weighted PageRank Algorithm. In: 2nd Annual Conference on Communication Networks and Services Research, pp. 305–314. IEEE Press, Los Alamitos (2004)
Heasoo, H., Andrey, B., Berthold, R., Erik, N.: BinRank: Scaling Dynamic Authority-Based Search using Materialized Subgraph. Journal of IEEE Transactions on TKDE 22(8), 1176–1190 (2010)
Amit, P., Chakrabarti, S., Manish, G.: Index Design for Dynamic Personalized PageRank. In: IEEE 24th International Conference on Data Engineering, pp. 1489–1491. IEEE Press, Los Alamitos (2008)
Sweah, L.Y., Markus, H., Ah Chung, T.: Ranking Web Pages using Machine learning Approaches. In: IEEE International Conference on Web Inteligence and Intelligent Agent Technology, pp. 677–680. IEEE Press, Los Alamitos (2008)
Matthew, H., Julie, S., Chaoyang, Z.: A Scalable Parallel HITS Algorithm for Page Ranking. In: First International Multi-Symposiums on Computer and Computational Sciences (IMSCCS 2006), pp. 437–442. IEEE Press, Los Alamitos (2006)
Allan, B., Gareth, O.R., Jeffrey, S.R., Panayiotis, T.: Link Analysis Ranking Algorithms, Theory and Experiments. Journal of ACM Transactions on Internet Technology 5(1), 231–297 (2005)
Brian, A., Loren, T., Hill, W.: Does Authority Mean Quality? Predicting Expert Ratings of Web Documents. In: ACM SIGIR 2000, pp. 296–303 (July 2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
K.C., S. et al. (2011). PCF-Engine: A Fact Based Search Engine. In: Venugopal, K.R., Patnaik, L.M. (eds) Computer Networks and Intelligent Computing. ICIP 2011. Communications in Computer and Information Science, vol 157. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22786-8_14
Download citation
DOI: https://doi.org/10.1007/978-3-642-22786-8_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-22785-1
Online ISBN: 978-3-642-22786-8
eBook Packages: Computer ScienceComputer Science (R0)