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,742 papers · 148 categories

Trend · papers per month

5099149198 · Jun 202019922001200920172026
48 results for attribute embeddings

Proposes VCLANC for attributed network clustering using node and attribute embeddings.

problem Lack of mutual affinity exploitation between nodes and attributes in graph convolution.
method Dual variational auto-encoders for node and attribute embeddings, Gaussian mixture model priors, mutual distance and clustering assignment hardening losses.
result Demonstrates effectiveness on real-world attributed network datasets.

AUASE embeds dynamic networks with stability guarantees for node comparison.

problem Stability in dynamic network embeddings for comparing nodes across time.
method Attributed unfolded adjacency spectral embedding (AUASE) for stable unsupervised learning.
result AUASE provides significant improvements in link prediction and node classification.

Mining tasks over sequential data, such as clickstreams and gene sequences, require a careful design of embeddings usable by learning algorithms. Recent research in feature learning has been extended to sequential data, where each instance consists of a sequence of heterogeneous items with a variable length. However, m…

2019-11-03abs ↗pdf ↗

Proposes a block-based model for attributed network embedding.

problem Handles both assortative and disassortative networks.
method Assigns nodes to blocks based on similar linkage patterns, using neural networks to preserve attribute information.
result Consistently outperforms state-of-the-art methods on disassortative networks.

AnomalyDAE detects anomalies in networks by learning cross-modality interactions.

problem Detecting anomalies in attributed networks where structure and attributes interact.
method Dual autoencoder framework with attention mechanism for joint learning of structure and attribute embeddings.
result AnomalyDAE effectively detects anomalies by reconstructing node attributes and structures.

Modern LLMs fail at authorship attribution without fine-tuning, but topic embeddings outperform them.

problem Authorship attribution of the Federalist Papers using modern LLMs.
method Examined popular LLMs, compared word/phrase embeddings, and used Bayesian analysis with topic embeddings.
result Topic embeddings trained on 'function words' outperform default LLM embeddings in authorship attribution.

Network embedding leverages the node proximity manifested to learn a low-dimensional node vector representation for each node in the network. The learned embeddings could advance various learning tasks such as node classification, network clustering, and link prediction. Most, if not all, of the existing works, are ove…

2017-06-06abs ↗pdf ↗

A method for trust evaluation of devices in human-device coexistence systems.

problem Efficient trust evaluation of devices in systems with diverse physical and social attributes.
method Canonical correlation analysis-enhanced hypergraph self-supervised learning (HSLCCA).
result The proposed HSLCCA method significantly outperforms baseline algorithms in identifying trusted devices.

Adding attributes for nodes to network embedding helps to improve the ability of the learned joint representation to depict features from topology and attributes simultaneously. Recent research on the joint embedding has exhibited a promising performance on a variety of tasks by jointly embedding the two spaces. Howeve…

2018-04-17abs ↗pdf ↗

Method detects anomalies on attributed graphs with few labeled instances.

problem Detecting anomalies on connected instances (attributed graphs) with limited labeled data.
method Embed nodes in latent space using GCNs, training to distinguish normal and anomalous nodes.
result Method outperforms existing methods on real-world attributed graph datasets.

We present network embedding algorithms that capture information about a node from the local distribution over node attributes around it, as observed over random walks following an approach similar to Skip-gram. Observations from neighborhoods of different sizes are either pooled (AE) or encoded distinctly in a multi-s…

2019-09-28abs ↗pdf ↗

In this paper, we study the problem of transfer learning with the attribute data. In the transfer learning problem, we want to leverage the data of the auxiliary and the target domains to build an effective model for the classification problem in the target domain. Meanwhile, the attributes are naturally stable cross d…

2018-03-26abs ↗pdf ↗

Paper proposes embedding models to capture semantic similarities of categorical attributes in financial bonds.

problem Challenges in finding similar bonds due to overshadowing of categorical non-financial attributes.
method Embedding models to capture semantic similarities of categorical attributes.
result Improves risk modeling and curve construction via sparse-issuer augmentation.

A-DOGE embeds attributed graphs efficiently using density of states.

