Abstract

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.

Original languageEnglish (US)
Title of host publicationProceedings of the 2016 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, ASONAM 2016
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages945-948
Number of pages4
ISBN (Electronic)9781509028467
DOIs
StatePublished - Nov 21 2016
Event2016 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, ASONAM 2016 - San Francisco, United States
Duration: Aug 18 2016Aug 21 2016

Other

Other2016 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, ASONAM 2016
CountryUnited States
CitySan Francisco
Period8/18/168/21/16

Fingerprint

experiment
Experiments

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Sociology and Political Science
  • Communication

Cite this

Koc, S. S., Toroslu, I. H., & Davulcu, H. (2016). Co-clustering signed 3-partite graphs. In Proceedings of the 2016 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, ASONAM 2016 (pp. 945-948). [7752353] Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ASONAM.2016.7752353

Co-clustering signed 3-partite graphs. / Koc, Sefa Sahin; Toroslu, Ismail Hakki; Davulcu, Hasan.

Proceedings of the 2016 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, ASONAM 2016. Institute of Electrical and Electronics Engineers Inc., 2016. p. 945-948 7752353.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Koc, SS, Toroslu, IH & Davulcu, H 2016, Co-clustering signed 3-partite graphs. in Proceedings of the 2016 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, ASONAM 2016., 7752353, Institute of Electrical and Electronics Engineers Inc., pp. 945-948, 2016 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, ASONAM 2016, San Francisco, United States, 8/18/16. https://doi.org/10.1109/ASONAM.2016.7752353
Koc SS, Toroslu IH, Davulcu H. Co-clustering signed 3-partite graphs. In Proceedings of the 2016 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, ASONAM 2016. Institute of Electrical and Electronics Engineers Inc. 2016. p. 945-948. 7752353 https://doi.org/10.1109/ASONAM.2016.7752353
Koc, Sefa Sahin ; Toroslu, Ismail Hakki ; Davulcu, Hasan. / Co-clustering signed 3-partite graphs. Proceedings of the 2016 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, ASONAM 2016. Institute of Electrical and Electronics Engineers Inc., 2016. pp. 945-948
@inproceedings{ac96dd76ccaa41fcbc913e9d46a60d83,
title = "Co-clustering signed 3-partite graphs",
abstract = "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.",
author = "Koc, {Sefa Sahin} and Toroslu, {Ismail Hakki} and Hasan Davulcu",
year = "2016",
month = "11",
day = "21",
doi = "10.1109/ASONAM.2016.7752353",
language = "English (US)",
pages = "945--948",
booktitle = "Proceedings of the 2016 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, ASONAM 2016",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
address = "United States",

}

TY - GEN

T1 - Co-clustering signed 3-partite graphs

AU - Koc, Sefa Sahin

AU - Toroslu, Ismail Hakki

AU - Davulcu, Hasan

PY - 2016/11/21

Y1 - 2016/11/21

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=85006802567&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85006802567&partnerID=8YFLogxK

U2 - 10.1109/ASONAM.2016.7752353

DO - 10.1109/ASONAM.2016.7752353

M3 - Conference contribution

SP - 945

EP - 948

BT - Proceedings of the 2016 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, ASONAM 2016

PB - Institute of Electrical and Electronics Engineers Inc.

ER -