Nov. 1, 2022, 1:12 a.m. | Ming-Jun Lai, Zhaiming Shen

cs.LG updates on arXiv.org arxiv.org

A least squares semi-supervised local clustering algorithm based on the idea
of compressed sensing is proposed to extract clusters from a graph with known
adjacency matrix. The algorithm is based on a two-stage approach similar to the
one in \cite{LaiMckenzie2020}. However, under a weaker assumption and with less
computational complexity than the one in \cite{LaiMckenzie2020}, the algorithm
is shown to be able to find a desired cluster with high probability. The ``one
cluster at a time" feature of our method …

arxiv cluster extraction least semi-supervised sensing squares

Founding AI Engineer, Agents

@ Occam AI | New York

AI Engineer Intern, Agents

@ Occam AI | US

AI Research Scientist

@ Vara | Berlin, Germany and Remote

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