{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/task/graph-embedding/papers/11","list_of":"/task/graph-embedding","task":"Graph Embedding","archive":{"snapshot":"2025-07-28"},"key_notes":{"n_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"syntology_read_at":"2026-09-28T10:30:06+00:00","order":"archive","order_definition":"repositories listed in the archive (most first), then date (newest first), then slug","page":11,"pages_in_order":12,"rows_per_page":100,"rows":[1001,1100],"of":1192,"counts":{"archive_papers_tagged":1192,"with_a_code_link":533,"where_syntology_ran_a_sample":92,"not_listed_spam_title":0,"listed":1192,"listed_where_code_ran":92,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":83,"every_run_a_failure_of_syntologys_instrument":9,"listed_with_a_run_with_no_instrument_failure":83,"listed_every_run_a_failure_of_syntologys_instrument":9,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"first_page":"/task/graph-embedding","prev":"/task/graph-embedding/papers/10","next":"/task/graph-embedding/papers/12","papers":[{"url":null,"slug":"fast-detection-of-maximum-common-subgraph-via","title":"GLSearch: Maximum Common Subgraph Detection via Learning to Search","date":"2020-02-08","arxiv_id":"2002.03129","repositories_listed":0,"syntology":null},{"url":null,"slug":"fast-generating-a-large-number-of-gumbel-max","title":"Fast Generating A Large Number of Gumbel-Max Variables","date":"2020-02-02","arxiv_id":"2002.00413","repositories_listed":0,"syntology":null},{"url":null,"slug":"geff-graph-embedding-for-functional","title":"GEFF: Graph Embedding for Functional Fingerprinting","date":"2020-01-18","arxiv_id":"2001.06605","repositories_listed":0,"syntology":null},{"url":"/paper/knowledge-graph-embedding-via-graph","slug":"knowledge-graph-embedding-via-graph","title":"Knowledge Graph Embedding via Graph Attenuated Attention Networks","date":"2019-12-31","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":"/paper/cross-modality-attention-with-semantic-graph","slug":"cross-modality-attention-with-semantic-graph","title":"Cross-Modality Attention with Semantic Graph Embedding for Multi-Label Classification","date":"2019-12-17","arxiv_id":"1912.07872","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-based-multi-view-binary-learning-for","title":"Graph-based Multi-view Binary Learning for Image Clustering","date":"2019-12-11","arxiv_id":"1912.05159","repositories_listed":0,"syntology":null},{"url":null,"slug":"product-knowledge-graph-embedding-for-e","title":"Product Knowledge Graph Embedding for E-commerce","date":"2019-11-28","arxiv_id":"1911.12481","repositories_listed":0,"syntology":null},{"url":null,"slug":"scalable-global-alignment-graph-kernel-using","title":"Scalable Global Alignment Graph Kernel Using Random Features: From Node Embedding to Graph Embedding","date":"2019-11-25","arxiv_id":"1911.11119","repositories_listed":0,"syntology":null},{"url":null,"slug":"an-end-to-end-framework-for-cold-question","title":"An End-to-End Framework for Cold Question Routing in Community Question Answering Services","date":"2019-11-22","arxiv_id":"1911.11017","repositories_listed":0,"syntology":null},{"url":null,"slug":"customized-graph-embedding-tailoring-the","title":"Customized Graph Embedding: Tailoring Embedding Vectors to different Applications","date":"2019-11-21","arxiv_id":"1911.09454","repositories_listed":0,"syntology":null},{"url":null,"slug":"exponential-family-graph-embeddings","title":"Exponential Family Graph Embeddings","date":"2019-11-20","arxiv_id":"1911.09007","repositories_listed":0,"syntology":null},{"url":null,"slug":"joint-embedding-learning-of-educational","title":"Joint Embedding Learning of Educational Knowledge Graphs","date":"2019-11-20","arxiv_id":"1911.08776","repositories_listed":0,"syntology":null},{"url":"/paper/orthogonal-relation-transforms-with-graph","slug":"orthogonal-relation-transforms-with-graph","title":"Orthogonal Relation Transforms with Graph Context Modeling for Knowledge Graph Embedding","date":"2019-11-09","arxiv_id":"1911.04910","repositories_listed":0,"syntology":null},{"url":null,"slug":"dynamic-graph-embedding-via-lstm-history","title":"Dynamic Graph Embedding via LSTM History Tracking","date":"2019-11-05","arxiv_id":"1911.01551","repositories_listed":0,"syntology":null},{"url":null,"slug":"attentive-knowledge-graph-embedding-for","title":"Hierarchical Attentive Knowledge Graph Embedding for Personalized Recommendation","date":"2019-10-18","arxiv_id":"1910.08288","repositories_listed":0,"syntology":null},{"url":null,"slug":"cascading-association-augmented-sequential","title":"Cascading: Association Augmented Sequential Recommendation","date":"2019-10-17","arxiv_id":"1910.07792","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-embedding-vae-a-permutation-invariant","title":"Graph Embedding VAE: A Permutation Invariant Model of Graph Structure","date":"2019-10-17","arxiv_id":"1910.08057","repositories_listed":0,"syntology":null},{"url":null,"slug":"efficiently-embedding-dynamic-knowledge","title":"Efficiently Embedding Dynamic Knowledge Graphs","date":"2019-10-15","arxiv_id":"1910.06708","repositories_listed":0,"syntology":null},{"url":null,"slug":"disentangling-interpretable-generative","title":"Disentangling Interpretable Generative Parameters of Random and Real-World Graphs","date":"2019-10-12","arxiv_id":"1910.05639","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-high-order-structural-and-attribute","title":"Learning High-order Structural and Attribute information by Knowledge Graph Attention Networks for Enhancing Knowledge Graph Embedding","date":"2019-10-09","arxiv_id":"1910.03891","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-event-representations-in-image","title":"Learning event representations for temporal segmentation of image sequences by dynamic graph embedding","date":"2019-10-08","arxiv_id":"1910.03483","repositories_listed":0,"syntology":null},{"url":null,"slug":"representation-learning-of-ehr-data-via-graph","title":"Representation Learning of EHR Data via Graph-Based Medical Entity Embedding","date":"2019-10-07","arxiv_id":"1910.02574","repositories_listed":0,"syntology":null},{"url":null,"slug":"dynamic-joint-variational-graph-autoencoders","title":"Dynamic Joint Variational Graph Autoencoders","date":"2019-10-04","arxiv_id":"1910.01963","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-analysis-and-graph-pooling-in-the","title":"Graph Analysis and Graph Pooling in the Spatial Domain","date":"2019-10-03","arxiv_id":"1910.01589","repositories_listed":0,"syntology":null},{"url":null,"slug":"limit-theorems-for-out-of-sample-extensions","title":"Limit theorems for out-of-sample extensions of the adjacency and Laplacian spectral embeddings","date":"2019-09-29","arxiv_id":"1910.00423","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-group-theoretic-framework-for-knowledge","title":"A Group-Theoretic Framework for Knowledge Graph Embedding","date":"2019-09-25","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"global-graph-curvature","title":"Global graph curvature","date":"2019-09-25","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-neural-networks-for-multi-image","title":"Graph Neural Networks For Multi-Image Matching","date":"2019-09-25","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"iterative-deep-graph-learning-for-graph","title":"Iterative Deep Graph Learning for Graph Neural Networks","date":"2019-09-25","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"knowledge-graph-embedding-a-probabilistic","title":"Knowledge Graph Embedding: A Probabilistic Perspective and Generalization Bounds","date":"2019-09-25","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"noigan-noise-aware-knowledge-graph-embedding","title":"NoiGAN: NOISE AWARE KNOWLEDGE GRAPH EMBEDDING WITH GAN","date":"2019-09-25","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"pine-universal-deep-embedding-for-graph-nodes","title":"PINE: Universal Deep Embedding for Graph Nodes via Partial Permutation Invariant Set Functions","date":"2019-09-25","arxiv_id":"1909.12903","repositories_listed":0,"syntology":null},{"url":null,"slug":"toward-understanding-the-effect-of-loss","title":"Toward Understanding The Effect of Loss Function on The Performance of Knowledge Graph Embedding","date":"2019-09-25","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"unsupervised-universal-self-attention-network-1","title":"Unsupervised Universal Self-Attention Network for Graph Classification","date":"2019-09-25","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"triplet-aware-scene-graph-embeddings","title":"Triplet-Aware Scene Graph Embeddings","date":"2019-09-19","arxiv_id":"1909.09256","repositories_listed":0,"syntology":null},{"url":null,"slug":"group-representation-theory-for-knowledge","title":"Group Representation Theory for Knowledge Graph Embedding","date":"2019-09-11","arxiv_id":"1909.05100","repositories_listed":0,"syntology":null},{"url":null,"slug":"lifelog-patterns-analyzation-using-graph","title":"Lifelog Patterns Analyzation using Graph Embedding based on Deep Neural Network","date":"2019-09-10","arxiv_id":"1909.04252","repositories_listed":0,"syntology":null},{"url":null,"slug":"composing-knowledge-graph-embeddings-via-word","title":"Composing Knowledge Graph Embeddings via Word Embeddings","date":"2019-09-09","arxiv_id":"1909.03794","repositories_listed":0,"syntology":null},{"url":null,"slug":"parallel-computation-of-graph-embeddings","title":"Parallel Computation of Graph Embeddings","date":"2019-09-06","arxiv_id":"1909.02977","repositories_listed":0,"syntology":null},{"url":null,"slug":"structured-query-construction-via-knowledge","title":"Structured Query Construction via Knowledge Graph Embedding","date":"2019-09-06","arxiv_id":"1909.02930","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-non-commutative-bilinear-model-for","title":"A Non-commutative Bilinear Model for Answering Path Queries in Knowledge Graphs","date":"2019-09-04","arxiv_id":"1909.01567","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-the-knowledge-graph-completion-using","title":"Toward Understanding The Effect Of Loss function On Then Performance Of Knowledge Graph Embedding","date":"2019-09-02","arxiv_id":"1909.00519","repositories_listed":0,"syntology":null},{"url":null,"slug":"whom-to-learn-from-graph-vs-text-based-word","title":"Whom to Learn From? Graph- vs. Text-based Word Embeddings","date":"2019-09-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"hrge-net-hierarchical-relational-graph","title":"HRGE-Net: Hierarchical Relational Graph Embedding Network for Multi-view 3D Shape Recognition","date":"2019-08-27","arxiv_id":"1908.10098","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-embedding-based-hybrid-social","title":"Graph Embedding Based Hybrid Social Recommendation System","date":"2019-08-26","arxiv_id":"1908.09454","repositories_listed":0,"syntology":null},{"url":null,"slug":"semi-supervised-adversarial-active-learning","title":"SEAL: Semi-supervised Adversarial Active Learning on Attributed Graphs","date":"2019-08-22","arxiv_id":"1908.08169","repositories_listed":0,"syntology":null},{"url":"/paper/logicenn-a-neural-based-knowledge-graphs","slug":"logicenn-a-neural-based-knowledge-graphs","title":"LogicENN: A Neural Based Knowledge Graphs Embedding Model with Logical Rules","date":"2019-08-20","arxiv_id":"1908.07141","repositories_listed":0,"syntology":null},{"url":null,"slug":"temporal-analysis-of-reddit-networks-via-role","title":"Temporal Analysis of Reddit Networks via Role Embeddings","date":"2019-08-14","arxiv_id":"1908.05192","repositories_listed":0,"syntology":null},{"url":"/paper/censnet-convolution-with-edge-node-switching","slug":"censnet-convolution-with-edge-node-switching","title":"CensNet: Convolution with Edge-Node Switching in Graph Neural Networks","date":"2019-08-10","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-embedding-using-infomax-for-asd","title":"Graph Embedding Using Infomax for ASD Classification and Brain Functional Difference Detection","date":"2019-08-09","arxiv_id":"1908.04769","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-node-embeddings-using-domain-aware","title":"Graph Node Embeddings using Domain-Aware Biased Random Walks","date":"2019-08-08","arxiv_id":"1908.02947","repositories_listed":0,"syntology":null},{"url":null,"slug":"authorship-recognition-with-short-text-using","title":"Authorship Recognition with Short-Text using Graph-based Techniques","date":"2019-08-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"tripartite-heterogeneous-graph-propagation","title":"Tripartite Heterogeneous Graph Propagation for Large-scale Social Recommendation","date":"2019-07-24","arxiv_id":"1908.02569","repositories_listed":0,"syntology":null},{"url":null,"slug":"hyperlink-regression-via-bregman-divergence","title":"Hyperlink Regression via Bregman Divergence","date":"2019-07-22","arxiv_id":"1908.02573","repositories_listed":0,"syntology":null},{"url":null,"slug":"improving-skip-gram-based-graph-embeddings","title":"Improving Skip-Gram based Graph Embeddings via Centrality-Weighted Sampling","date":"2019-07-20","arxiv_id":"1907.08793","repositories_listed":0,"syntology":null},{"url":null,"slug":"mercem-method-name-recommendation-based-on","title":"Mercem: Method Name Recommendation Based on Call Graph Embedding","date":"2019-07-12","arxiv_id":"1907.05690","repositories_listed":0,"syntology":null},{"url":null,"slug":"semi-supervised-graph-embedding-for-multi","title":"Semi-Supervised Graph Embedding for Multi-Label Graph Node Classification","date":"2019-07-12","arxiv_id":"1907.05743","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-embeddings-at-scale","title":"Graph Embeddings at Scale","date":"2019-07-03","arxiv_id":"1907.01705","repositories_listed":0,"syntology":null},{"url":null,"slug":"unsupervised-adversarial-graph-alignment-with","title":"Unsupervised Adversarial Graph Alignment with Graph Embedding","date":"2019-07-01","arxiv_id":"1907.00544","repositories_listed":0,"syntology":null},{"url":null,"slug":"identifying-illicit-accounts-in-large-scale-e","title":"Identifying Illicit Accounts in Large Scale E-payment Networks -- A Graph Representation Learning Approach","date":"2019-06-13","arxiv_id":"1906.05546","repositories_listed":0,"syntology":null},{"url":null,"slug":"spaceland-embedding-of-sparse-stochastic","title":"Spaceland Embedding of Sparse Stochastic Graphs","date":"2019-06-13","arxiv_id":"1906.05582","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-representations-of-graph-data-a","title":"Learning Representations of Graph Data -- A Survey","date":"2019-06-07","arxiv_id":"1906.02989","repositories_listed":0,"syntology":null},{"url":null,"slug":"pyramnet-point-cloud-pyramid-attention","title":"PyramNet: Point Cloud Pyramid Attention Network and Graph Embedding Module for Classification and Segmentation","date":"2019-06-07","arxiv_id":"1906.03299","repositories_listed":0,"syntology":null},{"url":null,"slug":"cross-domain-model-compression-by","title":"Cross Domain Model Compression by Structurally Weight Sharing","date":"2019-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"integration-of-knowledge-graph-embedding-into","title":"Integration of Knowledge Graph Embedding Into Topic Modeling with Hierarchical Dirichlet Process","date":"2019-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"190600120","title":"Consensus Clustering: An Embedding Perspective, Extension and Beyond","date":"2019-05-31","arxiv_id":"1906.00120","repositories_listed":0,"syntology":null},{"url":null,"slug":"scalable-and-transferable-learning-of","title":"Learning NP-Hard Multi-Agent Assignment Planning using GNN: Inference on a Random Graph and Provable Auction-Fitted Q-learning","date":"2019-05-29","arxiv_id":"1905.12204","repositories_listed":0,"syntology":null},{"url":null,"slug":"triple2vec-learning-triple-embeddings-from","title":"Triple2Vec: Learning Triple Embeddings from Knowledge Graphs","date":"2019-05-28","arxiv_id":"1905.11691","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-cross-domain-representation-with","title":"Learning Cross-Domain Representation with Multi-Graph Neural Network","date":"2019-05-24","arxiv_id":"1905.10095","repositories_listed":0,"syntology":null},{"url":null,"slug":"knowledge-graph-embedding-bi-vector-models","title":"Knowledge Graph Embedding Bi-Vector Models for Symmetric Relation","date":"2019-05-23","arxiv_id":"1905.09557","repositories_listed":0,"syntology":null},{"url":null,"slug":"toward-understanding-the-effect-of-loss-1","title":"Toward Understanding The Effect of Loss Function on The Performance of Knowledge Graph Embedding","date":"2019-05-22","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"logicenn-a-neural-based-knowledge-graphs-1","title":"LogicENN: A Neural Based Knowledge Graphs Embedding Model with Logical Rules","date":"2019-05-21","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"scalable-graph-embeddings-via-sparse","title":"Scalable Graph Embeddings via Sparse Transpose Proximities","date":"2019-05-16","arxiv_id":"1905.07245","repositories_listed":0,"syntology":null},{"url":null,"slug":"tracewalk-semantic-based-process-graph","title":"TraceWalk: Semantic-based Process Graph Embedding for Consistency Checking","date":"2019-05-16","arxiv_id":"1905.06883","repositories_listed":0,"syntology":null},{"url":null,"slug":"language-in-our-time-an-empirical-analysis-of","title":"Language in Our Time: An Empirical Analysis of Hashtags","date":"2019-05-11","arxiv_id":"1905.04590","repositories_listed":0,"syntology":null},{"url":null,"slug":"vertex-nomination-consistent-estimation-and","title":"Vertex Nomination, Consistent Estimation, and Adversarial Modification","date":"2019-05-06","arxiv_id":"1905.01776","repositories_listed":0,"syntology":null},{"url":null,"slug":"deep-geometrical-graph-classification","title":"DEEP GEOMETRICAL GRAPH CLASSIFICATION","date":"2019-05-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"relwalk-a-latent-variable-model-approach-to","title":"RelWalk -- A Latent Variable Model Approach to Knowledge Graph Embedding","date":"2019-05-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"riemannian-transe-multi-relational-graph","title":"Riemannian TransE: Multi-relational Graph Embedding in Non-Euclidean Space","date":"2019-05-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"towards-data-poisoning-attack-against","title":"Data Poisoning Attack against Knowledge Graph Embedding","date":"2019-04-26","arxiv_id":"1904.12052","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-embedded-multi-layer-kernel-extreme","title":"Graph-Embedded Multi-layer Kernel Extreme Learning Machine for One-class Classification or (Graph-Embedded Multi-layer Kernel Ridge Regression for One-class Classification)","date":"2019-04-13","arxiv_id":"1904.06491","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-pattern-entity-ranking-model-for","title":"Graph Pattern Entity Ranking Model for Knowledge Graph Completion","date":"2019-04-05","arxiv_id":"1904.02856","repositories_listed":0,"syntology":null},{"url":null,"slug":"domain-representation-for-knowledge-graph","title":"Domain Representation for Knowledge Graph Embedding","date":"2019-03-26","arxiv_id":"1903.10716","repositories_listed":0,"syntology":null},{"url":null,"slug":"unsupervised-concatenation-hashing-with","title":"Unsupervised Multi-modal Hashing for Cross-modal retrieval","date":"2019-03-26","arxiv_id":"1904.00726","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-deep-patent-landscaping-model-using","title":"Deep Patent Landscaping Model Using Transformer and Graph Embedding","date":"2019-03-14","arxiv_id":"1903.05823","repositories_listed":0,"syntology":null},{"url":null,"slug":"interaction-embeddings-for-prediction-and","title":"Interaction Embeddings for Prediction and Explanation in Knowledge Graphs","date":"2019-03-12","arxiv_id":"1903.04750","repositories_listed":0,"syntology":null},{"url":null,"slug":"logic-rules-powered-knowledge-graph-embedding","title":"Logic Rules Powered Knowledge Graph Embedding","date":"2019-03-09","arxiv_id":"1903.03772","repositories_listed":0,"syntology":null},{"url":null,"slug":"empirical-effect-of-graph-embeddings-on-fraud","title":"Empirical effect of graph embeddings on fraud detection/ risk mitigation","date":"2019-03-05","arxiv_id":"1903.05976","repositories_listed":0,"syntology":null},{"url":null,"slug":"deep-adversarial-network-alignment","title":"Deep Adversarial Network Alignment","date":"2019-02-27","arxiv_id":"1902.10307","repositories_listed":0,"syntology":null},{"url":null,"slug":"joint-modeling-of-dense-and-incomplete","title":"Joint Modeling of Dense and Incomplete Trajectories for Citywide Traffic Volume Inference","date":"2019-02-25","arxiv_id":"1902.09255","repositories_listed":0,"syntology":null},{"url":null,"slug":"robust-graph-embedding-with-noisy-link","title":"Robust Graph Embedding with Noisy Link Weights","date":"2019-02-22","arxiv_id":"1902.08440","repositories_listed":0,"syntology":null},{"url":null,"slug":"variational-quantum-circuit-model-for","title":"Variational Quantum Circuit Model for Knowledge Graphs Embedding","date":"2019-02-19","arxiv_id":"1903.00556","repositories_listed":0,"syntology":null},{"url":null,"slug":"3d-graph-embedding-learning-with-a-structure","title":"3D Graph Embedding Learning with a Structure-aware Loss Function for Point Cloud Semantic Instance Segmentation","date":"2019-02-14","arxiv_id":"1902.05247","repositories_listed":0,"syntology":null},{"url":null,"slug":"examining-adversarial-learning-against-graph","title":"Examining Adversarial Learning against Graph-based IoT Malware Detection Systems","date":"2019-02-12","arxiv_id":"1902.04416","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-relational-tucker-decomposition-for-multi","title":"A Relational Tucker Decomposition for Multi-Relational Link Prediction","date":"2019-02-03","arxiv_id":"1902.00898","repositories_listed":0,"syntology":null},{"url":null,"slug":"190108286","title":"Neural IR Meets Graph Embedding: A Ranking Model for Product Search","date":"2019-01-24","arxiv_id":"1901.08286","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-graph-embedding-with-adversarial","title":"Learning Graph Embedding with Adversarial Training Methods","date":"2019-01-04","arxiv_id":"1901.01250","repositories_listed":0,"syntology":null},{"url":null,"slug":"dimensionality-reduction-of-hyperspectral","title":"Dimensionality Reduction of Hyperspectral Imagery Based on Spatial-spectral Manifold Learning","date":"2018-12-22","arxiv_id":"1812.09530","repositories_listed":0,"syntology":null},{"url":null,"slug":"deep-program-reidentification-a-graph-neural","title":"Attentional Heterogeneous Graph Neural Network: Application to Program Reidentification","date":"2018-12-10","arxiv_id":"1812.04064","repositories_listed":0,"syntology":null},{"url":null,"slug":"improved-knowledge-graph-embedding-using","title":"Improved Knowledge Graph Embedding using Background Taxonomic Information","date":"2018-12-07","arxiv_id":"1812.03235","repositories_listed":0,"syntology":null}],"record_sha256":"d5e42c678c9b8fa3d7f8def896e3c01cc668beeff640cd1882b0cbc5a292daab","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}