ia tagung 2005: card sorting

74
Card Sorting for Information Architecture: Usage Areas, Methods and Samples IATagung Frankfurt :: 28./29.05.2005 :: Steffen Schilb Card Sorting for Information Architectur Usage Areas, Methods and Samples Steffen Schilb ([email protected])

Upload: steffen-schilb

Post on 28-Jan-2015

111 views

Category:

Economy & Finance


1 download

DESCRIPTION

 

TRANSCRIPT

Page 1: IA Tagung 2005: Card Sorting

Card Sorting for Information Architecture: Usage Areas, Methods and Samples

IATagung Frankfurt :: 28./29.05.2005 :: Steffen Schilb

Card Sorting for Information Architecture

Usage Areas, Methods and Samples

Steffen Schilb ([email protected])

Page 2: IA Tagung 2005: Card Sorting

Outline

Card Sorting for Information Architecture: Usage Areas, Methods and Samples

IATagung Frankfurt :: 28./29.05.2005 :: Steffen Schilb

1.Introduction2.Card Sorting: The Standard Method3.Cluster Analysis4.Computer-Based Card Sorting5.Card Sorting Variants6.Conclusion7.References8.Questions and Discussion

Page 3: IA Tagung 2005: Card Sorting

Introduction

Card Sorting for Information Architecture: Usage Areas, Methods and Samples

IATagung Frankfurt :: 28./29.05.2005 :: Steffen Schilb

1Introduction

Page 4: IA Tagung 2005: Card Sorting

Introduction: Why do People browse the Internet?

Card Sorting for Information Architecture: Usage Areas, Methods and Samples

IATagung Frankfurt :: 28./29.05.2005 :: Steffen Schilb

Page 5: IA Tagung 2005: Card Sorting

Introduction: Why do People browse the Internet?

Card Sorting for Information Architecture: Usage Areas, Methods and Samples

IATagung Frankfurt :: 28./29.05.2005 :: Steffen Schilb

Typical User Behaviour (Wodtke, 2003)

• Search for specific Information

• Complete a Task

• Browsing around

ProblemInformation cannot be found

Page 6: IA Tagung 2005: Card Sorting

Introduction:Why does this happen?

Card Sorting for Information Architecture: Usage Areas, Methods and Samples

IATagung Frankfurt :: 28./29.05.2005 :: Steffen Schilb

Hierarchy, Navigation Scheme

No intuitive Navigation Scheme, Hierarchy

People expect Content somewhere else

Page 7: IA Tagung 2005: Card Sorting

Introduction:Why does this happen?

Card Sorting for Information Architecture: Usage Areas, Methods and Samples

IATagung Frankfurt :: 28./29.05.2005 :: Steffen Schilb

Misunderstood Wording

Inconsistent Terms

English Vs. German

Ambiguous Terms

Page 8: IA Tagung 2005: Card Sorting

Introduction

Card Sorting for Information Architecture: Usage Areas, Methods and Samples

IATagung Frankfurt :: 28./29.05.2005 :: Steffen Schilb

How can this be improved?

Page 9: IA Tagung 2005: Card Sorting

Introduction: How can this be improved?

Card Sorting for Information Architecture: Usage Areas, Methods and Samples

IATagung Frankfurt :: 28./29.05.2005 :: Steffen Schilb

With Card Sorting

• Users group the Contents and develop a Hierarchy themselves

• Helps to understand how Users group Information

• Can provide insight into mental Model

• Serves as helpful Input to specify IA

Page 10: IA Tagung 2005: Card Sorting

Introduction

Card Sorting for Information Architecture: Usage Areas, Methods and Samples

IATagung Frankfurt :: 28./29.05.2005 :: Steffen Schilb

Benfits of Card Sorting

• Simple, Cheap, Quick

• Established

• Involves Users

• Flexible

• Provides good Results

Page 11: IA Tagung 2005: Card Sorting

Introduction

Card Sorting for Information Architecture: Usage Areas, Methods and Samples

IATagung Frankfurt :: 28./29.05.2005 :: Steffen Schilb

Usage Areas

• Designing a new Site

• Designing a new Area of a Site

• Redesigning a Site

• Early Stages of Prototyping

• Large Websites

Page 12: IA Tagung 2005: Card Sorting

Card Sorting: The Standard Method

Card Sorting for Information Architecture: Usage Areas, Methods and Samples

