Visualizing Overlapping Biclusterings and Boolean Matrix Factorizations

• URL: http://arxiv.org/abs/2307.07396v1
• Date: Fri, 14 Jul 2023 15:12:55 GMT
• Title: Visualizing Overlapping Biclusterings and Boolean Matrix Factorizations
• Authors: Thibault Marette, Pauli Miettinen and Stefan Neumann
• Abstract summary: We study the problem of visualizing empha given clustering of overlapping clusters in bipartite graphs. We conceptualize three different objectives that any good visualization should satisfy. In experiments on real-world datasets, we find that the best trade-off between these competing goals is achieved by a novel.
• Score: 7.509129971169722
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Finding (bi-)clusters in bipartite graphs is a popular data analysis approach. Analysts typically want to visualize the clusters, which is simple as long as the clusters are disjoint. However, many modern algorithms find overlapping clusters, making visualization more complicated. In this paper, we study the problem of visualizing \emph{a given clustering} of overlapping clusters in bipartite graphs and the related problem of visualizing Boolean Matrix Factorizations. We conceptualize three different objectives that any good visualization should satisfy: (1) proximity of cluster elements, (2) large consecutive areas of elements from the same cluster, and (3) large uninterrupted areas in the visualization, regardless of the cluster membership. We provide objective functions that capture these goals and algorithms that optimize these objective functions. Interestingly, in experiments on real-world datasets, we find that the best trade-off between these competing goals is achieved by a novel heuristic, which locally aims to place rows and columns with similar cluster membership next to each other.

Related papers

• Reinforcement Graph Clustering with Unknown Cluster Number [91.4861135742095]
  We propose a new deep graph clustering method termed Reinforcement Graph Clustering. In our proposed method, cluster number determination and unsupervised representation learning are unified into a uniform framework. In order to conduct feedback actions, the clustering-oriented reward function is proposed to enhance the cohesion of the same clusters and separate the different clusters.
  arXiv  Detail & Related papers  (2023-08-13T18:12:28Z)
• Unified Multi-View Orthonormal Non-Negative Graph Based Clustering Framework [74.25493157757943]
  We formulate a novel clustering model, which exploits the non-negative feature property and incorporates the multi-view information into a unified joint learning framework. We also explore, for the first time, the multi-model non-negative graph-based approach to clustering data based on deep features.
  arXiv  Detail & Related papers  (2022-11-03T08:18:27Z)
• Efficient Multi-view Clustering via Unified and Discrete Bipartite Graph Learning [15.617206773324952]
  This paper presents an efficient multi-view clustering approach via unified and discrete bipartite graph learning (UDBGL) An anchor-based subspace learning is incorporated to learn the view-specific bipartite graphs from multiple views. The Laplacian rank constraint is imposed to ensure that the fused bipartite graph has discrete cluster structures.
  arXiv  Detail & Related papers  (2022-09-09T08:51:01Z)
• Adaptively-weighted Integral Space for Fast Multiview Clustering [54.177846260063966]
  We propose an Adaptively-weighted Integral Space for Fast Multiview Clustering (AIMC) with nearly linear complexity. Specifically, view generation models are designed to reconstruct the view observations from the latent integral space. Experiments conducted on several realworld datasets confirm the superiority of the proposed AIMC method.
  arXiv  Detail & Related papers  (2022-08-25T05:47:39Z)
• ACTIVE:Augmentation-Free Graph Contrastive Learning for Partial Multi-View Clustering [52.491074276133325]
  We propose an augmentation-free graph contrastive learning framework to solve the problem of partial multi-view clustering. The proposed approach elevates instance-level contrastive learning and missing data inference to the cluster-level, effectively mitigating the impact of individual missing data on clustering.
  arXiv  Detail & Related papers  (2022-03-01T02:32:25Z)
• Self-supervised Contrastive Attributed Graph Clustering [110.52694943592974]
  We propose a novel attributed graph clustering network, namely Self-supervised Contrastive Attributed Graph Clustering (SCAGC) In SCAGC, by leveraging inaccurate clustering labels, a self-supervised contrastive loss, are designed for node representation learning. For the OOS nodes, SCAGC can directly calculate their clustering labels.
  arXiv  Detail & Related papers  (2021-10-15T03:25:28Z)
• Effective and Efficient Graph Learning for Multi-view Clustering [173.8313827799077]
  We propose an effective and efficient graph learning model for multi-view clustering. Our method exploits the view-similar between graphs of different views by the minimization of tensor Schatten p-norm. Our proposed algorithm is time-economical and obtains the stable results and scales well with the data size.
  arXiv  Detail & Related papers  (2021-08-15T13:14:28Z)
• Structured Graph Learning for Scalable Subspace Clustering: From Single-view to Multi-view [28.779909990410978]
  Graph-based subspace clustering methods have exhibited promising performance. They still suffer some of these drawbacks: encounter the expensive time overhead, fail in exploring the explicit clusters, and cannot generalize to unseen data points. We propose a scalable graph learning framework, seeking to address the above three challenges simultaneously.
  arXiv  Detail & Related papers  (2021-02-16T03:46:11Z)
• Non-Exhaustive, Overlapping Co-Clustering: An Extended Analysis [32.15852903039789]
  The goal of co-clustering is to simultaneously identify a clustering of rows as well as columns of a two dimensional data matrix. We develop an efficient iterative algorithm which we call the NEO-CC algorithm. Experimental results show that the NEO-CC algorithm is able to effectively capture the underlying co-clustering structure of real-world data.
  arXiv  Detail & Related papers  (2020-04-24T04:39:14Z)
• Consistent and Complementary Graph Regularized Multi-view Subspace Clustering [31.187031653119025]
  This study investigates the problem of multi-view clustering, where multiple views contain consistent information and each view also includes complementary information. We propose a method that involves consistent and complementary graph-regularized multi-view subspace clustering (GRMSC) The objective function is optimized by the augmented Lagrangian multiplier method in order to achieve multi-view clustering.
  arXiv  Detail & Related papers  (2020-04-07T03:48:08Z)
• Bi-objective Optimization of Biclustering with Binary Data [0.0]
  Clustering consists of partitioning data objects into subsets called clusters according to some similarity criteria. This paper addresses a quasi-clustering that allows overlapping of clusters, and which we link to biclustering. Biclustering simultaneously groups the objects and features so that a specific group of objects has a special group of features.
  arXiv  Detail & Related papers  (2020-02-09T21:49:26Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.