{"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":"/method/line","slug":"line","name":"LINE","full_name":"Large-scale Information Network Embedding","full_name_withheld":false,"description_markdown":"LINE is a novel network embedding method which is suitable for arbitrary types of information networks: undirected, directed, and/or weighted. The method optimizes a carefully designed objective function that preserves both the local and global network structures.\r\n\r\nSource: [Tang et al.](https://arxiv.org/pdf/1503.03578v1.pdf)\r\n\r\nImage source: [Tang et al.](https://arxiv.org/pdf/1503.03578v1.pdf)","description_state":"present","introduced_year":null,"introduced_by":{"title":null,"paper":null,"first_author":null,"n_authors":0,"url_abs":null,"archive_paper_url":null},"source":{"url":"http://arxiv.org/abs/1503.03578v1","title":"LINE: Large-scale Information Network Embedding","url_on_a_paper_host":true},"code_snippet_url":null,"code_snippet_url_on_a_code_host":false,"categories":[{"area":"Graphs","area_id":"graphs","collection":"Graph Embeddings","url":"/methods/category/graph-embeddings","pwc_aliases":[]}],"n_papers_tagged":9,"archive_num_papers":null,"papers_newest_first":[{"paper":null,"slug":"highly-conserved-sequence-specific-double","title":"Highly conserved sequence-specific double-stranded DNA binding networks contributing to divergent genomic evolution of human and chimpanzee brain development","date":"2024-09-12","arxiv_id":"2409.07812","n_code_links":0,"syntology":null},{"paper":"/paper/robustness-of-graph-embedding-methods-for","slug":"robustness-of-graph-embedding-methods-for","title":"Robustness of graph embedding methods for community detection","date":"2024-05-01","arxiv_id":"2405.00636","n_code_links":1,"syntology":null},{"paper":null,"slug":"re-visiting-skip-gram-negative-sampling","title":"Bypassing Skip-Gram Negative Sampling: Dimension Regularization as a More Efficient Alternative for Graph Embeddings","date":"2024-04-30","arxiv_id":"2405.00172","n_code_links":0,"syntology":null},{"paper":null,"slug":"chatbot-application-to-support-smart","title":"Chatbot Application to Support Smart Agriculture in Thailand","date":"2023-07-31","arxiv_id":"2308.02524","n_code_links":0,"syntology":null},{"paper":null,"slug":"generating-post-hoc-explanations-for-skip","title":"Generating Post-hoc Explanations for Skip-gram-based Node Embeddings by Identifying Important Nodes with Bridgeness","date":"2023-04-24","arxiv_id":"2304.12036","n_code_links":0,"syntology":null},{"paper":null,"slug":"large-scale-privacy-preserving-network","title":"Large-Scale Privacy-Preserving Network Embedding against Private Link Inference Attacks","date":"2022-05-28","arxiv_id":"2205.14440","n_code_links":0,"syntology":null},{"paper":null,"slug":"learning-large-scale-network-embedding-from","title":"Learning Large-scale Network Embedding from Representative Subgraph","date":"2021-12-02","arxiv_id":"2112.01442","n_code_links":0,"syntology":null},{"paper":null,"slug":"generalizable-cross-graph-embedding-for-gnn","title":"Generalizable Cross-Graph Embedding for GNN-based Congestion Prediction","date":"2021-11-10","arxiv_id":"2111.05941","n_code_links":0,"syntology":null},{"paper":"/paper/line-large-scale-information-network","slug":"line-large-scale-information-network","title":"LINE: Large-scale Information Network Embedding","date":"2015-03-12","arxiv_id":"1503.03578","n_code_links":9,"syntology":{"ran":2,"of":3,"n_ran_checked":2,"n_instrument":0,"unverified":1,"pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","official":{"repos":["tangjianpku/LINE"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}}],"papers_shown":9,"papers_order":"date (newest first), then slug","paper_counts":{"archive_papers_tagged":9,"with_a_code_link":2,"where_syntology_ran_a_sample":1,"not_listed_spam_title":0,"listed":9,"listed_where_code_ran":1,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":1,"every_run_a_failure_of_syntologys_instrument":0,"listed_with_a_run_with_no_instrument_failure":1,"listed_every_run_a_failure_of_syntologys_instrument":0,"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"},"papers_where_code_ran":1,"papers_where_code_ran_first_page":"/method/line/papers/ran/1","papers_where_code_ran_caption":"We ran code from the paper's repository; we did not isolate this method inside it.","pages":[{"order":"ran","page":1,"of":1,"url":"/method/line/papers/ran/1","json":"/method/line/papers/ran/1.json","rows":1}],"tasks":[{"task":"/task/graph-embedding","name":"Graph Embedding","papers":5},{"task":"/task/link-prediction","name":"Link Prediction","papers":3},{"task":"/task/network-embedding","name":"Network Embedding","papers":3},{"task":"/task/node-classification","name":"Node Classification","papers":2},{"task":"/task/chatbot","name":"Chatbot","papers":1},{"task":"/task/community-detection","name":"Community Detection","papers":1},{"task":"/task/decision-making","name":"Decision Making","papers":1},{"task":null,"name":"GPU","papers":1},{"task":"/task/graph-neural-network","name":"Graph Neural Network","papers":1},{"task":"/task/graph-sampling","name":"Graph Sampling","papers":1},{"task":"/task/privacy-preserving","name":"Privacy Preserving","papers":1},{"task":"/task/recommendation-systems","name":"Recommendation Systems","papers":1},{"task":"/task/representation-learning","name":"Representation Learning","papers":1},{"task":"/task/self-supervised-learning","name":"Self-Supervised Learning","papers":1}],"tasks_shown":14,"n_tasks":14,"usage_by_year":[{"year":"2015","papers":1},{"year":"2021","papers":2},{"year":"2022","papers":1},{"year":"2023","papers":2},{"year":"2024","papers":3}],"row_source":"embedded","archive":{"source":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","archive_url":"https://paperswithcode.com/method/line"},"syntology_read_at":"2026-10-05T00:36:11+00:00","syntology":{"source":"Syntology's have check for this name (the free coverage lookup), read from Syntology's graph","have_url":"https://syntology.ai/api/graph/have?x=LINE","read_at":"2026-10-05T00:58:33+00:00","query":"LINE","kind":"paper","have":"unknown_name","tier":null,"verified_implementation":null,"level":null,"level_meaning":"the served verification level, per answer; never summed across methods","resolved_to":null,"resolution":null,"resolved_name_differs":false,"absence_asserted":false,"absence_unchecked":null,"no_code_is_about_this_method":false,"subject":null,"archive_paper_arxiv_id":null,"repositories":null,"retrieve_with":null,"name_competition":{"verdict":"unresolved_bearers","may_be_wrong_sense":true,"bearers_found":3,"served":null,"leading_other_bearer":{"arxiv_id":"1503.03578","title":"LINE: Large-scale Information Network Embedding","citations":5696,"named_by":["title_prefix"],"bearer_name":"LINE: Large-scale Information Network Embedding","ask_with":"have('1503.03578')"},"n_other_bearers_listed":3,"note":"Nothing resolved to 'LINE' by name, but 3 thing(s) here DECLARE that name -- most cited: the paper 'LINE: Large-scale Information Network Embedding' (arXiv:1503.03578, 5,696 citations). That is a RESOLUTION miss, not a coverage gap: the corpus holds the name under a spelling the lookup did not reach. Ask again with an entry of `also_named`."},"name_competition_text":"Nothing resolved to this name, but 3 entries in Syntology's graph carry it; the most cited is the paper “LINE: Large-scale Information Network Embedding” (arXiv:1503.03578, 5,696 citations). The lookup reads this as a miss of its own name matching, not a gap in coverage: the graph holds the name under a spelling the lookup did not reach.","near_matches":[],"code_nearby":[],"code_nearby_caption":null,"origin_paper":null,"line":"name not resolved (unknown_name). Other entries in Syntology's graph carry this name; the lookup's note below says what that means for this name.","level_legend":null},"syntology_have_state":"loaded","record_sha256":"250a8b65f2be1c67861c55eb11866fed6902651f7dc1c17f8069743618d89847","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}