Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,786 papers · 148 categories

Trend · papers per month

239478717956 · Jun 202019922001200920172026
48 results for network entity

The regression of multiple inter-connected sequence data is a problem in various disciplines. Formally, we name the regression problem of multiple inter-connected data entities as the "dynamic network regression" in this paper. Within the problem of stock forecasting or traffic speed prediction, we need to consider bot…

2019-07-25abs ↗pdf ↗

Survey on ML advances for personalized prediction considering entity characteristics.

problem Sub-optimal performance in personalized prediction due to heterogeneity in data across entities.
method Organized current literature on entity-aware modeling based on characteristics availability and training data amount.
result Recent innovations in uncertainty quantification, fairness, and knowledge-guided machine learning can improve entity-aware modeling.

TransGCN combines GCNs with transformation assumptions for better link prediction in KGs.

problem Link prediction in knowledge graphs for understanding graph structure.
method Unified GCN framework with simultaneous learning of entity and relation embeddings, using transformation assumptions.
result TransGCN outperforms state-of-the-art models on FB15K-237 and WN18RR.

Neural production systems learn visual dynamics by applying rule templates to entities.

problem Modeling interactions among entities in structured visual environments.
method Inspired by production systems, the paper uses rule templates to bind placeholder variables to specific entities, scoring and applying the best fitting rules to update entity properties.
result The architecture achieves robust future-state prediction and extrapolation from simple to complex environments, outperforming GNNs.

We introduce a technique to compute probably approximately correct (PAC) bounds on precision and recall for matching algorithms. The bounds require some verified matches, but those matches may be used to develop the algorithms. The bounds can be applied to network reconciliation or entity resolution algorithms, which i…

2014-10-31abs ↗pdf ↗

The relational model is a ubiquitous representation of big-data, in part due to its extensive use in databases. In this paper, we propose the Equivariant Entity-Relationship Network (EERN), which is a Multilayer Perceptron equivariant to the symmetry transformations of the Entity-Relationship model. To this end, we ide…

2019-03-21abs ↗pdf ↗

Previous models for learning entity and relationship embeddings of knowledge graphs such as TransE, TransH, and TransR aim to explore new links based on learned representations. However, these models interpret relationships as simple translations on entity embeddings. In this paper, we try to learn more complex connect…

2017-10-23abs ↗pdf ↗

Often, more time is spent on finding a model that works well, rather than tuning the model and working directly with the dataset. Our research began as an attempt to improve upon a simple Recurrent Neural Network for answering "simple" first-order questions (QA-RNN), developed by Ferhan Ture and Oliver Jojic, from Comc…

2018-07-12abs ↗pdf ↗

Knowledge graphs, on top of entities and their relationships, contain other important elements: literals. Literals encode interesting properties (e.g. the height) of entities that are not captured by links between entities alone. Most of the existing work on embedding (or latent feature) based knowledge graph analysis …

2018-02-03abs ↗pdf ↗

GraIL predicts relations by reasoning over subgraphs, outperforming embeddings.

problem Relation prediction in knowledge graphs using latent representations is limited.
method Graph neural network with inductive bias to learn entity-independent relational semantics.
result GraIL outperforms existing rule-induction baselines in the inductive setting.

In many supervised learning tasks, the entities to be labeled are related to each other in complex ways and their labels are not independent. For example, in hypertext classification, the labels of linked pages are highly correlated. A standard approach is to classify each entity independently, ignoring the correlation…

2012-12-12abs ↗pdf ↗

Optimizes treatment allocation in networks considering indirect effects.

problem Finding optimal treatment allocation in network settings with interference.
method OTAPI: Optimizing Treatment Allocation in the Presence of Interference, integrating causal estimators into IM algorithms.
result OTAPI outperforms classic IM and UM approaches on synthetic and semi-synthetic datasets.

For many natural language processing (NLP) tasks the amount of annotated data is limited. This urges a need to apply semi-supervised learning techniques, such as transfer learning or meta-learning. In this work we tackle Named Entity Recognition (NER) task using Prototypical Network - a metric learning technique. It le…

2018-12-14abs ↗pdf ↗

Knowledge graphs enable a wide variety of applications, including question answering and information retrieval. Despite the great effort invested in their creation and maintenance, even the largest (e.g., Yago, DBPedia or Wikidata) remain incomplete. We introduce Relational Graph Convolutional Networks (R-GCNs) and app…

2017-03-17abs ↗pdf ↗

Entity relatedness has emerged as an important feature in a plethora of applications such as information retrieval, entity recommendation and entity linking. Given an entity, for instance a person or an organization, entity relatedness measures can be exploited for generating a list of highly-related entities. However,…

2018-10-23abs ↗pdf ↗

Model learns to discover and disambiguate entities and relations in text streams.

problem Learning to follow and resolve mentions in a continuous text stream.
method End-to-end trainable memory network for online, one-shot learning.
result Improves disambiguation and discovery skills with minimal supervision.

A semi-parametric, non-linear regression model in the presence of latent variables is applied towards learning network graph structure. These latent variables can correspond to unmodeled phenomena or unmeasured agents in a complex system of interacting entities. This formulation jointly estimates non-linearities in the…

2018-06-28abs ↗pdf ↗

Stochastic networks are a plausible representation of the relational information among entities in dynamic systems such as living cells or social communities. While there is a rich literature in estimating a static or temporally invariant network from observation data, little has been done toward estimating time-varyin…

2008-12-30abs ↗pdf ↗

New model integrates community and link clustering for network data.

problem Lack of embedded prior information and community evolution description in MMSB.
method Fragmentation coagulation process for community and link clustering, with Gibbs sampling for inference.
result Model infers community structure and evolution, improving MMSB.

DEMOTE uses neural diffusion-reaction processes to capture temporal dynamics in sparse tensor data.

problem Sparse and temporally associated tensor data with limited structural knowledge.
method Develops a neural diffusion-reaction process to estimate dynamic embeddings for tensor modes.
result Captures both commonalities and personalities in evolving tensor entries.

Measuring entity relatedness is a fundamental task for many natural language processing and information retrieval applications. Prior work often studies entity relatedness in static settings and an unsupervised manner. However, entities in real-world are often involved in many different relationships, consequently enti…

2018-08-24abs ↗pdf ↗

Improves medication name inference for telemedicine and conversational agents.

problem Challenges in mapping user-friendly medication names to standardized ones.
method Entity-boosted two-tower neural network for ranking SMN to DMP.
result State-of-the-art results achieved with improved attention-based ranking.

Model learns collective and individual dynamics in time series data.

problem Lack of models capturing system-level collective behavior in individual time series.
method Hierarchical switching-state model with latent system-level and entity-level Markov chains.
result Model improves interpretability and forecasting accuracy compared to larger models.

Proposes HetSANN for learning heterogeneous graph structures without meta-paths.

problem Learning low-dimensional vector space of heterogeneous information networks.
method Implicitly represents heterogeneous information through entity space transformation and attention mechanism.
result Significant improvements over state-of-the-art solutions on public datasets.

The multivariate probit model (MVP) is a popular classic model for studying binary responses of multiple entities. Nevertheless, the computational challenge of learning the MVP model, given that its likelihood involves integrating over a multidimensional constrained space of latent variables, significantly limits its a…

2018-03-22abs ↗pdf ↗