期刊文献+
共找到42篇文章
< 1 2 3 >
每页显示 20 50 100
Model and service for privacy in decentralized online social networks
1
作者 George Pacheco Pinto JoséRonaldo Leles Jr +3 位作者 Cíntia da Costa Souza Paulo Rde Souza Frederico Araújo Durão Cássio Prazeres 《Journal of Electronic Science and Technology》 2025年第1期76-97,共22页
Intensely using online social networks(OSNs)makes users concerned about privacy of data.Given the centralized nature of these platforms,and since each platform has a particular storage mechanism,authentication,and acc... Intensely using online social networks(OSNs)makes users concerned about privacy of data.Given the centralized nature of these platforms,and since each platform has a particular storage mechanism,authentication,and access control,their users do not have the control and the right over their data.Therefore,users cannot easily switch between similar platforms or transfer data from one platform to another.These issues imply,among other things,a threat to privacy since such users depend on the interests of the service provider responsible for administering OSNs.As a strategy for the decentralization of the OSNs and,consequently,as a solution to the privacy problems in these environments,the so-called decentralized online social networks(DOSNs)have emerged.Unlike OSNs,DOSNs are decentralized content management platforms because they do not use centralized service providers.Although DOSNs address some of the privacy issues encountered in OSNs,DOSNs also pose significant challenges to consider,for example,access control to user profile information with high granularity.This work proposes developing an ontological model and a service to support privacy in DOSNs.The model describes the main concepts of privacy access control in DOSNs and their relationships.In addition,the service will consume the model to apply access control according to the policies represented in the model.Our model was evaluated in two phases to verify its compliance with the proposed domain.Finally,we evaluated our service with a performance evaluation,and the results were satisfactory concerning the response time of access control requests. 展开更多
关键词 Access control Decentralized online social network ONTOLOGY PRIVACY
在线阅读 下载PDF
CRB:A new rumor blocking algorithm in online social networks based on competitive spreading model and influence maximization 被引量:1
2
作者 董晨 徐桂琼 孟蕾 《Chinese Physics B》 SCIE EI CAS CSCD 2024年第8期588-604,共17页
The virtuality and openness of online social platforms make networks a hotbed for the rapid propagation of various rumors.In order to block the outbreak of rumor,one of the most effective containment measures is sprea... The virtuality and openness of online social platforms make networks a hotbed for the rapid propagation of various rumors.In order to block the outbreak of rumor,one of the most effective containment measures is spreading positive information to counterbalance the diffusion of rumor.The spreading mechanism of rumors and effective suppression strategies are significant and challenging research issues.Firstly,in order to simulate the dissemination of multiple types of information,we propose a competitive linear threshold model with state transition(CLTST)to describe the spreading process of rumor and anti-rumor in the same network.Subsequently,we put forward a community-based rumor blocking(CRB)algorithm based on influence maximization theory in social networks.Its crucial step is to identify a set of influential seeds that propagate anti-rumor information to other nodes,which includes community detection,selection of candidate anti-rumor seeds and generation of anti-rumor seed set.Under the CLTST model,the CRB algorithm has been compared with six state-of-the-art algorithms on nine online social networks to verify the performance.Experimental results show that the proposed model can better reflect the process of rumor propagation,and review the propagation mechanism of rumor and anti-rumor in online social networks.Moreover,the proposed CRB algorithm has better performance in weakening the rumor dissemination ability,which can select anti-rumor seeds in networks more accurately and achieve better performance in influence spread,sensitivity analysis,seeds distribution and running time. 展开更多
关键词 online social networks rumor blocking competitive linear threshold model influence maximization
原文传递
SEIR Model of Rumor Spreading in Online Social Network with Varying Total Population Size 被引量:7
3
作者 董苏雅拉图 邓燕斌 黄永畅 《Communications in Theoretical Physics》 SCIE CAS CSCD 2017年第10期545-552,共8页
Based on the infectious disease model with disease latency, this paper proposes a new model for the rumor spreading process in online social network. In this paper what we establish an SEIR rumor spreading model to de... Based on the infectious disease model with disease latency, this paper proposes a new model for the rumor spreading process in online social network. In this paper what we establish an SEIR rumor spreading model to describe the online social network with varying total number of users and user deactivation rate. We calculate the exact equilibrium points and reproduction number for this model. Furthermore, we perform the rumor spreading process in the online social network with increasing population size based on the original real world Facebook network. The simulation results indicate that the SEIR model of rumor spreading in online social network with changing total number of users can accurately reveal the inherent characteristics of rumor spreading process in online social network. 展开更多
关键词 online social network rumor spreading model equilibrium point varying population size
原文传递
Modeling online social networks based on preferential linking 被引量:2
4
作者 胡海波 郭进利 陈骏 《Chinese Physics B》 SCIE EI CAS CSCD 2012年第11期573-578,共6页
We study the phenomena of preferential linking in a large-scale evolving online social network and find that the linear preference holds for preferential creation, preferential acceptance, and preferential attachment.... We study the phenomena of preferential linking in a large-scale evolving online social network and find that the linear preference holds for preferential creation, preferential acceptance, and preferential attachment. Based on the linear preference, we propose an analyzable model, which illustrates the mechanism of network growth and reproduces the process of network evolution. Our simulations demonstrate that the degree distribution of the network produced by the model is in good agreement with that of the real network. This work provides a possible bridge between the micro=mechanisms of network growth and the macrostructures of online social networks. 展开更多
关键词 online social network preferential linking MODEL power law
原文传递
ED-SWE:Event detection based on scoring and word embedding in online social networks for the internet of people 被引量:2
5
作者 Xiang Sun Lu Liu +1 位作者 Ayodeji Ayorinde John Panneerselvam 《Digital Communications and Networks》 SCIE CSCD 2021年第4期559-569,共11页
Online social media networks are gaining attention worldwide,with an increasing number of people relying on them to connect,communicate and share their daily pertinent event-related information.Event detection is now ... Online social media networks are gaining attention worldwide,with an increasing number of people relying on them to connect,communicate and share their daily pertinent event-related information.Event detection is now increasingly leveraging online social networks for highlighting events happening around the world via the Internet of People.In this paper,a novel Event Detection model based on Scoring and Word Embedding(ED-SWE)is proposed for discovering key events from a large volume of data streams of tweets and for generating an event summary using keywords and top-k tweets.The proposed ED-SWE model can distill high-quality tweets,reduce the negative impact of the advent of spam,and identify latent events in the data streams automatically.Moreover,a word embedding algorithm is used to learn a real-valued vector representation for a predefined fixed-sized vocabulary from a corpus of Twitter data.In order to further improve the performance of the Expectation-Maximization(EM)iteration algorithm,a novel initialization method based on the authority values of the tweets is also proposed in this paper to detect live events efficiently and precisely.Finally,a novel automatic identification method based on the cosine measure is used to automatically evaluate whether a given topic can form a live event.Experiments conducted on a real-world dataset demonstrate that the ED-SWE model exhibits better efficiency and accuracy than several state-of-art event detection models. 展开更多
关键词 Internet of people Hyperlink-induced topic search Event detection online social networks
在线阅读 下载PDF
A Personalized Search Model Using Online Social Network Data Based on a Holonic Multiagent System 被引量:2
6
作者 Meijia Wang Qingshan Li Yishuai Lin 《China Communications》 SCIE CSCD 2020年第2期176-205,共30页
Personalized search utilizes user preferences to optimize search results,and most existing studies obtain user preferences by analyzing user behaviors in search engines that provide click-through data.However,the beha... Personalized search utilizes user preferences to optimize search results,and most existing studies obtain user preferences by analyzing user behaviors in search engines that provide click-through data.However,the behavioral data are noisy because users often clicked some irrelevant documents to find their required information,and the new user cold start issue represents a serious problem,greatly reducing the performance of personalized search.This paper attempts to utilize online social network data to obtain user preferences that can be used to personalize search results,mine the knowledge of user interests,user influence and user relationships from online social networks,and use this knowledge to optimize the results returned by search engines.The proposed model is based on a holonic multiagent system that improves the adaptability and scalability of the model.The experimental results show that utilizing online social network data to implement personalized search is feasible and that online social network data are significant for personalized search. 展开更多
关键词 personalized search online social network holonic multiagent system
在线阅读 下载PDF
Discrete Opinion Dynamics on Online Social Networks
7
作者 胡艳丽 白亮 张维明 《Communications in Theoretical Physics》 SCIE CAS CSCD 2013年第1期53-58,共6页
This paper focuses on the dynamics of binary opinions {+1,-1} on online social networks consisting of heterogeneous actors. In our model, actors update their opinions under the interplay of social influence and self-... This paper focuses on the dynamics of binary opinions {+1,-1} on online social networks consisting of heterogeneous actors. In our model, actors update their opinions under the interplay of social influence and self- affirmation, which leads to rich dynamical behaviors on online social networks. We find that the opinion leading to the consensus features an advantage of the initially weighted fraction based on actors' strength over the other, instead of the population. For the role of specific actors, the consensus converges towards the opinion that a small fraction of high-strength actors hold, and individual diversity of self-amrmation slows down the ordering process of consensus. These indicate that high-strength actors play an essential role in opinion formation with strong social influence as well as high persistence. Further investigations show that the initial fraction of high-strength actors to dominate the evolution depends on the heterogeneity of the strength distribution, and less high-strength actors are needed in the case of a smaller exponent of power-law distribution of actors' strength. Our study provides deep insights into the role of social influence and self-affirmation on opinion formation on online social networks. 展开更多
关键词 opinion dynamics social influence SELF-AFFIRMATION online social networks
原文传递
Effect of Online Social Networking on Emotional Status and Its Interaction with Offline Reality during the Early Stage of the COVID-19 Pandemic in China
8
作者 Xiaolin Lu Xiaolei Miao 《International Journal of Mental Health Promotion》 2023年第9期1041-1052,共12页
Background:During the early stages of the COVID-19 pandemic in China,social interactions shifted to online spaces due to lockdowns and social distancing measures.As a result,the impact of online social networking on u... Background:During the early stages of the COVID-19 pandemic in China,social interactions shifted to online spaces due to lockdowns and social distancing measures.As a result,the impact of online social networking on users’emotional status has become stronger than ever.This study examines the association between online social networking and Internet users’emotional status and how offline reality affects this relationship.Methods:The study utilizes cross-sectional online survey data(n=3004)and Baidu Migration big data from the first 3 months of the pandemic.Two dimensions of online networking are measured:social support and information sources.Results:First,individuals’online social support(β=0.16,p<0.05)and information sources(β=0.08,p<0.01)are both positively associated to their emotional status during the epidemic.Second,these positive associations are moderated by social status and provincial pandemic control interventions.With regards to the moderation effect of social status,the constructive impact of information sources on emotional well-being is more pronounced among individuals from vulnerable groups compared to those who are not.With regard to the moderation effect of provincial interventions,online social support has the potential to alleviate the adverse repercussions of high rates of confirmed COVID-19 cases and strict lockdown measures while simultaneously augmenting the favorable effects of recovery.Conclusion:The various dimensions of social networking exert distinct effects on emotional status through diverse mechanisms,all of which must be taken into account when designing and adapting pandemic-control interventions. 展开更多
关键词 COVID-19 emotional status online social networking social support information sources
在线阅读 下载PDF
Malicious Activities Prediction Over Online Social Networking Using Ensemble Model
9
作者 S.Sadhasivam P.Valarmathie K.Dinakaran 《Intelligent Automation & Soft Computing》 SCIE 2023年第4期461-479,共19页
With the vast advancements in Information Technology,the emergence of Online Social Networking(OSN)has also hit its peak and captured the atten-tion of the young generation people.The clone intends to replicate the us... With the vast advancements in Information Technology,the emergence of Online Social Networking(OSN)has also hit its peak and captured the atten-tion of the young generation people.The clone intends to replicate the users and inject massive malicious activities that pose a crucial security threat to the original user.However,the attackers also target this height of OSN utilization,explicitly creating the clones of the user’s account.Various clone detection mechanisms are designed based on social-network activities.For instance,monitoring the occur-rence of clone edges is done to restrict the generation of clone activities.However,this assumption is unsuitable for a real-time environment and works optimally during the simulation process.This research concentrates on modeling and effi-cient clone prediction and avoidance methods to help the social network activists and the victims enhance the clone prediction accuracy.This model does not rely on assumptions.Here,an ensemble Adaptive Random Subspace is used for clas-sifying the clone victims with k-Nearest Neighbour(k-NN)as a base classifier.The weighted clone nodes are analysed using the weighted graph theory concept based on the classified results.When the weighted node’s threshold value is high-er,the trust establishment is terminated,and the clones are ranked and sorted in the higher place for termination.Thus,the victims are alert to the clone propaga-tion over the online social networking end,and the validation is done using the MATLAB 2020a simulation environment.The model shows a better trade-off than existing approaches like Random Forest(RF),Naïve Bayes(NB),and the standard graph model.Various performance metrics like True Positive Rate(TPR),False Alarm Rate(FAR),Recall,Precision,F-measure,and ROC and run time analysis are evaluated to show the significance of the model. 展开更多
关键词 online social network decision tree weighted measure clone attack predictive measures
在线阅读 下载PDF
Identification of Influential Users in Online Social Network: A Brief Overview
10
作者 Mahmuda Ferdous Md. Musfique Anwar 《Journal of Computer and Communications》 2023年第7期58-73,共16页
Information networks where users join a network, publish their own content, and create links to other users are called Online Social Networks (OSNs). Nowadays, OSNs have become one of the major platforms to promote bo... Information networks where users join a network, publish their own content, and create links to other users are called Online Social Networks (OSNs). Nowadays, OSNs have become one of the major platforms to promote both new and viral applications as well as disseminate information. Social network analysis is the study of these information networks that leads to uncovering patterns of interaction among the entities. In this regard, finding influential users in OSNs is very important as they play a key role in the success above phenomena. Various approaches exist to detect influential users in OSNs, starting from simply counting the immediate neighbors to more complex machine-learning and message-passing techniques. In this paper, we review the recent existing research works that focused on identifying influential users in OSNs. 展开更多
关键词 online Social network Trending Topics Social Influence Influential User
在线阅读 下载PDF
Analysis of the Characteristics and Model of Online Social Network Information Dissemination
11
作者 DANG Yan 《International English Education Research》 2016年第12期18-21,共4页
Online social network is increasingly showing a significant impact and role in many areas of social life. In the study of online social network related issues have become the consensus of the academic and industrial c... Online social network is increasingly showing a significant impact and role in many areas of social life. In the study of online social network related issues have become the consensus of the academic and industrial communities and the urgent need for. This paper mainly studies the problem of information dissemination in social network, the mode of communication, behavior, propagation paths and propagation characteristics are studied, and take the Tencent micro-blog as an example, based on the analysis of many examples, several main models and characteristics of information dissemination in social network platform. 展开更多
关键词 online social network information dissemination Information dissemination characteristic: Information dissemination model
在线阅读 下载PDF
An Efficient Deep Learning-Based Hybrid Framework for Personality Trait Prediction through Behavioral Analysis
12
作者 Nareshkumar Raveendhran Nimala Krishnan 《Computers, Materials & Continua》 2025年第11期3253-3265,共13页
Social media outlets deliver customers a medium for communication,exchange,and expression of their thoughts with others.The advent of social networks and the fast escalation of the quantity of data have created opport... Social media outlets deliver customers a medium for communication,exchange,and expression of their thoughts with others.The advent of social networks and the fast escalation of the quantity of data have created opportunities for textual evaluation.Utilising the user corpus,characteristics of social platform users,and other data,academic research may accurately discern the personality traits of users.This research examines the traits of consumer personalities.Usually,personality tests administered by psychological experts via interviews or self-report questionnaires are costly,time-consuming,complex,and labour-intensive.Currently,academics in computational linguistics are increasingly focused on predicting personality traits from social media data.An individual’s personality comprises their traits and behavioral habits.To address this distinction,we propose a novel LSTMapproach(BERT-LIWC-LSTM)that simultaneously incorporates users’enduring and immediate personality characteristics for textual personality recognition.Long-termPersonality Encoding in the proposed paradigmcaptures and represents persisting personality traits.Short-termPersonality Capturing records changing personality states.Experimental results demonstrate that the designed BERT-LIWC-LSTM model achieves an average improvement in accuracy of 3.41% on the Big Five dataset compared to current methods,thereby justifying the efficacy of encoding both stable and dynamic personality traits simultaneously through long-and short-term feature interaction. 展开更多
关键词 PERSONALITY deep learning online social network LSTM big five
在线阅读 下载PDF
IPSA:A Multi-View Perception Model for Information Propagation in Online Social Networks
13
作者 Huiyu Min Jiuxin Cao +1 位作者 Tao Zhou Qing Meng 《Big Data Mining and Analytics》 2025年第1期241-256,共16页
A thorough understanding of the information dissemination process in Online Social Networks (OSNs) is crucial for enhancing user behavior analysis. While recent studies usually focus on assessing the emotional intensi... A thorough understanding of the information dissemination process in Online Social Networks (OSNs) is crucial for enhancing user behavior analysis. While recent studies usually focus on assessing the emotional intensity of individual tweets or predicting their popularity, they frequently overlook how these tweets impact sentiment trends over time. The explosive and inflammatory nature of deliberate tweets is difficult to perceive by prediction or sentiment methods. To address this gap, we propose the multi-view Information Propagation State Awareness (IPSA) model, which aims to simultaneously assess and forecast both the popularity and sentiment strength throughout the information propagation process. Our approach begins by segmenting the information propagation into distinct time windows. Within each window, the IPSA model designs an encoder module to capture multi-view influence factors from structure, content, and time series data. Specifically, the encoder module includes a graph encoder layer based on graph attention networks to represent the backbone propagation structure formed by key nodes in the reply chain. Meanwhile, the sentiment encoder layer, utilizing an attention mechanism, extracts emotional factors present in the reply chain. Besides, we introduce a residual information prediction method that enhances the model’s precision in perceiving both popularity and sentiment intensity for each time window. Our comparative experiments, conducted on two datasets and benchmarked against State-of-the-Art (SOTA) methods, demonstrate that the IPSA model excels in predicting popularity and assessing future emotional trends in information propagation. 展开更多
关键词 information propagating state popularity prediction sentiment intensity online social networks
原文传递
UAV Online Path Planning Algorithm in a Low Altitude Dangerous Environment 被引量:18
14
作者 Naifeng Wen Lingling Zhao +1 位作者 Xiaohong Su Peijun Ma 《IEEE/CAA Journal of Automatica Sinica》 SCIE EI 2015年第2期173-185,共13页
UAV online path-planning in a low altitude dangerous environment with dense obstacles, static threats (STs) and dynamic threats (DTs), is a complicated, dynamic, uncertain and real-time problem. We propose a novel met... UAV online path-planning in a low altitude dangerous environment with dense obstacles, static threats (STs) and dynamic threats (DTs), is a complicated, dynamic, uncertain and real-time problem. We propose a novel method to solve the problem to get a feasible and safe path. Firstly STs are modeled based on intuitionistic fuzzy set (IFS) to express the uncertainties in STs. The methods for ST assessment and synthesizing are presented. A reachability set (RS) estimator of DT is developed based on rapidly-exploring random tree (RRT) to predict the threat of DT. Secondly a subgoal selector is proposed and integrated into the planning system to decrease the cost of planning, accelerate the path searching and reduce threats on a path. Receding horizon (RH) is introduced to solve the online path planning problem in a dynamic and partially unknown environment. A local path planner is constructed by improving dynamic domain rapidly-exploring random tree (DDRRT) to deal with complex obstacles. RRT∗ is embedded into the planner to optimize paths. The results of Monte Carlo simulation comparing the traditional methods prove that our algorithm behaves well on online path planning with high successful penetration probability. © 2014 Chinese Association of Automation. 展开更多
关键词 ALGORITHMS FORESTRY Fuzzy sets Intelligent systems Monte Carlo methods Problem solving Social networking (online)
在线阅读 下载PDF
Modeling Reading and Replying Activities in a BBS Social Network 被引量:1
15
作者 Fei Ding Yun Liu Bo Shen Hui Cheng 《Journal of Electronic Science and Technology》 CAS 2010年第4期300-306,共7页
This paper is devoted to analyze and model user reading and replying activities in a bulletin board system (BBS) social network. By analyzing the data set from a famous Chinese BBS social network, we show how some u... This paper is devoted to analyze and model user reading and replying activities in a bulletin board system (BBS) social network. By analyzing the data set from a famous Chinese BBS social network, we show how some user activities distribute, and reveal several important features that might characterize user dynamics. We propose a method to model user activities in the BBS social network. The model could reproduce power-law and non-power-law distributions of user activities at the same time. Our results show that user reading and replying activities could be simulated through simple agent-based models. Specifically, manners of how the BBS server interacts with Internet users in the Web 2.0 application, how users organize their reading lists, and how user behavioral trait distributes are the important factors in the formation of activity patterns. 展开更多
关键词 Agent based modeling bulletin boardsystem data analysis online social network.
在线阅读 下载PDF
Spotted Hyena Optimizer with Deep Learning Driven Cybersecurity for Social Networks
16
作者 Anwer Mustafa Hilal Aisha Hassan Abdalla Hashim +5 位作者 Heba G.Mohamed Lubna A.Alharbi Mohamed K.Nour Abdullah Mohamed Ahmed S.Almasoud Abdelwahed Motwakel 《Computer Systems Science & Engineering》 SCIE EI 2023年第5期2033-2047,共15页
Recent developments on Internet and social networking have led to the growth of aggressive language and hate speech.Online provocation,abuses,and attacks are widely termed cyberbullying(CB).The massive quantity of use... Recent developments on Internet and social networking have led to the growth of aggressive language and hate speech.Online provocation,abuses,and attacks are widely termed cyberbullying(CB).The massive quantity of user generated content makes it difficult to recognize CB.Current advancements in machine learning(ML),deep learning(DL),and natural language processing(NLP)tools enable to detect and classify CB in social networks.In this view,this study introduces a spotted hyena optimizer with deep learning driven cybersecurity(SHODLCS)model for OSN.The presented SHODLCS model intends to accomplish cybersecurity from the identification of CB in the OSN.For achieving this,the SHODLCS model involves data pre-processing and TF-IDF based feature extraction.In addition,the cascaded recurrent neural network(CRNN)model is applied for the identification and classification of CB.Finally,the SHO algorithm is exploited to optimally tune the hyperparameters involved in the CRNN model and thereby results in enhanced classifier performance.The experimental validation of the SHODLCS model on the benchmark dataset portrayed the better outcomes of the SHODLCS model over the recent approaches. 展开更多
关键词 CYBERSECURITY CYBERBULLYING online social network deep learning spotted hyena optimizer
在线阅读 下载PDF
Generalized Jaccard Similarity Based Recurrent DNN for Virtualizing Social Network Communities
17
作者 R.Gnanakumari P.Vijayalakshmi 《Intelligent Automation & Soft Computing》 SCIE 2023年第6期2719-2730,共12页
In social data analytics,Virtual Community(VC)detection is a primary challenge in discovering user relationships and enhancing social recommenda-tions.VC formation is used for personal interaction between communities.... In social data analytics,Virtual Community(VC)detection is a primary challenge in discovering user relationships and enhancing social recommenda-tions.VC formation is used for personal interaction between communities.But the usual methods didn’t find the Suspicious Behaviour(SB)needed to make a VC.The Generalized Jaccard Suspicious Behavior Similarity-based Recurrent Deep Neural Network Classification and Ranking(GJSBS-RDNNCR)Model addresses these issues.The GJSBS-RDNNCR model comprises four layers for VC formation in Social Networks(SN).In the GJSBS-RDNNCR model,the SN is given as an input at the input layer.After that,the User’s Behaviors(UB)are extracted in the first Hidden Layer(HL),and the Generalized Jaccard Similarity coefficient calculates the similarity value at the second HL based on the SB.In the third HL,the similarity values are examined,and SB tendency is classified using the Activation Function(AF)in the Output Layer(OL).Finally,the ranking process is performed with classified users in SN and their SB.Results analysis is performed with metrics such as Classification Accuracy(CA),Time Complexity(TC),and False Positive Rate(FPR).The experimental setup consid-ers 250 tweet users from the dataset to identify the SBs of users. 展开更多
关键词 online social networks deep learning misbehaviors recurrent network GJS
在线阅读 下载PDF
Towards understanding bogus traffic service in online social networks
18
作者 Ping HE Xuhong ZHANG +2 位作者 Changting LIN Ting WANG Shouling JI 《Frontiers of Information Technology & Electronic Engineering》 SCIE EI CSCD 2024年第3期415-431,共17页
Critical functionality and huge infuence of the hot trend/topic page(HTP)in microblogging sites have driven the creation of a new kind of underground service called the bogus traffic service(BTS).BTS provides a kind o... Critical functionality and huge infuence of the hot trend/topic page(HTP)in microblogging sites have driven the creation of a new kind of underground service called the bogus traffic service(BTS).BTS provides a kind of illegal service which hijacks the HTP by pushing the controlled topics into it for malicious customers with the goal of guiding public opinions.To hijack HTP,the agents of BTS maintain an army of black-market accounts called bogus trafic accounts(BTAs)and control BTAs to generate a burst of fake trafic by massively retweeting the tweets containing the customer desired topic(hashtag).Although this service has been extensively exploited by malicious customers,little has been done to understand it.In this paper,we conduct a systematic measurement study of the BTS.We first investigate and collect 125 BTS agents from a variety of sources and set up a honey pot account to capture BTAs from these agents.We then build a BTA detector that detects 162218 BTAs from Weibo,the largest Chinese microblogging site,with a precision of 94.5%.We further use them as a bridge to uncover 296916 topics that might be involved in bogus trafic.Finally,we uncover the operating mechanism from the perspectives of the attack cycle and the attack entity.The highlights of our findings include the temporal attack patterns and intelligent evasion tactics of the BTAs.These findings bring BTS into the spotlight.Our work will help in understanding and ultimately eliminating this threat. 展开更多
关键词 online social networks MEASUREMENT Bogus traffic Black market
原文传递
A deep decentralized privacy-preservation framework for online social networks
19
作者 Samuel Akwasi Frimpong Mu Han +3 位作者 Emmanuel Kwame Effah Joseph Kwame Adjei Isaac Hanson Percy Brown 《Blockchain(Research and Applications)》 2024年第4期163-174,共12页
This paper addresses the critical challenge of privacy in Online Social Networks(OSNs),where centralized designs compromise user privacy.We propose a novel privacy-preservation framework that integrates blockchain tec... This paper addresses the critical challenge of privacy in Online Social Networks(OSNs),where centralized designs compromise user privacy.We propose a novel privacy-preservation framework that integrates blockchain technology with deep learning to overcome these vulnerabilities.Our methodology employs a two-tier architecture:the first tier uses an elitism-enhanced Particle Swarm Optimization and Gravitational Search Algorithm(ePSOGSA)for optimizing feature selection,while the second tier employs an enhanced Non-symmetric Deep Autoencoder(e-NDAE)for anomaly detection.Additionally,a blockchain network secures users’data via smart contracts,ensuring robust data protection.When tested on the NSL-KDD dataset,our framework achieves 98.79%accuracy,a 10%false alarm rate,and a 98.99%detection rate,surpassing existing methods.The integration of blockchain and deep learning not only enhances privacy protection in OSNs but also offers a scalable model for other applications requiring robust security measures. 展开更多
关键词 PREPROCESSING Privacy-preservation Blockchain Deep learning online social network
原文传递
Tag clustering algorithm LMMSK: improved K-means algorithm based on latent semantic analysis 被引量:7
20
作者 Jing Yang Jun Wang 《Journal of Systems Engineering and Electronics》 SCIE EI CSCD 2017年第2期374-384,共11页
With the wide application of Web-2.0 and social software, there are more and more tag-related studies and applications. Because of the randomness and the personalization in users' tagging, tag research continues t... With the wide application of Web-2.0 and social software, there are more and more tag-related studies and applications. Because of the randomness and the personalization in users' tagging, tag research continues to encounter data space and semantics obstacles. With the min-max similarity (MMS) to establish the initial centroids, the traditional K-means clustering algorithm is firstly improved to the MMSK-means clustering algorithm, the superiority of which has been tested; based on MMSK-means and combined with latent semantic analysis (LSA), here secondly emerges a new tag clustering algorithm, LMMSK. Finally, three algorithms for tag clustering, MMSK-means, tag clustering based on LSA (LSA-based algorithm) and LMMSK, have been run on Matlab, using a real tag-resource dataset obtained from the Delicious Social Bookmarking System from 2004 to 2009. LMMSK's clustering result turns out to be the most effective and the most accurate. Thus, a better tag-clustering algorithm is found for greater application of social tags in personalized search, topic identification or knowledge community discovery. In addition, for a better comparison of the clustering results, the clustering corresponding results matrix (CCR matrix) is proposed, which is promisingly expected to be an effective tool to capture the evolutions of the social tagging system. © 2017 Beijing Institute of Aerospace Information. 展开更多
关键词 Application programs Data mining MATLAB SEMANTICS Social networking (online) WEBSITES
在线阅读 下载PDF
上一页 1 2 3 下一页 到第
使用帮助 返回顶部