103 citations · 268 across the 27 of their papers we have counts for
Showing 2018Show all
3 papers · 1 filter
cs.SI2018
Measuring the Robustness of Graph Properties
Yali Wan, Marina Meila
In this paper, we propose a perturbation framework to measure the robustness of graph properties. Although there are already perturbation methods proposed to tackle this problem, t…
stat.ML2018★ 3 cited
Manifold Coordinates with Physical Meaning
Samson Koelle, Hanyu Zhang, Marina Meila +1
Manifold embedding algorithms map high-dimensional data down to coordinates in a much lower-dimensional space. One of the aims of dimension reduction is to find intrinsic coordinat…
cs.DM2018
How to sample connected -partitions of a graph
Marina Meila
A connected undirected graph is given. This paper presents an algorithm that samples (non-uniformly) a partition of the graph nodes , such that th…