Stefano Soatto, David Wipf, Zheng Zhang, Yuanjun Xiong, Wei Xia, Tianjun Xiao, Tong He, Yifan Xing, Yongxin Wang
We have not lifted any functions out of this paper's repositories yet, so there is nothing we have run. The repositories linked to it are listed below.
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
We propose a hierarchical graph neural network (GNN) model that learns how to cluster a set of images into an unknown number of identities using a training set of images annotated with labels belonging to a disjoint set of identities. Our hierarchical GNN uses a novel approach to merge connected components predicted at each level of the hierarchy to form a new graph at the next level. Unlike fully unsupervised hierarchical clustering, the choice of grouping and complexity criteria stems naturally from supervision in the training set. The resulting method, Hi-LANDER, achieves an average of 49% improvement in F-score and 7% increase in Normalized Mutual Information (NMI) relative to current GNN-based clustering algorithms. Additionally, stateof-the-art GNN-based methods rely on separate models to predict linkage probabilities and node densities as intermediate steps of the clustering process. In contrast, our unified framework achieves a three-fold decrease in computational cost. Our training and inference code are released 1 .
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2107.01319")
get_code_for_paper("2107.01319")
have("2107.01319")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2107.01319.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2107.01319)
Connect an agent — have() is free.