Efficient Information Theoretic Clustering on Discrete Lattices

2013-10-26 · Christian Bauckhage, Kristian Kersting

We consider the problem of clustering data that reside on discrete, low dimensional lattices. Canonical examples for this setting are found in image segmentation and key point extraction. Our solution is based on a recent approach to information theoretic clustering where clusters result from an iterative procedure that minimizes a divergence measure. We replace costly processing steps in the original algorithm by means of convolutions. These allow for highly efficient implementations and thus significantly reduce runtime. This paper therefore bridges a gap between machine learning and signal processing.

📄 PDF Abstract BibTeX arXiv:1310.7114

Code (0)

등록된 구현이 없습니다.

Tasks

BIG-bench Machine LearningClusteringImage Segmentation Semantic Segmentation

Fuzzy c-Means Clustering for Persistence Diagrams

2020-06-04 · Thomas Davies, Jack Aspinall, Bryan Wilder, Long Tran-Thanh

Persistence diagrams concisely represent the topology of a point cloud whilst having strong theoretical guarantees, but the question of how to best integrate this information into machine learning workflows remains open.…

BIG-bench Machine Learning Clustering Model Selection Topological Data Analysis

Discrete Optimal Graph Clustering

2019-04-25 · Yudong Han, Lei Zhu, Zhiyong Cheng, Jingjing Li 외

Graph based clustering is one of the major clustering methods. Most of it work in three separate steps: similarity graph construction, clustering label relaxing and label discretization with k-means. Such common practice…

Clustering Graph Clustering graph construction

Coarse-Grain Cluster Analysis of Tensors with Application to Climate Biome Identification

2020-01-22 · Derek DeSantis, Phillip J. Wolfram, Katrina Bennett, Boian Alexandrov

A tensor provides a concise way to codify the interdependence of complex data. Treating a tensor as a d-way array, each entry records the interaction between the different indices. Clustering provides a way to parse the …

Classification Clustering General Classification

On the Conditional Independence Implication Problem: A Lattice-Theoretic Approach

2014-08-09 · Mathias Niepert, Dirk Van Gucht, Marc Gyssens

A lattice-theoretic framework is introduced that permits the study of the conditional independence (CI) implication problem relative to the class of discrete probability measures. Semi-lattices are associated with CI sta…

Can Evolutionary Clustering Have Theoretical Guarantees?

2022-12-04 · Chao Qian

Clustering is a fundamental problem in many areas, which aims to partition a given data set into groups based on some distance measure, such that the data points in the same group are similar while that in different grou…

Clustering Evolutionary Algorithms Fairness