Proposes a novel tensor-based approach for multi-level link prediction.
problem Inferring potential links from observed networks.
method Tensor-based joint network embedding capturing pairwise and hyperlinks.
result Improves hyperlink and pairwise link prediction accuracy.
BHLR predicts hyperlink weights from data vectors using symmetric similarity functions and Bregman divergence.
problem Predicting hyperlink weights from data vectors in a general framework.
method BHLR learns a symmetric similarity function to minimize Bregman-divergence between hyperlink weights and estimated similarities.
result BHLR is statistically consistent and computationally tractable, providing theoretical guarantees for various methods.
Computes Wilson Loop observable using Einstein-Hilbert and Chern-Simons path integrals.
problem Computing Wilson Loop observable using path integrals.
method Uses Einstein-Hilbert action and axial-gauge fixing to express as Chern-Simons integrals, then computes observable from link diagram.
result Wilson Loop observable can be computed from a hyperlink's link diagram, invariant under equivalence relation.
A novel multilayer network approach for text analysis.
problem Clustering documents and finding topics in large collections with metadata and hyperlinks.
method Multilayer Networks and Stochastic Block Models applied to multiple data types.
result Taking into account multiple types of information improves topic and document clustering.
Quantizes area of surfaces in loop quantum gravity.
problem Quantizing the area of surfaces in loop quantum gravity.
method Using hyperlink and holonomy operators, quantize area of surfaces.
result Area operator can be computed from link-surface diagrams.
A training-free message passing module improves hypergraph neural networks.
problem Computational intensive training process in hypergraph neural networks.
method Decoupling hypergraph structural information from model learning stage.
result TF-HNN achieves superior performance and training efficiency.
Wiki-CS dataset benchmarks Graph Neural Networks using Wikipedia articles.
problem Benchmarking Graph Neural Networks on a new domain with structural differences.
method Derived from Wikipedia, nodes represent Computer Science articles, edges from hyperlinks, 10 classes for different branches, evaluated semi-supervised node classification and link prediction.
result Graph Neural Networks perform well on Wiki-CS, showing structural differences from earlier benchmarks.
We present the mixture-of-parents maximum entropy Markov model (MoP-MEMM), a class of directed graphical models extending MEMMs. The MoP-MEMM allows tractable incorporation of long-range dependencies between nodes by restricting the conditional distribution of each node to be a mixture of distributions given the parent…
In this paper we propose a Bayesian nonparametric approach to modelling sparse time-varying networks. A positive parameter is associated to each node of a network, which models the sociability of that node. Sociabilities are assumed to evolve over time, and are modelled via a dynamic point process model. The model is a…
Many classification problems involve data instances that are interlinked with each other, such as webpages connected by hyperlinks. Techniques for "collective classification" (CC) often increase accuracy for such data graphs, but usually require a fully-labeled training graph. In contrast, we examine how to improve the…
New method tests causal association using noise contrastive backdoor adjustment.
problem Testing causal association in complex settings with many confounders.
method Backdoor-HSIC (bd-HSIC) using HSIC for independence testing.
result Calibrated and powerful for binary and continuous treatments with many confounders.
Infrastructure monitors AI/ML radiology models across multiple sites.
problem Monitoring and improving AI/ML radiology models across multiple sites.
method Interactive radiology reporting, centralized cloud system, post-marketing surveillance.
result Efficient monitoring and iterative development of AI/ML models without radiologist burden.
Many data sets contain rich information about objects, as well as pairwise relations between them. For instance, in networks of websites, scientific papers, and other documents, each node has content consisting of a collection of words, as well as hyperlinks or citations to other nodes. In order to perform inference on…
LinkedRNN models linked sequences by capturing both sequential and link information.
problem Challenges in modeling linked sequences that are not i.i.d.
method Introduces a principled approach to capture link information and proposes LinkedRNN.
result Demonstrates the effectiveness of LinkedRNN on real-world datasets.
Max-MIG tackles crowdsourced label learning without knowing crowd information structure.
problem Learning from crowds without knowing the information structure among crowds.
method Max-MIG is an information theoretic approach that simultaneously aggregates crowdsourced labels and learns a data classifier.
result Max-MIG achieves state-of-the-art results in most settings, including real-world data.