High order feature modelling of dynamic network nodes based on social network security

Author(s):  
Xiaoming Li ◽  
Guangquan Xu ◽  
Changzheng Liu ◽  
Wei Yu ◽  
Zhao Liu ◽  
...  
2014 ◽  
Vol 25 (10) ◽  
pp. 1450056 ◽  
Author(s):  
Ke-Ke Shang ◽  
Wei-Sheng Yan ◽  
Xiao-Ke Xu

Previously many studies on online social networks simply analyze the static topology in which the friend relationship once established, then the links and nodes will not disappear, but this kind of static topology may not accurately reflect temporal interactions on online social services. In this study, we define four types of users and interactions in the interaction (dynamic) network. We found that active, disappeared, new and super nodes (users) have obviously different strength distribution properties and this result also can be revealed by the degree characteristics of the unweighted interaction and friendship (static) networks. However, the active, disappeared, new and super links (interactions) only can be reflected by the strength distribution in the weighted interaction network. This result indicates the limitation of the static topology data on analyzing social network evolutions. In addition, our study uncovers the approximately stable statistics for the dynamic social network in which there are a large variation for users and interaction intensity. Our findings not only verify the correctness of our definitions, but also helped to study the customer churn and evaluate the commercial value of valuable customers in online social networks.


Author(s):  
Chanintorn Jittawiriyanukoon

<span>To secure a wealth of data traversing the computer network at your fingertips is compulsory. But when attack arises at various parts of the network it is difficult to protect, especially when each incident is investigated separately. Geography is a necessary construct in computer networks. The analytics of geography algorithms and metrics to curate insight from a security problem are a critical method of analysis for computer systems. A geography based representation is employed to highlight aspects (on a local and global level) of a security problem which are Eigenvalue, eccentricity, clustering coefficient and cliques. Network security model based on attack undirected geography (AUG) is familiarized. First, analysis based upon association rules is presented then the attack threshold value is set from AUG. The probability of an individual attack edge and associated network nodes are computed in order to quantify the security threat. The simulation is exploited to validate that results are effective.</span>


Author(s):  
Yingzi Jin ◽  
Yutaka Matsuo

Previous chapters focused on the models of static networks, which consider a relational network at a given point in time. However, real-world social networks are dynamic in nature; for example, friends of friends become friends. Social network research has, in recent years, paid increasing attention to dynamic and longitudinal network analysis in order to understand network evolution, belief formation, friendship formation, and so on. This chapter focuses mainly on the dynamics and evolutional patterns of social networks. The chapter introduces real-world applications and reviews major theories and models of dynamic network mining.


2013 ◽  
Vol 5 (2) ◽  
pp. 45-49
Author(s):  
Suha Hameed ◽  
Zahraa Muhsen ◽  
Salwa Alsamarai

Author(s):  
Neeraj Kumar ◽  
R. B. Patel

Wireless mobile adhoc network (MANET) is a dynamic network. Nodes in a MANET have high degree of mobility from one domain to another in a particular time interval. In such a dynamic network, security is a major concern. In this paper, the authors propose an inter domain agent based secure authorization and communication for mobile clients/nodes (MCs) in MANET. Mobile agents (MAs) are software programs that support the mobility of clients in different domain and provide necessary resources to the clients for safe execution. It also shares the key with MCs in different domains. An algorithm for secure authorization and communication between MCs having mobility in different domains is proposed. The scheme is evaluated on ns-2 w.r.t. metrics such as overall cost in terms of overhead generated, admission and traceability cost, and itinerary chosen by MAs w.r.t. mobility of MCs.


Author(s):  
Alessandro Muscoloni ◽  
Ilyes Abdelhamid ◽  
Julius L. Decano ◽  
Edwin Souza ◽  
Enrico Maiorino ◽  
...  

Many real complex systems present multilayer structure where high-order metadata on one layer refers to dyadic data on a lower layer. Significant progresses to analyse high-order metadata under the assumption of community organization have been done. However, there are no planted communities in real-world networks, and the necessity of new frameworks to analyze high-order metadata regardless of community organization has been raised.Here, we propose to adopt hyperedge organization. Predicting &lsquo;entanglements&rsquo; between a hyperedge and nodes scattered in the rest of the network might suggest structural or functional liaisons, without assumption of any community organization. We introduce a novel concept: hyperedge entanglement (HE), which associates to each hyperedge an entangled hyperedge, by means of a network operator that predicts significant &lsquo;interactions at distance&rsquo; between network nodes and existing hyperedges. We also introduce a new challenge termed hyperedge entanglement prediction (HEP), and an algorithm to perform this task. We evaluated HEP performance on social, biological and synthetic data where, given only topology and hyperedges (such as communities or functional modules), the goal is to predict whether nodes not connected to a certain hyperedge might be candidates for a significant entanglement. Finally, as real application in diseasome systems biomedicine, we perform HEP on the human protein interactome to predict unknown gene entanglements with the COPD disease gene hyperedge. HEP predictions are validated by biological experiments, enlarging our understanding of molecular mechanisms behind COPD/aneurysm comorbidity.


Sign in / Sign up

Export Citation Format

Share Document