scholarly journals Multiview Community Discovery Algorithm via Nonnegative Factorization Matrix in Heterogeneous Networks

2017 ◽  
Vol 2017 ◽  
pp. 1-9 ◽  
Author(s):  
Wang Tao ◽  
Liu Yang
Keyword(s):  
Community Structure ◽  
Heterogeneous Networks ◽  
Real World ◽  
Rapid Development ◽  
Complex Structure ◽  
Nonnegative Matrix ◽  
Bipartite Graphs ◽  
Semisupervised Learning ◽  
Detection Methods ◽  
Target Mode

With the rapid development of the Internet and communication technologies, a large number of multimode or multidimensional networks widely emerge in real-world applications. Traditional community detection methods usually focus on homogeneous networks and simply treat different modes of nodes and connections in the same way, thus ignoring the inherent complexity and diversity of heterogeneous networks. It is challenging to effectively integrate the multiple modes of network information to discover the hidden community structure underlying heterogeneous interactions. In our work, a joint nonnegative matrix factorization (Joint-NMF) algorithm is proposed to discover the complex structure in heterogeneous networks. Our method transforms the heterogeneous dataset into a series of bipartite graphs correlated. Taking inspiration from the multiview method, we extend the semisupervised learning from single graph to several bipartite graphs with multiple views. In this way, it provides mutual information between different bipartite graphs to realize the collaborative learning of different classifiers, thus comprehensively considers the internal structure of all bipartite graphs, and makes all the classifiers tend to reach a consensus on the clustering results of the target-mode nodes. The experimental results show that Joint-NMF algorithm is efficient and well-behaved in real-world heterogeneous networks and can better explore the community structure of multimode nodes in heterogeneous networks.

scholarly journals Variational Approach for Learning Community Structures

Complexity ◽  
2018 ◽  
Vol 2018 ◽  
pp. 1-13 ◽  
Author(s):  
Jun Jin Choong ◽  
Xin Liu ◽  
Tsuyoshi Murata
Keyword(s):  
Deep Learning ◽  
Community Structure ◽  
Learning Community ◽  
Community Detection ◽  
Representation Learning ◽  
Semisupervised Learning ◽  
Detection Methods ◽  
Community Structures ◽  
Learning Tasks ◽  
Proposed Model

Discovering and modeling community structure exist to be a fundamentally challenging task. In domains such as biology, chemistry, and physics, researchers often rely on community detection algorithms to uncover community structures from complex systems yet no unified definition of community structure exists. Furthermore, existing models tend to be oversimplified leading to a neglect of richer information such as nodal features. Coupled with the surge of user generated information on social networks, a demand for newer techniques beyond traditional approaches is inevitable. Deep learning techniques such as network representation learning have shown tremendous promise. More specifically, supervised and semisupervised learning tasks such as link prediction and node classification have achieved remarkable results. However, unsupervised learning tasks such as community detection remain widely unexplored. In this paper, a novel deep generative model for community detection is proposed. Extensive experiments show that the proposed model, empowered with Bayesian deep learning, can provide insights in terms of uncertainty and exploit nonlinearities which result in better performance in comparison to state-of-the-art community detection methods. Additionally, unlike traditional methods, the proposed model is community structure definition agnostic. Leveraging on low-dimensional embeddings of both network topology and feature similarity, it automatically learns the best model configuration for describing similarities in a community.

scholarly journals Detecting Communities in 2-Mode Networks via Fast Nonnegative Matrix Trifactorization

2015 ◽  
Vol 2015 ◽  
pp. 1-10 ◽  
Author(s):  
Liu Yang ◽  
Wang Tao ◽  
Ji Xin-sheng ◽  
Liu Caixia ◽  
Xu Mingyan
Keyword(s):  
Community Structure ◽  
Rapid Development ◽  
Nonnegative Matrix ◽  
Communication Technologies ◽  
Bipartite Network ◽  
Bipartite Networks ◽  
Slow Convergence ◽  
Network Information ◽  
Relational Networks ◽  
Multiple Dimensions

