Pith. sign in

REVIEW 2 cited by

Is a Single Vector Enough? Exploring Node Polysemy for Network Embedding

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1905.10668 v1 pith:LLHDIODS submitted 2019-05-25 cs.SI cs.IRcs.LG

classification cs.SIcs.IRcs.LG
keywords embeddingnetworknodevectordifferentmodelsreal-worldclassification
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

Networks have been widely used as the data structure for abstracting real-world systems as well as organizing the relations among entities. Network embedding models are powerful tools in mapping nodes in a network into continuous vector-space representations in order to facilitate subsequent tasks such as classification and link prediction. Existing network embedding models comprehensively integrate all information of each node, such as links and attributes, towards a single embedding vector to represent the node's general role in the network. However, a real-world entity could be multifaceted, where it connects to different neighborhoods due to different motives or self-characteristics that are not necessarily correlated. For example, in a movie recommender system, a user may love comedies or horror movies simultaneously, but it is not likely that these two types of movies are mutually close in the embedding space, nor the user embedding vector could be sufficiently close to them at the same time. In this paper, we propose a polysemous embedding approach for modeling multiple facets of nodes, as motivated by the phenomenon of word polysemy in language modeling. Each facet of a node is mapped as an embedding vector, while we also maintain association degree between each pair of node and facet. The proposed method is adaptive to various existing embedding models, without significantly complicating the optimization process. We also discuss how to engage embedding vectors of different facets for inference tasks including classification and link prediction. Experiments on real-world datasets help comprehensively evaluate the performance of the proposed method.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. SpecAE: Spectral AutoEncoder for Anomaly Detection in Attributed Networks

    cs.LG 2019-08 conditional novelty 5.0 of 10

    SpecAE detects global and community anomalies in attributed networks by embedding nodes with a graph convolutional autoencoder and Laplacian sharpening, then scoring them with a Gaussian mixture energy.

  2. Deep Structured Cross-Modal Anomaly Detection

    cs.LG 2019-08 conditional novelty 4.0 of 10

    CMAD learns a shared embedding space for two modalities with a pull-push contrastive loss, then flags instances whose cross-modal similarity falls below a threshold.

Pith tools