paper-with-me

홈 › Papers

Fourier Transform Approach to Machine Learning II: Fourier Clustering

2019-04-29 · Soheil Mehrabkhani

We propose a Fourier-based approach for optimization of several clustering algorithms. Mathematically, clusters data can be described by a density function represented by the Dirac mixture distribution. The density function can be smoothed by applying the Fourier transform and a Gaussian filter. The determination of the optimal standard deviation of the Gaussian filter will be accomplished by the use of a convergence criterion related to the correlation between the smoothed and the original density functions. In principle, the optimal smoothed density function exhibits local maxima, which correspond to the cluster centroids. Thus, the complex task of finding the centroids of the clusters is simplified by the detection of the peaks of the smoothed density function. A multiple sliding windows procedure is used to detect the peaks. The remarkable accuracy of the proposed algorithm demonstrates its capability as a reliable general method for enhancement of the clustering performance, its global optimization and also removing the initialization problem in many clustering methods.

📄 PDF Abstract BibTeX arXiv:1904.13241

Code (0)

등록된 구현이 없습니다.

Tasks

BIG-bench Machine LearningClusteringglobal-optimization

Similar Papers 제목 키워드 기반

Joint Time-Vertex Fractional Fourier Transform

2022-03-15 · Tuna Alikaşifoğlu, Bünyamin Kartal, Eray Özgünay, Aykut Koç

Graph signal processing (GSP) facilitates the analysis of high-dimensional data on non-Euclidean domains by utilizing graph signals defined on graph vertices. In addition to static data, each vertex can provide continuou…

DenoisingTime SeriesTime Series Analysis

Learning Set Functions that are Sparse in Non-Orthogonal Fourier Bases

2020-10-01 · Chris Wendler, Andisheh Amrollahi, Bastian Seifert, Andreas Krause 외

Many applications of machine learning on discrete domains, such as learning preference functions in recommender systems or auctions, can be reduced to estimating a set function that is sparse in the Fourier domain. In th…

Recommendation Systems

Circular Convolution and Product Theorem for Affine Discrete Fractional Fourier Transform

2020-10-19 · Amir R. Nafchi, Eric Hamke, Cristina Pereyra, Ramiro Jordan

The Fractional Fourier Transform is a ubiquitous signal processing tool in basic and applied sciences. The Fractional Fourier Transform generalizes every property and application of the Fourier Transform. Despite the pra…

FourierNAT: A Fourier-Mixing-Based Non-Autoregressive Transformer for Parallel Sequence Generation

2025-03-04 · Andrew Kiruluta, Eric Lundy, Andreas Lemos

We present FourierNAT, a novel non-autoregressive Transformer (NAT) architecture that employs Fourier-based mixing in the decoder to generate output sequences in parallel. While traditional NAT approaches often face chal…

DecoderMachine TranslationText Generation

Fast Partial Fourier Transform

2020-08-28 · Yong-chan Park, Jun-Gi Jang, U Kang

Given a time series vector, how can we efficiently compute a specified part of Fourier coefficients? Fast Fourier transform (FFT) is a widely used algorithm that computes the discrete Fourier transform in many machine le…

Time SeriesTime Series Analysis