scholarly journals Spheres of legislation: polarization and most influential nodes in behavioral context

2021 ◽  
Vol 8 (1) ◽  
Author(s):  
Andrew C. Phillips ◽  
Mohammad T. Irfan ◽  
Luca Ostertag-Hill
Keyword(s):  
Network Structure ◽  
Clustering Algorithms ◽  
Generative Models ◽  
Machine Learning Techniques ◽  
Centrality Measures ◽  
Behavioral Context ◽  
Real World Data ◽  
Game Theoretic ◽  
Influential Nodes ◽  
Structural Centrality

AbstractGame-theoretic models of influence in networks often assume the network structure to be static. In this paper, we allow the network structure to vary according to the underlying behavioral context. This leads to several interesting questions on two fronts. First, how do we identify different contexts and learn the corresponding network structures using real-world data? We focus on the U.S. Senate and apply unsupervised machine learning techniques, such as fuzzy clustering algorithms and generative models, to identify spheres of legislation as context and learn an influence network for each sphere. Second, how do we analyze these networks to gain an insight into the role played by the spheres of legislation in various interesting constructs like polarization and most influential nodes? To this end, we apply both game-theoretic and social network analysis techniques. In particular, we show that game-theoretic notion of most influential nodes brings out the strategic aspects of interactions like bipartisan grouping, which structural centrality measures fail to capture.

scholarly journals Spheres of Legislation: Polarization and Most Influential Nodes in Behavioral Context

2020 ◽  
Author(s):  
Andrew C. Phillips ◽  
Mohammad T. Irfan ◽  
Luca Ostertag-Hill
Keyword(s):  
Network Structure ◽  
Clustering Algorithms ◽  
Generative Models ◽  
Machine Learning Techniques ◽  
Centrality Measures ◽  
Behavioral Context ◽  
Real World Data ◽  
Game Theoretic ◽  
Influential Nodes ◽  
Structural Centrality

Abstract Game-theoretic models of influence in networks often assume the network structure to be static. In this paper, we allow the network structure to vary according to the underlying behavioral context. This leads to several interesting questions on two fronts. First, how do we identify different contexts and learn the corresponding network structures using real-world data? We focus on the U.S. Senate and apply unsupervised machine learning techniques, such as fuzzy clustering algorithms and generative models, to identify spheres of legislation as context and learn an influence network for each sphere. Second, how do we analyze these networks in order to gain an insight into the role played by the spheres of legislation in various interesting constructs like polarization and most influential nodes? To this end, we apply both game-theoretic and social network analysis techniques. In particular, we show that game-theoretic notion of most influential nodes brings out the strategic aspects of interactions like bipartisan grouping, which structural centrality measures fail to capture.

scholarly journals Spheres of Legislation: Polarization and Most Influential Nodes in Behavioral Context

2020 ◽  
Author(s):  
Andrew C Phillips ◽  
Mohammad T Irfan ◽  
Luca Ostertag-Hill
Keyword(s):  
Network Structure ◽  
Clustering Algorithms ◽  
Generative Models ◽  
Machine Learning Techniques ◽  
Centrality Measures ◽  
Behavioral Context ◽  
Real World Data ◽  
Game Theoretic ◽  
Influential Nodes ◽  
Structural Centrality

Abstract Game-theoretic models of influence in networks often assume the network structure to be static. In this paper, we allow the network structure to vary according to the underlying behavioral context. This leads to several interesting questions on two fronts. First, how do we identify different contexts and learn the corresponding network structures using real-world data? We focus on the U.S. Senate and apply unsupervised machine learning techniques, such as fuzzy clustering algorithms and generative models, to identify spheres of legislation as context and learn an influence network for each sphere. Second, how do we analyze these networks in order to gain an insight into the role played by the spheres of legislation in various interesting constructs like polarization and most influential nodes? To this end, we apply both game-theoretic and social network analysis techniques. In particular, we show that game-theoretic notion of most influential nodes brings out the strategic aspects of interactions like bipartisan grouping, which structural centrality measures fail to capture.

Influential nodes in planar trusses and meshes using centrality measures

2021 ◽  
Author(s):  
P. Sangeetha ◽  
R. Sundareswaran ◽  
M. Shanmugapriya ◽  
S. Srinidhi ◽  
K. Sowmya
Keyword(s):  
Centrality Measures ◽  
Influential Nodes

scholarly journals Time-ResNeXt for epilepsy recognition based on EEG signals in wireless networks

2020 ◽  
Vol 2020 (1) ◽  
Author(s):  
Shaoqiang Wang ◽  
Shudong Wang ◽  
Song Zhang ◽  
Yifan Wang
Keyword(s):  
Deep Learning ◽  
Network Structure ◽  
Signal Recognition ◽  
Eeg Signals ◽  
Real World Data ◽  
Data Set ◽  
Practical Applications ◽  
Epilepsy Diagnosis ◽  
Single Data ◽  
Electroencephalogram Eeg