IATagung Frankfurt :: 28./29.05.2005 :: Steffen Schilb

2Card Sorting:The Standard Method

Page 13: IA Tagung 2005: Card Sorting

Card Sorting: The Standard Method

Card Sorting for Information Architecture: Usage Areas, Methods and Samples

IATagung Frankfurt :: 28./29.05.2005 :: Steffen Schilb

Preparation

Page 14: IA Tagung 2005: Card Sorting

Card Sorting: The Standard Method

Card Sorting for Information Architecture: Usage Areas, Methods and Samples

IATagung Frankfurt :: 28./29.05.2005 :: Steffen Schilb

Preparation

• Write down the Topics

• Write each Content on a Card

• Size of Cards should be manageable

• Number of Cards should be manageable (30-100)

• Label is extremely important

Page 15: IA Tagung 2005: Card Sorting

Card Sorting: Preparation

Card Sorting for Information Architecture: Usage Areas, Methods and Samples

IATagung Frankfurt :: 28./29.05.2005 :: Steffen Schilb

Same Level of Detail Politics

Album Charts

Page 16: IA Tagung 2005: Card Sorting

Card Sorting: Preparation

Card Sorting for Information Architecture: Usage Areas, Methods and Samples

IATagung Frankfurt :: 28./29.05.2005 :: Steffen Schilb

Cover one distinguished Content

Tennis

Icehockey

Page 17: IA Tagung 2005: Card Sorting

Card Sorting: Preparation

Card Sorting for Information Architecture: Usage Areas, Methods and Samples

IATagung Frankfurt :: 28./29.05.2005 :: Steffen Schilb

Describe the Content in a unambiguous Way

Inspiration

Opening Hours

Page 18: IA Tagung 2005: Card Sorting

Card Sorting: Preparation

Card Sorting for Information Architecture: Usage Areas, Methods and Samples

IATagung Frankfurt :: 28./29.05.2005 :: Steffen Schilb

Before the Exercise starts...

• Define Test Conditions (Single, Group,...)

• Select Participants

• Invite Participants

Page 19: IA Tagung 2005: Card Sorting

Card Sorting: Conducting the Exercise

Card Sorting for Information Architecture: Usage Areas, Methods and Samples

IATagung Frankfurt :: 28./29.05.2005 :: Steffen Schilb

Conducting the Exercise

Page 20: IA Tagung 2005: Card Sorting

Card Sorting: Conducting the Exercise

Card Sorting for Information Architecture: Usage Areas, Methods and Samples

IATagung Frankfurt :: 28./29.05.2005 :: Steffen Schilb

Procedure

• Welcome Participants

• Introduce Card Sorting Method

• Give Instructions• Sorting out Cards• Sorting into multiple Categories

Page 21: IA Tagung 2005: Card Sorting

Card Sorting: Conducting the Exercise

Card Sorting for Information Architecture: Usage Areas, Methods and Samples

IATagung Frankfurt :: 28./29.05.2005 :: Steffen Schilb

Step 1: Sorting the Cards

Page 22: IA Tagung 2005: Card Sorting

Card Sorting: Conducting the Exercise

Card Sorting for Information Architecture: Usage Areas, Methods and Samples

IATagung Frankfurt :: 28./29.05.2005 :: Steffen Schilb

Step 2: Finalizing the Sorting

Page 23: IA Tagung 2005: Card Sorting

Card Sorting: Conducting the Exercise

Card Sorting for Information Architecture: Usage Areas, Methods and Samples

IATagung Frankfurt :: 28./29.05.2005 :: Steffen Schilb

Step 3: Labeling the Clusters

Page 24: IA Tagung 2005: Card Sorting

Card Sorting: Closed Card Sorting

Card Sorting for Information Architecture: Usage Areas, Methods and Samples

IATagung Frankfurt :: 28./29.05.2005 :: Steffen Schilb

Variant: Closed Card Sorting

• Categories are predefined

• Top-down Approach

• Redesign/Relaunch of Websites

Page 25: IA Tagung 2005: Card Sorting

Card Sorting: Analysis

Card Sorting for Information Architecture: Usage Areas, Methods and Samples

IATagung Frankfurt :: 28./29.05.2005 :: Steffen Schilb

(Manual) Analysis

Page 26: IA Tagung 2005: Card Sorting

Card Sorting: Analysis

