Content deleted Content added
added Category:Survey methodology and Category:Qualitative research and 'See also' section |
Adding short description: "Test in user experience design" |
||
| (19 intermediate revisions by 12 users not shown) | |||
Line 1:
{{Short description|Test in user experience design}}
{{Use dmy dates|date=January 2025}}
{{Distinguish|Card sorter}}
Line 7 ⟶ 9:
|website=Nielsen Norman Group
|url=http://www.useit.com/papers/sun/cardsort.html
|archive-url=https://web.archive.org/web/20120505030209/http://www.useit.com/papers/sun/cardsort.html
|archive-date=2012-05-05
|url-status=dead
|first=Jakob|last=Nielsen
|authorlink=Jakob Nielsen (usability consultant)
Line 14 ⟶ 19:
|title=Card Sorting: How Many Users to Test
|website=Nielsen Norman Group
|url=http://www.useit.com/alertbox/20040719.html
|archive-url=https://web.archive.org/web/20121027101903/http://www.useit.com/alertbox/20040719.html
|archive-date=2012-10-27
|url-status=dead
|first=Jakob|last=Nielsen
|authorlink=Jakob Nielsen (usability consultant)
Line 77 ⟶ 85:
===Reverse card sorting===
In a '''reverse card sort''' (more popularly called [[tree testing]]), an existing structure of categories and sub-categories is tested. Users are given tasks and are asked to complete them navigating a collection of cards. Each card contains the names of subcategories related to a category, and the user should find the card most relevant to the given task starting from the main card with the top-level categories. This ensures that the structure is evaluated in isolation, nullifying the effects of navigational aids, visual design, and other factors. Reverse card sorting is '''evaluative'''—it judges whether a predetermined hierarchy provides a good way to find information.
===Modified-Delphi card sorting===
Created by [[Celeste Paul]], The Modified-Delphi card sort is based on the [[Delphi method]]. Rather than each participant creating their own card sort, only the first participant does a full card sort of organizing and arranging items. The next participant iterates on the first participant's model, then the third participant iterates on the second's model, and so on. The idea is that with each iteration the card sort gets more refined with fewer participants and consensus is built sooner. <ref>{{cite journal |last1=Paul |first1=Celeste Lyn |title=A modified Delphi approach to a new card sorting methodology |journal=Journal of Usability Studies |date=November 2008 |volume=4 |issue=1 |pages=7–30 |url=https://dl.acm.org/doi/10.5555/2835577.2835579}}</ref>
==Analysis==
Line 97 ⟶ 108:
* [[Cluster analysis]]
* [[Group concept mapping]]
* [[Q methodology]]
==References==
Line 104 ⟶ 116:
* {{cite book |last=Coxon |first=Anthony Peter Macmillan |date=1999 |title=Sorting Data: Collection and Analysis |url={{google books|1Uz6GVbwlcIC|plainurl=yes}} |via=Google Books |isbn=978-0-8039-7237-7 |publisher=SAGE |series=Quantitative Applications in the Social Sciences |volume=127 |issn=0149-192X }}
* {{cite encyclopedia |first=William |last=Hudson |url=http://www.interaction-design.org/encyclopedia/card_sorting.html |title=Card Sorting |encyclopedia=The Encyclopedia of Human-Computer Interaction |edition=2nd |editor1-last=Soegaard |editor1-first=Mads |editor2-last=Dam |editor2-first=Rikke Friis |publisher=Interaction Design Foundation }}
* {{cite web |first=Sergey |last=Sinyakov |date=May 13, 2013 |title=Can Card Sorting Improve the Usability of Your Designs? |website=Design Instruct |url=http://designinstruct.com/web-design/card-sorting-usability-designs/ }}
[[Category:Folksonomy]]
| |||