Tree testing is a usability technique for evaluating the findability of topics in a website. It is also known as reverse card sorting or card-based classification A large website is typically organized into a hierarchy (a "tree") of topics and subtopics. Tree testing provides a way to measure how well users can find items in this hierarchy. Unlike traditional usability testing, tree testing is not done on the website itself; instead, a simplified text version of the site structure is used.
| Property | Value |
|---|
| dbpprop:abstract
|
- Tree testing is a usability technique for evaluating the findability of topics in a website. It is also known as reverse card sorting or card-based classification A large website is typically organized into a hierarchy (a "tree") of topics and subtopics. Tree testing provides a way to measure how well users can find items in this hierarchy. Unlike traditional usability testing, tree testing is not done on the website itself; instead, a simplified text version of the site structure is used. This ensures that the structure is evaluated in isolation, nullifying the effects of navigational aids, visual design, and other factors.
|
| dbpprop:reference
| |
| rdfs:comment
|
- Tree testing is a usability technique for evaluating the findability of topics in a website. It is also known as reverse card sorting or card-based classification A large website is typically organized into a hierarchy (a "tree") of topics and subtopics. Tree testing provides a way to measure how well users can find items in this hierarchy. Unlike traditional usability testing, tree testing is not done on the website itself; instead, a simplified text version of the site structure is used.
|
| rdfs:label
| |
| skos:subject
| |
| foaf:page
| |
| is dbpprop:redirect
of | |
![[RDF Data]](/statics/sw-cube.png)