Card Sorting for Information Architecture: Usage Areas, Methods and Samples

IATagung Frankfurt :: 28./29.05.2005 :: Steffen Schilb

Analysis Methods

• Documention

• „Data-Eyeballing“

• Spreadsheet Analysis

• (Clusteranalysis)

Page 27: IA Tagung 2005: Card Sorting

Card Sorting: Analysis

Card Sorting for Information Architecture: Usage Areas, Methods and Samples

IATagung Frankfurt :: 28./29.05.2005 :: Steffen Schilb

Data-Eyeballing

• Look for dominant Organization Schemes (Patterns)

• Adjust Scheme to make kinds of Categories consistent

• Set asside the odd Categories that don‘t match

Page 28: IA Tagung 2005: Card Sorting

Card Sorting: Data-Eyeballing

Card Sorting for Information Architecture: Usage Areas, Methods and Samples

IATagung Frankfurt :: 28./29.05.2005 :: Steffen Schilb

Result: Simple TaxonomySport

Fussball1. Bundesliga2. Bundesliga...

TennisWeltranglisteATP-Turniere...

BasketballNBA...

PolitikAktuelles

Aus aller WeltDeutschland...

InnenpolitikNews...

AußenpolitikEuropa...

WirtschaftDeutschland

News...

WeltweitNews...

BörseNewsDAXDow-Jones...

Page 29: IA Tagung 2005: Card Sorting

Card Sorting: Data-Eyeballing

Card Sorting for Information Architecture: Usage Areas, Methods and Samples

IATagung Frankfurt :: 28./29.05.2005 :: Steffen Schilb

Attributes of Data-Eyeballing

• Efficient

• Easy and fast

But:

• Highly subjective

Page 30: IA Tagung 2005: Card Sorting

Card Sorting: Analysis

Card Sorting for Information Architecture: Usage Areas, Methods and Samples

IATagung Frankfurt :: 28./29.05.2005 :: Steffen Schilb

Spreadsheet Analysis

Page 31: IA Tagung 2005: Card Sorting

Card Sorting: Analysis

Card Sorting for Information Architecture: Usage Areas, Methods and Samples

IATagung Frankfurt :: 28./29.05.2005 :: Steffen Schilb

Spreadsheet Analysis

• More information can be found atBoxes and Arrows: Analyzing Card Sort Results with a Spreadsheet Template

Page 32: IA Tagung 2005: Card Sorting

Cluster Analysis

Card Sorting for Information Architecture: Usage Areas, Methods and Samples

IATagung Frankfurt :: 28./29.05.2005 :: Steffen Schilb

3Cluster Analysis

Page 33: IA Tagung 2005: Card Sorting

Cluster Analysis

Card Sorting for Information Architecture: Usage Areas, Methods and Samples

IATagung Frankfurt :: 28./29.05.2005 :: Steffen Schilb

Cluster Analysis

• Statistical Analysis Method for identifying Groups

• Most common Analysis Method

• Mostly done with Computer

• Procedure:• Step 1: Distance Matrix• Step 2: Tree Diagram

Page 34: IA Tagung 2005: Card Sorting

Cluster Analysis

Card Sorting for Information Architecture: Usage Areas, Methods and Samples

IATagung Frankfurt :: 28./29.05.2005 :: Steffen Schilb

Distance Matrix

Page 35: IA Tagung 2005: Card Sorting

Cluster Analysis: Distance Matrix

Card Sorting for Information Architecture: Usage Areas, Methods and Samples

IATagung Frankfurt :: 28./29.05.2005 :: Steffen Schilb

ExampleParticipant 1

ProjekteAG‘sAktuelle Projekte

StudentischesFachbereicheInsitute

CampusLageplanAnreise

Participant 2Aktivitäten

AG‘sAktuelle Projekte

StudiumFachbereicheInstitute

Allgemeine InfosLageplanAnreise

Participant 3Aktivitäten

AG‘s

StudiumFachbereicheAktuelle ProjekteInstitute

InformationenLageplanAnreise

Page 36: IA Tagung 2005: Card Sorting

Cluster Analysis: Distance Matrix

Card Sorting for Information Architecture: Usage Areas, Methods and Samples

IATagung Frankfurt :: 28./29.05.2005 :: Steffen Schilb

Distance Matrix P1AG‘s

Aktuelle Projekte

