Sept. 30, 2022, 1:12 a.m. | Meng Qin, Chaorui Zhang, Bo Bai, Gong Zhang, Dit-Yan Yeung

cs.LG updates on arXiv.org arxiv.org

Many network applications can be formulated as NP-hard combinatorial
optimization problems of community detection (CD). Due to the NP-hardness, to
balance the CD quality and efficiency remains a challenge. Most existing CD
methods are transductive, which are independently optimized only for the CD on
a single graph. Some of these methods use advanced machine learning techniques
to obtain high-quality CD results but usually have high complexity. Other
approaches use fast heuristic approximation to ensure low runtime but may
suffer from …

arxiv community detection efficiency graphs inductive quality trading

Data Architect

@ University of Texas at Austin | Austin, TX

Data ETL Engineer

@ University of Texas at Austin | Austin, TX

Lead GNSS Data Scientist

@ Lurra Systems | Melbourne

Senior Machine Learning Engineer (MLOps)

@ Promaton | Remote, Europe

Social Insights & Data Analyst (Freelance)

@ Media.Monks | Jakarta

Cloud Data Engineer

@ Arkatechture | Portland, ME, USA