Closed-ended questionnaire data analysis

Authors:
Leuo-Hong Wang;Chao-Fu Hong;Chia-Ling Hsu
Affiliations:
Evolutionary Computation Laboratory, Department of Information Management, Aletheia University, Taiwan;Evolutionary Computation Laboratory, Department of Information Management, Aletheia University, Taiwan;Centre for Teacher Education, Tamkang University, Taiwan
Venue:
KES'06 Proceedings of the 10th international conference on Knowledge-Based Intelligent Information and Engineering Systems - Volume Part III
Year:
2006

Citing 2
Cited 2

Fast Algorithms for Mining Association Rules in Large Databases

VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
KeyGraph: Automatic Indexing by Co-occurrence Graph based on Building Construction Metaphor

ADL '98 Proceedings of the Advances in Digital Libraries Conference

Instructional design for remedial English e-learning

ICCCI'10 Proceedings of the Second international conference on Computational collective intelligence: technologies and applications - Volume Part II
Integrating curriculum and instruction system based on objective weak tie approach

ICCCI'12 Proceedings of the 4th international conference on Computational Collective Intelligence: technologies and applications - Volume Part II

Quantified Score

Hi-index	0.00

Visualization

Abstract

A KeyGraph-like algorithm, which incorporates the concept of structural importance with association rules mining, for analyzing closed-ended questionnaire data is presented in this paper. The proposed algorithm transforms the questionnaire data into a directed graph, and then applies association rules mining and clustering procedures, whose parameters are determined by gradient sensitivity analysis, as well as correlation analysis in turn to the graph. As a result, both statistically significant and other cryptic events are successfully unveiled. A questionnaire survey data from an instructional design application has been analyzed by the proposed algorithm. Comparing to the results of statistical methods, which elicited almost no information, the proposed algorithm successfully identified three cryptic events and provided five different strategies for designing instructional activities. The preliminary experimental results indicated that the algorithm works out for analyzing closed-ended questionnaire survey data.