Fach-bereiche

Institute Lageplan Anreise

AG‘s 1.00 0.00 1.00 1.00 1.00 1.00

Aktuelle Projekte 0.00 1.00 1.00 1.00 1.00 1.00

Fach-bereiche 1.00 1.00 1.00 0.00 1.00 1.00

Insitute 1.00 1.00 0.00 1.00 1.00 1.00

Lageplan 1.00 1.00 1.00 1.00 1.00 0.00

Anreise 1.00 1.00 1.00 1.00 0.00 1.00

Page 37: IA Tagung 2005: Card Sorting

Cluster Analysis: Distance Matrix

Card Sorting for Information Architecture: Usage Areas, Methods and Samples

IATagung Frankfurt :: 28./29.05.2005 :: Steffen Schilb

Distance Matrix P1AG‘s

Aktuelle Projekte

Fach-bereiche

Institute Lageplan Anreise

AG‘s 1.00 0.00 1.00 1.00 1.00 1.00

Aktuelle Projekte 0.00 1.00 1.00 1.00 1.00 1.00

Fach-bereiche 1.00 1.00 1.00 0.00 1.00 1.00

Insitute 1.00 1.00 0.00 1.00 1.00 1.00

Lageplan 1.00 1.00 1.00 1.00 1.00 0.00

Anreise 1.00 1.00 1.00 1.00 0.00 1.00

Page 38: IA Tagung 2005: Card Sorting

Cluster Analysis: Distance Matrix

Card Sorting for Information Architecture: Usage Areas, Methods and Samples

IATagung Frankfurt :: 28./29.05.2005 :: Steffen Schilb

Distance Matrix P1 + P2AG‘s

Aktuelle Projekte

Fach-bereiche

Institute Lageplan Anreise

AG‘s 1.00 0.00 1.00 1.00 1.00 1.00

Aktuelle Projekte 0.00 1.00 1.00 1.00 1.00 1.00

Fach-bereiche 1.00 1.00 1.00 0.00 1.00 1.00

Insitute 1.00 1.00 0.00 1.00 1.00 1.00

Lageplan 1.00 1.00 1.00 1.00 1.00 0.00

Anreise 1.00 1.00 1.00 1.00 0.00 1.00

Page 39: IA Tagung 2005: Card Sorting

Cluster Analysis: Distance Matrix

Card Sorting for Information Architecture: Usage Areas, Methods and Samples

IATagung Frankfurt :: 28./29.05.2005 :: Steffen Schilb

ExampleParticipant 1

ProjekteAG‘sAktuelle Projekte

StudentischesFachbereicheInsitute

CampusLageplanAnreise

Participant 2Aktivitäten

AG‘sAktuelle Projekte

StudiumFachbereicheInstitute

Allgemeine InfosLageplanAnreise

Participant 3Aktivitäten

AG‘s

StudiumFachbereicheAktuelle ProjekteInstitute

InformationenLageplanAnreise

Page 40: IA Tagung 2005: Card Sorting

Cluster Analysis: Distance Matrix

Card Sorting for Information Architecture: Usage Areas, Methods and Samples

IATagung Frankfurt :: 28./29.05.2005 :: Steffen Schilb

Distance Matrix (P1+P2)+P3AG‘s

Aktuelle Projekte

Fach-bereiche

Institute Lageplan Anreise

AG‘s 1.00 0.33 1.00 1.00 1.00 1.00

Aktuelle Projekte 0.33 1.00 0.67 0.67 1.00 1.00

Fach-bereiche 1.00 0.67 1.00 0.00 1.00 1.00

Insitute 1.00 0.67 0.00 1.00 1.00 1.00

Lageplan 1.00 1.00 1.00 1.00 1.00 0.00

Anreise 1.00 1.00 1.00 1.00 0.00 1.00

Page 41: IA Tagung 2005: Card Sorting

Cluster Analysis: Distance Matrix

Card Sorting for Information Architecture: Usage Areas, Methods and Samples

IATagung Frankfurt :: 28./29.05.2005 :: Steffen Schilb

How to calculate

∑KF(AF/BF) =

Kt(At/Bt)

Tt=1

T

K: Relative CoordinateA: Relative X-CoordinateB: Relative Y-CoordinateF: Final MatrixT: Number of Participants

t: Participant

Page 42: IA Tagung 2005: Card Sorting

