Dimensionality Reduction Using pseudo-Boolean polynomials For Cluster Analysis

Tendai Mapungwana Chikake, Boris Goldengorin
8/29/2023
cs.IRcs.LG

No confident code implementation found for this paper.

Abstract

We introduce usage of a reduction property of penalty-based formulation of pseudo-Boolean polynomials as a mechanism for invariant dimensionality reduction in cluster analysis processes. In our experiments, we show that multidimensional data, like 4-dimensional Iris Flower dataset can be reduced to 2-dimensional space while the 30-dimensional Wisconsin Diagnostic Breast Cancer (WDBC) dataset can be reduced to 3-dimensional space, and by searching lines or planes that lie between reduced samples we can extract clusters in a linear and unbiased manner with competitive accuracies, reproducibility and clear interpretation.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{chikake2023dimensionality,
  title  = {Dimensionality Reduction Using pseudo-Boolean polynomials For Cluster Analysis},
  author = {Tendai Mapungwana Chikake and Boris Goldengorin},
  year   = {2023},
  eprint = {2308.15553},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2308.15553v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2308.15553.svg)](https://codeofpaper.com/paper/2308.15553)

Discussion