A Machine Learning Approach for Predicting Human Preference for Graph Layouts

• URL: http://arxiv.org/abs/2103.03665v1
• Date: Mon, 1 Mar 2021 23:54:54 GMT
• Title: A Machine Learning Approach for Predicting Human Preference for Graph Layouts
• Abstract summary: We present the first machine learning approach for predicting human preference for graph layouts. Experimental results using the ground truth human preference data sets show that our model can successfully predict human preference for graph layouts.
• Score: 46.31441679172231
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Understanding what graph layout human prefer and why they prefer is significant and challenging due to the highly complex visual perception and cognition system in human brain. In this paper, we present the first machine learning approach for predicting human preference for graph layouts. In general, the data sets with human preference labels are limited and insufficient for training deep networks. To address this, we train our deep learning model by employing the transfer learning method, e.g., exploiting the quality metrics, such as shape-based metrics, edge crossing and stress, which are shown to be correlated to human preference on graph layouts. Experimental results using the ground truth human preference data sets show that our model can successfully predict human preference for graph layouts. To our best knowledge, this is the first approach for predicting qualitative evaluation of graph layouts using human preference experiment data.

Related papers

• Beauty in the Eye of AI: Aligning LLMs and Vision Models with Human Aesthetics in Network Visualization [47.53880889741314]
  We explore the use of large language models (LLMs) and vision models (VMs) as proxies for human judgment.<n>We show that prompt engineering that combines few-shot examples and diverse input formats, such as image embeddings, significantly improves LLM-human alignment.<n>Our results suggest that AI can feasibly serve as a scalable proxy for human labelers.
  arXiv  Detail & Related papers  (2026-04-03T19:30:34Z)
• Graph Prompting for Graph Learning Models: Recent Advances and Future Directions [75.7773954442738]
  "Pre-training, adaptation" scheme first pre-trains graph learning models on unlabeled graph data in a self-supervised manner.<n> graph prompting emerges as a promising approach that learns trainable prompts while keeping the pre-trained graph learning models unchanged.
  arXiv  Detail & Related papers  (2025-06-10T01:27:19Z)
• Learning a Canonical Basis of Human Preferences from Binary Ratings [28.975782992900065]
  This paper shifts the focus to understanding the preferences encoded in such datasets and identifying common human preferences. We find that a small subset of 21 preference categories captures >89% of preference variation across individuals. This small set of preferences is analogous to a canonical basis of human preferences, similar to established findings that characterize human variation in psychology or facial recognition studies.
  arXiv  Detail & Related papers  (2025-03-31T14:35:48Z)
• Influencing Humans to Conform to Preference Models for RLHF [41.929409024817936]
  A preference model that poorly describes how humans generate preferences risks learning a poor approximation of the human's reward function. We conduct three human studies to asses whether one can influence the expression of real human preferences to more closely conform to a desired preference model.
  arXiv  Detail & Related papers  (2025-01-11T03:12:53Z)
• A Survey of Deep Graph Learning under Distribution Shifts: from Graph Out-of-Distribution Generalization to Adaptation [59.14165404728197]
  We provide an up-to-date and forward-looking review of deep graph learning under distribution shifts. Specifically, we cover three primary scenarios: graph OOD generalization, training-time graph OOD adaptation, and test-time graph OOD adaptation. To provide a better understanding of the literature, we systematically categorize the existing models based on our proposed taxonomy.
  arXiv  Detail & Related papers  (2024-10-25T02:39:56Z)
• Data-Centric Human Preference with Rationales for Direct Preference Alignment [23.243583332894737]
  We propose augmenting standard preference pairs with rationales that explain the reasoning behind the human preference.<n>Our comprehensive analysis demonstrates that incorporating rationales improves learning efficiency.<n>Our findings showcase the potential of thoughtful data design in preference learning.
  arXiv  Detail & Related papers  (2024-07-19T17:27:52Z)
• Better with Less: A Data-Active Perspective on Pre-Training Graph Neural Networks [39.71761440499148]
  Pre-training on graph neural networks (GNNs) aims to learn transferable knowledge for downstream tasks with unlabeled data. We propose a better-with-less framework for graph pre-training: fewer, but carefully chosen data are fed into a GNN model. Experiment results show that the proposed APT is able to obtain an efficient pre-training model with fewer training data and better downstream performance.
  arXiv  Detail & Related papers  (2023-11-02T07:09:59Z)
• Intrinsically motivated graph exploration using network theories of human curiosity [71.2717061477241]
  We propose a novel approach for exploring graph-structured data motivated by two theories of human curiosity. We use these proposed features as rewards for graph neural-network-based reinforcement learning.
  arXiv  Detail & Related papers  (2023-07-11T01:52:08Z)
• Curriculum Graph Machine Learning: A Survey [51.89783017927647]
  curriculum graph machine learning (Graph CL) integrates the strength of graph machine learning and curriculum learning. This paper comprehensively overview approaches on Graph CL and present a detailed survey of recent advances in this direction.
  arXiv  Detail & Related papers  (2023-02-06T16:59:25Z)
• State of the Art and Potentialities of Graph-level Learning [54.68482109186052]
  Graph-level learning has been applied to many tasks including comparison, regression, classification, and more. Traditional approaches to learning a set of graphs rely on hand-crafted features, such as substructures. Deep learning has helped graph-level learning adapt to the growing scale of graphs by extracting features automatically and encoding graphs into low-dimensional representations.
  arXiv  Detail & Related papers  (2023-01-14T09:15:49Z)
• Graph Self-Supervised Learning: A Survey [73.86209411547183]
  Self-supervised learning (SSL) has become a promising and trending learning paradigm for graph data. We present a timely and comprehensive review of the existing approaches which employ SSL techniques for graph data.
  arXiv  Detail & Related papers  (2021-02-27T03:04:21Z)
• Latent-Graph Learning for Disease Prediction [44.26665239213658]
  We show that it is possible to learn a single, optimal graph towards the GCN's downstream task of disease classification. Unlike commonly employed spectral GCN approaches, our GCN is spatial and inductive, and can thus infer previously unseen patients as well.
  arXiv  Detail & Related papers  (2020-03-27T08:18:01Z)

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.