arrow
返回

Vicinal Vertex Allocation for Matrix Factorization in Networks

delete2022-08-01
delete12
delete
OA
AI
T
Tiantian He
L
Lu Bai *
Y
Yew-Soon Ong
DOI:10.1109/TCYB.2021.3051606delete
delete原文链接
delete分享
delete收藏
查看原文
摘要

摘要

En 中文
In this article, we present a novel matrix-factorization-based model, labeled here as Vicinal vertex allocated matrix factorization (VVAMo), for uncovering clusters in network data. Different from the past related efforts of network clustering, which consider the edge structure, vertex features, or both in their design, the proposed model includes the additional detail on vertex inclinations with respect to topology and features into the learning. In particular, by taking the latent preferences between vicinal vertices into consideration, VVAMo is then able to uncover network clusters composed of proximal vertices that share analogous inclinations, and correspondingly high structural and feature correlations. To ensure such clusters are effectively uncovered, we propose a unified likelihood function for VVAMo and derive an alternating algorithm for optimizing the proposed function. Subsequently, we provide the theoretical analysis of VVAMo, including the convergence proof and computational complexity analysis. To investigate the effectiveness of the proposed model, a comprehensive empirical study of VVAMo is conducted using extensive commonly used realistic network datasets. The results obtained show that VVAMo attained superior performances over existing classical and state-of-the-art approaches.
Keyword:
Computational modeling
Correlation
Data models
Task analysis
Probabilistic logic
Network topology
Adaptation models
Community detection
complex network
graph clustering
network clustering
probabilistic matrix factorization
vicinal vertex-allocated matrix factorization (VVAMo)
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

IEEE Transactions on Cybernetics 封面图
IEEE Transactions on Cybernetics
IF:
10.5
论文数:
1.1W
被引数:
5.0W

机构

N
Nanyang Technological University
学者数:
4.9W
论文数: 4.8W
被引数: 8.1W
引用论文

引用论文

BioGRID: a general repository for interaction datasetsBioGRID: 交互数据集的通用存储库
err2006-01-01
err3.3K
errOAAI
errStark, Chris; Breitkreutz, Bobby-Joe; Reguly, Teresa; Boucher, Lorrie; Breitkreutz, Ashton; Tyers, Mike
err分享
err收藏
Efficient and effective sparse tensor reordering高效有效的稀疏张量重排序
err2019-06-26
err0
errOAAI
errJiajia Li; Bora Uçar; Ümit V. Çatalyürek; Jimeng Sun; Kevin Barker; Richard Vuduc
err分享
err收藏
err
IF0
err
err0
PREAI
err
err分享
err收藏
err分享
err收藏
Dynamic Node Embeddings From Edge Streams
err2020-01-01
err9
errOAAI
errLee, John Boaz; Nguyen, Giang; Rossi, Ryan A.; Ahmed, Nesreen K.; Koh, Eunyee; Kim, Sungchul
err分享
err收藏
ChainForge: A Visual Toolkit for Prompt Engineering and LLM Hypothesis Testing
err2024-05-11
err0
errOAAI
errIan Arawjo; Chelse Swoopes; Priyan Vaithilingam; Martin Wattenberg; Elena L. Glassman
err分享
err收藏
学者 查看更多内容