{"id":533,"date":"2014-12-02T00:42:37","date_gmt":"2014-12-01T22:42:37","guid":{"rendered":"https:\/\/www.cs.ubbcluj.ro\/~bufny\/?p=533"},"modified":"2022-01-10T00:33:30","modified_gmt":"2022-01-09T22:33:30","slug":"a-study-regarding-inter-domain-linked-documents-similarity-and-their-consequent-bounce-rate","status":"publish","type":"post","link":"https:\/\/www.cs.ubbcluj.ro\/~bufny\/a-study-regarding-inter-domain-linked-documents-similarity-and-their-consequent-bounce-rate\/","title":{"rendered":"A Study Regarding Inter Domain Linked Documents Similarity and their Consequent Bounce Rate"},"content":{"rendered":"

published in Studia Universitatis Babe\u015f-Bolyai, Seria Informatica, Vol. LIX, No. 1, pp. 83-91, 2014.<\/p>\n

Cite as<\/strong><\/p>\n

D. Halita, D. Bufnea, \"A Study Regarding Inter Domain Linked Documents Similarity and their Consequent Bounce Rate\", in Studia Universitatis Babe\u015f-Bolyai, Seria Informatica, Vol. LIX, No. 1, pp. 83-91, 2014<\/pre>\n
Full paper<\/strong><\/p>\n
\"\" A Study Regarding Inter Domain Linked Documents Similarity and their Consequent Bounce Rate<\/a><\/p>\n
Authors<\/strong><\/p>\n
Diana Halita, Darius Bufnea
\nDepartment of Computer Science, Faculty of Mathematics and Computer Science,
\nBabe\u015f-Bolyai University of Cluj-Napoca<\/p>\n
Abstract<\/strong><\/p>\n
Then main objective of linking inter domain documents is to offer to the reader access to supplementary, semantic related information. However, linking web domains is sometimes artificially used, especially when the goal is to abusively increase the page rank of the destination domain. This paper presents a study regarding inter domain linked documents similarity and their consequent bounce rate. For that, we have advanced a series of experiments which outlines how similarity functions’ behavior correlates with a website bounce rate. The method presented here could be used to identify within a web site improper placed outgoing links such as ads or spam links. Based on that, a search engine could fine the results in SERP by downgrading any website that fall in the above presented category.<\/p>\n
Key words<\/strong><\/p>\n
bounce rate, document similarity, page ranking, identify improper placed links<\/p>\n
BibTeX bib file<\/strong><\/p>\n
\"\" halita-bufnea-2014.bib<\/a><\/p>\n
<\/pre>\n
EndNote enw file<\/strong><\/p>\n
\"\" halita-bufnea-2014.enw<\/a><\/p>\n
References<\/strong><\/p>\n
    \n
  1. L. Becchetti, C. Castillo, D. Donato, Link-Based Characterization and Detection of Web Spam<\/em>, 2nd<\/sup> International Workshop on Adversarial Information Retrieval on the Web, AIRWeb, Seattle, USA, August 2006, pp. 1-8.<\/li>\n
  2. L. Becchetti, C. Castillo, D. Donato, S. Leonardi,R. Baeza-Yates, Link Analysis for Web Spam Detection: Link-based and Content Based Techniques<\/em>, ACM Transactions on the Web (TWEB), Volume 2, Issue 1, New York, USA, February 2008, pp. 1-41.<\/li>\n
  3. A. Farahat, M. Bailey, How Effective is Targeted Advertising?<\/em>, Proceedings of the 21st<\/sup> World Wide Web Conference 2012, Lyon, France, April 16-20, 2012, pp. 111-120.<\/li>\n
  4. Z. Gyongy, H. Garcia-Molina, P. Berkhin, J. Pedersen, Link Spam Detection Based on Mass Estimation<\/em>, 32nd<\/sup> International Conference in Very Large Data Bases (VLDB), Seoul, Korea, 2006, pp. 439-450.<\/li>\n
  5. A. Huang, Similarity Measures for Text Document Clustering<\/em>, Proceedings of the New Zealand Computer Science Research Student Conference, Hamilton, New Zealand, 2008, pp. 49-56.<\/li>\n
  6. J. Leskovec, A. Rajaraman, J. Ullman, Mining of Massive Datasets<\/em>, Cambridge University Press, 2010.<\/li>\n
  7. M. Najork, Detecting Spam Web Pages through Content Analysis<\/em>, International World Wide Web Conference Committee, Edinburgh, Scotland, 2006, pp. 83-92.<\/li>\n
  8. N. Spirin, J. Han, Survey on Web Spam Detection: Principles and Algorithms<\/em>, ACM SIGKDD Explorations Newsletter, Volume 13, Issue 2, December 2011, pp. 50-64.<\/li>\n
  9. D. Zhou, C. Burges, T. Tao, Transductive Link Spam Detection<\/em>, Proceedings of the 3rd<\/sup> International Workshop on Adversarial Information Retrieval on the Web, AIRWeb, New York, USA, ACM Press, 2007, pp. 21-28.<\/li>\n<\/ol>\n","protected":false},"excerpt":{"rendered":"
    published in Studia Universitatis Babe\u015f-Bolyai, Seria Informatica, Vol. LIX, No. 1, pp. 83-91, 2014. Cite as D. Halita, D. Bufnea, “A Study Regarding Inter Domain Linked Documents Similarity and their Consequent Bounce Rate”, in Studia Universitatis Babe\u015f-Bolyai, Seria Informatica, Vol.… Continue Reading →<\/span><\/a><\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"closed","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":[],"categories":[110],"tags":[132,133,131],"_links":{"self":[{"href":"https:\/\/www.cs.ubbcluj.ro\/~bufny\/wp-json\/wp\/v2\/posts\/533"}],"collection":[{"href":"https:\/\/www.cs.ubbcluj.ro\/~bufny\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.cs.ubbcluj.ro\/~bufny\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.cs.ubbcluj.ro\/~bufny\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/www.cs.ubbcluj.ro\/~bufny\/wp-json\/wp\/v2\/comments?post=533"}],"version-history":[{"count":13,"href":"https:\/\/www.cs.ubbcluj.ro\/~bufny\/wp-json\/wp\/v2\/posts\/533\/revisions"}],"predecessor-version":[{"id":2230,"href":"https:\/\/www.cs.ubbcluj.ro\/~bufny\/wp-json\/wp\/v2\/posts\/533\/revisions\/2230"}],"wp:attachment":[{"href":"https:\/\/www.cs.ubbcluj.ro\/~bufny\/wp-json\/wp\/v2\/media?parent=533"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.cs.ubbcluj.ro\/~bufny\/wp-json\/wp\/v2\/categories?post=533"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.cs.ubbcluj.ro\/~bufny\/wp-json\/wp\/v2\/tags?post=533"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}