Two-mode probabilistic distance clustering

Download

Two-Mode Probabilistic Distance Clustering.pdf

Date

2021-7-29

Author

Caner, Yağmur

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

514
views

141
downloads

Probabilistic Distance Clustering (PDC) is a soft clustering technique constructed around some axioms. It is a center-based approach and assigns each data point to multiple clusters with a membership probability. The PDC is applicable for one-mode data sets, where each data points’ quantitative or qualitative values over each feature are stored. This study focuses on PDC and consists of two main contributions. Firstly, the relevance of PDC to some other probabilistic models in the literature is examined. We show that PDC method and its axioms explain models from marketing, location theory, and unsupervised learning. Secondly, this thesis proposes two original solution methods for the soft Two-Mode Clustering (TMC) problem. Two-mode clustering is a technique to cluster two-mode data, representing a linkage between two sets of data points. A comprehensive computational study is conducted on continuous, noisy, and binary data sets. The use of membership probabilities for decision-making is also discussed. This study will be the pioneer soft assignment approach for two-mode clustering literature.

Subject Keywords

Clustering, Probabilistic clustering, One-mode data, Location theory, Two-mode data clustering

URI

https://hdl.handle.net/11511/91642

Collections

Graduate School of Natural and Applied Sciences, Thesis

Suggestions

OpenMETU
Core

Principal Coordinate Clustering SEKMEN, ali; ALDROUBİ, Akram; HAMM, Keaton; Koku, Ahmet Buğra (2017-12-14) This paper introduces a clustering algorithm, called principal coordinate clustering. It takes in a similarity matrix SW of a data matrix W and computes the singular value decomposition of SW to determine the principal coordinates to convert the clustering problem to a simpler domain. It is a relative of spectral clustering, however, principal coordinate clustering is easier to interpret, and gives a clear understanding of why it performs well. In a fashion, this gives intuition behind why spectral clusteri...
ACOUSTIC SOURCE SEPARATION USING THE SHORT-TIME QUATERNION FOURIER TRANSFORMS OF PARTICLE VELOCITY SIGNALS Hacıhabiboğlu, Hüseyin (2016-03-25) Quaternion Fourier transforms (QFT) provide a powerful tool for the analysis of signals obtained from vector probes. Acoustic particle velocity is one such signal which can be measured with specially designed microphone arrays. This paper presents a time-frequency source separation method based on the short-time quaternion Fourier transform of acoustic particle velocity signals and the k-plane clustering of the vector part of the resulting representation. Two example cases, one with a single and one with tw...
Two-dimensional unsteady Navier-Stokes solution method with moving overset grids Tuncer, İsmail Hakkı (American Institute of Aeronautics and Astronautics (AIAA), 1997-03-01) A simple numerical algorithm to localize intergrid boundary points and to interpolate unsteady solution variables across two-dimensional, structured overset grids is presented. Overset grids are allowed to move in time relative to each other. Intergrid boundary points are localized in a triangular stencil on the donor grid by a directional search algorithm. The final parameters of the search algorithm give the interpolation weights at the intergrid boundary point. Numerical results are presented for steady ...
Three dimensional hyperbolic grid generation Dinçgez, Umut Can; Aksel, Mehmet Haluk; Department of Mechanical Engineering (2006) This thesis analyzes procedure of generation of hyperbolic grids formulated by two constraints, which specify grid orthogonality and cell volume. The procedure was applied on a wide range of geometries and high quality two and three dimensional hyperbolic grids were generated by using grid control and smoothing procedures, which supply grid clustering in all directions and prevent grid deformation (grid shock), respectively.
Two-Step Lagrange Interpolation Method for the Multilevel Fast Multipole Algorithm Ergül, Özgür Salih; Gurel, L. (Institute of Electrical and Electronics Engineers (IEEE), 2009) We present a two-step Lagrange interpolation method for the efficient solution of large-scale electromagnetics problems with the multilevel fast multipole algorithm (MLFMA). Local interpolations are required during aggregation and disaggregation stages of MLFMA in order to match the different sampling rates for the radiated and incoming fields in consecutive levels. The conventional one-step method is decomposed into two one-dimensional interpolations, applied successively. As it provides a significant acce...

Citation Formats

Y. Caner, “Two-mode probabilistic distance clustering,” M.S. - Master of Science, Middle East Technical University, 2021.