Diversification and fairness in top-k ranking algorithms

Given a user query, the typical user interfaces, such as search engines and recommender systems, only allow a small number of results to be returned to the user. Hence, figuring out what would be the top-k results is an important task in information retrieval, as it helps to ensure that the most relevant results are presented to the user. There exists an extensive body of research that studies how to score the records and return top-k to the user. Moreover, there exists an extensive set of criteria that researchers identify to present the user with top-k results, and result diversification is one of them. Diversifying the top-k result ensures that the returned result set is relevant as well as representative of the entire set of answers to the user query, and it is highly relevant in the context of search, recommendation, and data exploration. The goal of this dissertation is two-fold: the first goal is to focus on adapting existing popular diversification algorithms and studying how to expedite them without losing the accuracy of the answers. This work studies the scalability challenges of expediting the running time of existing diversification algorithms by designing a generic framework that produces the same results as the original algorithms, yet it is significantly faster in running time. This proposed approach handles scenarios where data change over a period of time and studies how to adapt the framework to accommodate data changes. The second aspect of the work studies how the existing top-k algorithms could lead to inequitable exposure of records that are equivalent qualitatively. This scenario is highly important for long-tail data where there exists a long tail of records that have similar utility, but the existing top-k algorithm only shows one of the top-ks, and the rest are never returned to the user. Both of these problems are studied analytically, and their hardness is studied. The contributions of this dissertation lie in (a) formalizing principal problems and studying them analytically. (b) designing scalable algorithms with theoretical guarantees, and (c) evaluating the efficacy and scalability of the designed solutions by comparing them with the state-of-the-art solutions over large-scale datasets

Multi-Dimensional-Personalization in mobile contexts

During the dot com era the word "personalisation” was a hot buzzword. With the fall of the dot com companies the topic has lost momentum. As the killer application for UMTS or the mobile internet has yet to be identified, the concept of Multi-Dimensional-Personalisation (MDP) could be a candidate. Using this approach, a recommendation of mobile advertisement or marketing (i.e., recommendations or notifications), online content, as well as offline events, can be offered to the user based on their known interests and current location. Instead of having to request or pull this information, the new service concept would proactively provide the information and services – with the consequence that the right information or service could therefore be offered at the right place, at the right time. The growing availability of "Location-based Services“ for mobile phones is a new target for the use of personalisation. "Location-based Services“ are information, for example, about restaurants, hotels or shopping malls with offers which are in close range / short distance to the user. The lack of acceptance for such services in the past is based on the fact that early implementations required the user to pull the information from the service provider. A more promising approach is to actively push information to the user. This information must be from interest to the user and has to reach the user at the right time and at the right place. This raises new requirements on personalisation which will go far beyond present requirements. It will reach out from personalisation based only on the interest of the user. Besides the interest, the enhanced personalisation has to cover the location and movement patterns, the usage and the past, present and future schedule of the user. This new personalisation paradigm has to protect the user’s privacy so that an approach supporting anonymous recommendations through an extended "Chinese Wall“ will be described

Behavioral Symptom Clusters, Inflammation, and Quality of Life in Chronic Low Back Pain Patients

Chronic low back pain (CLBP) is a prevalent condition, often involving an inflammatory process. Those with CLBP frequently experience behavioral symptoms, including depressed mood, fatigue, and sleep disturbance, which may exacerbate pain and reduce quality of life (QOL). The purpose of this study was to identify behavioral symptom clusters (depressive mood, fatigue, poor sleep) in individuals with CLBP, and to determine whether there are differences in pain, QOL and inflammation (plasma IL-6) based on cluster membership. CLBP patients (N=69; age = 56±13 years) completed measures of pain, depressive mood, fatigue, sleep, and QOL. Blood was obtained for IL-6 measurement. LCA revealed a two-class model. Participants in Class 1 characterized by High Behavioral Symptoms (HBS) had more depressive mood, fatigue, and sleep disturbance (including less sleep per night) compared to participants in Class 2 characterized by Low behavioral Symptoms (LBS). Univariate general linear models revealed HBS reported worse QOL and pain interference than those in LBS. Pain severity did not significantly differ between the classes. Exploratory analysis suggested this was due to a moderating effect of IL-6 on pain severity. Levels of IL-6 (controlling for BMI) were trending to significantly greater in HBS, compared to LBS, with higher levels of IL-6 correlating with greater pain severity and more sleep disturbance. Further, logistic regression revealed higher levels of IL-6 predicted HBS membership. In conclusion, behavioral symptoms cluster in individuals with CLBP and worsen QOL. Inflammation contributes to the complex relationship between behavioral symptoms and pain severity. Clinical recognition of behavioral symptom clusters can foster more comprehensive pain assessment and tailored interventions for CLBP patients

Models and algorithms for promoting diverse and fair query results

Ensuring fairness and diversity in search results are two key concerns in compelling search and recommendation applications. This work explicitly studies these two aspects given multiple users\u27 preferences as inputs, in an effort to create a single ranking or top-k result set that satisfies different fairness and diversity criteria. From group fairness standpoint, it adapts demographic parity like group fairness criteria and proposes new models that are suitable for ranking or producing top-k set of results. This dissertation also studies equitable exposure of individual search results in long tail data, a concept related to individual fairness. First, the dissertation focuses on aggregating ranks while achieving proportionate fairness (ensures proportionate representation of every group) for multiple protected groups. Then, the dissertation explores how to minimally modify original users\u27 preferences under plurality voting, aiming to produce top-k result set that satisfies complex fairness constraints. A concept referred to as manipulation by modifications is introduced, which involves making minimal changes to the original user preferences to ensure query satisfaction. This problem is formalized as the margin finding problem. A follow up work studies this problem considering a popular ranked choice voting mechanism, namely, the Instant Run-off Voting or IRV, as the preference aggregation method. From the standpoint of individual fairness, this dissertation studies an exposure concern that top-k set based algorithms exhibit when the underlying data has long tail properties, and designs techniques to make those results equitable. For result diversification, the work studies efficiency opportunities in existing diversification algorithms, and designs a generic access primitive called DivGetBatch() to enable that. The contributions of this dissertation lie in (a) formalizing principal problems and studying them analytically. (b) designing scalable algorithms with theoretical guarantees, and (c) extensive experimental study to evaluate the efficacy and scalability of the designed solutions by comparing them with the state-of-the-art solutions using large-scale datasets