With the rapid development of the Internet and communication technologies, a large number of multitype relational networks widely emerge in real world applications. The bipartite network is one representative and important kind of complex networks. Detecting community structure in bipartite networks is crucial to obtain a better understanding of the network structures and functions. Traditional nonnegative matrix factorization methods usually focus on homogeneous networks, and they are subject to several problems such as slow convergence and large computation. It is challenging to effectively integrate the network information of multiple dimensions in order to discover the hidden community structure underlying heterogeneous interactions. In this work, we present a novel fast nonnegative matrix trifactorization (F-NMTF) method to cocluster the 2-mode nodes in bipartite networks. By constructing the affinity matrices of 2-mode nodes as manifold regularizations of NMTF, we manage to incorporate the intratype and intratype information of 2-mode nodes to reveal the latent community structure in bipartite networks. Moreover, we decompose the NMTF problem into two subproblems, which are involved with much less matrix multiplications and achieve faster convergence. Experimental results on synthetic and real bipartite networks show that the proposed method improves the slow convergence of NMTF and achieves high accuracy and stability on the results of community detection.

Detecting communities in networks using a Bayesian nonparametric method

2014 ◽  
Vol 28 (28) ◽  
pp. 1450199
Author(s):  
Shengze Hu ◽  
Zhenwen Wang
Keyword(s):  
Community Structure ◽  
Community Detection ◽  
Real World ◽  
Detection Method ◽  
Generative Models ◽  
Detection Methods ◽  
Model Parameters ◽  
Nonparametric Method ◽  
Bayesian Nonparametric ◽  
New Community

In the real world, a large amount of systems can be described by networks where nodes represent entities and edges the interconnections between them. Community structure in networks is one of the interesting properties revealed in the study of networks. Many methods have been developed to extract communities from networks using the generative models which give the probability of generating networks based on some assumption about the communities. However, many generative models require setting the number of communities in the network. The methods based on such models are lack of practicality, because the number of communities is unknown before determining the communities. In this paper, the Bayesian nonparametric method is used to develop a new community detection method. First, a generative model is built to give the probability of generating the network and its communities. Next, the model parameters and the number of communities are calculated by fitting the model to the actual network. Finally, the communities in the network can be determined using the model parameters. In the experiments, we apply the proposed method to the synthetic and real-world networks, comparing with some other community detection methods. The experimental results show that the proposed method is efficient to detect communities in networks.

scholarly journals Uncovering Hidden Community Structure in Multi-Layer Networks

2021 ◽  
Vol 11 (6) ◽  
pp. 2857
Author(s):  
Faiza Riaz Khawaja ◽  
Jinfang Sheng ◽  
Bin Wang ◽  
Yumna Memon
Keyword(s):  
Community Structure ◽  
Community Detection ◽  
Real World ◽  
Graph Clustering ◽  
Detection Methods ◽  
Connected Components ◽  
Natural Community ◽  
As Graph ◽  
Dominant Structure

Community detection, also known as graph clustering, in multi-layer networks has been extensively studied in the literature. The goal of community detection is to partition vertices in a network into densely connected components so called communities. Networks contain a set of strong, dominant communities, which may interfere with the detection of weak, natural community structure. When most of the members of the weak communities also belong to stronger communities, they are extremely hard to be uncovered. We call the weak communities the hidden or disguised community structure. In this paper, we present a method to uncover weak communities in a network by weakening the strength of the dominant structure. With the aim to detect the weak communities, through experiments, we observe real-world networks to answer the question of whether real-world networks have hidden community structure or not. Results of the hidden community detection (HCD) method showed the great variation in the number of communities detected in multiple layers when compared with the results of other community detection methods.

scholarly journals Community Detection Based on DeepWalk Model in Large-Scale Networks

