Principal Coordinate Clustering

Date

2017-12-14

Author

SEKMEN, ali
ALDROUBİ, Akram
HAMM, Keaton
Koku, Ahmet Buğra

Metadata

Show full item record

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

Item Usage Stats

154
views

0
downloads

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 clustering works from a more simple, linear algebra perspective, beyond the typical explanations via graph cuts, or other techniques. Moreover, it was demonstrated through experimentation on real and synthetic data that the proposed method performs equally well on average as spectral clustering, and that the method has the ability to scale quite easily to truly large data.

Subject Keywords

Spectral clustering, Principal component analysis, Similarity matrix, Clustering

URI

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

Collections

Department of Mechanical Engineering, Conference / Seminar

Suggestions

OpenMETU
Core

Similarity matrix framework for data from union of subspaces Aldroubi, Akram; Sekmen, Ali; Koku, Ahmet Buğra; Cakmak, Ahmet Faruk (2018-09-01) This paper presents a framework for finding similarity matrices for the segmentation of data W = [w(1)...w(N)] subset of R-D drawn from a union U = boolean OR(M)(i=1) S-i, of independent subspaces {S-i}(i=1)(M), of dimensions {d(i)}(i=1)(M). It is shown that any factorization of W = BP, where columns of B form a basis for data W and they also come from U, can be used to produce a similarity matrix Xi w. In other words, Xi w(i, j) not equal 0, when the columns w(i) and w(j) of W come from the same subspace, ...
Two-mode probabilistic distance clustering Caner, Yağmur; İyigün, Cem; Department of Industrial Engineering (2021-7-29) 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...
Skeleton Decomposition Analysis for Subspace Clustering Sekmen, Ali; Aldroubi, Akram; Koku, Ahmet Buğra (2016-12-08) This paper provides a comprehensive analysis of skeleton decomposition used for segmentation of data W = [w(1) center dot center dot center dot w(N)] subset of R-D drawn from a union u = U-i=1(M) S-i of linearly independent subspaces {Si}(M)(i=1) of dimensionsof {di}(M)(i=1). Our previous work developed a generalized theoretical framework for computing similarity matrices by matrix factorization. Skeleton decomposition is a special case of this general theory. First, a square sub-matrix A is an element of R...
Deep Spectral Convolution Network for Hyperspectral Unmixing Akar, Gözde (2018-10-10) In this paper, we propose a novel hyperspectral unmixing technique based on deep spectral convolution networks (DSCN). Particularly, three important contributions are presented throughout this paper. First, fully-connected linear operation is replaced with spectral convolutions to extract local spectral characteristics from hyperspectral signatures with a deeper network architecture. Second, instead of batch normalization, we propose a spectral normalization layer which improves the selectivity of filters b...
Probabilistic D-clustering Ben-Israel, Adi; İyigün, Cem (2008-06-01) We present a new iterative method for probabilistic clustering of data. Given clusters, their centers and the distances of data points from these centers, the probability of cluster membership at any point is assumed inversely proportional to the distance from (the center of) the cluster in question. This assumption is our working principle.

Citation Formats

a. SEKMEN, A. ALDROUBİ, K. HAMM, and A. B. Koku, “Principal Coordinate Clustering,” 2017, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/55133.