{"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/20","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":20,"pages_in_order":20,"rows_per_page":100,"rows":[1901,1949],"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/19","next":null,"papers":[{"url":null,"slug":"a-generative-model-of-words-and-relationships","title":"A Generative Model of Words and Relationships from Multiple Sources","date":"2015-10-01","arxiv_id":"1510.00259","repositories_listed":0,"syntology":null},{"url":null,"slug":"aligning-knowledge-and-text-embeddings-by","title":"Aligning Knowledge and Text Embeddings by Entity Descriptions","date":"2015-09-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"birds-of-a-feather-linked-together-a","title":"Birds of a Feather Linked Together: A Discriminative Topic Model using Link-based Priors","date":"2015-09-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"composing-relationships-with-translations","title":"Composing Relationships with Translations","date":"2015-09-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"context-dependent-knowledge-graph-embedding","title":"Context-Dependent Knowledge Graph Embedding","date":"2015-09-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"efficient-and-expressive-knowledge-base","title":"Efficient and Expressive Knowledge Base Completion Using Subgraph Feature Extraction","date":"2015-09-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"measuring-prerequisite-relations-among","title":"Measuring Prerequisite Relations Among Concepts","date":"2015-09-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"representing-text-for-joint-embedding-of-text","title":"Representing Text for Joint Embedding of Text and Knowledge Bases","date":"2015-09-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"type-constrained-representation-learning-in","title":"Type-Constrained Representation Learning in Knowledge Graphs","date":"2015-08-11","arxiv_id":"1508.02593","repositories_listed":0,"syntology":null},{"url":null,"slug":"entity-hierarchy-embedding","title":"Entity Hierarchy Embedding","date":"2015-07-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-relational-features-with-backward","title":"Learning Relational Features with Backward Random Walks","date":"2015-07-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"semantically-smooth-knowledge-graph-embedding","title":"Semantically Smooth Knowledge Graph Embedding","date":"2015-07-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"towards-combined-matrix-and-tensor","title":"Towards Combined Matrix and Tensor Factorization for Universal Schema Relation Extraction","date":"2015-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"knowlege-graph-embedding-by-flexible","title":"Knowlege Graph Embedding by Flexible Translation","date":"2015-05-20","arxiv_id":"1505.05253","repositories_listed":0,"syntology":null},{"url":null,"slug":"evaluating-link-prediction-methods","title":"Evaluating Link Prediction Methods","date":"2015-05-15","arxiv_id":"1505.04094","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-hybrid-generativediscriminative-approach-to","title":"A Hybrid Generative/Discriminative Approach To Citation Prediction","date":"2015-05-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"fast-sampling-for-bayesian-max-margin-models","title":"Fast Sampling for Bayesian Max-Margin Models","date":"2015-04-27","arxiv_id":"1504.07107","repositories_listed":0,"syntology":null},{"url":null,"slug":"handling-oversampling-in-dynamic-networks","title":"Handling oversampling in dynamic networks using link prediction","date":"2015-04-24","arxiv_id":"1504.06667","repositories_listed":0,"syntology":null},{"url":null,"slug":"large-margin-nearest-neighbor-embedding-for","title":"Large Margin Nearest Neighbor Embedding for Knowledge Representation","date":"2015-04-07","arxiv_id":"1504.01684","repositories_listed":0,"syntology":null},{"url":null,"slug":"nonparametric-relational-topic-models-through","title":"Nonparametric Relational Topic Models through Dependent Gamma Processes","date":"2015-03-30","arxiv_id":"1503.08542","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-embedding-representations-for","title":"Learning Embedding Representations for Knowledge Inference on Imperfect and Incomplete Repositories","date":"2015-03-27","arxiv_id":"1503.08155","repositories_listed":0,"syntology":null},{"url":null,"slug":"infinite-edge-partition-models-for","title":"Infinite Edge Partition Models for Overlapping Community Detection and Link Prediction","date":"2015-01-25","arxiv_id":"1501.06218","repositories_listed":0,"syntology":null},{"url":null,"slug":"efficient-inference-of-overlapping","title":"Efficient inference of overlapping communities in complex networks","date":"2014-11-28","arxiv_id":"1411.7864","repositories_listed":0,"syntology":null},{"url":null,"slug":"pu-learning-for-matrix-completion","title":"PU Learning for Matrix Completion","date":"2014-11-22","arxiv_id":"1411.6081","repositories_listed":0,"syntology":null},{"url":null,"slug":"scalable-link-prediction-in-dynamic-networks","title":"Scalable Link Prediction in Dynamic Networks via Non-Negative Matrix Factorization","date":"2014-11-13","arxiv_id":"1411.3675","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-parallel-and-efficient-algorithm-for","title":"A Parallel and Efficient Algorithm for Learning to Match","date":"2014-10-22","arxiv_id":"1410.6414","repositories_listed":0,"syntology":null},{"url":null,"slug":"predicting-missing-links-via-correlation","title":"Predicting missing links via correlation between nodes","date":"2014-09-30","arxiv_id":"1409.8485","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-bayesian-tensor-factorization-model-via","title":"A Bayesian Tensor Factorization Model via Variational Inference for Link Prediction","date":"2014-09-29","arxiv_id":"1409.8276","repositories_listed":0,"syntology":null},{"url":null,"slug":"bayesian-models-of-graphs-arrays-and-other","title":"Bayesian Models of Graphs, Arrays and Other Exchangeable Random Structures","date":"2013-12-30","arxiv_id":"1312.7857","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-scalable-approach-to-probabilistic-latent","title":"A Scalable Approach to Probabilistic Latent Space Inference of Large-Scale Networks","date":"2013-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"efficient-online-inference-for-bayesian","title":"Efficient Online Inference for Bayesian Nonparametric Relational Models","date":"2013-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"modeling-overlapping-communities-with-node","title":"Modeling Overlapping Communities with Node Popularities","date":"2013-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"similarity-component-analysis","title":"Similarity Component Analysis","date":"2013-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"nonparametric-multi-group-membership-model","title":"Nonparametric Multi-group Membership Model for Dynamic Networks","date":"2013-11-08","arxiv_id":"1311.2079","repositories_listed":0,"syntology":null},{"url":null,"slug":"discriminative-link-prediction-using-local","title":"Discriminative Link Prediction using Local Links, Node Features and Community Structure","date":"2013-10-17","arxiv_id":"1310.4579","repositories_listed":0,"syntology":null},{"url":null,"slug":"predicting-social-links-for-new-users-across","title":"Predicting Social Links for New Users across Aligned Heterogeneous Social Networks","date":"2013-10-13","arxiv_id":"1310.3492","repositories_listed":0,"syntology":null},{"url":null,"slug":"copula-mixed-membership-stochastic-blockmodel","title":"Copula Mixed-Membership Stochastic Blockmodel for Intra-Subgroup Correlations","date":"2013-06-12","arxiv_id":"1306.2733","repositories_listed":0,"syntology":null},{"url":null,"slug":"link-prediction-with-social-vector-clocks","title":"Link Prediction with Social Vector Clocks","date":"2013-04-15","arxiv_id":"1304.4058","repositories_listed":0,"syntology":null},{"url":null,"slug":"scalable-text-and-link-analysis-with-mixed","title":"Scalable Text and Link Analysis with Mixed-Topic Link Models","date":"2013-03-28","arxiv_id":"1303.7264","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-based-generalization-bounds-for","title":"Graph-based Generalization Bounds for Learning Binary Relations","date":"2013-02-21","arxiv_id":"1302.5348","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-semantic-matching-energy-function-for","title":"A Semantic Matching Energy Function for Learning with Multi-relational Data","date":"2013-01-15","arxiv_id":"1301.3485","repositories_listed":0,"syntology":null},{"url":null,"slug":"link-prediction-in-graphs-with-autoregressive","title":"Link Prediction in Graphs with Autoregressive Features","date":"2012-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"topic-partitioned-multinetwork-embeddings","title":"Topic-Partitioned Multinetwork Embeddings","date":"2012-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"reading-the-web-with-learned-syntactic","title":"Reading The Web with Learned Syntactic-Semantic Inference Rules","date":"2012-07-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"uwn-a-large-multilingual-lexical-knowledge","title":"UWN: A Large Multilingual Lexical Knowledge Base","date":"2012-07-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"nonparametric-link-prediction-in-dynamic","title":"Nonparametric Link Prediction in Dynamic Networks","date":"2012-06-27","arxiv_id":"1206.6394","repositories_listed":0,"syntology":null},{"url":null,"slug":"nonparametric-link-prediction-in-large-scale","title":"Nonparametric Link Prediction in Large Scale Dynamic Networks","date":"2011-09-06","arxiv_id":"1109.1077","repositories_listed":0,"syntology":null},{"url":null,"slug":"nonparametric-latent-feature-models-for-link","title":"Nonparametric Latent Feature Models for Link Prediction","date":"2009-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"gaussian-process-models-for-link-analysis-and","title":"Gaussian Process Models for Link Analysis and Transfer Learning","date":"2007-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null}],"record_sha256":"c8238b437d80be2a78fb7981061ccc207aa6a48c14bc94ec56dfbba733ef5d07","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}