scholarly journals Hybrid Neuro-Fuzzy Classification Algorithm for Social Network

2019 ◽  
Vol 8 (6) ◽  
pp. 2434-2437
Keyword(s):  
Social Network ◽  
Link Prediction ◽  
Training Data ◽  
Fuzzy Classification ◽  
Membership Functions ◽  
Output Surface ◽  
Neuro Fuzzy ◽  
The Social ◽  
Testing Error ◽  
Generation Rule

People tend to build and maintain their friendship relying on SNS nowadays. Thus, the problem of how to organize the social network accurately and automatically. In this paper, a hybrid neuro-fuzzy approach is used. . Many aspect impact the error values like input/output, membership functions, the training data arrays, and the number of epochs needed to train the model. This paper is based on hybrid Neuro-Fuzzy concept for testing the link prediction for facebook data. We use Matlab to calculate average testing Error, View Generation Rule, Output Surface.

scholarly journals Group Relationship Mining of College Students Based on Predictive Social Network

2022 ◽  
Vol 2022 ◽  
pp. 1-9
Author(s):  
Huazhang Liu
Keyword(s):  
College Students ◽  
Social Networks ◽  
Social Network ◽  
Complex Network ◽  
Link Prediction ◽  
Rapid Development ◽  
Combination Method ◽  
Prediction Algorithm ◽  
The Social ◽  
Random Block

With the rapid development of the Internet, social networks have shown an unprecedented development trend among college students. Closer social activities among college students have led to the emergence of college students with new social characteristics. The traditional method of college students’ group classification can no longer meet the current demand. Therefore, this paper proposes a social network link prediction method-combination algorithm, which combines neighbor information and a random block. By mining the social networks of college students’ group relationships, the classification of college students’ groups can be realized. Firstly, on the basis of complex network theory, the essential relationship of college student groups under a complex network is analyzed. Secondly, a new combination algorithm is proposed by using the simplest linear combination method to combine the proximity link prediction based on neighbor information and the likelihood analysis link prediction based on a random block. Finally, the proposed combination algorithm is verified by using the social data of college students’ networks. Experimental results show that, compared with the traditional link prediction algorithm, the proposed combination algorithm can effectively dig out the group characteristics of social networks and improve the accuracy of college students’ association classification.

A Novel Method to Dynamically Fix Threshold for Node Neighbourhood Based Link Prediction Techniques

2020 ◽  
Vol 15 (1) ◽  
pp. 17-34
Author(s):  
Anand Kumar Gupta ◽  
Neetu Sardana
Keyword(s):  
Social Network ◽  
Link Prediction ◽  
Binary Classification ◽  
Online Social Network ◽  
Threshold Value ◽  
Classification Problem ◽  
Similarity Score ◽  
The Social ◽  
Comparative Results ◽  
Prediction Techniques

The objective of an online social network is to amplify the stream of information among the users. This goal can be accomplished by maximizing interconnectivity among users using link prediction techniques. Existing link prediction techniques uses varied heuristics such as similarity score to predict possible connections. Link prediction can be considered a binary classification problem where probable class outcomes are presence and absence of connections. One of the challenges in classification is to decide threshold value. Since the social network is exceptionally dynamic in nature and each user possess different features, it is difficult to choose a static, common threshold which decides whether two non-connected users will form interconnectivity. This article proposes a novel technique, FIXT, that dynamically decides the threshold value for predicting the possibility of new link formation. The article evaluates the performance of FIXT with six baseline techniques. The comparative results depict that FIXT achieves accuracy up to 93% and outperforms baseline techniques.

Similarity-Based Indices or Metrics for Link Prediction

2019 ◽  
pp. 1-29
Author(s):  
Praveen Kumar Bhanodia ◽  
Kamal Kumar Sethi ◽  
Aditya Khamparia ◽  
Babita Pandey ◽  
Shaligram Prajapat
Keyword(s):  
Social Networks ◽  
Social Network ◽  
Link Prediction ◽  
Online Social Network ◽  
Dynamic Networks ◽  
Relevant Information ◽  
Network Evolution ◽  
Problem Instance ◽  
The Social ◽  
Social Network Evolution

