{"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,"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","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,"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,"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,"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,"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,"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,"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","title":"LINE: Large-scale Information Network Embedding","date":"2015-03-12","arxiv_id":"1503.03578","n_code_links":9,"syntology":{"ran":0,"of":3,"unverified":3,"pointer_only":0}}],"papers_shown":9,"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-09-24T18:15:14+00:00"}