Back to Search
Start Over
A NEW APPROACH TO PROCESS CARD SORTING RESULTS USING VERTICAL FRAGMENTATION METHODS.
- Source :
- Proceedings of the IADIS International Conference on WWW/Internet; Jan2007, p243-246, 4p, 2 Charts
- Publication Year :
- 2007
-
Abstract
- One of the challenges for information system architects and interface designers is organizing the information in order to easily navigate through the application. The actual problem is a gap that exists between users' needs and business experts priorities. The goal of this paper is to describe a new approach to analyze data obtained from Card Sorting experiments considering different sources of information such as business requirements and usability experts' opinions. Particularly, we investigate how to apply Vertical Fragmentation algorithms, developed as an alternative for hierarchical clustering in distributed databases, to the Card Sorting problem and how to interpret the output. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- Database :
- Supplemental Index
- Journal :
- Proceedings of the IADIS International Conference on WWW/Internet
- Publication Type :
- Conference
- Accession number :
- 63798189