Link prediction in social network has gained momentum with the inception of machine learning. The social networks are evolving into smart dynamic networks possessing various relevant information about the user. The relationship between users can be approximated by evaluation of similarity between the users. Online social network (OSN) refers to the formulation of association (relationship/links) between users known as nodes. Evolution of OSNs such as Facebook, Twitter, Hi-Fi, LinkedIn has provided a momentum to the growth of such social networks, whereby millions of users are joining it. The online social network evolution has motivated scientists and researchers to analyze the data and information of OSN in order to recommend the future friends. Link prediction is a problem instance of such recommendation systems. Link prediction is basically a phenomenon through which potential links between nodes are identified on a network over the period of time. In this chapter, the authors describe the similarity metrics that further would be instrumental in recognition of future links between nodes.

scholarly journals A Weight based Scheme for Improving the Accuracy of Relationship in Social Network

2019 ◽  
Vol 8 (11) ◽  
pp. 3040-3043 ◽  
Keyword(s):  
Social Media ◽  
Social Network ◽  
Link Prediction ◽  
Performance Metrics ◽  
Prediction Algorithm ◽  
Relationship Matrix ◽  
Community Network ◽  
The Social ◽  
Relationship Value ◽  
The Relationship

The usage of social media has become unavoidable in the last decade. The social media is highly dynamic in nature and grows rapidly. The community network offers a rich expedient of various data. The detection of communities is based on the frequency in the networks which is usually represented by graphs. The vertices (nodes) are representing the social actor and the edges (links) represent the relation between those actors. The community link detection is as hard as the graph increases up to millions of vertices and edges. The accuracy of link prediction for inferring missing (erased or broken) links is very complex due to the dynamic nature of links. The links are updated from time to time and the new links are established dynamically. As the links are appeared and disappeared dynamically, the accuracy of identifying the edges of the social network graph of the user is complex in nature. Many efforts have been put up in developing link prediction algorithms in the past, but still there is a lacuna in accuracy in predicting inferred / broken links. A weight based link prediction algorithm is proposed to improve the accuracy of the link prediction on inferred / broken links in the social media. In this method, a weight based link analysis is employed to quantify the relative value between two nodes in the community network. The correlation value for relationship is also determined over a period of time using the designed relationship matrix. The relationship value between the nodes is computed by a Euclidian distance approach. The relationship value of each node is determined by the relationship equation using weight values. The proposed approach is experimented in constrained environment for 2 users’ Facebook usages over a period of a year. The accuracy of relationship is used as performance metrics. The results shown that the accuracy is improved 2.35% more than random predictor method

Predicting investor funding behavior using crunchbase social network features

2016 ◽  
Vol 26 (1) ◽  
pp. 74-100 ◽  
Author(s):  
Yuxian Eugene Liang ◽  
Soe-Tsyr Daphne Yuan
Keyword(s):  
Social Network ◽  
Social Network Analysis ◽  
Network Analysis ◽  
Link Prediction ◽  
Social Relationship ◽  
Jaccard Coefficient ◽  
Network Graph ◽  
Content Type ◽  
The Social ◽  
Relationship Factors

Purpose – What makes investors tick? Largely counter-intuitive compared to the findings of most past research, this study explores the possibility that funding investors invest in companies based on social relationships, which could be positive or negative, similar or dissimilar. The purpose of this paper is to build a social network graph using data from CrunchBase, the largest public database with profiles about companies. The authors combine social network analysis with the study of investing behavior in order to explore how similarity between investors and companies affects investing behavior through social network analysis. Design/methodology/approach – This study crawls and analyzes data from CrunchBase and builds a social network graph which includes people, companies, social links and funding investment links. The problem is then formalized as a link (or relationship) prediction task in a social network to model and predict (across various machine learning methods and evaluation metrics) whether an investor will create a link to a company in the social network. Various link prediction techniques such as common neighbors, shortest path, Jaccard Coefficient and others are integrated to provide a holistic view of a social network and provide useful insights as to how a pair of nodes may be related (i.e., whether the investor will invest in the particular company at a time) within the social network. Findings – This study finds that funding investors are more likely to invest in a particular company if they have a stronger social relationship in terms of closeness, be it direct or indirect. At the same time, if investors and companies share too many common neighbors, investors are less likely to invest in such companies. Originality/value – The author’s study is among the first to use data from the largest public company profile database of CrunchBase as a social network for research purposes. The author ' s also identify certain social relationship factors that can help prescribe the investor funding behavior. Authors prediction strategy based on these factors and modeling it as a link prediction problem generally works well across the most prominent learning algorithms and perform well in terms of aggregate performance as well as individual industries. In other words, this study would like to encourage companies to focus on social relationship factors in addition to other factors when seeking external funding investments.

