Information Architecture Steffen Schilb (Steffen@cardsort.net) Card Sorting for Information Architecture: Usage Areas, Methods and Samples Card Sorting for Information Architecture Usage Areas, Methods and Samples Steffen Schilb (Steffen@cardsort.net) IATagung Frankfurt :: 28./29.05.2005 :: Steffen Schilb
Card Sorting: The Standard Method Cluster Analysis Card Sorting for Information Architecture: Usage Areas, Methods and Samples Outline Introduction Card Sorting: The Standard Method Cluster Analysis Computer-Based Card Sorting Card Sorting Variants Conclusion References Questions and Discussion IATagung Frankfurt :: 28./29.05.2005 :: Steffen Schilb
1 Introduction Introduction Card Sorting for Information Architecture: Usage Areas, Methods and Samples Introduction 1 Introduction Was ist Card Sorting? Kurzvorstellung mit Animation Wo wird es eingesetzt? In welcher Phase? Open, Closed Card Sorting Benefit: Labels, mentales Modell, Inhaltsstruktur, Hierarchie Nicht teuer, einfach IATagung Frankfurt :: 28./29.05.2005 :: Steffen Schilb
Introduction: Why do People browse the Internet? Card Sorting for Information Architecture: Usage Areas, Methods and Samples Introduction: Why do People browse the Internet? IATagung Frankfurt :: 28./29.05.2005 :: Steffen Schilb
Typical User Behaviour (Wodtke, 2003) Card Sorting for Information Architecture: Usage Areas, Methods and Samples Introduction: Why do People browse the Internet? Typical User Behaviour (Wodtke, 2003) Search for specific Information Complete a Task Browsing around Problem Information cannot be found IATagung Frankfurt :: 28./29.05.2005 :: Steffen Schilb
Hierarchy, Navigation Scheme Card Sorting for Information Architecture: Usage Areas, Methods and Samples Introduction:Why does this happen? Hierarchy, Navigation Scheme No intuitive Navigation Scheme, Hierarchy People expect Content somewhere else IATagung Frankfurt :: 28./29.05.2005 :: Steffen Schilb
Misunderstood Wording Card Sorting for Information Architecture: Usage Areas, Methods and Samples Introduction:Why does this happen? Misunderstood Wording Inconsistent Terms English Vs. German Ambiguous Terms IATagung Frankfurt :: 28./29.05.2005 :: Steffen Schilb
How can this be improved? Card Sorting for Information Architecture: Usage Areas, Methods and Samples Introduction How can this be improved? IATagung Frankfurt :: 28./29.05.2005 :: Steffen Schilb
Card Sorting for Information Architecture: Usage Areas, Methods and Samples Introduction: How can this be improved? 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 IATagung Frankfurt :: 28./29.05.2005 :: Steffen Schilb
Benfits of Card Sorting Card Sorting for Information Architecture: Usage Areas, Methods and Samples Introduction Benfits of Card Sorting Simple, Cheap, Quick Established Involves Users Flexible Provides good Results IATagung Frankfurt :: 28./29.05.2005 :: Steffen Schilb
Usage Areas Designing a new Site Designing a new Area of a Site Card Sorting for Information Architecture: Usage Areas, Methods and Samples Introduction Usage Areas Designing a new Site Designing a new Area of a Site Redesigning a Site Early Stages of Prototyping Large Websites IATagung Frankfurt :: 28./29.05.2005 :: Steffen Schilb
2 Card Sorting: The Standard Method Card Sorting: The Standard Method Card Sorting for Information Architecture: Usage Areas, Methods and Samples Card Sorting: The Standard Method 2 Card Sorting: The Standard Method Preparation Conducting the exercise Analysis manual (Data-eyeballing. Simple Taxonomy) IATagung Frankfurt :: 28./29.05.2005 :: Steffen Schilb
Preparation Card Sorting: The Standard Method Card Sorting for Information Architecture: Usage Areas, Methods and Samples Card Sorting: The Standard Method Preparation IATagung Frankfurt :: 28./29.05.2005 :: Steffen Schilb
Preparation Write down the Topics Write each Content on a Card Card Sorting for Information Architecture: Usage Areas, Methods and Samples Card Sorting: The Standard Method 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 IATagung Frankfurt :: 28./29.05.2005 :: Steffen Schilb
Politics Album Charts Same Level of Detail Card Sorting: Preparation Card Sorting for Information Architecture: Usage Areas, Methods and Samples Card Sorting: Preparation Same Level of Detail Politics Album Charts IATagung Frankfurt :: 28./29.05.2005 :: Steffen Schilb
Tennis Icehockey Cover one distinguished Content Card Sorting for Information Architecture: Usage Areas, Methods and Samples Card Sorting: Preparation Cover one distinguished Content Tennis Icehockey IATagung Frankfurt :: 28./29.05.2005 :: Steffen Schilb
Inspiration Opening Hours Describe the Content in a unambiguous Way Card Sorting for Information Architecture: Usage Areas, Methods and Samples Card Sorting: Preparation Describe the Content in a unambiguous Way Inspiration Opening Hours IATagung Frankfurt :: 28./29.05.2005 :: Steffen Schilb
Before the Exercise starts... Card Sorting for Information Architecture: Usage Areas, Methods and Samples Card Sorting: Preparation Before the Exercise starts... Define Test Conditions (Single, Group,...) Select Participants Invite Participants IATagung Frankfurt :: 28./29.05.2005 :: Steffen Schilb
Conducting the Exercise Card Sorting: Conducting the Exercise Card Sorting for Information Architecture: Usage Areas, Methods and Samples Card Sorting: Conducting the Exercise Conducting the Exercise IATagung Frankfurt :: 28./29.05.2005 :: Steffen Schilb
Procedure Welcome Participants Introduce Card Sorting Method Card Sorting for Information Architecture: Usage Areas, Methods and Samples Card Sorting: Conducting the Exercise Procedure Welcome Participants Introduce Card Sorting Method Give Instructions Sorting out Cards Sorting into multiple Categories IATagung Frankfurt :: 28./29.05.2005 :: Steffen Schilb
Step 1: Sorting the Cards Card Sorting for Information Architecture: Usage Areas, Methods and Samples Card Sorting: Conducting the Exercise Step 1: Sorting the Cards IATagung Frankfurt :: 28./29.05.2005 :: Steffen Schilb
Step 2: Finalizing the Sorting Card Sorting for Information Architecture: Usage Areas, Methods and Samples Card Sorting: Conducting the Exercise Step 2: Finalizing the Sorting IATagung Frankfurt :: 28./29.05.2005 :: Steffen Schilb
Step 3: Labeling the Clusters Card Sorting for Information Architecture: Usage Areas, Methods and Samples Card Sorting: Conducting the Exercise Step 3: Labeling the Clusters IATagung Frankfurt :: 28./29.05.2005 :: Steffen Schilb
Variant: Closed Card Sorting Card Sorting for Information Architecture: Usage Areas, Methods and Samples Card Sorting: Closed Card Sorting Variant: Closed Card Sorting Categories are predefined Top-down Approach Redesign/Relaunch of Websites IATagung Frankfurt :: 28./29.05.2005 :: Steffen Schilb
(Manual) Analysis Card Sorting: Analysis Card Sorting for Information Architecture: Usage Areas, Methods and Samples Card Sorting: Analysis (Manual) Analysis Data-eyeballing Spreadsheet Subjectivity,.... Disadvantages: time-consuming, IATagung Frankfurt :: 28./29.05.2005 :: Steffen Schilb
Analysis Methods Documention „Data-Eyeballing“ Spreadsheet Analysis Card Sorting for Information Architecture: Usage Areas, Methods and Samples Card Sorting: Analysis Analysis Methods Documention „Data-Eyeballing“ Spreadsheet Analysis (Clusteranalysis) IATagung Frankfurt :: 28./29.05.2005 :: Steffen Schilb
Data-Eyeballing Look for dominant Organization Schemes (Patterns) Card Sorting for Information Architecture: Usage Areas, Methods and Samples Card Sorting: Analysis 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 IATagung Frankfurt :: 28./29.05.2005 :: Steffen Schilb
Result: Simple Taxonomy Card Sorting for Information Architecture: Usage Areas, Methods and Samples Card Sorting: Data-Eyeballing Result: Simple Taxonomy Sport Politik Wirtschaft Fussball 1. Bundesliga 2. Bundesliga ... Tennis Weltrangliste ATP-Turniere Basketball NBA Aktuelles Aus aller Welt Deutschland ... Innenpolitik News Außenpolitik Europa Deutschland News ... Weltweit Börse DAX Dow-Jones IATagung Frankfurt :: 28./29.05.2005 :: Steffen Schilb
Attributes of Data-Eyeballing Card Sorting for Information Architecture: Usage Areas, Methods and Samples Card Sorting: Data-Eyeballing Attributes of Data-Eyeballing Efficient Easy and fast But: Highly subjective IATagung Frankfurt :: 28./29.05.2005 :: Steffen Schilb
Spreadsheet Analysis Card Sorting: Analysis Card Sorting for Information Architecture: Usage Areas, Methods and Samples Card Sorting: Analysis Spreadsheet Analysis IATagung Frankfurt :: 28./29.05.2005 :: Steffen Schilb
Spreadsheet Analysis More information can be found at Card Sorting for Information Architecture: Usage Areas, Methods and Samples Card Sorting: Analysis Spreadsheet Analysis More information can be found at Boxes and Arrows: Analyzing Card Sort Results with a Spreadsheet Template IATagung Frankfurt :: 28./29.05.2005 :: Steffen Schilb
3 Cluster Analysis Cluster Analysis Card Sorting for Information Architecture: Usage Areas, Methods and Samples Cluster Analysis 3 Cluster Analysis What is Cluster Analysis? Distance Matrix 3 Folien Example Single-Linkage Verfahren 5 Folien Complete Linkage Verfahren 2 Folien Average-Linkage Verfahren 2 Folien IATagung Frankfurt :: 28./29.05.2005 :: Steffen Schilb
Cluster Analysis Statistical Analysis Method for identifying Groups Card Sorting for Information Architecture: Usage Areas, Methods and Samples Cluster Analysis 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 IATagung Frankfurt :: 28./29.05.2005 :: Steffen Schilb
Distance Matrix Cluster Analysis Card Sorting for Information Architecture: Usage Areas, Methods and Samples Cluster Analysis Distance Matrix IATagung Frankfurt :: 28./29.05.2005 :: Steffen Schilb
Example Participant 1 Participant 2 Participant 3 Card Sorting for Information Architecture: Usage Areas, Methods and Samples Cluster Analysis: Distance Matrix Example Participant 1 Participant 2 Participant 3 Projekte AG‘s Aktuelle Projekte Studentisches Fachbereiche Insitute Campus Lageplan Anreise Aktivitäten AG‘s Aktuelle Projekte Studium Fachbereiche Institute Allgemeine Infos Lageplan Anreise Aktivitäten AG‘s Studium Fachbereiche Aktuelle Projekte Institute Informationen Lageplan Anreise IATagung Frankfurt :: 28./29.05.2005 :: Steffen Schilb
Distance Matrix P1 Cluster Analysis: Distance Matrix 1.00 0.00 Card Sorting for Information Architecture: Usage Areas, Methods and Samples Cluster Analysis: Distance Matrix Distance Matrix P1 AG‘s Aktuelle Projekte Fach-bereiche Institute Lageplan Anreise 1.00 0.00 Insitute IATagung Frankfurt :: 28./29.05.2005 :: Steffen Schilb
Distance Matrix P1 Cluster Analysis: Distance Matrix 1.00 0.00 Card Sorting for Information Architecture: Usage Areas, Methods and Samples Cluster Analysis: Distance Matrix Distance Matrix P1 AG‘s Aktuelle Projekte Fach-bereiche Institute Lageplan Anreise 1.00 0.00 Insitute IATagung Frankfurt :: 28./29.05.2005 :: Steffen Schilb
Distance Matrix P1 + P2 Cluster Analysis: Distance Matrix 1.00 0.00 Card Sorting for Information Architecture: Usage Areas, Methods and Samples Cluster Analysis: Distance Matrix Distance Matrix P1 + P2 AG‘s Aktuelle Projekte Fach-bereiche Institute Lageplan Anreise 1.00 0.00 Insitute IATagung Frankfurt :: 28./29.05.2005 :: Steffen Schilb
Example Participant 1 Participant 2 Participant 3 Card Sorting for Information Architecture: Usage Areas, Methods and Samples Cluster Analysis: Distance Matrix Example Participant 1 Participant 2 Participant 3 Projekte AG‘s Aktuelle Projekte Studentisches Fachbereiche Insitute Campus Lageplan Anreise Aktivitäten AG‘s Aktuelle Projekte Studium Fachbereiche Institute Allgemeine Infos Lageplan Anreise Aktivitäten AG‘s Studium Fachbereiche Aktuelle Projekte Institute Informationen Lageplan Anreise IATagung Frankfurt :: 28./29.05.2005 :: Steffen Schilb
Distance Matrix (P1+P2)+P3 Card Sorting for Information Architecture: Usage Areas, Methods and Samples Cluster Analysis: Distance Matrix Distance Matrix (P1+P2)+P3 AG‘s Aktuelle Projekte Fach-bereiche Institute Lageplan Anreise 1.00 0.33 0.67 0.00 Insitute IATagung Frankfurt :: 28./29.05.2005 :: Steffen Schilb
∑ How to calculate Kt(At/Bt) KF(AF/BF) = T Card Sorting for Information Architecture: Usage Areas, Methods and Samples Cluster Analysis: Distance Matrix How to calculate T ∑ Kt(At/Bt) KF(AF/BF) = t=1 T K: Relative Coordinate A: Relative X-Coordinate B: Relative Y-Coordinate F: Final Matrix T: Number of Participants t: Participant IATagung Frankfurt :: 28./29.05.2005 :: Steffen Schilb
From Distance Matrix to Tree Diagrams Card Sorting for Information Architecture: Usage Areas, Methods and Samples Cluster Analysis: Distance Matrix From Distance Matrix to Tree Diagrams Single Linkage Algorithm Complete Linkage Algorithm Average Linkage Algorithm IATagung Frankfurt :: 28./29.05.2005 :: Steffen Schilb
Distance Matrix Cluster Analysis: Single Linkage Algorithm 1.00 0.69 Card Sorting for Information Architecture: Usage Areas, Methods and Samples Cluster Analysis: Single Linkage Algorithm Distance Matrix AG‘s ASTA Aktuelle Projekte Alumni 1.00 0.69 0.42 0.83 0.92 0.81 0.86 IATagung Frankfurt :: 28./29.05.2005 :: Steffen Schilb
Card Sorting for Information Architecture: Usage Areas, Methods and Samples Cluster Analysis: Single Linkage Algorithm 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 IATagung Frankfurt :: 28./29.05.2005 :: Steffen Schilb
New Distance Matrix Cluster Analysis: Single Linkage Algorithm 1.00 Card Sorting for Information Architecture: Usage Areas, Methods and Samples Cluster Analysis: Single Linkage Algorithm New Distance Matrix AG‘s+ Aktuelle Projekte ASTA Alumni 1.00 0.69 0.83 0.81 IATagung Frankfurt :: 28./29.05.2005 :: Steffen Schilb
Steps AG‘s+Aktuelle Projekte 0.42 (AG‘s+Aktuelle Projekte)+ASTA 0.69 Card Sorting for Information Architecture: Usage Areas, Methods and Samples Cluster Analysis: Single Linkage Algorithm Steps AG‘s+Aktuelle Projekte 0.42 (AG‘s+Aktuelle Projekte)+ASTA 0.69 ((AG‘s+Aktuelle Projekte)+ASTA)+Alumni 0.81 IATagung Frankfurt :: 28./29.05.2005 :: Steffen Schilb
Final Dendogram Cluster Analysis: Single Linkage Algorithm AG‘s Card Sorting for Information Architecture: Usage Areas, Methods and Samples Cluster Analysis: Single Linkage Algorithm Final Dendogram AG‘s Aktuelle Projekte ASTA Alumni 0.42 0.69 0.81 0.00 0.50 1.00 IATagung Frankfurt :: 28./29.05.2005 :: Steffen Schilb
Attributes min{0.69;0.92}=0.69 Nearest-Neighboor-Method Card Sorting for Information Architecture: Usage Areas, Methods and Samples Cluster Analysis: Single Linkage Algorithm Attributes min{0.69;0.92}=0.69 Nearest-Neighboor-Method Minimum-Distance Rule Chaining Phenomenon Isolates Outliners (Most important Attribute) IATagung Frankfurt :: 28./29.05.2005 :: Steffen Schilb
Attributes max{0.69;0.92}=0.92 Furthest-Neighboor-Method Card Sorting for Information Architecture: Usage Areas, Methods and Samples Cluster Analysis: Complete Linkage Algorithm 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 IATagung Frankfurt :: 28./29.05.2005 :: Steffen Schilb
Attributes 0,5x(0.69) + 0,5x(0.92) = 0.80 Takes mean Distance Card Sorting for Information Architecture: Usage Areas, Methods and Samples Cluster Analysis: Average Linkage Algorithm Attributes 0,5x(0.69) + 0,5x(0.92) = 0.80 Takes mean Distance No Chaining Phenonemon IATagung Frankfurt :: 28./29.05.2005 :: Steffen Schilb
4 Computer-Based Card Sorting Computer-Based Card Sorting Card Sorting for Information Architecture: Usage Areas, Methods and Samples Computer-Based Card Sorting 4 Computer-Based Card Sorting IATagung Frankfurt :: 28./29.05.2005 :: Steffen Schilb
Some Tools EZSort CardSort Computer-Based Card Sorting Card Sorting for Information Architecture: Usage Areas, Methods and Samples Computer-Based Card Sorting Some Tools EZSort CardSort Advantages and Disadvantages of Computer-Based Card Sorting: Easier in Analysis Perhaps difficult to use Results of Usabiltiy Test of Usort Vorstellung der einzelnen Tools IATagung Frankfurt :: 28./29.05.2005 :: Steffen Schilb
EZSort Computer-Based Card Sorting: EZSort Card Sorting for Information Architecture: Usage Areas, Methods and Samples Computer-Based Card Sorting: EZSort EZSort IATagung Frankfurt :: 28./29.05.2005 :: Steffen Schilb
Features Most common Card Sorting Tool Developed by IBM in 1998 Card Sorting for Information Architecture: Usage Areas, Methods and Samples Computer-Based Card Sorting: EZSort Features Most common Card Sorting Tool Developed by IBM in 1998 USort for Sorting the Cards (Open Card Sort) EZCalc for Clusteranalysis Windows-only IATagung Frankfurt :: 28./29.05.2005 :: Steffen Schilb
CardSort Computer-Based Card Sorting: CardSort Card Sorting for Information Architecture: Usage Areas, Methods and Samples Computer-Based Card Sorting: CardSort CardSort IATagung Frankfurt :: 28./29.05.2005 :: Steffen Schilb
Features Developed in 2003 www.cardsort.net Card Sorting for Information Architecture: Usage Areas, Methods and Samples Computer-Based Card Sorting: CardSort Features Developed in 2003 www.cardsort.net Allows only Card Sorting (open and closed) Analysis with EZCalc Cross-plattform IATagung Frankfurt :: 28./29.05.2005 :: Steffen Schilb
Other Tools CardZort http://condor.depaul.edu/~jtoro/cardzort/ Card Sorting for Information Architecture: Usage Areas, Methods and Samples Computer-Based Card Sorting Other Tools CardZort http://condor.depaul.edu/~jtoro/cardzort/ CardSword http://cardsword.sourceforge.net/ WebSort http://www.websort.net/ Advantages and Disadvantages of Computer-Based Card Sorting: Easier in Analysis Perhaps difficult to use Results of Usabiltiy Test of Usort Vorstellung der einzelnen Tools IATagung Frankfurt :: 28./29.05.2005 :: Steffen Schilb
5 Card Sorting Variants Card Sorting Variants Card Sorting for Information Architecture: Usage Areas, Methods and Samples Card Sorting Variants 5 Card Sorting Variants IATagung Frankfurt :: 28./29.05.2005 :: Steffen Schilb
Card Sorting Variants Card Sorting with Subgroups Card Sorting for Information Architecture: Usage Areas, Methods and Samples Card Sorting Variants Card Sorting Variants Card Sorting with Subgroups Labeling the Contents Rating the Contents Advantages and Disadvantages of Computer-Based Card Sorting: Easier in Analysis Perhaps difficult to use Results of Usabiltiy Test of Usort Vorstellung der einzelnen Tools IATagung Frankfurt :: 28./29.05.2005 :: Steffen Schilb
Card Sorting with Subgroups Card Sorting for Information Architecture: Usage Areas, Methods and Samples Card Sorting Variants: Card Sorting with Subgroups Card Sorting with Subgroups IATagung Frankfurt :: 28./29.05.2005 :: Steffen Schilb
Attributes Adding an additional Sorting Step Card Sorting for Information Architecture: Usage Areas, Methods and Samples Card Sorting Variants: Card Sorting with Subgroups Attributes Adding an additional Sorting Step First: Forming Clusters (Subgroups) Second: Forming Major Clusters Third: Labeling the (Major) Clusters Advantages and Disadvantages of Computer-Based Card Sorting: Easier in Analysis Perhaps difficult to use Results of Usabiltiy Test of Usort Vorstellung der einzelnen Tools IATagung Frankfurt :: 28./29.05.2005 :: Steffen Schilb
Labeling the Contents Card Sorting Variants: Labeling the Contents Card Sorting for Information Architecture: Usage Areas, Methods and Samples Card Sorting Variants: Labeling the Contents Labeling the Contents IATagung Frankfurt :: 28./29.05.2005 :: Steffen Schilb
Labeling the Contents Cards represent Content Descriptions Card Sorting for Information Architecture: Usage Areas, Methods and Samples Card Sorting Variants: Labeling the Contents Labeling the Contents Cards represent Content Descriptions Users label the Contents On this page, students register online for their courses. Advantages and Disadvantages of Computer-Based Card Sorting: Easier in Analysis Perhaps difficult to use Results of Usabiltiy Test of Usort Vorstellung der einzelnen Tools IATagung Frankfurt :: 28./29.05.2005 :: Steffen Schilb
Rating the Contents Gerry McGovern (2002) Card Sorting for Information Architecture: Usage Areas, Methods and Samples Card Sorting Variants: Rating the Contents Rating the Contents Gerry McGovern (2002) IATagung Frankfurt :: 28./29.05.2005 :: Steffen Schilb
Step 1 Step 2 Card Sorting Variants: Rating the Contents Card Sorting for Information Architecture: Usage Areas, Methods and Samples Card Sorting Variants: Rating the Contents Step 1 Step 2 Begriff 1 Begriff 20 Begriff 23 Begriff 2 Begriff 1 Begriff 3 Begriff 4 Begriff 5 Begriff 6 Begriff 8 Begriff 14 Begriff 6 Begriff 7 Begriff 9 Begriff 14 Begriff 10 Begriff 16 Begriff 11 Begriff 19 Begriff 13 Begriff 20 Begriff 15 Begriff 7 Begriff 24 Begriff 23 Begriff 17 Begriff 24 Begriff 1 Begriff 18 Begriff 21 Begriff 22 Begriff 4 Begriff 16 Begriff 25 Begriff 26 IATagung Frankfurt :: 28./29.05.2005 :: Steffen Schilb
6 Conclusion Conclusion Card Sorting for Information Architecture: Usage Areas, Methods and Samples Conclusion 6 Conclusion IATagung Frankfurt :: 28./29.05.2005 :: Steffen Schilb
Card Sorting for Information Architecture: Usage Areas, Methods and Samples Conclusion 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 IATagung Frankfurt :: 28./29.05.2005 :: Steffen Schilb
Summary Can be done paper-based or computer-based Card Sorting for Information Architecture: Usage Areas, Methods and Samples Conclusion 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 IATagung Frankfurt :: 28./29.05.2005 :: Steffen Schilb
Keep in Mind Only for large Websites Users‘ Tasks are not integrated Card Sorting for Information Architecture: Usage Areas, Methods and Samples Conclusion Keep in Mind Only for large Websites Users‘ Tasks are not integrated May capture “Surface” Characteristics only IATagung Frankfurt :: 28./29.05.2005 :: Steffen Schilb
7 References References Card Sorting for Information Architecture: Usage Areas, Methods and Samples References 7 References IATagung Frankfurt :: 28./29.05.2005 :: Steffen Schilb
Links, Books, Articles IAWiki Card Sorting Card Sorting for Information Architecture: Usage Areas, Methods and Samples References Links, Books, Articles IAWiki Card Sorting http://www.iawiki.net/CardSorting Boxes and Arrows http://www.boxesandarrows.com James Robertson http://www.steptwo.au Donna Maurer http://www.maadmob.net/donna/ IATagung Frankfurt :: 28./29.05.2005 :: Steffen Schilb
Thank you! Card Sorting Variants: Card-Based Classification Evaluation Card Sorting for Information Architecture: Usage Areas, Methods and Samples Card Sorting Variants: Card-Based Classification Evaluation Thank you! IATagung Frankfurt :: 28./29.05.2005 :: Steffen Schilb
8 Questions and Discussion Computer-Based Card Sorting Card Sorting for Information Architecture: Usage Areas, Methods and Samples Computer-Based Card Sorting 8 Questions and Discussion IATagung Frankfurt :: 28./29.05.2005 :: Steffen Schilb
Further Questions? Contact me! Steffen@cardsort.net Card Sorting for Information Architecture: Usage Areas, Methods and Samples Card Sorting Variants: Card-Based Classification Evaluation Further Questions? Contact me! Steffen@cardsort.net IATagung Frankfurt :: 28./29.05.2005 :: Steffen Schilb