View in EDS HTML Full Text PDF Full Text

Information Architecture: Using Best Merge Method, Category Validity, and Multidimensional Scaling for Open Card Sort Data Analysis.

Saved in:
Bibliographic Details
Title: Information Architecture: Using Best Merge Method, Category Validity, and Multidimensional Scaling for Open Card Sort Data Analysis.
Authors: Paea, Sione (AUTHOR), Katsanos, Christos (AUTHOR), Bulivou, Gabiriele (AUTHOR)
Source: International Journal of Human-Computer Interaction. Jan2024, Vol. 40 Issue 2, p203-223. 21p.
Subjects: Multidimensional scaling, Information architecture, Multidimensional databases, K-means clustering, Data analysis, Hierarchical clustering (Cluster analysis), Quantitative research
Abstract: Open card sorting is a widely used method in HCI for the design of user-centered Information Architectures (IAs). This article proposes a new algorithm that combines the best merge method (BMM), category validity technique (CVT), and multidimensional scaling (MDS) to explore, analyze and visualize open card sort data. A study involving 20 participants and 41 cards explored the IA redesign of a university's website. The collected data were analyzed using two popular methods employed in the quantitative analysis of open card sort data (i.e., hierarchical clustering, K-means) and the proposed algorithm. It was found that the latter provides increased IA insights compared to the existing methods. Specifically, the proposed algorithm can expose hidden patterns and relationships amongst cards and identify complexities. We also found that the proposed algorithm produces better initial clusters, which have a direct effect on the final clustering quality. [ABSTRACT FROM AUTHOR]
Copyright of International Journal of Human-Computer Interaction is the property of Taylor & Francis Ltd and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database: Psychology and Behavioral Sciences Collection
Full text is not displayed to guests.
FullText Links:
  – Type: pdflink
Text:
  Availability: 1
Header DbId: pbh
DbLabel: Psychology and Behavioral Sciences Collection
An: 174796085
AccessLevel: 6
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 0
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: Information Architecture: Using Best Merge Method, Category Validity, and Multidimensional Scaling for Open Card Sort Data Analysis.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Paea%2C+Sione%22">Paea, Sione</searchLink> (AUTHOR)<br /><searchLink fieldCode="AR" term="%22Katsanos%2C+Christos%22">Katsanos, Christos</searchLink> (AUTHOR)<br /><searchLink fieldCode="AR" term="%22Bulivou%2C+Gabiriele%22">Bulivou, Gabiriele</searchLink> (AUTHOR)
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <searchLink fieldCode="JN" term="%22International+Journal+of+Human-Computer+Interaction%22">International Journal of Human-Computer Interaction</searchLink>. Jan2024, Vol. 40 Issue 2, p203-223. 21p.
– Name: Subject
  Label: Subjects
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22Multidimensional+scaling%22">Multidimensional scaling</searchLink><br /><searchLink fieldCode="DE" term="%22Information+architecture%22">Information architecture</searchLink><br /><searchLink fieldCode="DE" term="%22Multidimensional+databases%22">Multidimensional databases</searchLink><br /><searchLink fieldCode="DE" term="%22K-means+clustering%22">K-means clustering</searchLink><br /><searchLink fieldCode="DE" term="%22Data+analysis%22">Data analysis</searchLink><br /><searchLink fieldCode="DE" term="%22Hierarchical+clustering+%28Cluster+analysis%29%22">Hierarchical clustering (Cluster analysis)</searchLink><br /><searchLink fieldCode="DE" term="%22Quantitative+research%22">Quantitative research</searchLink>
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: Open card sorting is a widely used method in HCI for the design of user-centered Information Architectures (IAs). This article proposes a new algorithm that combines the best merge method (BMM), category validity technique (CVT), and multidimensional scaling (MDS) to explore, analyze and visualize open card sort data. A study involving 20 participants and 41 cards explored the IA redesign of a university's website. The collected data were analyzed using two popular methods employed in the quantitative analysis of open card sort data (i.e., hierarchical clustering, K-means) and the proposed algorithm. It was found that the latter provides increased IA insights compared to the existing methods. Specifically, the proposed algorithm can expose hidden patterns and relationships amongst cards and identify complexities. We also found that the proposed algorithm produces better initial clusters, which have a direct effect on the final clustering quality. [ABSTRACT FROM AUTHOR]
– Name: AbstractSuppliedCopyright
  Label:
  Group: Ab
  Data: <i>Copyright of International Journal of Human-Computer Interaction is the property of Taylor & Francis Ltd and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract.</i> (Copyright applies to all Abstracts.)
PLink https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=pbh&AN=174796085
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.1080/10447318.2022.2112077
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 21
        StartPage: 203
    Subjects:
      – SubjectFull: Multidimensional scaling
        Type: general
      – SubjectFull: Information architecture
        Type: general
      – SubjectFull: Multidimensional databases
        Type: general
      – SubjectFull: K-means clustering
        Type: general
      – SubjectFull: Data analysis
        Type: general
      – SubjectFull: Hierarchical clustering (Cluster analysis)
        Type: general
      – SubjectFull: Quantitative research
        Type: general
    Titles:
      – TitleFull: Information Architecture: Using Best Merge Method, Category Validity, and Multidimensional Scaling for Open Card Sort Data Analysis.
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Paea, Sione
      – PersonEntity:
          Name:
            NameFull: Katsanos, Christos
      – PersonEntity:
          Name:
            NameFull: Bulivou, Gabiriele
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 15
              M: 01
              Text: Jan2024
              Type: published
              Y: 2024
          Identifiers:
            – Type: issn-print
              Value: 10447318
          Numbering:
            – Type: volume
              Value: 40
            – Type: issue
              Value: 2
          Titles:
            – TitleFull: International Journal of Human-Computer Interaction
              Type: main
ResultId 1