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 simple yet effective multiple kernel clustering algorithm, termed simple multiple kernel k-means (SimpleMKKM). It extends the widely used supervised kernel alignment criterion to multi-kernel clustering. Our criterion is given by an intractable minimization-maximization problem in the kernel coefficient and clustering partition matrix. To optimize it, we re-formulate the problem as a smooth minimization one, which can be solved efficiently using a reduced gradient descent algorithm. We theoretically analyze the performance of SimpleMKKM in terms of its clustering generalization error. Comprehensive experiments on 11 benchmark datasets demonstrate that SimpleMKKM outperforms state of the art multi-kernel clustering alternatives.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2005.04975")
get_code_for_paper("2005.04975")
have("2005.04975")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2005.04975.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2005.04975)
Connect an agent — have() is free.