Gender Differences in Online Dating: What Do We Know So Far? A Systematic Literature Review

With millions of users worldwide, online dating platforms strive to assert themselves as powerful tools to find dates and form romantic relationships. However, significant differences exist in male and female use of this mate-matching technology with respect to motivation, preferences, self-presentation, interaction and outcomes. While existing research has routinely reported on gender differences in online dating, these insights remain scattered across multiple studies. To gain a systematic insight into existing findings, in this study we conduct a meta-review of existing research. We find that evolutionary theory generally holds true in online dating: Users still follow natural stereotypes when it comes to choosing a mate online. Physical attractiveness is the key criteria for men; while women, being much more demanding, prioritize socio-economic attributes when choosing a male partner. Together, our structured findings offer a deeper insight into the underlying dynamics of gender differences in online dating.

Word of mouth communication within online communities:conceptualizing the online social network

Word of mouth (WOM) communication is a major part of online consumer interactions, particularly within the environment of online communities. Nevertheless, existing (offline) theory may be inappropriate to describe online WOM and its influence on evaluation and purchase.The authors report the results of a two-stage study aimed at investigating online WOM: a set of in-depth qualitative interviews followed by a social network analysis of a single online community. Combined, the results provide strong evidence that individuals behave as if Web sites themselves are primary "actors" in online social networks and that online communities can act as a social proxy for individual identification. The authors offer a conceptualization of online social networks which takes the Web site into account as an actor, an initial exploration of the concept of a consumer-Web site relationship, and a conceptual model of the online interaction and information evaluation process. © 2007 Wiley Periodicals, Inc. and Direct Marketing Educational Foundation, Inc.

Mining the online social network data: Influence, summarization, and organization

Online Social Network (OSN) services provided by Internet companies bring people together to chat, share the information, and enjoy the information. Meanwhile, huge amounts of data are generated by those services (they can be regarded as the social media ) every day, every hour, even every minute, and every second. Currently, researchers are interested in analyzing the OSN data, extracting interesting patterns from it, and applying those patterns to real-world applications. However, due to the large-scale property of the OSN data, it is difficult to effectively analyze it. This dissertation focuses on applying data mining and information retrieval techniques to mine two key components in the social media data — users and user-generated contents. Specifically, it aims at addressing three problems related to the social media users and contents: (1) how does one organize the users and the contents? (2) how does one summarize the textual contents so that users do not have to go over every post to capture the general idea? (3) how does one identify the influential users in the social media to benefit other applications, e.g., Marketing Campaign? The contribution of this dissertation is briefly summarized as follows. (1) It provides a comprehensive and versatile data mining framework to analyze the users and user-generated contents from the social media. (2) It designs a hierarchical co-clustering algorithm to organize the users and contents. (3) It proposes multi-document summarization methods to extract core information from the social network contents. (4) It introduces three important dimensions of social influence, and a dynamic influence model for identifying influential users.

Mining the Online Social Network Data: Influence, Summarization, and Organization

Online Social Network (OSN) services provided by Internet companies bring people together to chat, share the information, and enjoy the information. Meanwhile, huge amounts of data are generated by those services (they can be regarded as the social media ) every day, every hour, even every minute, and every second. Currently, researchers are interested in analyzing the OSN data, extracting interesting patterns from it, and applying those patterns to real-world applications. However, due to the large-scale property of the OSN data, it is difficult to effectively analyze it. This dissertation focuses on applying data mining and information retrieval techniques to mine two key components in the social media data — users and user-generated contents. Specifically, it aims at addressing three problems related to the social media users and contents: (1) how does one organize the users and the contents? (2) how does one summarize the textual contents so that users do not have to go over every post to capture the general idea? (3) how does one identify the influential users in the social media to benefit other applications, e.g., Marketing Campaign? The contribution of this dissertation is briefly summarized as follows. (1) It provides a comprehensive and versatile data mining framework to analyze the users and user-generated contents from the social media. (2) It designs a hierarchical co-clustering algorithm to organize the users and contents. (3) It proposes multi-document summarization methods to extract core information from the social network contents. (4) It introduces three important dimensions of social influence, and a dynamic influence model for identifying influential users.

A common neighbour based two-way collaborative recommendation method

Traditional recommendation methods offer items, that are inanimate and one way recommendation, to users. Emerging new applications such as online dating or job recruitments require reciprocal people-to-people recommendations that are animate and two-way recommendations. In this paper, we propose a reciprocal collaborative method based on the concepts of users' similarities and common neighbors. The dataset employed for the experiment is gathered from a real life online dating network. The proposed method is compared with baseline methods that use traditional collaborative algorithms. Results show the proposed method can achieve noticeably better performance than the baseline methods.

Users segmentations for recommendation

Traditional recommendation methods provide recommendations equally to all users. In this paper, a segmentation method using the Gaussian Mixture Model (GMM) is proposed to customize users’ needs in order to offer a specific recommendation strategy to each segment. Experiment is conducted using a live online dating network data.

A people-to-people matching system using graph mining techniques

A people-to-people matching system (or a match-making system) refers to a system in which users join with the objective of meeting other users with the common need. Some real-world examples of these systems are employer-employee (in job search networks), mentor-student (in university social networks), consume-to-consumer (in marketplaces) and male-female (in an online dating network). The network underlying in these systems consists of two groups of users, and the relationships between users need to be captured for developing an efficient match-making system. Most of the existing studies utilize information either about each of the users in isolation or their interaction separately, and develop recommender systems using the one form of information only. It is imperative to understand the linkages among the users in the network and use them in developing a match-making system. This study utilizes several social network analysis methods such as graph theory, small world phenomenon, centrality analysis, density analysis to gain insight into the entities and their relationships present in this network. This paper also proposes a new type of graph called “attributed bipartite graph”. By using these analyses and the proposed type of graph, an efficient hybrid recommender system is developed which generates recommendation for new users as well as shows improvement in accuracy over the baseline methods.

