{"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/link-prediction/papers/19","list_of":"/task/link-prediction","task":"Link Prediction","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":19,"pages_in_order":20,"rows_per_page":100,"rows":[1801,1900],"of":1949,"counts":{"archive_papers_tagged":1949,"with_a_code_link":974,"where_syntology_ran_a_sample":233,"not_listed_spam_title":0,"listed":1949,"listed_where_code_ran":233,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":206,"every_run_a_failure_of_syntologys_instrument":27,"listed_with_a_run_with_no_instrument_failure":206,"listed_every_run_a_failure_of_syntologys_instrument":27,"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/link-prediction","prev":"/task/link-prediction/papers/18","next":"/task/link-prediction/papers/20","papers":[{"url":null,"slug":"probabilistic-knowledge-graph-embeddings","title":"Probabilistic Knowledge Graph Embeddings","date":"2018-09-27","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"incorporating-gan-for-negative-sampling-in","title":"Incorporating GAN for Negative Sampling in Knowledge Representation Learning","date":"2018-09-23","arxiv_id":"1809.11017","repositories_listed":0,"syntology":null},{"url":null,"slug":"improved-deep-embeddings-for-inferencing-with","title":"Improved Deep Embeddings for Inferencing with Multi-Layered Networks","date":"2018-09-20","arxiv_id":"1811.12156","repositories_listed":0,"syntology":null},{"url":null,"slug":"tge-ps-text-driven-graph-embedding-with-pairs","title":"Sampled in Pairs and Driven by Text: A New Graph Embedding Framework","date":"2018-09-12","arxiv_id":"1809.04234","repositories_listed":0,"syntology":null},{"url":null,"slug":"feature-learning-for-meta-paths-in-knowledge","title":"Feature Learning for Meta-Paths in Knowledge Graphs","date":"2018-09-07","arxiv_id":"1809.03267","repositories_listed":0,"syntology":null},{"url":"/paper/auggan-cross-domain-adaptation-with-gan-based","slug":"auggan-cross-domain-adaptation-with-gan-based","title":"AugGAN: Cross Domain Adaptation with GAN-based Data Augmentation","date":"2018-09-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"improving-visual-relationship-detection-using","title":"Improving Visual Relationship Detection using Semantic Modeling of Scene Descriptions","date":"2018-09-01","arxiv_id":"1809.00204","repositories_listed":0,"syntology":null},{"url":null,"slug":"improved-semantic-aware-network-embedding","title":"Improved Semantic-Aware Network Embedding with Fine-Grained Word Alignment","date":"2018-08-29","arxiv_id":"1808.09633","repositories_listed":0,"syntology":null},{"url":null,"slug":"towards-anticipation-of-architectural-smells","title":"Towards Anticipation of Architectural Smells using Link Prediction Techniques","date":"2018-08-20","arxiv_id":"1808.06362","repositories_listed":0,"syntology":null},{"url":null,"slug":"can-network-analysis-techniques-help-to","title":"Can Network Analysis Techniques help to Predict Design Dependencies? An Initial Study","date":"2018-08-08","arxiv_id":"1808.02776","repositories_listed":0,"syntology":null},{"url":null,"slug":"deeplink-a-novel-link-prediction-framework","title":"DeepLink: A Novel Link Prediction Framework based on Deep Learning","date":"2018-07-27","arxiv_id":"1807.10494","repositories_listed":0,"syntology":null},{"url":null,"slug":"global-and-local-evaluation-of-link","title":"Global and local evaluation of link prediction tasks with neural embeddings","date":"2018-07-27","arxiv_id":"1807.10511","repositories_listed":0,"syntology":null},{"url":null,"slug":"acekg-a-large-scale-knowledge-graph-for","title":"AceKG: A Large-scale Knowledge Graph for Academic Data Mining","date":"2018-07-23","arxiv_id":"1807.08484","repositories_listed":0,"syntology":null},{"url":null,"slug":"linknbed-multi-graph-representation-learning","title":"LinkNBed: Multi-Graph Representation Learning with Entity Linkage","date":"2018-07-23","arxiv_id":"1807.08447","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-sequence-learning-method-for-domain","title":"A Sequence Learning Method for Domain-Specific Entity Linking","date":"2018-07-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"knowledge-graph-embedding-with-numeric","title":"Knowledge Graph Embedding with Numeric Attributes of Entities","date":"2018-07-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"accurate-text-enhanced-knowledge-graph","title":"Accurate Text-Enhanced Knowledge Graph Representation Learning","date":"2018-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"scientific-discovery-as-link-prediction-in","title":"Scientific Discovery as Link Prediction in Influence and Citation Graphs","date":"2018-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"diffusion-maps-for-textual-network-embedding","title":"Diffusion Maps for Textual Network Embedding","date":"2018-05-24","arxiv_id":"1805.09906","repositories_listed":0,"syntology":null},{"url":null,"slug":"conditional-network-embeddings","title":"Conditional Network Embeddings","date":"2018-05-19","arxiv_id":"1805.07544","repositories_listed":0,"syntology":null},{"url":null,"slug":"gane-a-generative-adversarial-network","title":"GANE: A Generative Adversarial Network Embedding","date":"2018-05-18","arxiv_id":"1805.07324","repositories_listed":0,"syntology":null},{"url":null,"slug":"recs-robust-graph-embedding-using-connection","title":"RECS: Robust Graph Embedding Using Connection Subgraphs","date":"2018-05-03","arxiv_id":"1805.01509","repositories_listed":0,"syntology":null},{"url":null,"slug":"t-pine-tensor-based-predictable-and","title":"t-PINE: Tensor-based Predictable and Interpretable Node Embeddings","date":"2018-05-03","arxiv_id":"1805.01889","repositories_listed":0,"syntology":null},{"url":null,"slug":"fast-and-scalable-learning-of-neuro-symbolic","title":"Fast and scalable learning of neuro-symbolic representations of biomedical knowledge","date":"2018-04-30","arxiv_id":"1804.11105","repositories_listed":0,"syntology":null},{"url":null,"slug":"optimal-link-prediction-with-matrix-logistic","title":"Optimal link prediction with matrix logistic regression","date":"2018-03-19","arxiv_id":"1803.07054","repositories_listed":0,"syntology":null},{"url":null,"slug":"variational-knowledge-graph-reasoning","title":"Variational Knowledge Graph Reasoning","date":"2018-03-17","arxiv_id":"1803.06581","repositories_listed":0,"syntology":null},{"url":"/paper/deep-learning-in-mobile-and-wireless","slug":"deep-learning-in-mobile-and-wireless","title":"Deep Learning in Mobile and Wireless Networking: A Survey","date":"2018-03-12","arxiv_id":"1803.04311","repositories_listed":0,"syntology":null},{"url":null,"slug":"link-prediction-for-egocentrically-sampled","title":"Link prediction for egocentrically sampled networks","date":"2018-03-12","arxiv_id":"1803.04084","repositories_listed":0,"syntology":null},{"url":null,"slug":"representation-learning-over-dynamic-graphs","title":"Representation Learning over Dynamic Graphs","date":"2018-03-11","arxiv_id":"1803.04051","repositories_listed":0,"syntology":null},{"url":null,"slug":"stochastic-block-models-with-multiple","title":"Stochastic Block Models with Multiple Continuous Attributes","date":"2018-03-07","arxiv_id":"1803.02726","repositories_listed":0,"syntology":null},{"url":null,"slug":"aspem-embedding-learning-by-aspects-in","title":"AspEm: Embedding Learning by Aspects in Heterogeneous Information Networks","date":"2018-03-05","arxiv_id":"1803.01848","repositories_listed":0,"syntology":null},{"url":null,"slug":"tensorial-and-bipartite-block-models-for-link","title":"Tensorial and bipartite block models for link prediction in layered networks and temporal networks","date":"2018-03-05","arxiv_id":"1803.01616","repositories_listed":0,"syntology":null},{"url":null,"slug":"neural-tensor-factorization","title":"Neural Tensor Factorization","date":"2018-02-13","arxiv_id":"1802.04416","repositories_listed":0,"syntology":null},{"url":null,"slug":"weakly-supervised-collective-feature-learning","title":"Weakly supervised collective feature learning from curated media","date":"2018-02-13","arxiv_id":"1802.04668","repositories_listed":0,"syntology":null},{"url":"/paper/m-walk-learning-to-walk-over-graphs-using","slug":"m-walk-learning-to-walk-over-graphs-using","title":"M-Walk: Learning to Walk over Graphs using Monte Carlo Tree Search","date":"2018-02-12","arxiv_id":"1802.04394","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-generative-model-for-dynamic-networks-with","title":"A Generative Model for Dynamic Networks with Applications","date":"2018-02-11","arxiv_id":"1802.03725","repositories_listed":0,"syntology":null},{"url":null,"slug":"knowledge-graph-embedding-with-multiple","title":"Knowledge Graph Embedding with Multiple Relation Projections","date":"2018-01-26","arxiv_id":"1801.08641","repositories_listed":0,"syntology":null},{"url":null,"slug":"fast-node-embeddings-learning-ego-centric","title":"Fast Node Embeddings: Learning Ego-Centric Representations","date":"2018-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"graphgan-generating-graphs-via-random-walks","title":"GraphGAN: Generating Graphs via Random Walks","date":"2018-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"revisiting-knowledge-base-embedding-as-tensor","title":"Revisiting Knowledge Base Embedding as Tensor Decomposition","date":"2018-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"hypotheses-generation-using-link-prediction","title":"Hypotheses generation using link prediction in a bipartite graph","date":"2017-12-26","arxiv_id":"1708.04725","repositories_listed":0,"syntology":null},{"url":null,"slug":"predicting-rich-drug-drug-interactions-via","title":"Predicting Rich Drug-Drug Interactions via Biomedical Knowledge Graphs and Text Jointly Embedding","date":"2017-12-24","arxiv_id":"1712.08875","repositories_listed":0,"syntology":null},{"url":null,"slug":"representation-learning-for-scale-free","title":"Representation Learning for Scale-free Networks","date":"2017-11-29","arxiv_id":"1711.10755","repositories_listed":0,"syntology":null},{"url":null,"slug":"adversarial-network-embedding","title":"Adversarial Network Embedding","date":"2017-11-21","arxiv_id":"1711.07838","repositories_listed":0,"syntology":null},{"url":null,"slug":"toruse-knowledge-graph-embedding-on-a-lie","title":"TorusE: Knowledge Graph Embedding on a Lie Group","date":"2017-11-15","arxiv_id":"1711.05435","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-the-erm-principle-with-networked-data","title":"On the ERM Principle with Networked Data","date":"2017-11-12","arxiv_id":"1711.04297","repositories_listed":0,"syntology":null},{"url":null,"slug":"erratum-link-prediction-in-drug-target","title":"Erratum: Link prediction in drug-target interactions network using similarity indices","date":"2017-11-01","arxiv_id":"1711.00150","repositories_listed":0,"syntology":null},{"url":null,"slug":"inductive-representation-learning-in-large","title":"Inductive Representation Learning in Large Attributed Graphs","date":"2017-10-25","arxiv_id":"1710.09471","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-social-image-embedding-with-deep","title":"Learning Social Image Embedding with Deep Multimodal Attention Networks","date":"2017-10-18","arxiv_id":"1710.06582","repositories_listed":0,"syntology":null},{"url":null,"slug":"lasagne-locality-and-structure-aware-graph","title":"LASAGNE: Locality And Structure Aware Graph Node Embedding","date":"2017-10-17","arxiv_id":"1710.06520","repositories_listed":0,"syntology":null},{"url":null,"slug":"safe-medicine-recommendation-via-medical","title":"SMR: Medical Knowledge Graph Embedding for Safe Medicine Recommendation","date":"2017-10-16","arxiv_id":"1710.05980","repositories_listed":0,"syntology":null},{"url":null,"slug":"community-aware-random-walk-for-network","title":"Community Aware Random Walk for Network Embedding","date":"2017-10-14","arxiv_id":"1710.05199","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-dynamic-edge-exchangeable-model-for-sparse","title":"A Dynamic Edge Exchangeable Model for Sparse Temporal Networks","date":"2017-10-11","arxiv_id":"1710.04008","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-the-model-shrinkage-effect-of-gamma","title":"On the Model Shrinkage Effect of Gamma Process Edge Partition Models","date":"2017-09-26","arxiv_id":"1709.08770","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-comprehensive-survey-of-graph-embedding","title":"A Comprehensive Survey of Graph Embedding: Problems, Techniques and Applications","date":"2017-09-22","arxiv_id":"1709.07604","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-statistical-interpretation-of-spectral","title":"A statistical interpretation of spectral embedding: the generalised random dot product graph","date":"2017-09-16","arxiv_id":"1709.05506","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-multi-relational-link-prediction-with","title":"On Multi-Relational Link Prediction with Bilinear Models","date":"2017-09-14","arxiv_id":"1709.04808","repositories_listed":0,"syntology":null},{"url":null,"slug":"complex-and-holographic-embeddings-of","title":"Complex and Holographic Embeddings of Knowledge Graphs: A Comparison","date":"2017-07-05","arxiv_id":"1707.01475","repositories_listed":0,"syntology":null},{"url":null,"slug":"npglm-a-non-parametric-method-for-temporal","title":"NPGLM: A Non-Parametric Method for Temporal Link Prediction","date":"2017-06-21","arxiv_id":"1706.06783","repositories_listed":0,"syntology":null},{"url":null,"slug":"deep-generative-models-for-relational-data","title":"Deep Generative Models for Relational Data with Side Information","date":"2017-06-16","arxiv_id":"1706.05136","repositories_listed":0,"syntology":null},{"url":null,"slug":"attributed-network-embedding-for-learning-in","title":"Attributed Network Embedding for Learning in a Dynamic Environment","date":"2017-06-06","arxiv_id":"1706.01860","repositories_listed":0,"syntology":null},{"url":null,"slug":"cross-view-link-prediction-by-learning-noise","title":"Cross view link prediction by learning noise-resilient representation consensus","date":"2017-04-03","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"improving-neural-knowledge-base-completion","title":"Improving Neural Knowledge Base Completion with Cross-Lingual Projections","date":"2017-04-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"classification-in-biological-networks-with","title":"Classification in biological networks with hypergraphlet kernels","date":"2017-03-14","arxiv_id":"1703.04823","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-the-equivalence-of-holographic-and-complex","title":"On the Equivalence of Holographic and Complex Embeddings for Link Prediction","date":"2017-02-18","arxiv_id":"1702.05563","repositories_listed":0,"syntology":null},{"url":null,"slug":"forward-backward-similarity-search-in","title":"Forward Backward Similarity Search in Knowledge Networks","date":"2016-11-28","arxiv_id":"1611.09316","repositories_listed":0,"syntology":null},{"url":null,"slug":"hierarchical-hyperlink-prediction-for-the-www","title":"Hierarchical Hyperlink Prediction for the WWW","date":"2016-11-28","arxiv_id":"1611.09084","repositories_listed":0,"syntology":null},{"url":null,"slug":"knowledge-graph-representation-with-jointly","title":"Knowledge Graph Representation with Jointly Structural and Textual Encoding","date":"2016-11-26","arxiv_id":"1611.08661","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-noesis-network-oriented-exploration","title":"The NOESIS Network-Oriented Exploration, Simulation, and Induction System","date":"2016-11-15","arxiv_id":"1611.04810","repositories_listed":0,"syntology":null},{"url":null,"slug":"link-prediction-using-embedded-knowledge","title":"Link Prediction using Embedded Knowledge Graphs","date":"2016-11-14","arxiv_id":"1611.04642","repositories_listed":0,"syntology":null},{"url":null,"slug":"limitations-and-alternatives-for-the","title":"Limitations and Alternatives for the Evaluation of Large-scale Link Prediction","date":"2016-11-02","arxiv_id":"1611.00547","repositories_listed":0,"syntology":null},{"url":null,"slug":"encoding-temporal-information-for-time-aware","title":"Encoding Temporal Information for Time-Aware Link Prediction","date":"2016-11-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":"/paper/jointly-embedding-knowledge-graphs-and","slug":"jointly-embedding-knowledge-graphs-and","title":"Jointly Embedding Knowledge Graphs and Logical Rules","date":"2016-11-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":"/paper/discriminative-gaifman-models","slug":"discriminative-gaifman-models","title":"Discriminative Gaifman Models","date":"2016-10-28","arxiv_id":"1610.09369","repositories_listed":0,"syntology":null},{"url":null,"slug":"semi-supervised-graph-embedding-approach-to","title":"Semi-supervised Graph Embedding Approach to Dynamic Link Prediction","date":"2016-10-14","arxiv_id":"1610.04351","repositories_listed":0,"syntology":null},{"url":null,"slug":"improved-knowledge-base-completion-by-path","title":"Improved Knowledge Base Completion by Path-Augmented TransR Model","date":"2016-10-06","arxiv_id":"1610.04073","repositories_listed":0,"syntology":null},{"url":null,"slug":"knowledge-representation-via-joint-learning","title":"Knowledge Representation via Joint Learning of Sequential Text and Knowledge Graphs","date":"2016-09-22","arxiv_id":"1609.07075","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-word-embeddings-from-intrinsic-and","title":"Learning Word Embeddings from Intrinsic and Extrinsic Views","date":"2016-08-20","arxiv_id":"1608.05852","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-discriminative-topic-model-using-document","title":"A Discriminative Topic Model using Document Network Structure","date":"2016-08-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"discriminative-deep-random-walk-for-network","title":"Discriminative Deep Random Walk for Network Classification","date":"2016-08-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"evaluating-link-prediction-accuracy-on","title":"Evaluating Link Prediction Accuracy on Dynamic Networks with Added and Removed Edges","date":"2016-07-25","arxiv_id":"1607.07330","repositories_listed":0,"syntology":null},{"url":null,"slug":"adaptive-neighborhood-graph-construction-for","title":"Adaptive Neighborhood Graph Construction for Inference in Multi-Relational Networks","date":"2016-07-02","arxiv_id":"1607.00474","repositories_listed":0,"syntology":null},{"url":null,"slug":"predict-anchor-links-across-social-networks","title":"Predict Anchor Links across Social Networks via an Embedding Approach","date":"2016-06-25","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"link-prediction-via-matrix-completion","title":"Link Prediction via Matrix Completion","date":"2016-06-22","arxiv_id":"1606.06812","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-translation-based-knowledge-graph-embedding","title":"A Translation-Based Knowledge Graph Embedding Preserving Logical Property of Relations","date":"2016-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"applying-universal-schemas-for-domain","title":"Applying Universal Schemas for Domain Specific Ontology Expansion","date":"2016-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"a-critical-examination-of-rescal-for","title":"A Critical Examination of RESCAL for Completion of Knowledge Bases with Transitive Relations","date":"2016-05-16","arxiv_id":"1605.04672","repositories_listed":0,"syntology":null},{"url":null,"slug":"adaptive-candidate-generation-for-scalable","title":"Adaptive Candidate Generation for Scalable Edge-discovery Tasks on Data Graphs","date":"2016-05-02","arxiv_id":"1605.00686","repositories_listed":0,"syntology":null},{"url":null,"slug":"leveraging-network-dynamics-for-improved-link","title":"Leveraging Network Dynamics for Improved Link Prediction","date":"2016-04-08","arxiv_id":"1604.03221","repositories_listed":0,"syntology":null},{"url":null,"slug":"max-margin-nonparametric-latent-feature","title":"Max-Margin Nonparametric Latent Feature Models for Link Prediction","date":"2016-02-24","arxiv_id":"1602.07428","repositories_listed":0,"syntology":null},{"url":null,"slug":"machine-learning-meets-network-science","title":"Machine learning meets network science: dimensionality reduction for fast and efficient embedding of networks in the hyperbolic space","date":"2016-02-21","arxiv_id":"1602.06522","repositories_listed":0,"syntology":null},{"url":null,"slug":"log-normal-matrix-completion-for-large-scale","title":"Log-Normal Matrix Completion for Large Scale Link Prediction","date":"2016-01-28","arxiv_id":"1601.07714","repositories_listed":0,"syntology":null},{"url":null,"slug":"trust-from-the-past-bayesian-personalized","title":"Trust from the past: Bayesian Personalized Ranking based Link Prediction in Knowledge Graphs","date":"2016-01-14","arxiv_id":"1601.03778","repositories_listed":0,"syntology":null},{"url":null,"slug":"from-one-point-to-a-manifold-knowledge-graph","title":"From One Point to A Manifold: Knowledge Graph Embedding For Precise Link Prediction","date":"2015-12-15","arxiv_id":"1512.04792","repositories_listed":0,"syntology":null},{"url":null,"slug":"dropout-training-of-matrix-factorization-and","title":"Dropout Training of Matrix Factorization and Autoencoder for Link Prediction in Sparse Graphs","date":"2015-12-14","arxiv_id":"1512.04483","repositories_listed":0,"syntology":null},{"url":null,"slug":"discriminative-nonparametric-latent-feature","title":"Discriminative Nonparametric Latent Feature Relational Models with Data Augmentation","date":"2015-12-07","arxiv_id":"1512.02016","repositories_listed":0,"syntology":null},{"url":null,"slug":"halting-in-random-walk-kernels","title":"Halting in Random Walk Kernels","date":"2015-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"the-consistency-of-common-neighbors-for-link","title":"The Consistency of Common Neighbors for Link Prediction in Stochastic Blockmodels","date":"2015-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"handling-class-imbalance-in-link-prediction","title":"Handling Class Imbalance in Link Prediction using Learning to Rank Techniques","date":"2015-11-13","arxiv_id":"1511.04383","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-multi-faceted-representations-of","title":"Learning multi-faceted representations of individuals from heterogeneous evidence using neural networks","date":"2015-10-18","arxiv_id":"1510.05198","repositories_listed":0,"syntology":null}],"record_sha256":"a357d01f20f5a6568db6a31f932b3536eb7139bfae7147ca3ce8c369ee271b88","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}