Fusion of centroid-based clustering with graph clustering: An expectation-maximization-based hybrid clustering
Z Uykan - IEEE Transactions on Neural Networks and Learning …, 2021 - ieeexplore.ieee.org
This article extends the expectation-maximization (EM) formulation for the Gaussian mixture
model (GMM) with a novel weighted dissimilarity loss. This extension results in the fusion of …
model (GMM) with a novel weighted dissimilarity loss. This extension results in the fusion of …
Transmission-order optimization for bidirectional device-to-device (D2D) communications underlaying cellular TDD networks—A graph theoretic approach
Device-to-device (D2D) communications underlaying cellular networks is a promising
concept that has several advantages over the traditional cellular networks. In the TDD …
concept that has several advantages over the traditional cellular networks. In the TDD …
Shadow-Cuts minimization/maximization and complex Hopfield neural networks
Z Uykan - IEEE transactions on neural networks and learning …, 2020 - ieeexplore.ieee.org
In this article, we continue our very recent work by extending it to the complex case. Having
been inspired by the real Hopfield neural network (HNN) results, our investigations here …
been inspired by the real Hopfield neural network (HNN) results, our investigations here …
Optimum “Eye Location” Problem for Spectral Clustering With Cosine Distance
Z Uykan - IEEE Access, 2023 - ieeexplore.ieee.org
It has recently been reported that Spectral Clustering gives state-of-the art clustering
performance for many real-life benchmark datasets. When building the dissimilarity …
performance for many real-life benchmark datasets. When building the dissimilarity …
Joint optimization of transmission-order selection and channel allocation for bidirectional wireless links—Part I: Game theoretic analysis
In this two-part paper, we consider a system consisting of bidirectional wireless links that
interfere with each other, which has been the of focus of intensive research recently in …
interfere with each other, which has been the of focus of intensive research recently in …
[HTML][HTML] A modified GADIA-based upper-bound to the capacity of Gaussian general N-relay networks
In this paper, we present a general Gaussian N-relay network by allowing relays to
communicate to each other and allowing a direct channel between source and destination …
communicate to each other and allowing a direct channel between source and destination …
From GADIA to Pairwise Synchronous Algorithm for 2-Channel Case
The fully distributed and asynchronous interference reduction algorithm GADIA developed
by B. Babadi and V. Tarokh [1] is a very powerful and effective algorithm. It has been the …
by B. Babadi and V. Tarokh [1] is a very powerful and effective algorithm. It has been the …