Consensus Clustering of Free-Viewing Gaze Data: New Insights into Human-Information Interaction

• URL: http://arxiv.org/abs/2606.30035v2
• Date: Tue, 30 Jun 2026 09:26:30 GMT
• Title: Consensus Clustering of Free-Viewing Gaze Data: New Insights into Human-Information Interaction
• Abstract summary: Free-viewing gaze data provides a rich, task-free window into human visual attention.<n>Despite the richness of this gaze data, its human-information interaction (HII) patterns are understudied.<n>We present a novel end-to-end unsupervised ensemble learning system for consensus clustering of gaze datasets.
• Score: 1.108292291257035
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Free-viewing gaze data provides a rich, task-free window into human visual attention. Conventional exploratory data analysis of the data provides user attention patterns through fixations and areas of interest. However, despite the richness of this gaze data, its human-information interaction (HII) patterns are understudied. We address this gap using consensus clustering of gaze data with respect to users and stimulus characteristics. We present a novel end-to-end unsupervised ensemble learning system for consensus clustering of free-viewing gaze datasets, EnsembleGaze. With a goal of characterizing the user behavior and stimulus type, we propose a feature engineering step based on statistical descriptors of fixation-based distributions. EnsembleGaze involves consensus voting of selected clustering methods implemented on the feature vector to compute the co-association matrix. Using the separate consensus clustering of users and stimuli as a baseline, we further propose two high-dimensional clustering strategies for determining gaze clusters based on joint user and image characterization. They are consensus subspace clustering and spectral biclustering. Clustering performance is evaluated using selected standard metrics and is further interpreted through image-level properties. Our system provides a replicable method for the unsupervised analysis of fixation behavior in scene perception research. Our results show that image stimuli groupings are highly consistent across methods, reflecting a robust ambient-versus-focal viewing mode distinction, whereas user groupings are image-context-dependent, a structure that only biclustering and the two-step conditional approaches are architecturally capable of recovering. Testing on the publicly available datasets revealed dataset-specific patterns, with each offering complementary insights through distinct clustering strategies.

Related papers

• K-Models: a Flexible and Interpretable Method for Ordinal Clustering with Application to Antigen-Antibody Interaction Profiles [65.21921642886367]
  K-Models is a novel framework that integrates ordinal constraints and estimates key underlying elements of the random process generating the observed functional profiles.<n>The proposed method is evaluated through simulations and real-world applications.
  arXiv  Detail & Related papers  (2026-05-14T13:35:44Z)
• Clusterability-Based Assessment of Potentially Noisy Views for Multi-View Clustering [14.310871812932193]
  We study the problem of pre-clustering noisy-view analysis in multi-view data from a clusterability perspective.<n>We propose a Multi-View Clusterability Score (MVCS), which quantifies the strength of latent cluster-related structures in multi-view data.<n>We further use it to perform potentially noisy view analysis and noisy-view detection before clustering.
  arXiv  Detail & Related papers  (2026-04-20T09:49:42Z)
• IPBC: An Interactive Projection-Based Framework for Human-in-the-Loop Semi-Supervised Clustering of High-Dimensional Data [0.0]
  High-dimensional datasets are increasingly common across scientific and industrial domains.<n>Traditional dimensionality reduction techniques generate static 2D or 3D embeddings that provide limited interpretability.<n>We propose Interactive Project-Based Clustering (IPBC), a framework that reframes clustering as an iterative human-guided visual analysis process.
  arXiv  Detail & Related papers  (2026-01-25T15:23:51Z)
• Imputation-free and Alignment-free: Incomplete Multi-view Clustering Driven by Consensus Semantic Learning [65.75756724642932]
  In incomplete multi-view clustering, missing data induce prototype shifts within views and semantic inconsistencies across views.<n>We propose an IMVC framework, imputation- and alignment-free for consensus semantics learning (FreeCSL)<n>FreeCSL achieves more confident and robust assignments on IMVC task, compared to state-of-the-art competitors.
  arXiv  Detail & Related papers  (2025-05-16T12:37:10Z)
• Structure-guided Deep Multi-View Clustering [13.593229506936682]
  Deep multi-view clustering seeks to utilize the abundant information from multiple views to improve clustering performance.<n>Most of the existing clustering methods often neglect to fully mine multi-view structural information.<n>We propose a structure-guided deep multi-view clustering model to explore the distribution of multi-view data.
  arXiv  Detail & Related papers  (2025-01-17T12:42:30Z)
• CLAMS: A Cluster Ambiguity Measure for Estimating Perceptual Variability in Visual Clustering [23.625877882403227]
  We study perceptual variability in conducting visual clustering, which we call Cluster Ambiguity. We introduce CLAMS, a data-driven visual quality measure for automatically predicting cluster ambiguity in monochrome scatterplots.
  arXiv  Detail & Related papers  (2023-08-01T04:46:35Z)
• HPSCAN: Human Perception-Based Scattered Data Clustering [15.217526822318428]
  We propose HPSCAN, a learning strategy that operates directly on scattered data.<n>We report on how we collected our dataset, report statistics of the resulting annotations, and investigate the perceptual agreement of cluster separation for real-world data.
  arXiv  Detail & Related papers  (2023-04-27T13:41:12Z)
• 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)
• 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)
• Graph Contrastive Clustering [131.67881457114316]
  We propose a novel graph contrastive learning framework, which is then applied to the clustering task and we come up with the Graph Constrastive Clustering(GCC) method. Specifically, on the one hand, the graph Laplacian based contrastive loss is proposed to learn more discriminative and clustering-friendly features. On the other hand, a novel graph-based contrastive learning strategy is proposed to learn more compact clustering assignments.
  arXiv  Detail & Related papers  (2021-04-03T15:32:49Z)
• Agglomerative Neural Networks for Multi-view Clustering [109.55325971050154]
  We propose the agglomerative analysis to approximate the optimal consensus view. We present Agglomerative Neural Network (ANN) based on Constrained Laplacian Rank to cluster multi-view data directly. Our evaluations against several state-of-the-art multi-view clustering approaches on four popular datasets show the promising view-consensus analysis ability of ANN.
  arXiv  Detail & Related papers  (2020-05-12T05:39:10Z)

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.