Discernibility in the Analysis of Binary Card Sort Data ... Included in the following conference series: International Workshop on Rough Sets, Fuzzy Sets, Data ...
Abstract. In an open card sorting study of 356 facial photographs, each of 25 participants created an unconstrained number of piles. We.
Nov 21, 2024 · Discernibility in the Analysis of Binary Card Sort Data. October 2013; Lecture Notes in Computer Science 8170:380-387. DOI:10.1007/978-3-642 ...
LNAI 8170 - Discernibility in the Analysis of Binary Card Sort Data
link.springer.com › content › pdf
Discernibility in the Analysis of Binary Card Sort Data. 381 analysis has been described elsewhere [4]. From that preliminary analysis, it was hypothesized ...
Discernibility in the Analysis of Binary Card Sort Data (2013) · Conference · Authors · Abstract · Links · BibTeX.
People also ask
How to analyze card sorting data?
What is the analysis of binary data?
Daryl H. Hepting , Emad H. Almestadi: Discernibility in the Analysis of Binary Card Sort Data. RSFDGrC 2013: 380-387.
Research paper thumbnail of Discernibility in the Analysis of Binary Card Sort Data. Discernibility in the Analysis of Binary Card Sort Data. Lecture Notes in ...
Discernibility in the Analysis of Binary Card Sort Data · Hepting, D.H.; Almestadi, E.H.. Lecture Notes in Computer Science (including subseries Lecture Notes ...
Recommendations. Discernibility in the Analysis of Binary Card Sort Data. Proceedings of the 14th International Conference on Rough Sets, Fuzzy Sets, Data ...
"Discernibility in the Analysis of Binary Card Sort Data." In Lecture Notes in Computer Science, 380–87. Berlin, Heidelberg: Springer Berlin Heidelberg ...