Generalizing terrorist social networks with K-nearest neighbor and edge betweeness for social network integration and privacy preservation

2010 ◽  
Author(s):  
Xuning Tang ◽  
Christopher C. Yang
Keyword(s):  
Social Networks ◽  
Social Network ◽  
Privacy Preservation ◽  
Nearest Neighbor ◽  
K Nearest Neighbor ◽  
Network Integration

scholarly journals Privacy preservation in mobile social networks

2019 ◽  
Author(s):  
◽  
Douglas Steiert
Keyword(s):  
Social Networks ◽  
Social Network ◽  
Social Networking ◽  
Privacy Preservation ◽  
Location Based Services ◽  
Mobile Social Networks ◽  
Privacy Concerns ◽  
Average Person ◽  
Effectiveness And Efficiency ◽  
Privacy Breaches

In this day and age with the prevalence of smartphones, networking has evolved in an intricate and complex way. With the help of a technology-driven society, the term "social networking" was created and came to mean using media platforms such as Myspace, Facebook, and Twitter to connect and interact with friends, family, or even complete strangers. Websites are created and put online each day, with many of them possessing hidden threats that the average person does not think about. A key feature that was created for vast amount of utility was the use of location-based services, where many websites inform their users that the website will be using the users' locations to enhance the functionality. However, still far too many websites do not inform their users that they may be tracked, or to what degree. In a similar juxtaposed scenario, the evolution of these social networks has allowed countless people to share photos with others online. While this seems harmless at face-value, there may be times in which people share photos of friends or other non-consenting individuals who do not want that picture viewable to anyone at the photo owner's control. There exists a lack of privacy controls for users to precisely de fine how they wish websites to use their location information, and for how others may share images of them online. This dissertation introduces two models that help mitigate these privacy concerns for social network users. MoveWithMe is an Android and iOS application which creates decoys that move locations along with the user in a consistent and semantically secure way. REMIND is the second model that performs rich probability calculations to determine which friends in a social network may pose a risk for privacy breaches when sharing images. Both models have undergone extensive testing to demonstrate their effectiveness and efficiency.

scholarly journals Trajectory Clustering and k-NN for Robust Privacy Preserving k-NN Query Processing in GeoSpark

Algorithms ◽  
2020 ◽  
Vol 13 (8) ◽  
pp. 182
Author(s):  
Elias Dritsas ◽  
Andreas Kanavos ◽  
Maria Trigka ◽  
Gerasimos Vonitsanos ◽  
Spyros Sioutas ◽  
...  
Keyword(s):  
Big Data ◽  
Spatial Data ◽  
Privacy Preservation ◽  
Nearest Neighbor ◽  
Data Representation ◽  
Privacy Preserving ◽  
Temporal Data ◽  
K Nearest Neighbor ◽  
Trajectory Data ◽  
Spatio Temporal

Privacy Preserving and Anonymity have gained significant concern from the big data perspective. We have the view that the forthcoming frameworks and theories will establish several solutions for privacy protection. The k-anonymity is considered a key solution that has been widely employed to prevent data re-identifcation and concerns us in the context of this work. Data modeling has also gained significant attention from the big data perspective. It is believed that the advancing distributed environments will provide users with several solutions for efficient spatio-temporal data management. GeoSpark will be utilized in the current work as it is a key solution that has been widely employed for spatial data. Specifically, it works on the top of Apache Spark, the main framework leveraged from the research community and organizations for big data transformation, processing and visualization. To this end, we focused on trajectory data representation so as to be applicable to the GeoSpark environment, and a GeoSpark-based approach is designed for the efficient management of real spatio-temporal data. Th next step is to gain deeper understanding of the data through the application of k nearest neighbor (k-NN) queries either using indexing methods or otherwise. The k-anonymity set computation, which is the main component for privacy preservation evaluation and the main issue of our previous works, is evaluated in the GeoSpark environment. More to the point, the focus here is on the time cost of k-anonymity set computation along with vulnerability measurement. The extracted results are presented into tables and figures for visual inspection.

Anonymization Techniques for Privacy Preservation in Social Networks: A Review

2021 ◽  
pp. 14-21
Author(s):  
Kalpana Chavhan ◽  
Dr. Praveen S. Challagidad
Keyword(s):  
Data Mining ◽  
Social Networks ◽  
Social Network ◽  
Privacy Preservation ◽  
Information Science ◽  
Original Data ◽  
Published Data ◽  
Sensitive Information ◽  
Social Network Data ◽  
The Social

Any data that user creates or owns is known as the user's data (For example: Name, USN, Phone number, address, email Id). As the number of users in social networks are increasing day by day the data generated by the user's is also increasing. Network providers will publish the data to others for analysis with hope that mining will provide additional functionality to their users or produce useful results that they can share with others. The analysis of social networks is used in modern sociology, geography, economics and information science as well as in various fields. Publicizing the original data of social networks for analysis raises issues of confidentiality, the adversary can search for documented threats such as identity theft, digital harassment and personalized spam. The published data may contain some sensitive information of individuals which must not be disclosed for this reason social network data must be anonymized before it is published. To do the data in nominate the anonymization technique should be applied, to preserve the privacy of data in the social network in a manner that preserves the privacy of the user whose records are being published while maintaining the published dataset rich enough to allow for the exploration of data. In order to address the issue of privacy protection, we first describe the concept of k-anonymity and illustrate different approaches for its enforcement. We then discuss how the privacy requirements characterized by k-anonymity can be violated in data mining and introduce possible approaches to ensure the satisfaction of k-anonymity in data mining also several attacks on dataset are discussed.

scholarly journals Development of a Social Network for People Without a Diagnosis (RarePairs): Evaluation Study