Abstract To automatically detect dynamic EEG signals to reduce the time cost of epilepsy diagnosis. In the signal recognition of electroencephalogram (EEG) of epilepsy, traditional machine learning and statistical methods require manual feature labeling engineering in order to show excellent results on a single data set. And the artificially selected features may carry a bias, and cannot guarantee the validity and expansibility in real-world data. In practical applications, deep learning methods can release people from feature engineering to a certain extent. As long as the focus is on the expansion of data quality and quantity, the algorithm model can learn automatically to get better improvements. In addition, the deep learning method can also extract many features that are difficult for humans to perceive, thereby making the algorithm more robust. Based on the design idea of ResNeXt deep neural network, this paper designs a Time-ResNeXt network structure suitable for time series EEG epilepsy detection to identify EEG signals. The accuracy rate of Time-ResNeXt in the detection of EEG epilepsy can reach 91.50%. The Time-ResNeXt network structure produces extremely advanced performance on the benchmark dataset (Berne-Barcelona dataset) and has great potential for improving clinical practice.

Improved influential nodes identification in complex networks

2021 ◽  
pp. 1-9
Author(s):  
Shi Dong ◽  
Wengang Zhou
Keyword(s):  
Theoretical Analysis ◽  
Complex Networks ◽  
Network Structure ◽  
Information Entropy ◽  
Network System ◽  
Weighted Degree ◽  
Identification Methods ◽  
Hybrid Mechanism ◽  
Influential Nodes ◽  
Influential Node

Influential node identification plays an important role in optimizing network structure. Many measures and identification methods are proposed for this purpose. However, the current network system is more complex, the existing methods are difficult to deal with these networks. In this paper, several basic measures are introduced and discussed and we propose an improved influential nodes identification method that adopts the hybrid mechanism of information entropy and weighted degree of edge to improve the accuracy of identification (Hm-shell). Our proposed method is evaluated by comparing with nine algorithms in nine datasets. Theoretical analysis and experimental results on real datasets show that our method outperforms other methods on performance.

Improving Reliability Estimation for Individual Numeric Predictions: A Machine Learning Approach

2021 ◽  
Author(s):  
Gediminas Adomavicius ◽  
Yaqiong Wang
Keyword(s):  
Machine Learning ◽  
General Purpose ◽  
Reliability Estimation ◽  
Machine Learning Techniques ◽  
Data Sets ◽  
Real World Data ◽  
Learning Techniques ◽  
Reliability Indicator ◽  
Machine Learning Approach ◽  
Prediction Reliability

Numerical predictive modeling is widely used in different application domains. Although many modeling techniques have been proposed, and a number of different aggregate accuracy metrics exist for evaluating the overall performance of predictive models, other important aspects, such as the reliability (or confidence and uncertainty) of individual predictions, have been underexplored. We propose to use estimated absolute prediction error as the indicator of individual prediction reliability, which has the benefits of being intuitive and providing highly interpretable information to decision makers, as well as allowing for more precise evaluation of reliability estimation quality. As importantly, the proposed reliability indicator allows the reframing of reliability estimation itself as a canonical numeric prediction problem, which makes the proposed approach general-purpose (i.e., it can work in conjunction with any outcome prediction model), alleviates the need for distributional assumptions, and enables the use of advanced, state-of-the-art machine learning techniques to learn individual prediction reliability patterns directly from data. Extensive experimental results on multiple real-world data sets show that the proposed machine learning-based approach can significantly improve individual prediction reliability estimation as compared with a number of baselines from prior work, especially in more complex predictive scenarios.

Exploring multi-modalities in weather prediction using a univariate graph based on machine learning techniques

2021 ◽  
Author(s):  
Natacha Galmiche ◽  
Nello Blaser ◽  
Morten Brun ◽  
Helwig Hauser ◽  
Thomas Spengler ◽  
...  
Keyword(s):  
Machine Learning ◽  
Standard Deviation ◽  
Probability Distributions ◽  
Weather Prediction ◽  
A Priori ◽  
Clustering Algorithms ◽  
Quantitative Information ◽  
Machine Learning Techniques ◽  
Topological Data Analysis ◽  
Learning Techniques

<p>Probability distributions based on ensemble forecasts are commonly used to assess uncertainty in weather prediction. However, interpreting these distributions is not trivial, especially in the case of multimodality with distinct likely outcomes. The conventional summary employs mean and standard deviation across ensemble members, which works well for unimodal, Gaussian-like distributions. In the case of multimodality this misleads, discarding crucial information. </p><p>We aim at combining previously developed clustering algorithms in machine learning and topological data analysis to extract useful information such as the number of clusters in an ensemble. Given the chaotic behaviour of the atmosphere, machine learning techniques can provide relevant results even if no, or very little, a priori information about the data is available. In addition, topological methods that analyse the shape of the data can make results explainable.</p><p>Given an ensemble of univariate time series, a graph is generated whose edges and vertices represent clusters of members, including additional information for each cluster such as the members belonging to them, their uncertainty, and their relevance according to the graph. In the case of multimodality, this approach provides relevant and quantitative information beyond the commonly used mean and standard deviation approach that helps to further characterise the predictability.</p>

