A supplementary note to questionnaire sorting and fuzzy sorting

被引：1
|
作者：
Harloff, Joachim [1 ]
机构：
[1] Soft Use, D-81477 Munich, Germany
来源：
QUALITY & QUANTITY | 2008年 / 42卷 / 01期
关键词：
sorting; cognitive structure; knowledge elicitation; semantic structure; cover set; cover set cluster analysis; fuzzy sorting; information architecture; web-site structure;
D O I：
10.1007/s11135-007-9163-6
中图分类号：
C [社会科学总论];
学科分类号：
03 ; 0303 ;
摘要：
This note supplements the article "An exploration of Questionnaire Sorting and Fuzzy Sorting" (this volume). It relates to recent methodological improvements by Capra (2005), who introduced a factor analysis solution to cover set cluster analysis.
引用
收藏
页码：133 / 134
页数：2
相关论文
共 50 条
  • [31] Sorting in Space and Words
    Samet, Hanan
    2018 IEEE 34TH INTERNATIONAL CONFERENCE ON DATA ENGINEERING (ICDE), 2018, : 1719 - 1722
  • [32] No Sorting? Better Searching!
    Franceschini, Gianni
    Grossi, Roberto
    ACM TRANSACTIONS ON ALGORITHMS, 2008, 4 (01)
  • [33] Signaling and optimal sorting
    Timothy Perri
    Journal of Economics, 2019, 126 : 135 - 151
  • [34] Sorting in Column Stores
    Daniel Bößwetter
    Datenbank-Spektrum , 2011, 11 (2) : 91 - 100
  • [35] Event shape sorting
    Renata Kopečná
    Boris Tomášik
    The European Physical Journal A, 2016, 52
  • [36] Spatial Sorting and Inequality
    Diamond, Rebecca
    Gaubert, Cecile
    ANNUAL REVIEW OF ECONOMICS, 2022, 14 : 795 - 819
  • [37] Sorting in the Labor Market
    Eeckhout, Jan
    ANNUAL REVIEW OF ECONOMICS, VOL 10, 2018, 10 : 1 - 29
  • [38] Signaling and optimal sorting
    Perri, Timothy
    JOURNAL OF ECONOMICS, 2019, 126 (02) : 135 - 151
  • [39] Incremental Sorting Algorithm
    Iqbal, Sardar Zafar
    Gull, Hina
    Ahmad, Jamil
    SECOND INTERNATIONAL CONFERENCE ON COMPUTER AND ELECTRICAL ENGINEERING, VOL 2, PROCEEDINGS, 2009, : 378 - +
  • [40] Sorting Algorithms in MOQA
    Townley, Jacinta
    Manning, Joseph
    Schellekens, Michel
    ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE, 2009, 225 : 391 - 404
12345