Using market basket analysis to integrate and motivate topics in discrete structures

Authors:
Michael R. Wick;Paul J. Wagner
Affiliations:
University of Wisconsin-Eau Claire, Eau Claire, WI;University of Wisconsin-Eau Claire, Eau Claire, WI
Venue:
Proceedings of the 37th SIGCSE technical symposium on Computer science education
Year:
2006

Citing 7
Cited 3

An effective hash-based algorithm for mining association rules

SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
Fast discovery of association rules

Advances in knowledge discovery and data mining
CS1 and CS2 (panel session): foundations of computer science and discrete mathematics

Proceedings of the thirty-first SIGCSE technical symposium on Computer science education
Data mining: concepts and techniques

Data mining: concepts and techniques
We claim this class for computer science: a non-mathematician's discrete structures course

Proceedings of the 35th SIGCSE technical symposium on Computer science education
Efficient Data Structures and Parallel Algorithms for Association Rules Discovery

ENC '04 Proceedings of the Fifth Mexican International Conference in Computer Science
Data Structure for Association Rule Mining: T-Trees and P-Trees

IEEE Transactions on Knowledge and Data Engineering

Effectiveness of a language implementation project in building appreciation for formal specification

Journal of Computing Sciences in Colleges - Papers of the twelfth annual CCSC Northeastern Conference
Problem-directed discrete structures course

Proceedings of the 41st ACM technical symposium on Computer science education
Teaching discrete structures: a systematic review of the literature

Proceedings of the 42nd ACM technical symposium on Computer science education

Quantified Score

Hi-index	0.00

Visualization

Abstract

Nearly every computer science curriculum includes a course called "Discrete Structures" or "Discrete Mathematics". Over the past few years, considerable attention has been paid to this course in an attempt to overcome the misperception by students that the material is mathematics and not related to computer science. Most of these efforts deal with attempting to explicitly show students the application of discrete mathematics within computer science. We present an application that adds to the efforts of this community by giving instructors a modern, powerful, and elegant example to motivate student engagement in discrete structures.