2020 ◽  
Vol 2020 ◽  
pp. 1-13
Author(s):  
Yunfang Chen ◽  
Li Wang ◽  
Dehao Qi ◽  
Tinghuai Ma ◽  
Wei Zhang
Keyword(s):  
Community Structure ◽  
Community Detection ◽  
Large Scale ◽  
Dimensional Space ◽  
Complex Structure ◽  
Gaussian Mixture ◽  
Detection Algorithm ◽  
Detection Methods ◽  
Large Scale Networks ◽  
Low Dimensional

The large-scale and complex structure of real networks brings enormous challenges to traditional community detection methods. In order to detect community structure in large-scale networks more accurately and efficiently, we propose a community detection algorithm based on the network embedding representation method. Firstly, in order to solve the scarce problem of network data, this paper uses the DeepWalk model to embed a high-dimensional network into low-dimensional space with topology information. Then, low-dimensional data are processed, with each node treated as a sample and each dimension of the node as a feature. Finally, samples are fed into a Gaussian mixture model (GMM), and in order to automatically learn the number of communities, variational inference is introduced into GMM. Experimental results on the DBLP dataset show that the model method of this paper can more effectively discover the communities in large-scale networks. By further analyzing the excavated community structure, the organizational characteristics within the community are better revealed.

scholarly journals Spectral estimation for detecting low-dimensional structure in networks using arbitrary null models

PLoS ONE ◽  
2021 ◽  
Vol 16 (7) ◽  
pp. e0254057
Author(s):  
Mark D. Humphries ◽  
Javier A. Caballero ◽  
Mat Evans ◽  
Silvia Maggi ◽  
Abhinav Singh
Keyword(s):  
Community Structure ◽  
Real World ◽  
Spectral Estimation ◽  
Null Model ◽  
Generative Models ◽  
Detection Methods ◽  
Dimensional Structure ◽  
Spectral Approach ◽  
Low Dimensional ◽  
Noise Nodes

Discovering low-dimensional structure in real-world networks requires a suitable null model that defines the absence of meaningful structure. Here we introduce a spectral approach for detecting a network’s low-dimensional structure, and the nodes that participate in it, using any null model. We use generative models to estimate the expected eigenvalue distribution under a specified null model, and then detect where the data network’s eigenspectra exceed the estimated bounds. On synthetic networks, this spectral estimation approach cleanly detects transitions between random and community structure, recovers the number and membership of communities, and removes noise nodes. On real networks spectral estimation finds either a significant fraction of noise nodes or no departure from a null model, in stark contrast to traditional community detection methods. Across all analyses, we find the choice of null model can strongly alter conclusions about the presence of network structure. Our spectral estimation approach is therefore a promising basis for detecting low-dimensional structure in real-world networks, or lack thereof.

Real-world environment affects the color appearance of virtual stimuli produced by augmented reality

2019 ◽  
Vol 2019 (1) ◽  
pp. 237-242
Author(s):  
Siyuan Chen ◽  
Minchen Wei
Keyword(s):  
Augmented Reality ◽  
Real World ◽  
Mixed Reality ◽  
Rapid Development ◽  
Light Level ◽  
Color Appearance ◽  
Chromatic Adaptation ◽  
Lighting Condition ◽  
The Real ◽  
World Environment

Color appearance models have been extensively studied for characterizing and predicting the perceived color appearance of physical color stimuli under different viewing conditions. These stimuli are either surface colors reflecting illumination or self-luminous emitting radiations. With the rapid development of augmented reality (AR) and mixed reality (MR), it is critically important to understand how the color appearance of the objects that are produced by AR and MR are perceived, especially when these objects are overlaid on the real world. In this study, nine lighting conditions, with different correlated color temperature (CCT) levels and light levels, were created in a real-world environment. Under each lighting condition, human observers adjusted the color appearance of a virtual stimulus, which was overlaid on a real-world luminous environment, until it appeared the whitest. It was found that the CCT and light level of the real-world environment significantly affected the color appearance of the white stimulus, especially when the light level was high. Moreover, a lower degree of chromatic adaptation was found for viewing the virtual stimulus that was overlaid on the real world.