Cluster Analysis: Distance Matrix

Card Sorting for Information Architecture: Usage Areas, Methods and Samples

IATagung Frankfurt :: 28./29.05.2005 :: Steffen Schilb

From Distance Matrix to Tree Diagrams

• Single Linkage Algorithm

• Complete Linkage Algorithm

• Average Linkage Algorithm

Page 43: IA Tagung 2005: Card Sorting

Cluster Analysis: Single Linkage Algorithm

Card Sorting for Information Architecture: Usage Areas, Methods and Samples

IATagung Frankfurt :: 28./29.05.2005 :: Steffen Schilb

Distance Matrix

AG‘s ASTAAktuelle Projekte

Alumni

AG‘s 1.00 0.69 0.42 0.83

ASTA 0.69 1.00 0.92 0.81

Aktuelle Projekte 0.42 0.92 1.00 0.86

Alumni 0.83 0.81 0.86 1.00

Page 44: IA Tagung 2005: Card Sorting

Cluster Analysis: Single Linkage Algorithm

Card Sorting for Information Architecture: Usage Areas, Methods and Samples

IATagung Frankfurt :: 28./29.05.2005 :: Steffen Schilb

How it works

• Pair (Aktuelle Projekte/AG‘s) is most frequently grouped together (58%)

• Combine Pair to one Cluster and calculate new Distances

• d(E; CE1 + CE2) = min{d(E;CE1), d(E;CE2)}

• d(ASTA; AG‘s + Aktuelle Projekte) = min{d(ASTA;AG‘s), d(ASTA; Aktuelle Projekte)} = min{0.69, 0.92}= 0.69

Page 45: IA Tagung 2005: Card Sorting

Cluster Analysis: Single Linkage Algorithm

Card Sorting for Information Architecture: Usage Areas, Methods and Samples

IATagung Frankfurt :: 28./29.05.2005 :: Steffen Schilb

New Distance MatrixAG‘s+

Aktuelle Projekte

ASTA Alumni

AG‘s+Aktuelle Projekte

1.00 0.69 0.83

ASTA 0.69 1.00 0.81

Aktuelle Projekte 0.83 0.81 1.00

Page 46: IA Tagung 2005: Card Sorting

Cluster Analysis: Single Linkage Algorithm

Card Sorting for Information Architecture: Usage Areas, Methods and Samples

IATagung Frankfurt :: 28./29.05.2005 :: Steffen Schilb

Steps

1. AG‘s+Aktuelle Projekte 0.42

2. (AG‘s+Aktuelle Projekte)+ASTA 0.69

3. ((AG‘s+Aktuelle Projekte)+ASTA)+Alumni 0.81

Page 47: IA Tagung 2005: Card Sorting

Cluster Analysis: Single Linkage Algorithm

Card Sorting for Information Architecture: Usage Areas, Methods and Samples

IATagung Frankfurt :: 28./29.05.2005 :: Steffen Schilb

Final DendogramAG‘s

AktuelleProjekte

ASTA

Alumni

0.00 0.50 1.00

0.42 0.69 0.81

Page 48: IA Tagung 2005: Card Sorting

Cluster Analysis: Single Linkage Algorithm

Card Sorting for Information Architecture: Usage Areas, Methods and Samples

IATagung Frankfurt :: 28./29.05.2005 :: Steffen Schilb

Attributes

• min{0.69;0.92}=0.69

• Nearest-Neighboor-Method

• Minimum-Distance Rule

• Chaining Phenomenon

• Isolates Outliners (Most important Attribute)

Page 49: IA Tagung 2005: Card Sorting

Cluster Analysis: Complete Linkage Algorithm

Card Sorting for Information Architecture: Usage Areas, Methods and Samples

IATagung Frankfurt :: 28./29.05.2005 :: Steffen Schilb

Attributes

• max{0.69;0.92}=0.92

• Furthest-Neighboor-Method

• A lot of small Groups are formed

• Large groups are mostly formed at the End

• Does not identify Outliners well

Page 50: IA Tagung 2005: Card Sorting

Cluster Analysis: Average Linkage Algorithm

Card Sorting for Information Architecture: Usage Areas, Methods and Samples

IATagung Frankfurt :: 28./29.05.2005 :: Steffen Schilb

Attributes

• 0,5x(0.69) + 0,5x(0.92) = 0.80

