Discernibility in the Analysis of Binary Card Sort Data (2013)




Conference

Authors

Abstract

In an open card sorting study of 356 facial photographs, each of 25 participants created an unconstrained number of piles. We consider all 63,190 possible pairs of photos: if both photos are in the same pile for a participant, we consider them as rated similar; otherwise we consider them as rated dissimilar. Each pair of photos is an attribute in an information system where the participants are the objects. We consider whether the attribute values permit accurate classification of the objects according to binary decision classes, without loss of generality. We propose a discernibility coefficient to measure the support of an attribute for classification according to a given decision class pair. We hypothesize that decision class pairs with the support of many attributes are more representative of the data than those with the support of few attributes. We present some computational experiments and discuss opportunities for future work.

Links

BibTeX

@inproceedings{2013-10-HepAlm,
	Author =  “Hepting, Daryl H. and Almestadi, Emad H.”,
	Title =  “Discernibility in the Analysis of Binary Card Sort Data”,
	Url = "http://www2.cs.uregina.ca/~hepting/research/works/2013-10-HepAlm-Discernibility-in-the-Analysis-of-Binary-Card-Sort-Data.html",
	Editor =  “Ciucci, D. and Inuiguchi, M. and Yao, Y. and {'S}l{\k e}zak, D. and Wang, G.”,
	Address =  “Berlin”,
	Booktitle =  “Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing. RSFDGrC 2013”,
	Doi =  “10.1007/978-3-642-41218-9_41”,
	Month =  “October”,
	Pages =  “380–387”,
	Publisher =  “Springer”,
	Series =  “Lecture Notes in Computer Science”,
	Volume =  “8170”,
	Year =  “2013”,
}

Related Works