10.2196/21849 ◽  
2020 ◽  
Vol 22 (9) ◽  
pp. e21849
Author(s):  
Lara Kühnle ◽  
Urs Mücke ◽  
Werner M Lechner ◽  
Frank Klawonn ◽  
Lorenz Grigull
Keyword(s):  
Social Network ◽  
Nearest Neighbor ◽  
Phase 1 ◽  
Diagnostic Delay ◽  
Evaluation Study ◽  
Nearest Neighbor Search ◽  
Diagnostic Process ◽  
K Nearest Neighbor ◽  
Data Set ◽  
Diagnostic Support

Background Diagnostic delay in rare disease (RD) is common, occasionally lasting up to more than 20 years. In attempting to reduce it, diagnostic support tools have been studied extensively. However, social platforms have not yet been used for systematic diagnostic support. This paper illustrates the development and prototypic application of a social network using scientifically developed questions to match individuals without a diagnosis. Objective The study aimed to outline, create, and evaluate a prototype tool (a social network platform named RarePairs), helping patients with undiagnosed RDs to find individuals with similar symptoms. The prototype includes a matching algorithm, bringing together individuals with similar disease burden in the lead-up to diagnosis. Methods We divided our project into 4 phases. In phase 1, we used known data and findings in the literature to understand and specify the context of use. In phase 2, we specified the user requirements. In phase 3, we designed a prototype based on the results of phases 1 and 2, as well as incorporating a state-of-the-art questionnaire with 53 items for recognizing an RD. Lastly, we evaluated this prototype with a data set of 973 questionnaires from individuals suffering from different RDs using 24 distance calculating methods. Results Based on a step-by-step construction process, the digital patient platform prototype, RarePairs, was developed. In order to match individuals with similar experiences, it uses answer patterns generated by a specifically designed questionnaire (Q53). A total of 973 questionnaires answered by patients with RDs were used to construct and test an artificial intelligence (AI) algorithm like the k-nearest neighbor search. With this, we found matches for every single one of the 973 records. The cross-validation of those matches showed that the algorithm outperforms random matching significantly. Statistically, for every data set the algorithm found at least one other record (match) with the same diagnosis. Conclusions Diagnostic delay is torturous for patients without a diagnosis. Shortening the delay is important for both doctors and patients. Diagnostic support using AI can be promoted differently. The prototype of the social media platform RarePairs might be a low-threshold patient platform, and proved suitable to match and connect different individuals with comparable symptoms. This exchange promoted through RarePairs might be used to speed up the diagnostic process. Further studies include its evaluation in a prospective setting and implementation of RarePairs as a mobile phone app.

scholarly journals Taking Social Networks to the Next Level

2012 ◽  
Vol 3 (4) ◽  
pp. 24-33 ◽  
Author(s):  
Alexiei Dingli ◽  
Dylan Seychell
Keyword(s):  
Social Networks ◽  
Social Network ◽  
Social Networking Sites ◽  
Data Transfer ◽  
Field Tests ◽  
Network Integration ◽  
Initial Field ◽  
Web Technologies ◽  
Adaptive Environment ◽  
Multiple Accounts

The success of social networking sites has led people to require the use of multiple accounts on different platforms which effectively increases the risks in managing them. Following and finding information about friends and family has become an issue too. Guided by these observations and by careful research of existing adaptive web technologies, the authors’ team worked on the development of SNAP - an adaptive social network integrator which aimed to amalgamate various social networks (Facebook, Twitter, and Flickr) in one adaptive environment, which unobtrusively sorts the users’ feed according to his/her preference. To achieve data transfer and authorisation, SNAP uses the newest version of the OAuth protocol. Adaptivity was achieved through statistical filtering. The initial field tests show that the system works, however there is definitely room for improvement in terms of Social Network Integration, and testers generally expressed an interest in the idea of using an adaptive social integrator such as SNAP. On top of this, the authors will be suggesting a number of improvements which will change the way society uses social networks forever.

scholarly journals Performance Examination and Feature Selection on Sybil User Data using Recursive Feature Elimination

2019 ◽  
Vol 8 (9S4) ◽  
pp. 48-56 ◽  
Keyword(s):  
Social Networks ◽  
Feature Selection ◽  
Online Social Networks ◽  
Nearest Neighbor ◽  
Classification Model ◽  
Recursive Feature Elimination ◽  
Support Vector ◽  
Actual Behavior ◽  
Features Selection ◽  
K Nearest Neighbor

Machine Learning (ML) research greatly helps in predicting model-based outcomes with high levels of accuracy based upon the training and testing of the models through the datasets. The social networks constitute one of the domains where ML can be used effectively to ensure the authenticity and security of the valid users. With the increase in usage of Online Social Networks (OSNs), the cases of spam and malicious activities can be found in abundance and Sybil nodes pose one such kind of safety and security hazard. Sybil account detection is not an easy task since they mimic the actual behavior of human accounts up to a great extent. In this paper, we look at one such scenario of Sybil accounts on the OSN, Twitter where machine leaning models have been used to train the machine with the existing datasets so as to be able to detect these malicious users before they can bring harm to the normal communication of the genuine users. Since the datasets used are so vast, the process of feature selection has been carried on the datasets as part of pre-processing before the actual classification as it assists in enhancing the model performance. Support Vector Machine–Recursive Feature Elimination (SVM-RFE) and Logistic Regression–Recursive Feature Elimination (LR-RFE) techniques have been used in this study for the selection of significant features. The classification model is trained on the selected features using Random Forest (RF) and K-Nearest Neighbor (KNN) algorithms. We also analyzed the biasing effects of fake accounts on the human accounts datasets during the process of features selection and classification. It has been shown that the RF algorithm outperformed KNN on the feature sets selected through SVM-RFE and LR-RFE.

Sign in / Sign up

Export Citation Format

Share Document