Co-Clustering Signed 3-Partite Graphs

Date

2016-08-21

Author

Koc, Sefa Sahin
Toroslu, İsmail Hakkı
Davulcu, Hasan

Metadata

Show full item record

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

Item Usage Stats

59
views

0
downloads

In this paper, we propose a new algorithm, called STRICLUSTER, to find tri-clusters from signed 3-partite graphs. The dataset contains three different types of nodes. Hyperedges connecting three nodes from three different partitions represent either positive or negative relations among those nodes. The aim of our algorithm is to find clusters with strong positive relations among its nodes. Moreover, negative relations up to a certain threshold is also allowed. Also, the clusters can have no overlapping hyperedges. We show the effectiveness of our algorithm via several experiments.

URI

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

Collections

Department of Computer Engineering, Conference / Seminar

Suggestions

OpenMETU
Core

phi Clust: Pheromone-based Aggregation for Robotic Swarms Arvin, Farshad; Turgut, Ali Emre; Krajnik, Tomas; Rahimi, Salar; Okay, Ilkin Ege; Yue, Shigang; Watson, Simon; Lennox, Barry (2018-10-05) In this paper, we proposed a pheromone-based aggregation method based on the state-of-the-art BEECLUST algorithm. We investigated the impact of pheromone-based communication on the efficiency of robotic swarms to locate and aggregate at areas with a given cue. In particular, we evaluated the impact of the pheromone evaporation and diffusion on the time required for the swarm to aggregate. In a series of simulated and real-world evaluation trials, we demonstrated that augmenting the BEECLUST method with arti...
Speeding up Curve25519 using Toeplitz Matrix-vector Multiplication Taskin, Halil Kemal; Cenk, Murat (2018-01-24) This paper proposes a new multiplication algorithm over F-2(255)-19 where the de-facto standard Curve25519 [2] algorithm is based on. Our algorithm for the underlying finite field multiplication exploits the Toeplitz matrix-vector multiplication and achieves salient results. We have used a new radix representation that is infeasible when used with schoolbook multiplication techniques but has notable advantages when used with Toeplitz matrix-vector multiplication methods. We present the new algorithm and dis...
DOMAIN ADAPTATION VIA TRANSFERRING SPECTRAL PROPERTIES OF LABEL FUNCTIONS ON GRAPHS Pilanci, Mehmet; Vural, Elif (2016-07-12) We propose a domain adaptation algorithm that relies on a graph representation of data samples in the source and target domains. The algorithm combines the information of the known class labels in the source and target domains through the Fourier coefficients of the class label function in the two graphs. The proposed method does not require an ordering or a one-to-one mapping between the samples of the source and target domains; instead, it uses only a small set of matched pairs that serve the purpose of "...
Computation of the Primary Decomposition of Polynomial Ideals Using Gröbner Bases Tolgay, Betül; Karayayla, Tolga; Department of Mathematics (2021-8-06) In this thesis, we investigate algorithms for computing primary decompositions of ideals in polynomial rings. Every ideal in a polynomial ring over a Noetherian commutative ring with identity has a primary decomposition, that is, it can be expressed as the intersection of primary ideals (in a unique way or not). The existence of primary decompositions in such polynomial rings is a result of the ascending chain condition and the existence proof does not suggest any construction method for the primary compone...
Inverse design of compressor cascades Kaplan, B.; Eyi, Sinan (2001-12-01) In this paper an inverse design method is presented which couples a Navier-Stokes flow solver and a numerical optimization algorithm. The design method generates a compressor cascade, producing a specified surface pressure distribution at a transonic speed. A least-square optimization technique is used to minimize pressure discrepancies between the target and designed cascades. In order to represent the nonlinear, rotational and viscous physics of transonic flows, Navier-Stokes equations are used to predict...

Citation Formats

S. S. Koc, İ. H. Toroslu, and H. Davulcu, “Co-Clustering Signed 3-Partite Graphs,” 2016, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/53320.