Evidence map›Paper›PMID 30416320›Full record

ArticleIEEE transactions on knowledge and data engineering2018

ComClus: A Self-Grouping Framework for Multi-Network Clustering.

Jingchao Ni, Wei Cheng, Wei Fan, Xiang Zhang

Abstract read
In one paragraph

Article in IEEE transactions on knowledge and data engineering, 2018. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 1 paper.

0numbers the graph read from it
0cells of the map it votes in
1citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

1 citing paper in PubMed.

  1. Article
4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

4 authors.

Jingchao NiCollege of Information Sciences and Technology, Pennsylvania State University, PA 16802 USA.
Wei ChengNEC Laboratories America, NJ 08540 USA.
Wei FanBaidu Research Big Data Lab, CA 94089 USA.
Xiang ZhangCollege of Information Sciences and Technology, Pennsylvania State University, PA 16802 USA.

Funding

Fast and Robust Methods for Large Scale Genotype Phenotype Association StudyR01GM115833 · NIGMS · UNIVERSITY OF CALIFORNIA LOS ANGELES · PI WANG, WEI · 2015 to 2017
$933k
Mining real-time social media big data to monitor HIV: Development and Ethical IssuesR56AI125105 · NIAID · UNIVERSITY OF CALIFORNIA LOS ANGELES · PI CONDIE, TYSON, WANG, WEI · 2016 to 2016
$671k
NIAID NIH HHS R56 AI125105NIGMS NIH HHS R01 GM115833
6 · The paper itself

Abstract

Joint clustering of multiple networks has been shown to be more accurate than performing clustering on individual networks separately. This is because multi-network clustering algorithms typically assume there is a common clustering structure shared by all networks, and different networks can provide compatible and complementary information for uncovering this underlying clustering structure. However, this assumption is too strict to hold in many emerging applications, where multiple networks usually have diverse data distributions. More popularly, the networks in consideration belong to different underlying groups. Only networks in the same underlying group share similar clustering structures. Better clustering performance can be achieved by considering such groups differently. As a result, an ideal method should be able to automatically detect network groups so that networks in the same group share a common clustering structure. To address this problem, we propose a new method, ComClus, to simultaneously group and cluster multiple networks. ComClus is novel in combining the clustering approach of non-negative matrix factorization (NMF) and the feature subspace learning approach of metric learning. Specifically, it treats node clusters as features of networks and learns proper subspaces from such features to differentiate different network groups. During the learning process, the two procedures of network grouping and clustering are coupled and mutually enhanced. Moreover, ComClus can effectively leverage prior knowledge on how to group networks such that network grouping can be conducted in a semi-supervised manner. This will enable users to guide the grouping process using domain knowledge so that network clustering accuracy can be further boosted. Extensive experimental evaluations on a variety of synthetic and real datasets demonstrate the effectiveness and scalability of the proposed method.

Indexed as

Multi-Network ClusteringNetwork GroupingNon-Negative Matrix Factorization

Identifiers

PMID30416320
PMCPMC6221474

What OpenQuestion holds

Textmetadata
LicenceTDM
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.