Identifying Fake Profiles in LinkedIn

• URL: http://arxiv.org/abs/2006.01381v1
• Date: Tue, 2 Jun 2020 04:15:20 GMT
• Title: Identifying Fake Profiles in LinkedIn
• Authors: Shalinda Adikari and Kaushik Dutta
• Abstract summary: We identify the minimal set of profile data necessary for identifying fake profiles in LinkedIn. We propose an appropriate data mining approach for fake profile identification. Our approach can identify fake profiles with 87% accuracy and 94% True Negative Rate.
• Score: 0.22843885788439797
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: As organizations increasingly rely on professionally oriented networks such as LinkedIn (the largest such social network) for building business connections, there is increasing value in having one's profile noticed within the network. As this value increases, so does the temptation to misuse the network for unethical purposes. Fake profiles have an adverse effect on the trustworthiness of the network as a whole, and can represent significant costs in time and effort in building a connection based on fake information. Unfortunately, fake profiles are difficult to identify. Approaches have been proposed for some social networks; however, these generally rely on data that are not publicly available for LinkedIn profiles. In this research, we identify the minimal set of profile data necessary for identifying fake profiles in LinkedIn, and propose an appropriate data mining approach for fake profile identification. We demonstrate that, even with limited profile data, our approach can identify fake profiles with 87% accuracy and 94% True Negative Rate, which is comparable to the results obtained based on larger data sets and more expansive profile information. Further, when compared to approaches using similar amounts and types of data, our method provides an improvement of approximately 14% accuracy.

Related papers

• Differentially Private Data Release on Graphs: Inefficiencies and Unfairness [48.96399034594329]
  This paper characterizes the impact of Differential Privacy on bias and unfairness in the context of releasing information about networks. We consider a network release problem where the network structure is known to all, but the weights on edges must be released privately. Our work provides theoretical foundations and empirical evidence into the bias and unfairness arising due to privacy in these networked decision problems.
  arXiv  Detail & Related papers  (2024-08-08T08:37:37Z)
• Federated Face Forgery Detection Learning with Personalized Representation [63.90408023506508]
  Deep generator technology can produce high-quality fake videos that are indistinguishable, posing a serious social threat. Traditional forgery detection methods directly centralized training on data. The paper proposes a novel federated face forgery detection learning with personalized representation.
  arXiv  Detail & Related papers  (2024-06-17T02:20:30Z)
• On mission Twitter Profiles: A Study of Selective Toxic Behavior [5.0157204307764625]
  This study aims to characterize profiles potentially used for influence operations, termed 'on-mission profiles' Longitudinal data from 138K Twitter or X, profiles and 293M tweets enables profiling based on theme diversity.
  arXiv  Detail & Related papers  (2024-01-25T15:42:36Z)
• The Looming Threat of Fake and LLM-generated LinkedIn Profiles: Challenges and Opportunities for Detection and Prevention [0.8808993671472349]
  We present a novel method for detecting fake and Large Language Model (LLM)-generated profiles in the LinkedIn Online Social Network. We show that the suggested method can distinguish between legitimate and fake profiles with an accuracy of about 95% across all word embeddings.
  arXiv  Detail & Related papers  (2023-07-21T19:09:24Z)
• Membership Inference Attacks against Synthetic Data through Overfitting Detection [84.02632160692995]
  We argue for a realistic MIA setting that assumes the attacker has some knowledge of the underlying data distribution. We propose DOMIAS, a density-based MIA model that aims to infer membership by targeting local overfitting of the generative model.
  arXiv  Detail & Related papers  (2023-02-24T11:27:39Z)
• Fraudulent User Detection Via Behavior Information Aggregation Network (BIAN) On Large-Scale Financial Social Network [8.687460943376605]
  We propose a novel behavior information aggregation network (BIAN) to combine the user behaviors with other user features. The experimental results on a real-world large-scale financial social network dataset, DGraph, show that BIAN obtains the 10.2% gain in AUROC.
  arXiv  Detail & Related papers  (2022-11-04T08:33:06Z)
• Detecting fake accounts through Generative Adversarial Network in online social media [0.0]
  This paper proposes a novel method using user similarity measures and the Generative Adversarial Network (GAN) algorithm to identify fake user accounts in the Twitter dataset. Despite the problem's complexity, the method achieves an AUC rate of 80% in classifying and detecting fake accounts.
  arXiv  Detail & Related papers  (2022-10-25T10:20:27Z)
• RealGait: Gait Recognition for Person Re-Identification [79.67088297584762]
  We construct a new gait dataset by extracting silhouettes from an existing video person re-identification challenge which consists of 1,404 persons walking in an unconstrained manner. Our results suggest that recognizing people by their gait in real surveillance scenarios is feasible and the underlying gait pattern is probably the true reason why video person re-idenfification works in practice.
  arXiv  Detail & Related papers  (2022-01-13T06:30:56Z)
• Relational Graph Neural Networks for Fraud Detection in a Super-App environment [53.561797148529664]
  We propose a framework of relational graph convolutional networks methods for fraudulent behaviour prevention in the financial services of a Super-App. We use an interpretability algorithm for graph neural networks to determine the most important relations to the classification task of the users. Our results show that there is an added value when considering models that take advantage of the alternative data of the Super-App and the interactions found in their high connectivity.
  arXiv  Detail & Related papers  (2021-07-29T00:02:06Z)
• A Cooperative Memory Network for Personalized Task-oriented Dialogue Systems with Incomplete User Profiles [55.951126447217526]
  We study personalized Task-oriented Dialogue Systems without assuming that user profiles are complete. We propose a Cooperative Memory Network (CoMemNN) that has a novel mechanism to gradually enrich user profiles. CoMemNN is able to enrich user profiles effectively, which results in an improvement of 3.06% in terms of response selection accuracy.
  arXiv  Detail & Related papers  (2021-02-16T18:05:54Z)
• Friend or Faux: Graph-Based Early Detection of Fake Accounts on Social Networks [4.923937591056569]
  We present the SybilEdge algorithm, which determines whether a new user is a fake account by aggregating over (I) her choices of friend request targets and (II) these targets' respective responses. We show that SybilEdge rapidly detects new fake users at scale on the Facebook network and outperforms state-of-the-art algorithms.
  arXiv  Detail & Related papers  (2020-04-09T22:03:28Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.