paper-with-me

Papers

Non-Negative Matrix Factorizations for Multiplex Network Analysis

2016-12-01 · Vladimir Gligorijevic, Yannis Panagakis, Stefanos Zafeiriou

Networks have been a general tool for representing, analyzing, and modeling relational data arising in several domains. One of the most important aspect of network analysis is community detection or network clustering. Until recently, the major focus have been on discovering community structure in single (i.e., monoplex) networks. However, with the advent of relational data with multiple modalities, multiplex networks, i.e., networks composed of multiple layers representing different aspects of relations, have emerged. Consequently, community detection in multiplex network, i.e., detecting clusters of nodes shared by all layers, has become a new challenge. In this paper, we propose Network Fusion for Composite Community Extraction (NF-CCE), a new class of algorithms, based on four different non-negative matrix factorization models, capable of extracting composite communities in multiplex networks. Each algorithm works in two steps: first, it finds a non-negative, low-dimensional feature representation of each network layer; then, it fuses the feature representation of layers into a common non-negative, low-dimensional feature representation via collective factorization. The composite clusters are extracted from the common feature representation. We demonstrate the superior performance of our algorithms over the state-of-the-art methods on various types of multiplex networks, including biological, social, economic, citation, phone communication, and brain multiplex networks.

📄 PDF Abstract BibTeX arXiv:1612.00750

Code (0)

등록된 구현이 없습니다.

Tasks

ClusteringCommunity Detection

Similar Papers 제목 키워드 기반

Community detection in multiplex networks based on orthogonal nonnegative matrix tri-factorization

2022-05-02 · Meiby Ortiz-Bouza, Selin Aviyente

Networks are commonly used to model complex systems. The different entities in the system are represented by nodes of the network and their interactions by edges. In most real life systems, the different entities may int…

Community DetectionMultiview Clustering

Algorithms for Approximate Subtropical Matrix Factorization

2017-07-19 · Sanjar Karaev, Pauli Miettinen

Matrix factorization methods are important tools in data mining and analysis. They can be used for many tasks, ranging from dimensionality reduction to visualization. In this paper we concentrate on the use of matrix fac…

Dimensionality Reduction

A Non-commutative Extension of Lee-Seung's Algorithm for Positive Semidefinite Factorizations

2021-06-01 · NeurIPS 2021 12 · Yong Sheng Soh, Antonios Varvitsiotis

Given a matrix $X\in \mathbb{R}_+^{m\times n}$ with nonnegative entries, a Positive Semidefinite (PSD) factorization of $X$ is a collection of $r \times r$-dimensional PSD matrices $\{A_i\}$ and $\{B_j\}$ satisfying $X_{…

Tensor Decompositions: A New Concept in Brain Data Analysis?

2013-05-02 · Andrzej Cichocki

Matrix factorizations and their extensions to tensor factorizations and decompositions have become prominent techniques for linear and multilinear blind source separation (BSS), especially multiway Independent Component …

blind source separationClassificationClusteringDimensionality Reduction+2

Multiplicative updates for symmetric-cone factorizations

2021-08-02 · Yong Sheng Soh, Antonios Varvitsiotis

Given a matrix $X\in \mathbb{R}^{m\times n}_+$ with non-negative entries, the cone factorization problem over a cone $\mathcal{K}\subseteq \mathbb{R}^k$ concerns computing $\{ a_1,\ldots, a_{m} \} \subseteq \mathcal{K}$ …