An Exploration of Questionnaire Sorting and Fuzzy Sorting

被引:0
作者
Joachim Harloff
机构
[1] Soft Use,
来源
Quality & Quantity | 2008年 / 42卷
关键词
sorting; cognitive structure; knowledge elicitation; semantic structure; network; fuzzy set; fuzzy cluster analysis; questionnaire sorting; fuzzy sorting; information architecture; web-site structure;
D O I
暂无
中图分类号
学科分类号
摘要
Questionnaire sorting is a concept for sorting mentioned by Coxon [(1999) SORTING DATA. Collection and Analysis. Thousand Oaks: Sage] and Harloff and Coxon [(2005), How to Sort. A Short Guide on Sorting Investigations. www.methodofsorting.com]. The use of questionnaire sorting is detailed herein. A paper questionnaire variant and a HTML form variant are introduced. Their equivalence among each other and with traditional sorting of paper cards is tested for two sets of items. These sets consist of 20 colors and 25 web-site content items. Results from paper questionnaires and HTML forms do not differ significantly. Contradictory results were obtained on the equivalence of paper card sorting and questionnaire sorting, depending on the item sets. Another variant allowing for placement of items in several clusters simultaneously has been termed fuzzy sorting (Harloff and Coxon, 2005, How to Sort. A Short Guide on Sorting Investigations. www.methodofsorting.com). Its first detailed application is given here for both paper card sorting and questionnaire sorting. The difference between results from fuzzy sorting and partition sorting experiments was tested using paired t-tests. The type I error is below 0.01. In contrast to current practice it is therefore advisable to use instructions and a mathematical model for sorting fitting to the methods of subsequent statistical analysis and to the designed domain. Results from two fuzzy sorting experiments are analyzed by fuzzy cluster analysis and network analysis, respectively. Fuzzy sorting and fuzzy cluster analysis provide much more detailed information than the common partition sorting and hierarchical cluster analysis. Network analysis gives valuable information about facet structure.
引用
收藏
页码:113 / 132
页数:19
相关论文
共 50 条
[21]   Sorting streamed multisets [J].
Gagie, Travis .
INFORMATION PROCESSING LETTERS, 2008, 108 (06) :418-421
[22]   In-Place Sorting [J].
Geffert, Viliam ;
Gajdos, Jozef .
SOFSEM 2011: THEORY AND PRACTICE OF COMPUTER SCIENCE, 2011, 6543 :248-259
[23]   Routing AGVs by sorting [J].
Qiu, L ;
Hsu, WJ .
PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED PROCESSING TECHNIQUES AND APPLICATIONS, VOLS I-V, 2000, :1465-1470
[24]   SORTING AND MERGING ON THE DAP [J].
BHAGAVATHI, D ;
DENNY, WM ;
GROSCH, CE ;
LOOGES, PJ ;
OLARIU, S .
COMPUTER SYSTEMS SCIENCE AND ENGINEERING, 1994, 9 (03) :175-183
[25]   A new sorting algorithm [J].
Sundararajan, Kiran Kumar ;
Chakraborty, Soubhik .
APPLIED MATHEMATICS AND COMPUTATION, 2007, 188 (01) :1037-1041
[26]   Sacrifice and Sorting in Clubs [J].
Carvalho, Jean-Paul .
FORUM FOR SOCIAL ECONOMICS, 2020, 49 (04) :357-369
[27]   The Sounds of Sorting Algorithms [J].
Adams, Joel C. ;
Allen, Bryce D. ;
Fowler, Bryan C. ;
Wissink, Mark C. ;
Wright, Joshua J. .
PROCEEDINGS OF THE 53RD ACM TECHNICAL SYMPOSIUM ON COMPUTER SCIENCE EDUCATION (SIGCSE 2022), VOL 1, 2022, :189-195
[28]   What is a sorting function? [J].
Henglein, Fritz .
JOURNAL OF LOGIC AND ALGEBRAIC PROGRAMMING, 2009, 78 (07) :552-572
[29]   Matching, sorting and wages [J].
Lise, Jeremy ;
Meghir, Costas ;
Robin, Jean-Marc .
REVIEW OF ECONOMIC DYNAMICS, 2016, 19 :63-87
[30]   No Sorting? Better Searching! [J].
Franceschini, Gianni ;
Grossi, Roberto .
ACM TRANSACTIONS ON ALGORITHMS, 2008, 4 (01)