Improving matching process in social network using implicit and explicit user information

Personalised social matching systems can be seen as recommender systems that recommend people to others in the social networks. However, with the rapid growth of users in social networks and the information that a social matching system requires about the users, recommender system techniques have become insufficiently adept at matching users in social networks. This paper presents a hybrid social matching system that takes advantage of both collaborative and content-based concepts of recommendation. The clustering technique is used to reduce the number of users that the matching system needs to consider and to overcome other problems from which social matching systems suffer, such as cold start problem due to the absence of implicit information about a new user. The proposed system has been evaluated on a dataset obtained from an online dating website. Empirical analysis shows that accuracy of the matching process is increased, using both user information (explicit data) and user behavior (implicit data).

'Try hard' : Attitudes to advertising in online social networks

Advertising has recently entered many new spaces it does not fully understand. The rules that apply in traditional media do not always translate in new media environments. However, their low cost of entry and the availability of hard-to-reach target markets, such as Generation Y, make environments such as online social networking sites attractive to marketers. This paper accumulates teenage perspectives from two qualitative studies to identify attitudes towards advertising in online social network sites and develop implications for marketers seeking to advertising on social network sites.

Getting it [on]line : sociological implications of e-dating

This article explores the role of sociology in understanding the phenomenon of online dating. Based on an examination of our qualitative study of 23 online daters, combined with the findings of the small number of other empirical studies available, we argue that further sociological consideration of the online dating phenomenon is required to: illuminate the social conditions informing these activities; enhance knowledge of if, and how, online technologies mediate intimate connections; and advance a critically informed understanding of the nature of intimacy in a global era.

A people-to-people recommendation system using Tensor Space Models

Existing recommendation systems often recommend products to users by capturing the item-to-item and user-to-user similarity measures. These types of recommendation systems become inefficient in people-to-people networks for people to people recommendation that require two way relationship. Also, existing recommendation methods use traditional two dimensional models to find inter relationships between alike users and items. It is not efficient enough to model the people-to-people network with two-dimensional models as the latent correlations between the people and their attributes are not utilized. In this paper, we propose a novel tensor decomposition-based recommendation method for recommending people-to-people based on users profiles and their interactions. The people-to-people network data is multi-dimensional data which when modeled using vector based methods tend to result in information loss as they capture either the interactions or the attributes of the users but not both the information. This paper utilizes tensor models that have the ability to correlate and find latent relationships between similar users based on both information, user interactions and user attributes, in order to generate recommendations. Empirical analysis is conducted on a real-life online dating dataset. As demonstrated in results, the use of tensor modeling and decomposition has enabled the identification of latent correlations between people based on their attributes and interactions in the network and quality recommendations have been derived using the 'alike' users concept.

Finding and matching communities in social networks using data mining

The rapid growth in the number of users using social networks and the information that a social network requires about their users make the traditional matching systems insufficiently adept at matching users within social networks. This paper introduces the use of clustering to form communities of users and, then, uses these communities to generate matches. Forming communities within a social network helps to reduce the number of users that the matching system needs to consider, and helps to overcome other problems from which social networks suffer, such as the absence of user activities' information about a new user. The proposed system has been evaluated on a dataset obtained from an online dating website. Empirical analysis shows that accuracy of the matching process is increased using the community information.

Online multiple profile manager for eHealth information sharing

Online social networks connect millions of people around the globe. These electronic bonds make individuals comfortable with their behaviours. Such positive signs of sharing information is useful phenomena requires consideration to establish a socio-scientific effect. Recently, many web users have more than one social networking account. This means a user may hold multiple profiles which are stored in different Social Network Sites (SNNs). Maintaining these multiple online social network profiles is cumbersome and time-consuming [1]. In this paper we will propose a framework for the management of a user's multiple profiles. A demonstrator, called Multiple Profile Manager (MPM), will be showcased to illustrate how effective the framework will be.

Grouping people in social networks using a weighted multi-constraints clustering method

Grouping users in social networks is an important process that improves matching and recommendation activities in social networks. The data mining methods of clustering can be used in grouping the users in social networks. However, the existing general purpose clustering algorithms perform poorly on the social network data due to the special nature of users' data in social networks. One main reason is the constraints that need to be considered in grouping users in social networks. Another reason is the need of capturing large amount of information about users which imposes computational complexity to an algorithm. In this paper, we propose a scalable and effective constraint-based clustering algorithm based on a global similarity measure that takes into consideration the users' constraints and their importance in social networks. Each constraint's importance is calculated based on the occurrence of this constraint in the dataset. Performance of the algorithm is demonstrated on a dataset obtained from an online dating website using internal and external evaluation measures. Results show that the proposed algorithm is able to increases the accuracy of matching users in social networks by 10% in comparison to other algorithms.

Synchronised integrated online e-health profiles

Web-based social networking applications have become increasingly important in recent years. The current applications in the healthcare sphere can support the health management, but to date there is no patient-controlled integrator. This paper proposes a platform called Multiple Profile Manager (MPM) that enables a user to create and manage an integrated profile that can be shared across numerous social network sites. Moreover, it is able to facilitate the collection of personal healthcare data, which makes a contribution to the development of public health informatics. Here we want to illustrate how patients and physicians can be benefited from enabling the platform for online social network sites. The MPM simplifies the management of patients' profiles and allows health professionals to obtain a more complete picture of the patients' background so that they can provide better health care. To do so, we demonstrate a prototype of the platform and describe its protocol specification, which is an XMPP (Extensible Messaging and Presence Protocol) [1] extension, for sharing and synchronising profile data (vCard²) between different social networks.