Robust Clustering as Ensembles of Affinity Relations

@inproceedings{Liu2010RobustCA,
  title={Robust Clustering as Ensembles of Affinity Relations},
  author={Hairong Liu and Longin Jan Latecki and Shuicheng Yan},
  booktitle={NIPS},
  year={2010}
}
In this paper, we regard clustering as ensembles of k-ary affinity relations and clusters correspond to subsets of objects with maximal average affinity relations. The average affinity relation of a cluster is relaxed and well approximated by a constrained homogenous function. We present an efficient procedure to solve this optimization problem, and show that the underlying clusters can be robustly revealed by using priors systematically constructed from the data. Our method can automatically… CONTINUE READING
Highly Cited
This paper has 67 citations. REVIEW CITATIONS

Citations

Publications citing this paper.

67 Citations

051015'10'12'14'16'18
Citations per Year
Semantic Scholar estimates that this publication has 67 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
Showing 1-10 of 17 references

Similar Papers

Loading similar papers…