Proficient Normalised Fuzzy K-Means With Initial Centroids Methodology

2018 ◽  
Vol 8 (1) ◽  
pp. 42-59
Author(s):  
Deepali Virmani ◽  
Nikita Jain ◽  
Ketan Parikh ◽  
Shefali Upadhyaya ◽  
Abhishek Srivastav
Keyword(s):  
Unsupervised Learning ◽  
Real World ◽  
Learning Algorithms ◽  
Clustering Algorithms ◽  
Real World Data ◽  
World Data ◽  
Clustering Problem ◽  
Time Required ◽  
Selection Of

This article describes how data is relevant and if it can be organized, linked with other data and grouped into a cluster. Clustering is the process of organizing a given set of objects into a set of disjoint groups called clusters. There are a number of clustering algorithms like k-means, k-medoids, normalized k-means, etc. So, the focus remains on efficiency and accuracy of algorithms. The focus is also on the time it takes for clustering and reducing overlapping between clusters. K-means is one of the simplest unsupervised learning algorithms that solves the well-known clustering problem. The k-means algorithm partitions data into K clusters and the centroids are randomly chosen resulting numeric values prohibits it from being used to cluster real world data containing categorical values. Poor selection of initial centroids can result in poor clustering. This article deals with a proposed algorithm which is a variant of k-means with some modifications resulting in better clustering, reduced overlapping and lesser time required for clustering by selecting initial centres in k-means and normalizing the data.

scholarly journals A Novel Hierarchical Clustering Approach Based on Universal Gravitation

2020 ◽  
Vol 2020 ◽  
pp. 1-15
Author(s):  
Peng Zhang ◽  
Kun She
Keyword(s):  
Hierarchical Clustering ◽  
Clustering Analysis ◽  
Gravitational Force ◽  
Clustering Algorithms ◽  
Influence Coefficient ◽  
Data Sets ◽  
Universal Gravitation ◽  
Real World Data ◽  
Gravitational Influence ◽  
Clustering Approach

The target of the clustering analysis is to group a set of data points into several clusters based on the similarity or distance. The similarity or distance is usually a scalar used in numerous traditional clustering algorithms. Nevertheless, a vector, such as data gravitational force, contains more information than a scalar and can be applied in clustering analysis to promote clustering performance. Therefore, this paper proposes a three-stage hierarchical clustering approach called GHC, which takes advantage of the vector characteristic of data gravitational force inspired by the law of universal gravitation. In the first stage, a sparse gravitational graph is constructed based on the top k data gravitations between each data point and its neighbors in the local region. Then the sparse graph is partitioned into many subgraphs by the gravitational influence coefficient. In the last stage, the satisfactory clustering result is obtained by merging these subgraphs iteratively by using a new linkage criterion. To demonstrate the performance of GHC algorithm, the experiments on synthetic and real-world data sets are conducted, and the results show that the GHC algorithm achieves better performance than the other existing clustering algorithms.

Identifying influential nodes in dynamic social networks based on degree-corrected stochastic block model

2016 ◽  
Vol 30 (16) ◽  
pp. 1650092 ◽  
Author(s):  
Tingting Wang ◽  
Weidi Dai ◽  
Pengfei Jiao ◽  
Wenjun Wang
Keyword(s):  
Social Networks ◽  
Real World ◽  
Dynamic Networks ◽  
Dynamic Network ◽  
Community Structures ◽  
Block Model ◽  
Real World Data ◽  
Stochastic Block Model ◽  
Dynamic Social Networks ◽  
Influential Nodes

Many real-world data can be represented as dynamic networks which are the evolutionary networks with timestamps. Analyzing dynamic attributes is important to understanding the structures and functions of these complex networks. Especially, studying the influential nodes is significant to exploring and analyzing networks. In this paper, we propose a method to identify influential nodes in dynamic social networks based on identifying such nodes in the temporal communities which make up the dynamic networks. Firstly, we detect the community structures of all the snapshot networks based on the degree-corrected stochastic block model (DCBM). After getting the community structures, we capture the evolution of every community in the dynamic network by the extended Jaccard’s coefficient which is defined to map communities among all the snapshot networks. Then we obtain the initial influential nodes of the dynamic network and aggregate them based on three widely used centrality metrics. Experiments on real-world and synthetic datasets demonstrate that our method can identify influential nodes in dynamic networks accurately, at the same time, we also find some interesting phenomena and conclusions for those that have been validated in complex network or social science.

Sign in / Sign up

Export Citation Format

Share Document