Auditing Search Engines for Differential Satisfaction Across Demographics

Many online services, such as search engines, social media platforms, and digital marketplaces, are advertised as being available to any user, regardless of their age, gender, or other demographic factors. However, there are growing concerns that these services may systematically underserve some groups of users. In this paper, we present a framework for internally auditing such services for differences in user satisfaction across demographic groups, using search engines as a case study. We first explain the pitfalls of na\"ively comparing the behavioral metrics that are commonly used to evaluate search engines. We then propose three methods for measuring latent differences in user satisfaction from observed differences in evaluation metrics. To develop these methods, we drew on ideas from the causal inference literature and the multilevel modeling literature. Our framework is broadly applicable to other online services, and provides general insight into interpreting their evaluation metrics.Comment: 8 pages Accepted at WWW 201

Discovery services: next generation of searching scholarly information

The new breed of resource discovery services is an evolutionary step forward in providing library users with a ‘one-stop shop’ where they can find information sources for their research. They provide a single search box that can search a library’s online and physical content including articles, books, journals, newspaper articles, e-books, specialist collections and more. These discovery services have built on the concepts of both federated searching and next-generation catalogues

Service validity and service reliability of search, experience and credence services: A scenario study

The purpose of this research is to add to our understanding of the antecedents of customer satisfaction by examining the effects of service reliability (Is the service “correctly” produced?) and service validity (Is the “correct” service produced?) of search, experience and credence services.\ud Design/methodology/approach – Service validity and service reliability were manipulated in scenarios describing service encounters with different types of services. Customer satisfaction was measured using questionnaires.\ud Findings – Service validity and service reliability independently affect customer satisfaction with search services. For experience services, service validity and service reliability are necessary conditions for customer satisfaction. For credence services, no effects of service validity were found but the effects of service reliability on customers' satisfaction were profound.\ud Research limitations/implications – Scenarios provided a useful method to investigate customer evaluation of different types of service situations. A limitation of this method was that the participants were not observed in a real service situation but had to give their opinion on hypothetical scenarios.\ud Practical implications – For search and credence services, it is possible to compensate low service validity by providing a highly reliable service. However, managers of experience services should be aware that little can be gained when either service validity or service reliability is faulty.\ud Originality/value – The present study provides empirical data on the effects of service reliability and the thus far neglected effects of service validity and integrates these (new) concepts in the model of information verification

GraphSE2^2: An Encrypted Graph Database for Privacy-Preserving Social Search

In this paper, we propose GraphSE$^2$, an encrypted graph database for online social network services to address massive data breaches. GraphSE$^2$ preserves the functionality of social search, a key enabler for quality social network services, where social search queries are conducted on a large-scale social graph and meanwhile perform set and computational operations on user-generated contents. To enable efficient privacy-preserving social search, GraphSE$^2$ provides an encrypted structural data model to facilitate parallel and encrypted graph data access. It is also designed to decompose complex social search queries into atomic operations and realise them via interchangeable protocols in a fast and scalable manner. We build GraphSE$^2$ with various queries supported in the Facebook graph search engine and implement a full-fledged prototype. Extensive evaluations on Azure Cloud demonstrate that GraphSE$^2$ is practical for querying a social graph with a million of users.Comment: This is the full version of our AsiaCCS paper "GraphSE$^2$: An Encrypted Graph Database for Privacy-Preserving Social Search". It includes the security proof of the proposed scheme. If you want to cite our work, please cite the conference version of i

Web Content Mining for Information on Information Scientists

This paper presents a search system for information on scientists which was implemented prototypically for the area of information science, employing Web Content Mining techniques. The sources that are used in the implemented approach are online publication services and personal homepages of scientists. The system contains wrappers for querying the publication services and information extraction from their result pages, as well as methods for information extraction from homepages, which are based on heuristics concerning structure and composition of the pages. Moreover a specialised search technique for searching for personal homepages of information scientists was developed