Web: http://arxiv.org/abs/2209.07342

Sept. 16, 2022, 1:12 a.m. | Li-Chun Zhang

cs.LG updates on arXiv.org arxiv.org

Given a valued graph, where both the nodes and the edges of the graph are
associated with one or several values, any network function for a given node
must be defined in terms of that node and its connected nodes in the graph.
Generally, applying the same definition to the whole graph or any given
subgraph of it would result in systematically different network functions. In
this paper we consider the feasibility of graph sampling approach to network
function learning, …

arxiv function network sampling

More from arxiv.org / cs.LG updates on arXiv.org

Machine Learning Product Manager (Canada, Remote)

@ FreshBooks | Canada

Data Engineer

@ Amazon.com | Irvine, California, USA

Senior Autonomy Behavior II, Performance Assessment Engineer

@ Cruise LLC | San Francisco, CA

Senior Data Analytics Engineer

@ Intercom | Dublin, Ireland

Data Analyst Intern

@ ADDX | Singapore

Data Science Analyst - Consumer

@ Yelp | London, England, United Kingdom

Senior Data Analyst - Python+Hadoop

@ Capco | India - Bengaluru

DevOps Engineer, Data Team

@ SingleStore | Hyderabad, India

Software Engineer (Machine Learning, AI Platform)

@ Phaidra | Remote

Sr. UI/UX Designer - Artificial Intelligence (ID:1213)

@ Truelogic Software | Remote, anywhere in LATAM

Analytics Engineer

@ carwow | London, England, United Kingdom

HRIS Data Analyst

@ SecurityScorecard | Remote