Skip to main content
CenXiv.org
This website is in trial operation, support us!
We gratefully acknowledge support from all contributors.
Contribute
Donate
cenxiv logo > stat > arXiv:1911.01535

Help | Advanced Search

Statistics > Machine Learning

arXiv:1911.01535 (stat)
[Submitted on 4 Nov 2019 ]

Title: Scalable Deep Generative Relational Models with High-Order Node Dependence

Title: 具有高阶节点依赖的可扩展深度生成关系模型

Authors:Xuhui Fan, Bin Li, Scott Anthony Sisson, Caoyuan Li, Ling Chen
Abstract: We propose a probabilistic framework for modelling and exploring the latent structure of relational data. Given feature information for the nodes in a network, the scalable deep generative relational model (SDREM) builds a deep network architecture that can approximate potential nonlinear mappings between nodes' feature information and the nodes' latent representations. Our contribution is two-fold: (1) We incorporate high-order neighbourhood structure information to generate the latent representations at each node, which vary smoothly over the network. (2) Due to the Dirichlet random variable structure of the latent representations, we introduce a novel data augmentation trick which permits efficient Gibbs sampling. The SDREM can be used for large sparse networks as its computational cost scales with the number of positive links. We demonstrate its competitive performance through improved link prediction performance on a range of real-world datasets.
Abstract: 我们提出了一种概率框架,用于建模和探索关系数据的潜在结构。 给定网络中节点的特征信息,可扩展的深度生成关系模型(SDREM)构建了一个深度网络架构,可以近似节点特征信息与节点潜在表示之间的潜在非线性映射。 我们的贡献有两个方面:(1) 我们将高阶邻域结构信息纳入考虑,以在每个节点生成潜在表示,这些表示在网络中平滑变化。 (2) 由于潜在表示具有狄利克雷随机变量结构,我们引入了一种新颖的数据增强技巧,允许高效的吉布斯采样。 SDREM可用于大型稀疏网络,因为其计算成本与正链接的数量成比例。 我们通过在一系列真实世界数据集上的改进链接预测性能展示了其竞争力。
Subjects: Machine Learning (stat.ML) ; Machine Learning (cs.LG)
Cite as: arXiv:1911.01535 [stat.ML]
  (or arXiv:1911.01535v1 [stat.ML] for this version)
  https://doi.org/10.48550/arXiv.1911.01535
arXiv-issued DOI via DataCite

Submission history

From: Xuhui Fan [view email]
[v1] Mon, 4 Nov 2019 23:36:09 UTC (1,740 KB)
Full-text links:

Access Paper:

    View a PDF of the paper titled
  • View Chinese PDF
  • View PDF
  • TeX Source
  • Other Formats
view license
Current browse context:
stat.ML
< prev   |   next >
new | recent | 2019-11
Change to browse by:
cs
cs.LG
stat

References & Citations

  • NASA ADS
  • Google Scholar
  • Semantic Scholar
a export BibTeX citation Loading...

BibTeX formatted citation

×
Data provided by:

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
IArxiv Recommender (What is IArxiv?)
  • Author
  • Venue
  • Institution
  • Topic

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)
  • About
  • Help
  • contact arXivClick here to contact arXiv Contact
  • subscribe to arXiv mailingsClick here to subscribe Subscribe
  • Copyright
  • Privacy Policy
  • Web Accessibility Assistance
  • arXiv Operational Status
    Get status notifications via email or slack

京ICP备2025123034号