problem Efficiently represent node-attributed graphs with few numerical features.
method A-DOGE uses density of states to blend topology and attributes, leveraging efficient approximation algorithms.
result A-DOGE achieves competitive performance with modern supervised GNNs while being significantly faster.

SASE improves attributed graph clustering for large graphs with linear time and space complexity.

problem Challenges in clustering large attributed graphs due to high computational and memory costs.
method SASE combines node features smoothing, scalable spectral clustering, and adaptive order selection.
result SASE achieves a 6.9% improvement in ACC and a 5.87x speedup on the ArXiv dataset.

AGE improves graph embedding by smoothing features and iteratively enhancing node embeddings.

problem Challenges in attributed graph embedding, especially in preserving optimal low-pass characteristics and robustness.
method AGE, a novel framework combining Laplacian smoothing and adaptive encoding, addresses these issues.
result AGE consistently outperforms state-of-the-art methods on node clustering and link prediction tasks.

MedGraph learns patient visit embeddings from EMRs, capturing both attributes and temporal sequences.

problem Limited EMR embedding methods fail to capture patient demographics, utilisation, and code descriptions.
method MedGraph constructs an attributed bipartite graph and uses a point process to model temporal sequences.
result MedGraph outperforms state-of-the-art methods in medical risk prediction tasks.

A new method improves semi-supervised learning by handling tasks with different attribute spaces.

problem Existing methods assume tasks share the same attribute space, limiting their applicability.
method Meta-learning approach that embeds labeled and unlabeled data in task-specific spaces using neural networks.
result Improves test performance on tasks with small labeled data using unlabeled and various task data.

New method for fair influence maximization in social networks.

problem Maximizing influence while ensuring fairness across sensitive attributes.
method Co-training an auto-encoder and discriminator to create fair graph embeddings.
result Our method reduces disparity while maintaining competitive influence maximization performance.

Nodes in a multiplex network are connected by multiple types of relations. However, most existing network embedding methods assume that only a single type of relation exists between nodes. Even for those that consider the multiplexity of a network, they overlook node attributes, resort to node labels for training, and …

2019-11-15abs ↗pdf ↗

Low dimensional embeddings that capture the main variations of interest in collections of data are important for many applications. One way to construct these embeddings is to acquire estimates of similarity from the crowd. However, similarity is a multi-dimensional concept that varies from individual to individual. Ex…

2017-09-22abs ↗pdf ↗

Proposes a VAE with Student-tt mixture model for authorship attribution.

problem Traditional authorship attribution in closed-set scenarios.
method Extends variational autoencoder with embedded Student-tt mixture model.
result Superior performance over existing methods on Amazon review dataset.

RKHS-SHAP uses Shapley values for kernel methods to provide feature attributions.

problem Feature attribution for kernel methods is often heuristic and not individualised.
method RKHS-SHAP uses Shapley values from coalition game theory to compute feature attributions for kernel machines efficiently.
result RKHS-SHAP can compute both Interventional and Observational Shapley values.

New method for embedding large networks without attributes, achieving state-of-the-art performance.

problem Learning embeddings from large-scale networks without domain-dependent attributes.
method Use predefined local encodings based on node degree frequencies at different distances.
result Inductive network embeddings generalize well across unseen or distant regions in the network.

Graph clustering is a fundamental task which discovers communities or groups in networks. Recent studies have mostly focused on developing deep learning approaches to learn a compact graph embedding, upon which classic clustering methods like k-means or spectral clustering algorithms are applied. These two-step framewo…

2019-06-15abs ↗pdf ↗

DArtNet predicts time series data using graph structure and dynamic attributes.

problem Predicting time series data using graph structure and dynamic attributes.
method DArtNet learns static and dynamic embeddings for graph nodes and encodes history information using RNN for joint link and attribute prediction.
result Improved time series prediction accuracy on five datasets.

DVA framework attributes value of predictive models to features, configurations, and interactions.

problem Lack of explanation for how predictive models influence operational decisions.
method Shapley-based cooperative game theory applied to predict-then-optimize systems.
result DVA can guide targeted interventions to align model beliefs with operational performance.