Comparison strategies in different types of graphs

Download

index.pdf

Date

2010

Author

Alaçam, Özge

Metadata

Show full item record

Item Usage Stats

188
views

99
downloads

This study aims to investigate the effects of event type (concepts represented by the graph) in graph comprehension with three graph types (line, bar, area) and two graph designs (linear, round) by means of two different task types (trend assessment, discrete comparison). A novel round graph type was designed for that purpose. Five hypotheses were investigated: H1: Graph type affects comparison strategies; H2: Event type affects comparison strategies; H3: Graph design affects comparison strategies; H4: Graph design and event type interact; H5: Task type affects comparison strategies. As a method to collect data on subjects' graph perception and comprehension, behavioral (recollected values, word preferences in the description task) and eye-tracking data (scan paths, gaze length, number of fixation, fixation duration and number of transitions) were collected. As an outcome of this thesis, while the event type and the task type seemed to affect the graph comprehension, the effect of graph type, the graph design and interaction between graph design and event type were partially observed. These results point out that although round and linear graph designs are informationally equivalent, the round graphs are computationally better suited than linear graphs for the interpretation of cyclic concepts. However, grasping trend information for the linear events and making discrete comparisons were achieved with the same effort in both graph designs. This result is not trivial at all, given the fact that participants were not familiar with the round graph design and were confronted with them in this experiment for the first time.

Subject Keywords

Cognitive sciences., Information structure.

URI

http://etd.lib.metu.edu.tr/upload/12611699/index.pdf
https://hdl.handle.net/11511/19502

Collections

Graduate School of Informatics, Thesis

Suggestions

OpenMETU
Core

Towards a systematic understanding of graphical cues in communication through statistical graphs Acartürk, Cengiz (2014-04-01) Statistical graphs in particular, line graphs and bar graphs are efficient means of communication in a wide range of non-expert settings. In communication settings, statistical graphs do not only serve as visualizations of individual data points but also provide visual access to various aspects of the information contained in data. Moreover, specific types of graphs are better means for providing visual access to certain aspects of data. For instance, trend information is visually conveyed through line grap...
Hybrid statistical and machine learning modeling of cognitive neuroscience data Çakar, Serenay; Gökalp Yavuz, Fulya (2023-01-01) The nested data structure is prevalent for cognitive measure experiments due to repeatedly taken observations from different brain locations within subjects. The analysis methods used for this data type should consider the dependency structure among the repeated measurements. However, the dependency assumption is mainly ignored in the cognitive neuroscience data analysis literature. We consider both statistical, and machine learning methods extended to repeated data analysis and compare distinct algorithms ...
Comparison of feature-based and image registration-based retrieval of image data using multidimensional data access methods Arslan, Serdar; Yazıcı, Adnan; Sacan, Ahmet; Toroslu, İsmail Hakkı; Acar, Esra (Elsevier BV, 2013-07-01) In information retrieval, efficient similarity search in multimedia collections is a critical task In this paper, we present a rigorous comparison of three different approaches to the image retrieval problem, including cluster-based indexing, distance-based indexing, and multidimensional scaling methods. The time and accuracy trade-offs for each of these methods are demonstrated on three different image data sets. Similarity of images is obtained either by a feature-based similarity measure using four MPEG-...
Effective feature reduction for link prediction in location-based social networks Bayrak, Ahmet Engin; Polat, Faruk (SAGE Publications, 2019-10-01) In this study, we investigated feature-based approaches for improving the link prediction performance for location-based social networks (LBSNs) and analysed their performances. We developed new features based on time, common friend detail and place category information of check-in data in order to make use of information in the data which cannot be utilised by the existing features from the literature. We proposed a feature selection method to determine a feature subset that enhances the prediction perform...
Learning Graph Signal Representations with Narrowband Spectral Kernels Kar, Osman Furkan; Turhan, Gülce; Vural, Elif (2022-01-01) In this work, we study the problem of learning graph dictionary models from partially observed graph signals. We represent graph signals in terms of atoms generated by narrowband graph kernels. We formulate an optimization problem where the kernel parameters are learnt jointly with the signal representations under a triple regularization scheme: While the first regularization term aims to control the spectrum of the narrowband kernels, the second term encourages the reconstructed graph signals to vary smoot...

Citation Formats

Ö. Alaçam, “Comparison strategies in different types of graphs,” M.S. - Master of Science, Middle East Technical University, 2010.