{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:25:33Z","timestamp":1750307133322,"version":"3.41.0"},"reference-count":25,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2011,10,1]],"date-time":"2011-10-01T00:00:00Z","timestamp":1317427200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000144","name":"Division of Computer and Network Systems","doi-asserted-by":"publisher","award":["CNS 0943382IIS 1036918"],"award-info":[{"award-number":["CNS 0943382IIS 1036918"]}],"id":[{"id":"10.13039\/100000144","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000145","name":"Division of Information and Intelligent Systems","doi-asserted-by":"publisher","award":["CNS 0943382IIS 1036918"],"award-info":[{"award-number":["CNS 0943382IIS 1036918"]}],"id":[{"id":"10.13039\/100000145","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["SIGCAS Comput. Soc."],"published-print":{"date-parts":[[2011,10]]},"abstract":"<jats:p>The best way to protect information is never to release it. Yet even the earliest definition of security recognizes availability as a necessary quality. In this work, we seek to quantify the value of information disclosure for web resource evaluation and discovery. Communal evaluation tools help users share ratings on websites, music, and other online resources. This approach assumes that experiences are self-similar, so that a site one person visits is likely to have been evaluated and thus visited by others. Collaborative search tools aim for discovery as opposed to evaluation. Therefore, they assume participants in a collaborative network have large sets of non-overlapping sites so that an increase in network size corresponds to an increase in web coverage. We quantify the value of information sharing for these closely related but sometimes distinct functions.<\/jats:p>\n          <jats:p>In this paper, we analyzed a dataset that includes eight weeks of browsing history of 1084 college students that live in the same dormitory. Our experiments showed that for discovery, more sharing monotonically improves results; for evaluation, however, there are decreasing marginal returns for each participant added to the network. The subject population was selected for its homogeneity in order to mimic a collaborative network.<\/jats:p>","DOI":"10.1145\/2095266.2095269","type":"journal-article","created":{"date-parts":[[2012,1,17]],"date-time":"2012-01-17T17:21:44Z","timestamp":1326820904000},"page":"23-37","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["The decreasing marginal value of evaluation network size"],"prefix":"10.1145","volume":"41","author":[{"given":"Zheng","family":"Dong","sequence":"first","affiliation":[{"name":"Indiana University, Bloomington, IN"}]},{"given":"L. Jean","family":"Camp","sequence":"additional","affiliation":[{"name":"Indiana University, Bloomington, IN"}]}],"member":"320","published-online":{"date-parts":[[2011,10]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1242572.1242685"},{"volume-title":"Global Phishing Survey 2H2010 Trends and Domain Name Use, viewed","year":"2011","key":"e_1_2_1_2_1","unstructured":"APWG 2010 , Global Phishing Survey 2H2010 Trends and Domain Name Use, viewed 31 May 2011 , &lt; HYPERLINK \"http:\/\/www.antiphishing.org\/reports\/APWG_GlobalPhishingSurvey_2H2010.pdf\" http:\/\/www.antiphishing.org\/reports\/APWG_GlobalPhishingSurvey_2H2010.pdf&gt;. APWG 2010, Global Phishing Survey 2H2010 Trends and Domain Name Use, viewed 31 May 2011, &lt; HYPERLINK \"http:\/\/www.antiphishing.org\/reports\/APWG_GlobalPhishingSurvey_2H2010.pdf\" http:\/\/www.antiphishing.org\/reports\/APWG_GlobalPhishingSurvey_2H2010.pdf&gt;."},{"key":"e_1_2_1_3_1","volume-title":"M 2006, AOL Proudly Releases Massive Amounts of Private Data, viewed","author":"Arrington","year":"2011","unstructured":"Arrington , M 2006, AOL Proudly Releases Massive Amounts of Private Data, viewed 31 May 2011 , &lt; HYPERLINK \"http:\/\/techcrunch.com\/2006\/08\/06\/aol-proudly-releases-massive-amounts-of-user-search-data\/\" http:\/\/techcrunch.com\/2006\/08\/06\/aol-proudly-releases-massive-amounts-of-user-search-data\/>. Arrington, M 2006, AOL Proudly Releases Massive Amounts of Private Data, viewed 31 May 2011, &lt; HYPERLINK \"http:\/\/techcrunch.com\/2006\/08\/06\/aol-proudly-releases-massive-amounts-of-user-search-data\/\" http:\/\/techcrunch.com\/2006\/08\/06\/aol-proudly-releases-massive-amounts-of-user-search-data\/>."},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2011.40"},{"volume-title":"LJ 2006, 'Reliable, usable signaling to defeat masquerade attacks', Proceedings of the 2006 Workshop on the Economics of Information Security (WEIS '06)","author":"Camp","key":"e_1_2_1_5_1","unstructured":"Camp , LJ 2006, 'Reliable, usable signaling to defeat masquerade attacks', Proceedings of the 2006 Workshop on the Economics of Information Security (WEIS '06) . Camp, LJ 2006, 'Reliable, usable signaling to defeat masquerade attacks', Proceedings of the 2006 Workshop on the Economics of Information Security (WEIS '06)."},{"volume-title":"J 2002, 'Collaborative Filtering with Privacy', Proceedings of the 2002 IEEE Symposium on Security and Privacy (S&P '02)","author":"Canny","key":"e_1_2_1_6_1","unstructured":"Canny , J 2002, 'Collaborative Filtering with Privacy', Proceedings of the 2002 IEEE Symposium on Security and Privacy (S&P '02) . Canny, J 2002, 'Collaborative Filtering with Privacy', Proceedings of the 2002 IEEE Symposium on Security and Privacy (S&P '02)."},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/564376.564419"},{"key":"e_1_2_1_8_1","volume-title":"MABDALB 2008","author":"Chew","year":"2011","unstructured":"Chew , MABDALB 2008 , Undermining Privacy in Social Networks, viewed 31 May 2011 , &lt; HYPERLINK \"http:\/\/w2spconf.com\/2008\/papers\/s3p2.pdf\" http:\/\/w2spconf.com\/2008\/papers\/s3p2.pdf&gt;. Chew, MABDALB 2008, Undermining Privacy in Social Networks, viewed 31 May 2011, &lt; HYPERLINK \"http:\/\/w2spconf.com\/2008\/papers\/s3p2.pdf\" http:\/\/w2spconf.com\/2008\/papers\/s3p2.pdf&gt;."},{"volume-title":"Proceedings of the 9th International World Wide Web Conference on Computer Networks: the International Journal of Computer and Telecommunications Netowrking.","author":"Cohen WW","key":"e_1_2_1_9_1","unstructured":"Cohen , WW & Fan , W 200 0 , ' Web-collaborative filtering: recommending music by crawling the Web ', Proceedings of the 9th International World Wide Web Conference on Computer Networks: the International Journal of Computer and Telecommunications Netowrking. Cohen, WW & Fan, W 2000, 'Web-collaborative filtering: recommending music by crawling the Web', Proceedings of the 9th International World Wide Web Conference on Computer Networks: the International Journal of Computer and Telecommunications Netowrking."},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1102199.1102214"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1056808.1056934"},{"key":"e_1_2_1_13_1","first-page":"53","volume-title":"RIM","author":"Hill RA","year":"2003","unstructured":"Hill , RA & Dunbar , RIM 2003 , 'Social network size in humans', Human Nature, vol 14 , pp. 53 -- 72 . Hill, RA & Dunbar, RIM 2003, 'Social network size in humans', Human Nature, vol 14, pp. 53--72."},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1278201.1278202"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.intcom.2007.10.003"},{"volume-title":"P 2008, 'A lower-bound on the number of rankings required in recommender systems using collaborative filtering', Proceedings of the 42nd Annual Conference on Information Sciences and Systems.","author":"Marbach","key":"e_1_2_1_16_1","unstructured":"Marbach , P 2008, 'A lower-bound on the number of rankings required in recommender systems using collaborative filtering', Proceedings of the 42nd Annual Conference on Information Sciences and Systems. Marbach, P 2008, 'A lower-bound on the number of rankings required in recommender systems using collaborative filtering', Proceedings of the 42nd Annual Conference on Information Sciences and Systems."},{"key":"e_1_2_1_17_1","unstructured":"Markines B Stoilova L & Menczer F 2006 'Bookmark Hierarchies and Collaborative Recommendation' AAAI.   Markines B Stoilova L & Menczer F 2006 'Bookmark Hierarchies and Collaborative Recommendation' AAAI ."},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1609\/aimag.v29i3.2155"},{"key":"e_1_2_1_19_1","unstructured":"Metcalfe R 1995 'Metcalfe's law: A network becomes more valuable as it reaches more users' Infoworld no. 17.  Metcalfe R 1995 'Metcalfe's law: A network becomes more valuable as it reaches more users' Infoworld no. 17."},{"volume-title":"R 2007, 'An empirical analysis of the current state of phishing attack and defence', Proceedings of the 2007 Workshop on the Economics of Information Security (WEIS '07)","author":"Moore T","key":"e_1_2_1_20_1","unstructured":"Moore , T & Clayton , R 2007, 'An empirical analysis of the current state of phishing attack and defence', Proceedings of the 2007 Workshop on the Economics of Information Security (WEIS '07) . Moore, T & Clayton, R 2007, 'An empirical analysis of the current state of phishing attack and defence', Proceedings of the 2007 Workshop on the Economics of Information Security (WEIS '07)."},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-85230-8_2"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1281192.1281252"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1639714.1639741"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2011.25"},{"key":"e_1_2_1_25_1","unstructured":"Tsow A Viecco C & Camp LJ Accepted 'Privacy-Aware Architecture for Sharing Web Histories' IBM Systems Journal.  Tsow A Viecco C & Camp LJ Accepted 'Privacy-Aware Architecture for Sharing Web Histories' IBM Systems Journal ."},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/1134707.1134742"}],"container-title":["ACM SIGCAS Computers and Society"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2095266.2095269","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2095266.2095269","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T09:48:42Z","timestamp":1750240122000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2095266.2095269"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,10]]},"references-count":25,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2011,10]]}},"alternative-id":["10.1145\/2095266.2095269"],"URL":"https:\/\/doi.org\/10.1145\/2095266.2095269","relation":{},"ISSN":["0095-2737"],"issn-type":[{"type":"print","value":"0095-2737"}],"subject":[],"published":{"date-parts":[[2011,10]]},"assertion":[{"value":"2011-10-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}