S. Hidaka

activity

20122018

most citedFast and exact search for the partition with minimal information loss

38 citations · 43 across the 7 of their papers we have counts for

collaborators

Showing 2018Show all

2 papers · 1 filter

stat.ML2018

Clustering by latent dimensions

Shohei Hidaka, Neeraj Kashyap

This paper introduces a new clustering technique, called {\em dimensional clustering}, which clusters each data point by its latent {\em pointwise dimension}, which is a measure of…

math.OC2018★ 1 cited

Polynomial algorithm for $k$ -partition minimization of monotone submodular function

Shohei Hidaka

For a fixed $k$ , this study considers $k$ -partition minimization of submodular system $(V, f)$ with a finite set $V$ and symmetric submodular function $f : 2^{V} \mapsto R$ …

Clustering by latent dimensions

Polynomial algorithm for k-partition minimization of monotone submodular function

Polynomial algorithm for $k$ -partition minimization of monotone submodular function