The social network

2013 ◽  
Vol 44 (2) ◽  
pp. 22
Author(s):  
ALAN ROCKOFF
Keyword(s):  
Social Network ◽  
The Social

The Multilevel p2 Model

Methodology ◽  
2006 ◽  
Vol 2 (1) ◽  
pp. 42-47 ◽  
Author(s):  
Bonne J. H. Zijlstra ◽  
Marijtje A. J. van Duijn ◽  
Tom A. B. Snijders
Keyword(s):  
Social Network ◽  
Network Data ◽  
Mcmc Algorithm ◽  
Independent Observation ◽  
Single Observation ◽  
Multiple Networks ◽  
Social Network Data ◽  
Multiple Observations ◽  
Practical Support ◽  
The Social

The p 2 model is a random effects model with covariates for the analysis of binary directed social network data coming from a single observation of a social network. Here, a multilevel variant of the p 2 model is proposed for the case of multiple observations of social networks, for example, in a sample of schools. The multilevel p 2 model defines an identical p 2 model for each independent observation of the social network, where parameters are allowed to vary across the multiple networks. The multilevel p 2 model is estimated with a Bayesian Markov Chain Monte Carlo (MCMC) algorithm that was implemented in free software for the statistical analysis of complete social network data, called StOCNET. The new model is illustrated with a study on the received practical support by Dutch high school pupils of different ethnic backgrounds.

ПРАГМАТИЧНИЙ ПОТЕНЦІАЛ НАТИВНОЇ РЕКЛАМИ: ФОРМИ, ТРЕНДИ (НА ПРИКЛАДІ НАТИВНОГО КОНТЕНТУ В СОЦІАЛЬНІЙ МЕРЕЖІ FACEBOOK ЩОДО БРЕНДА ФАКУЛЬТЕТУ ЖУРНАЛІСТИКИ ЗНУ)

2020 ◽  
pp. 113
Author(s):  
V. Kovpak ◽  
N. Trotsenko
Keyword(s):  
Social Network ◽  
Professional Training ◽  
Educational Process ◽  
Communication Strategy ◽  
Student Centered ◽  
Teacher Student ◽  
The Social ◽  
National University ◽  
High Level ◽  
The Impact

<div><p><em>The article analyzes the peculiarities of the format of native advertising in the media space, its pragmatic potential (in particular, on the example of native content in the social network Facebook by the brand of the journalism department of ZNU), highlights the types and trends of native advertising. The following research methods were used to achieve the purpose of intelligence: descriptive (content content, including various examples), comparative (content presentation options) and typological (types, trends of native advertising, in particular, cross-media as an opportunity to submit content in different formats (video, audio, photos, text, infographics, etc.)), content analysis method using Internet services (using Popsters service). And the native code for analytics was the page of the journalism department of Zaporizhzhya National University on the social network Facebook. After all, the brand of the journalism department of Zaporozhye National University in 2019 celebrates its 15th anniversary. The brand vector is its value component and professional training with balanced distribution of theoretical and practical blocks (seven practices), student-centered (democratic interaction and high-level teacher-student dialogue) and integration into Ukrainian and world educational process (participation in grant programs).</em></p></div><p><em>And advertising on social networks is also a kind of native content, which does not appear in special blocks, and is organically inscribed on one page or another and unobtrusively offers, just remembering the product as if «to the word». Popsters service functionality, which evaluates an account (or linked accounts of one person) for 35 parameters, but the main three areas: reach or influence, or how many users evaluate, comment on the recording; true reach – the number of people affected; network score – an assessment of the audience’s response to the impact, or how far the network information diverges (how many share information on this page).</em></p><p><strong><em>Key words:</em></strong><em> nativeness, native advertising, branded content, special project, communication strategy.</em></p>

Sign in / Sign up

Export Citation Format

Share Document