Skip to content

pexlechris/optimal_number_of_participants_in_a_cardsorting

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

34 Commits
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Optimal_number_of_participants_in_a_cardsorting

Analysis of card sorting experiments by using Mantel test and Element-centric clustering comparison

Team members

  • Pechlevanoudis Christos
  • Zilidis Grigorios

We are two post-graduate students of the Computer Science department of the Aristotle University of Thessaloniki. Currently, we are working on a study to complete our thesis. Our research focuses on Card Sorting, which supports the process of designing and / or evaluating information architecture sites and its title is:

"Minimum number of participants for collecting reliable data from card-sorting studies"

The main purpose is to conduct a sufficient number of studies, with about 150 participants, on two travel and two e-shop sites respectively, that we have chosen and after at least two type of comparison methods, to specify the minimum number of participants that will give us reliable data:

  • In our first analysis we conducted a Mantel test.

  • For our second analysis, we used Element-centric Similarity comparison method.

    Then the Python (Spyder) prints the correlations and the error bars for these 2 methods, by using the desirable participant range of our choice.

About

No description, website, or topics provided.

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages