Clustering for point pattern data

By Nhat-Quang Tran, B. Vo, Dinh Q. Phung. 2017

13 citations recorded by the source corpus.

Clustering is one of the most common unsupervised learning tasks in machine learning and data mining. Clustering algorithms have been used in a plethora of applications across several scientific fields. However, there has been limited research in the clustering of point patterns - sets or multi-sets of unordered elements - that are found in numerous applications and data sources. In this paper, we propose two approaches for clustering point patterns. The first is a non-parametric method based on novel distances for sets. The second is a model-based approach, formulated via random finite set theory, and solved by the Expectation-Maximization algorithm. Numerical experiments show that the proposed methods perform well on both simulated and real data.

Subfields: Computational Mechanics, Computer Vision and Pattern Recognition, Statistics and Probability, Probabilistic & Bayesian Methods

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computational Mechanics

  1. Hamid Rezatofighi
  2. L. Leal-Taix'e
  3. Ian David Reid
  4. Daniel Cremers
  5. Javen Qinfeng Shi
  6. Anton Milan
  7. Michael M. Bronstein
  8. Emanuele Rodolà

In Computer Vision and Pattern Recognition

  1. Ian David Reid
  2. Luc Van Gool
  3. L. Leal-Taix'e
  4. Anton Milan
  5. Chunhua Shen
  6. Dacheng Tao
  7. Ming-Hsuan Yang
  8. Bernt Schiele

In Statistics and Probability

  1. L. Leal-Taix'e
  2. Ian David Reid
  3. Daniel Cremers
  4. B. Vo
  5. Dinh Q. Phung
  6. Quang Nhat Tran
  7. Anthony R. Dick
  8. Javen Qinfeng Shi

In Probabilistic & Bayesian Methods

  1. Ian David Reid
  2. Javen Qinfeng Shi
  3. Anton Milan
  4. Seyed Hamid Rezatofighi
  5. Anthony R. Dick
  6. Daniel Cremers
  7. B. Vo
  8. Dinh Q. Phung

Citations in the corpus