Chapter

Foundations of Intelligent Systems

Volume 3488 of the series Lecture Notes in Computer Science pp 603-611

Experimental Analysis of the Q-Matrix Method in Knowledge Discovery

  • Tiffany BarnesAffiliated withComputer Science Dept., University of North Carolina at Charlotte
  • , Donald BitzerAffiliated withComputer Science Dept., North Carolina State University
  • , Mladen VoukAffiliated withComputer Science Dept., North Carolina State University

* Final gross prices may vary according to local VAT.

Get Access

Abstract

The q-matrix method, a new method for data mining and knowledge discovery, is compared with factor analysis and cluster analysis in analyzing fourteen experimental data sets. This method creates a matrix-based model that extracts latent relationships among observed binary variables. Results show that the q-matrix method offers several advantages over factor analysis and cluster analysis for knowledge discovery. The q-matrix method can perform fully unsupervised clustering, where the number of clusters is not known in advance. It also yields better error rates than factor analysis, and is comparable in error to cluster analysis. The q-matrix method also allows for automatic interpretation of the data sets. These results suggest that the q-matrix method can be an important tool in automated knowledge discovery.