• Takes mean Distance

• No Chaining Phenonemon

Page 51: IA Tagung 2005: Card Sorting

Computer-Based Card Sorting

Card Sorting for Information Architecture: Usage Areas, Methods and Samples

IATagung Frankfurt :: 28./29.05.2005 :: Steffen Schilb

4Computer-BasedCard Sorting

Page 52: IA Tagung 2005: Card Sorting

Computer-Based Card Sorting

Card Sorting for Information Architecture: Usage Areas, Methods and Samples

IATagung Frankfurt :: 28./29.05.2005 :: Steffen Schilb

Some Tools

• EZSort

• CardSort

Page 53: IA Tagung 2005: Card Sorting

Computer-Based Card Sorting: EZSort

Card Sorting for Information Architecture: Usage Areas, Methods and Samples

IATagung Frankfurt :: 28./29.05.2005 :: Steffen Schilb

EZSort

Page 54: IA Tagung 2005: Card Sorting

Computer-Based Card Sorting: EZSort

Card Sorting for Information Architecture: Usage Areas, Methods and Samples

IATagung Frankfurt :: 28./29.05.2005 :: Steffen Schilb

Features

• Most common Card Sorting Tool

• Developed by IBM in 1998

• USort for Sorting the Cards (Open Card Sort)

• EZCalc for Clusteranalysis

• Windows-only

Page 55: IA Tagung 2005: Card Sorting

Computer-Based Card Sorting: CardSort

Card Sorting for Information Architecture: Usage Areas, Methods and Samples

IATagung Frankfurt :: 28./29.05.2005 :: Steffen Schilb

CardSort

Page 56: IA Tagung 2005: Card Sorting

Computer-Based Card Sorting: CardSort

Card Sorting for Information Architecture: Usage Areas, Methods and Samples

IATagung Frankfurt :: 28./29.05.2005 :: Steffen Schilb

Features

• Developed in 2003

• www.cardsort.net

• Allows only Card Sorting (open and closed)

• Analysis with EZCalc

• Cross-plattform

Page 57: IA Tagung 2005: Card Sorting

Computer-Based Card Sorting

Card Sorting for Information Architecture: Usage Areas, Methods and Samples

IATagung Frankfurt :: 28./29.05.2005 :: Steffen Schilb

Other Tools

• CardZorthttp://condor.depaul.edu/~jtoro/cardzort/

• CardSwordhttp://cardsword.sourceforge.net/

• WebSorthttp://www.websort.net/

Page 58: IA Tagung 2005: Card Sorting

Card Sorting Variants

Card Sorting for Information Architecture: Usage Areas, Methods and Samples

IATagung Frankfurt :: 28./29.05.2005 :: Steffen Schilb

5Card SortingVariants

Page 59: IA Tagung 2005: Card Sorting

Card Sorting Variants

Card Sorting for Information Architecture: Usage Areas, Methods and Samples

IATagung Frankfurt :: 28./29.05.2005 :: Steffen Schilb

Card Sorting Variants

• Card Sorting with Subgroups

• Labeling the Contents

• Rating the Contents

Page 60: IA Tagung 2005: Card Sorting

Card Sorting Variants: Card Sorting with Subgroups

Card Sorting for Information Architecture: Usage Areas, Methods and Samples

IATagung Frankfurt :: 28./29.05.2005 :: Steffen Schilb

Card Sorting with Subgroups

Page 61: IA Tagung 2005: Card Sorting

Card Sorting Variants: Card Sorting with Subgroups

Card Sorting for Information Architecture: Usage Areas, Methods and Samples

IATagung Frankfurt :: 28./29.05.2005 :: Steffen Schilb

Attributes

• Adding an additional Sorting Step

• First: Forming Clusters (Subgroups)

• Second: Forming Major Clusters

• Third: Labeling the (Major) Clusters

Page 62: IA Tagung 2005: Card Sorting

Card Sorting Variants: Labeling the Contents

Card Sorting for Information Architecture: Usage Areas, Methods and Samples

IATagung Frankfurt :: 28./29.05.2005 :: Steffen Schilb

Labeling the Contents

Page 63: IA Tagung 2005: Card Sorting

Card Sorting Variants: Labeling the Contents

Card Sorting for Information Architecture: Usage Areas, Methods and Samples

IATagung Frankfurt :: 28./29.05.2005 :: Steffen Schilb

