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

0
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