Nothing Special   »   [go: up one dir, main page]

skip to main content
research-article

The decreasing marginal value of evaluation network size

Published: 01 October 2011 Publication History

Abstract

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.
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.

References

[1]
Ahn, Y-Y, Han, S, Kwak, H, Moon, S & Jeong, H 2007, 'Analysis of topological characteristics of huge online social networking services', Proceedings of the 16th International Conference on World Wide Web (WWW '07).
[2]
APWG 2010, Global Phishing Survey 2H2010 Trends and Domain Name Use, viewed 31 May 2011, < HYPERLINK "http://www.antiphishing.org/reports/APWG_GlobalPhishingSurvey_2H2010.pdf" http://www.antiphishing.org/reports/APWG_GlobalPhishingSurvey_2H2010.pdf>.
[3]
Arrington, M 2006, AOL Proudly Releases Massive Amounts of Private Data, viewed 31 May 2011, < 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/>.
[4]
Calandrino, JA, Kilzer, A, Narayanan, A, Felten, EW & Shmatikov, V 2011, '"You Might Also Like:" Privacy Risks of Collaborative Filtering', Proceedings of the 2011 IEEE Symposium on Security and Privacy (S&P '11).
[5]
Camp, LJ 2006, 'Reliable, usable signaling to defeat masquerade attacks', Proceedings of the 2006 Workshop on the Economics of Information Security (WEIS '06).
[6]
Canny, J 2002, 'Collaborative Filtering with Privacy', Proceedings of the 2002 IEEE Symposium on Security and Privacy (S&P '02).
[7]
Canny, J 2002, 'Collaborative filtering with privacy via factor analysis', Proceedings of the 25th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR '02).
[8]
Chew, MABDALB 2008, Undermining Privacy in Social Networks, viewed 31 May 2011, < HYPERLINK "http://w2spconf.com/2008/papers/s3p2.pdf" http://w2spconf.com/2008/papers/s3p2.pdf>.
[9]
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.
[10]
Duncan, JF 2010, 'Ethical Design for Security and Privacy', PhD Thesis, Indiana University Bloomington.
[11]
Gross, R & Acquisti, A 2005, 'Information revelation and privacy in online social networks', Proceedings of the 2005 ACM Workshop on Privacy in the Electronic Society (WPES '05).
[12]
Hawkey, K & Inkpen, KM 2005, 'Privacy gradients: exploring ways to manage incidental information during co-located collaboration', Proceedings of the Conference on Human Factors in Computing Systems (CHI '05).
[13]
Hill, RA & Dunbar, RIM 2003, 'Social network size in humans', Human Nature, vol 14, pp. 53--72.
[14]
Kobsa, A 2007, 'Privacy-enhanced personalization', Commun. ACM, vol 50, no. 8, pp. 24--33.
[15]
Komlodi, A & Lutters, WG 2008, 'Collaborative use of individual search histories', Interact. Comput., vol 20, no. 1, pp. 184--198.
[16]
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.
[17]
Markines, B, Stoilova, L & Menczer, F 2006, 'Bookmark Hierarchies and Collaborative Recommendation', AAAI.
[18]
Menczer, F, Wu, L-S & Akavipat, R 2008, 'Intelligent peer networks for collaborative Web search', AI Magazine, vol 29, no. 3, pp. 35--45.
[19]
Metcalfe, R 1995, 'Metcalfe's law: A network becomes more valuable as it reaches more users', Infoworld, no. 17.
[20]
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).
[21]
Moore, T & Clayton, R 2008, 'Evaluating the Wisdom of Crowds in Assessing Phishing Websites', in G Tsudik (ed.), Financial Cryptography and Data Security.
[22]
Park, S-T & Pennock, DM 2007, 'Applying collaborative filtering techniques to movie search for better ranking and browsing', Proceedings of the 13th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD '07).
[23]
Shokri, R, Pedarsani, P, Theodorakopoulos, G & Hubaux, J-P 2009, 'Preserving privacy in collaborative filtering through distributed aggregation of offline profiles', Proceedings of the Third ACM Conference on Recommender Systems (RecSys '09).
[24]
Thomas, K, Grier, C, Ma, J, Paxson, V & Song, D 2011, 'Design and Evaluation of a Real-Time URL Spam Filtering Service', Proceedings of 2011 IEEE Symposium of Security and Privacy (S&P '11).
[25]
Tsow, A, Viecco, C & Camp, LJ Accepted, 'Privacy-Aware Architecture for Sharing Web Histories', IBM Systems Journal.
[26]
Zhang, S, Ford, J & Makedon, F 2006, 'A privacy-preserving collaborative filtering scheme with two-way communication', Proceedings of the 7th ACM Conference on Electronic Commerce (EC '06).

Cited By

View all
  • (2012)PeerSecProceedings of the 7th USENIX conference on Hot Topics in Security10.5555/2372387.2372395(8-8)Online publication date: 7-Aug-2012
  • (2012)Pools, clubs and securityProceedings of the 2012 New Security Paradigms Workshop10.1145/2413296.2413304(77-86)Online publication date: 18-Sep-2012
  • (2012)Enabling users to self-manage networksProceedings of the 16th international conference on Financial Cryptography and Data Security10.1007/978-3-642-34638-5_5(53-67)Online publication date: 2-Mar-2012

Recommendations

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM SIGCAS Computers and Society
ACM SIGCAS Computers and Society  Volume 41, Issue 1
October 2011
48 pages
ISSN:0095-2737
DOI:10.1145/2095266
Issue’s Table of Contents

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 October 2011
Published in SIGCAS Volume 41, Issue 1

Check for updates

Author Tags

  1. collaborative search
  2. communal evaluation
  3. empirical analysis
  4. network size

Qualifiers

  • Research-article

Funding Sources

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)1
  • Downloads (Last 6 weeks)0
Reflects downloads up to 09 Nov 2024

Other Metrics

Citations

Cited By

View all
  • (2012)PeerSecProceedings of the 7th USENIX conference on Hot Topics in Security10.5555/2372387.2372395(8-8)Online publication date: 7-Aug-2012
  • (2012)Pools, clubs and securityProceedings of the 2012 New Security Paradigms Workshop10.1145/2413296.2413304(77-86)Online publication date: 18-Sep-2012
  • (2012)Enabling users to self-manage networksProceedings of the 16th international conference on Financial Cryptography and Data Security10.1007/978-3-642-34638-5_5(53-67)Online publication date: 2-Mar-2012

View Options

Get Access

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media