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.
This paper proposes a simple but effective graph-based agglomerative algorithm, for clustering high-dimensional data. We explore the different roles of two fundamental concepts in graph theory, indegree and outdegree, in the context of clustering. The average indegree reflects the density near a sample, and the average outdegree characterizes the local geometry around a sample. Based on such insights, we define the affinity measure of clusters via the product of average indegree and average outdegree. The product-based affinity makes our algorithm robust to noise. The algorithm has three main advantages: good performance, easy implementation, and high computational efficiency. We test the algorithm on two fundamental computer vision problems: image clustering and object matching. Extensive experiments demonstrate that it outperforms the state-of-the-arts in both applications.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("1208.5092")
get_code_for_paper("1208.5092")
have("1208.5092")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/1208.5092.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/1208.5092)
Connect an agent — have() is free.