Three Essays on Friend Recommendation Systems for Online Social Networks

Social networking sites (SNSs) first appeared in the mid-90s. In recent years, however, Web 2.0 technologies have made modern SNSs increasingly popular and easier to use, and social networking has expanded explosively across the web. This brought a massive number of new users. Two of the most popular SNSs, Facebook and Twitter, have reached one billion users and exceeded half billion users, respectively. Too many new users may cause the cold start problem. Users sign up on a SNS and discover they do not have any friends. Normally, SNSs solve this problem by recommending potential friends. The current major methods for friend recommendations are profile matching and “friends-of-friends.” The profile matching method compares two users’ profiles. This is relatively inflexible because it ignores the changing nature of users. It also requires complete profiles. The friends-of-friends method can only find people who are likely to be previously known to each other and neglects many users who share the same interests. To the best of my knowledge, existing research has not proposed guidelines for building a better recommendation system based on context information (location information) and user-generated content (UGC). This dissertation consists of three essays. The first essay focuses on location information and then develops a framework for using location to recommend friends--a framework that is not limited to making only known people recommendations but that also adds stranger recommendations. The second essay employs UGC by developing a text analytic framework that discovers users’ interests and personalities and uses this information to recommend friends. The third essay discusses friend recommendations in a certain type of online community – health and fitness social networking sites, physical activities and health status become more important factors in this case. Essay 1: Location-sensitive Friend Recommendations in Online Social Networks GPS-embedded smart devices and wearable devices such as smart phones, tablets, smart watches, etc., have significantly increased in recent years. Because of them, users can record their location at anytime and anyplace. SNSs such as Foursquare, Facebook, and Twitter all have developed their own location-based services to collect users’ location check-in data and provide location-sensitive services such as location-based promotions. None of these sites, however, have used location information to make friend recommendations. In this essay, we investigate a new model to make friend recommendations. This model includes location check-in data as predictors and calculates users’ check-in histories--users’ life patterns--to make friend recommendations. The results of our experiment show that this novel model provides better performance in making friend recommendations. Essay 2: Novel Friend Recommendations Based on User-generated Contents More and more users have joined and contributed to SNSs. Users share stories of their daily life (such as having delicious food, enjoying shopping, traveling, hanging out, etc.) and leave comments. This huge amount of UGC could provide rich data for building an accurate, adaptable, effective, and extensible user model that reflects users’ interests, their sentiments about different type of locations, and their personalities. From the computer-supported social matching process, these attributes could influence friend matches. Unfortunately, none of the previous studies in this area have focused on using these extracted meta-text features for friend recommendation systems. In this study, we develop a text analytic framework and apply it to UGCs on SNSs. By extracting interests and personality features from UGCs, we can make text-based friend recommendations. The results of our experiment show that text features could further improve recommendation performance. Essay 3: Friend Recommendations in Health/Fitness Social Networking Sites Thanks to the growing number of wearable devices, online health/fitness communities are becoming more and more popular. This type of social networking sites offers individuals the opportunity to monitor their diet process and motivating them to change their lifestyles. Users can improve their physical activity level and health status by receiving information, advice and supports from their friends in the social networks. Many studies have confirmed that social network structure and the degree of homophily in a network will affect how health behavior and innovations are spread. However, very few studies have focused on the opposite, the impact from users’ daily activities for building friendships in a health/fitness social networking site. In this study, we track and collect users’ daily activities from Record, a famous online fitness social networking sites. By building an analytic framework, we test and evaluate how people’s daily activities could help friend recommendations. The results of our experiment have shown that by using the helps from these information, friend recommendation systems become more accurate and more precise

Motivational Interviewing to Enhance Weight Loss and Eating Self-Efficacy in Overweight and Obese Adults

Greater than six in ten adults in the United States are overweight or obese which can lead to cardiovascular disease, Type II Diabetes, joint injury and some forms of cancer, costing billions of healthcare dollars each year. Weight loss is difficult, as is maintaining weight loss. The purpose of this project is to investigate if use of the evidenced based (EB) intervention, motivational interviewing (MI), will enhance weight loss and eating self-efficacy (ESE) in overweight and obese adults seeking weight loss at a weight loss clinic over the course of eight weeks. Participants who received MI in addition to current weight loss strategies lost significantly more weight (-2.74 kg, p \u3c .05) between the four and eight week visits as compared patients who did not receive MI (-1.3222 kg). The overall weight change over the course of this eight week study in patients who received MI was -6.7733 kg as compared to patients who did not receive MI which was -4.5717 kg. ESE was significantly improved from the initial visit of 4.8733 (p \u3c .05) to the four week visit of 4.6733 (p \u3c .05) and 4.3267 (p \u3c .05) at eight weeks in participants who received monthly MI sessions. Keywords: Weight Loss, Motivational Interviewing, Obesity, Self-efficac