下一篇:Veridical Network Embedding
Next Waves in Veridical Network Embedding
摘要:
将大型网络的节点嵌入到度量中(例如,欧几里德)空间已成为统计机器学习中的活跃研究领域,其已在自然科学和社会科学中找到应用。通常,网络对象的表示在欧几里德几何中学习,然后用于关于网络的节点和/或边缘的后续任务,例如社区检测、节点分类和链路预测。网络嵌入算法已经在多个学科中提出,通常具有特定领域的符号和细节。此外,还采用了不同的措施和工具来评估和比较在不同环境下提出的方法,这往往取决于下游任务。因此,在文献中系统地研究这些算法具有挑战性。受最近提出的Veridical Data Science(VDS)框架的启发,我们提出了一个网络嵌入算法的框架,并讨论了可预测性,可计算性和稳定性的原则如何在这种情况下应用。在网络嵌入中利用这个框架有可能激励和指出未来研究的新方向。
英文摘要:
Embedding nodes of a large network into a metric (e.g., Euclidean) space has become an area of active research in statistical machine learning, which has found applications in natural and social sciences. Generally, a representation of a network object is learned in a Euclidean geometry and is then used for subsequent tasks regarding the nodes and/or edges of the network, such as community detection, node classification and link prediction. Network embedding algorithms have been proposed in multiple disciplines, often with domain-specific notations and details. In addition, different measures and tools have been adopted to evaluate and compare the methods proposed under different settings, often dependent of the downstream tasks. As a result, it is challenging to study these algorithms in the literature systematically. Motivated by the recently proposed Veridical Data Science (VDS) framework, we propose a framework for network embedding algorithms and discuss how the principles of predictability, computability and stability apply in this context. The utilization of this framework in network embedding holds the potential to motivate and point to new directions for future research.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。