Vignettes

2018 ◽  
Author(s):  
Marc J. Stern
Keyword(s):  
Real World ◽  
Environmental Sustainability ◽  
National Park ◽  
Public Involvement ◽  
Energy Savings ◽  
Rapid Development ◽  
Environmental Problems ◽  
Persuasive Communications ◽  
For Profit ◽  
The Face

Chapter 9 contains five vignettes, each based on real world cases. In each, a character is faced with a problem and uses multiple theories within the book to help him or her develop and execute a plan of action. The vignettes provide concrete examples of how to apply the theories in the book to solving environmental problems and working toward environmental sustainability in a variety of contexts, including managing visitors in a national park, developing persuasive communications, designing more collaborative public involvement processes, starting up an energy savings program within a for-profit corporation, and promoting conservation in the face of rapid development.

scholarly journals Modelling community structure and temporal spreading on complex networks

2021 ◽  
Vol 8 (1) ◽  
Author(s):  
Vesa Kuikka
Keyword(s):  
Community Structure ◽  
Complex Networks ◽  
Community Detection ◽  
Network Structure ◽  
Network Connectivity ◽  
Network Models ◽  
Building Blocks ◽  
Detection Algorithm ◽  
Research Area ◽  
Detection Methods

AbstractWe present methods for analysing hierarchical and overlapping community structure and spreading phenomena on complex networks. Different models can be developed for describing static connectivity or dynamical processes on a network topology. In this study, classical network connectivity and influence spreading models are used as examples for network models. Analysis of results is based on a probability matrix describing interactions between all pairs of nodes in the network. One popular research area has been detecting communities and their structure in complex networks. The community detection method of this study is based on optimising a quality function calculated from the probability matrix. The same method is proposed for detecting underlying groups of nodes that are building blocks of different sub-communities in the network structure. We present different quantitative measures for comparing and ranking solutions of the community detection algorithm. These measures describe properties of sub-communities: strength of a community, probability of formation and robustness of composition. The main contribution of this study is proposing a common methodology for analysing network structure and dynamics on complex networks. We illustrate the community detection methods with two small network topologies. In the case of network spreading models, time development of spreading in the network can be studied. Two different temporal spreading distributions demonstrate the methods with three real-world social networks of different sizes. The Poisson distribution describes a random response time and the e-mail forwarding distribution describes a process of receiving and forwarding messages.

An algorithm Walktrap-SPM for detecting overlapping community structure

2017 ◽  
Vol 31 (15) ◽  
pp. 1750121 ◽  
Author(s):  
Fang Hu ◽  
Youze Zhu ◽  
Yuan Shi ◽  
Jianchao Cai ◽  
Luogeng Chen ◽  
...  
Keyword(s):  
Community Structure ◽  
Random Walk ◽  
Community Detection ◽  
Real World ◽  
Overlapping Community Detection ◽  
Overlapping Communities ◽  
Running Time ◽  
Overlapping Community ◽  
Negative Links ◽  
Novel Algorithm

In this paper, based on Walktrap algorithm with the idea of random walk, and by selecting the neighbor communities, introducing improved signed probabilistic mixture (SPM) model and considering the edges within the community as positive links and the edges between the communities as negative links, a novel algorithm Walktrap-SPM for detecting overlapping community is proposed. This algorithm not only can identify the overlapping communities, but also can greatly increase the objectivity and accuracy of the results. In order to verify the accuracy, the performance of this algorithm is tested on several representative real-world networks and a set of computer-generated networks based on LFR benchmark. The experimental results indicate that this algorithm can identify the communities accurately, and it is more suitable for overlapping community detection. Compared with Walktrap, SPM and LMF algorithms, the presented algorithm can acquire higher values of modularity and NMI. Moreover, this new algorithm has faster running time than SPM and LMF algorithms.

Sign in / Sign up

Export Citation Format

Share Document