loading
Papers

Research.Publish.Connect.

Paper

Authors: Mikio Mizukami 1 ; Kouich Hirata 1 and Tetsuji Kuboyama 2

Affiliations: 1 Kyushu Institute of Technology, Kawazu 680-4, Iizuka 820-8502 and Japan ; 2 Gakushuin University, Mejiro 1-5-1, Toshima, Tokyo 171-8588 and Japan

ISBN: 978-989-758-351-3

Keyword(s): Bipartite Edge Correlation Clustering, Edge Biclique Partition, Minimum Disagreement, Bipartite Correlation Clustering, Bicluster Graph Editing, Biclustering.

Abstract: In this paper, first we formulate the problem of a bipartite edge correlation clustering which finds an edge biclique partition with the minimum disagreement from a bipartite graph, by extending the bipartite correlation clustering which finds a biclique partition. Then, we design a simple randomized algorithm for bipartite edge correlation clustering, based on the randomized algorithm of bipartite correlation clustering. Finally, we give experimental results to evaluate the algorithms from both artificial data and real data.

PDF ImageFull Text

Download
CC BY-NC-ND 4.0

Sign In Guest: Register as new SciTePress user now for free.

Sign In SciTePress user: please login.

PDF ImageMy Papers

You are not signed in, therefore limits apply to your IP address 18.206.194.210

In the current month:
Recent papers: 100 available of 100 total
2+ years older papers: 200 available of 200 total

Paper citation in several formats:
Mizukami, M.; Hirata, K. and Kuboyama, T. (2019). Bipartite Edge Correlation Clustering: Finding an Edge Biclique Partition from a Bipartite Graph with Minimum Disagreement.In Proceedings of the 8th International Conference on Pattern Recognition Applications and Methods - Volume 1: ICPRAM, ISBN 978-989-758-351-3, pages 699-706. DOI: 10.5220/0007471506990706

@conference{icpram19,
author={Mikio Mizukami. and Kouich Hirata. and Tetsuji Kuboyama.},
title={Bipartite Edge Correlation Clustering: Finding an Edge Biclique Partition from a Bipartite Graph with Minimum Disagreement},
booktitle={Proceedings of the 8th International Conference on Pattern Recognition Applications and Methods - Volume 1: ICPRAM,},
year={2019},
pages={699-706},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0007471506990706},
isbn={978-989-758-351-3},
}

TY - CONF

JO - Proceedings of the 8th International Conference on Pattern Recognition Applications and Methods - Volume 1: ICPRAM,
TI - Bipartite Edge Correlation Clustering: Finding an Edge Biclique Partition from a Bipartite Graph with Minimum Disagreement
SN - 978-989-758-351-3
AU - Mizukami, M.
AU - Hirata, K.
AU - Kuboyama, T.
PY - 2019
SP - 699
EP - 706
DO - 10.5220/0007471506990706

Login or register to post comments.

Comments on this Paper: Be the first to review this paper.