Using edit distance to analyze card sorts

Expert Systems

Volumn 22, Issue 3, 2005, Pages 129-138

  Deibel, Katherine ^a,c   Anderson, Richard ^a,c   Anderson, Ruth ^b  

^a University of Washington   (United States)

^b University of Virginia   (United States)

^c UNIVERSITY OF WASHINGTON   (United States)

Author keywords

Card sorts; Clustering; Edit distance; Sorting

Indexed keywords

CARD SORTS; CLUSTERING; COMPLEX QUALITATIVE METHODS; EDIT DISTANCES;

COMPUTATION THEORY; DATA REDUCTION; KNOWLEDGE ACQUISITION; STATISTICAL METHODS;

SORTING;

EID: 33745221210     PISSN: 02664720     EISSN: 14680394     Source Type: Journal    
DOI: 10.1111/j.1468-0394.2005.00304.x     Document Type: Article

References (16)

1. ASTRACHAN, O. (2005) Resolved: objects early has failed, in Proceedings of the 36th SIGCSE Technical Symposium on Computer Science Education, St Louis, MO, February.
2. BRUCE, K. (2004) Controversy on how to teach CS1: a discussion on the SIGCSE-members mailing list, ACM SIGCSE Bulletin, 36 (4), 29-34.
3. GAREY, M. and D.S. JOHNSON (1979) Computers and Intractability: A Guide to the Theory of NP-Completeness, San Francisco, CA: W. H. Freeman.
4. GERRARD, S. (1995) The working wardrobe: perceptions of women's clothing at work, Master's thesis, Birkbeck College, London.
5. GERRARD, S. and J. DICKINSON (2005) Women's working wardrobes: a study using card sorts, Expert Systems, this issue.
6. HARTIGAN, J.A. (1975) Clustering Algorithms, New York: Wiley.
7. JAIN, A.K., M.N. MURTY and P.J. FLYNN (1999) Data clustering: a review, ACM Computing Surveys, 31 (3), 264-323.
8. JOINT TASK FORCE ON COMPUTING CURRICULA (2001) Computing curricula 2001, Journal of Educational Resources in Computing, 1 (3).
9. KNUTH, D. (1996) Algorithms in modern mathematics and computer science, in Selected Papers on Computer Science, Cambridge: Cambridge University Press, Ch. 4, pp. 110-111.
10. MARTINE, G. (2000) Quantification of 'look and feel' copyright infringement in Web page design, Master's thesis, University College Northampton, U.K.
11. PAPADIMITRIOU, C.H. and K. STEGLITZ (1982) Combinatorial Optimisation: Algorithms and Complexity, Englewood Cliffs, NJ: Prentice-Hall.
12. PETRE, M., S. FINCHER, J. TENENBERG, R. ANDERSON, R. ANDERSON, D. BOUVIER, S. FITZGERALD, A. GUTSCHOW, S. HALLER, M. JADUD, G. LEWANDOWSKI, R. LISTER, R. MCCAULEY, J. MCTAGGART, B. MORRISON, L. MURPHY, C. PRASAD, B. RICHARDS, K. SANDERS, T. SCOTT, D. SHINNERS-KENNEDY, L. THOMAS, S. WESTBROOK and C. ZANDER (2003) 'My criterion is: is it a Boolean?': a cardsort elicitation of students' knowledge of programming constructs, Technical Report 6-03, University of Kent.
13. POSTNER, L. and J. TURNS (2002) Using facet-based assessment to understand introductory programming students' knowledge, in Proceedings of FIE 2002, Boston, MA, November.
14. RUDIN, W. (1976) Principles of Mathematical Analysis, 3rd edn, New York: McGraw-Hill.
15. RUGG, G. and P. MCGEORGE (1997) The sorting techniques: a tutorial paper on card sorts, picture sorts and item sorts, Expert Systems, 14 (2), 80-93; also this issue.
16. SANDERS, K., S. FINCHER, D. BOUVIER, G. LEWANDOWSKI, B. MORRISON, L. MURPHY, M. PETRE, B. RICHARDS, J. TENENBERG, L. THOMAS, R. ANDERSON, R. ANDERSON, S. FITZGERALD, A. GUTSCHOW, S. HALLER, R. LISTER, R. MCCAULEY, J. MCTAGGART, C. PRASAD, T. SCOTT, D. SHINNERS-KENNEDY, S. WESTBROOK. and C. ZANDER (2005) A multi-institutional, multinational study of programming concepts using card sort data, Expert Systems, this issue.