Labeling the Contents

• Cards represent Content Descriptions

• Users label the Contents

On this page, students register online for their courses.

Page 64: IA Tagung 2005: Card Sorting

Card Sorting Variants: Rating the Contents

Card Sorting for Information Architecture: Usage Areas, Methods and Samples

IATagung Frankfurt :: 28./29.05.2005 :: Steffen Schilb

Rating the ContentsGerry McGovern (2002)

Page 65: IA Tagung 2005: Card Sorting

Card Sorting Variants: Rating the Contents

Card Sorting for Information Architecture: Usage Areas, Methods and Samples

IATagung Frankfurt :: 28./29.05.2005 :: Steffen Schilb

Begriff 20

Step 1

Step 2

Begriff 14

Begriff 7

Begriff 4

Begriff 23

Begriff 6

Begriff 24

Begriff 16

Begriff 1

Begriff 2

Begriff 1Begriff 3

Begriff 5

Begriff 8

Begriff 9

Begriff 10

Begriff 11

Begriff 13

Begriff 15

Begriff 17

Begriff 1Begriff 18

Begriff 21

Begriff 22

Begriff 25

Begriff 26

Begriff 4

Begriff 6

Begriff 7

Begriff 14

Begriff 16

Begriff 19

Begriff 20

Begriff 23

Begriff 24

Page 66: IA Tagung 2005: Card Sorting

Conclusion

Card Sorting for Information Architecture: Usage Areas, Methods and Samples

IATagung Frankfurt :: 28./29.05.2005 :: Steffen Schilb

6Conclusion

Page 67: IA Tagung 2005: Card Sorting

Conclusion

Card Sorting for Information Architecture: Usage Areas, Methods and Samples

IATagung Frankfurt :: 28./29.05.2005 :: Steffen Schilb

Summary

• Card Sorting is an easy and cheap Method to get an Insight into the users‘ mental Model

• Many different Variants

• Not a silver Bullet

• Generates Suggestions for Navigation, Hierarchy, Wording

Page 68: IA Tagung 2005: Card Sorting

Conclusion

Card Sorting for Information Architecture: Usage Areas, Methods and Samples

IATagung Frankfurt :: 28./29.05.2005 :: Steffen Schilb

Summary

• Can be done paper-based or computer-based

• Computer-based Method is better for Analysis-> Clusteranalysis

• Manual Method is easier for Users to handle

Page 69: IA Tagung 2005: Card Sorting

Conclusion

Card Sorting for Information Architecture: Usage Areas, Methods and Samples

IATagung Frankfurt :: 28./29.05.2005 :: Steffen Schilb

Keep in Mind

• Only for large Websites

• Users‘ Tasks are not integrated

• May capture “Surface” Characteristics only

Page 70: IA Tagung 2005: Card Sorting

References

Card Sorting for Information Architecture: Usage Areas, Methods and Samples

IATagung Frankfurt :: 28./29.05.2005 :: Steffen Schilb

7References

Page 71: IA Tagung 2005: Card Sorting

References

Card Sorting for Information Architecture: Usage Areas, Methods and Samples

IATagung Frankfurt :: 28./29.05.2005 :: Steffen Schilb

Links, Books, Articles

• IAWiki Card Sortinghttp://www.iawiki.net/CardSorting

• Boxes and Arrowshttp://www.boxesandarrows.com

• James Robertsonhttp://www.steptwo.au

• Donna Maurerhttp://www.maadmob.net/donna/

Page 72: IA Tagung 2005: Card Sorting

Card Sorting Variants: Card-Based Classification Evaluation

Card Sorting for Information Architecture: Usage Areas, Methods and Samples

IATagung Frankfurt :: 28./29.05.2005 :: Steffen Schilb

Thank you!

Page 73: IA Tagung 2005: Card Sorting

Computer-Based Card Sorting

Card Sorting for Information Architecture: Usage Areas, Methods and Samples

IATagung Frankfurt :: 28./29.05.2005 :: Steffen Schilb

8Questions and Discussion

Page 74: IA Tagung 2005: Card Sorting

Card Sorting Variants: Card-Based Classification Evaluation

Card Sorting for Information Architecture: Usage Areas, Methods and Samples

IATagung Frankfurt :: 28./29.05.2005 :: Steffen Schilb

Further Questions?Contact me!

[email protected]