We study the design of interactive clustering algorithms for data sets
satisfying natural stability assumptions. Our algorithms start with any initial
clustering and only make local changes in each step; both are desirable
features in many applications. We show that in this constrained setting one can
still design provably efficient algorithms that produce accurate clusterings.
We also show that our algorithms perform well on real-world data.

本文研究了基于稳定性假设的交互式聚类算法设计，算法开始于任意初始聚类，只进行每步的局部更改；我们证明在这种约束条件下，仍然可以设计出具有可证明高效和准确聚类能力的算法，并在真实数据上进行了实证。

交互式聚类的本地算法

Local algorithms for interactive clustering

We propose a new method of discovering causal structures, based on the
detection of local, spontaneous changes in the underlying data-generating
model. We analyze the classes of structures that are equivalent relative to a
stream of distributions produced by local changes, and devise algorithms that
output graphical representations of these equivalence classes. We present
experimental results, using simulated data, and examine the errors associated
with detection of changes and recovery of structures.

本研究提出了一种基于本地自发变化的方法，用于发现因果结构，并分析了与之相关的结构类别，设计了可以输出这些等价类的图形表示的算法，并使用模拟数据展示了实验结果，研究了变化检测和结构恢复的误差。