Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
10.1145/1121341.1121440acmconferencesArticle/Chapter ViewAbstractPublication PagessigcseConference Proceedingsconference-collections
Article

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

Published: 03 March 2006 Publication History

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.

References

[1]
Agrawal R., Mannila H., Srikant R., Toivonen H. and Verkamo, A.I., "Fast Discovery of Association Rules", from "Advances in Knowledge Discovery and Data Mining", AAI/MIT Press, 1996, pp. 307--328.
[2]
Cerin, C., Gay, J-S., Mahec, G. and Koskas M, "Efficient Data Structures and Parallel Algorithms for Association Rules Discovery", http://www-lipn.univ-paris13.fr/~cerin/documents/cerin_c_enc04.pdf
[3]
Coenen, F., Leng, P. and Ahmed, S., "Data Structure for Association Rule Mining: T-Trees and P-Trees", IEEE Transactions on Knowledge and Data Engineering, Vol. 16, No. 6, June 2004, pp. 774--778.
[4]
Decker, A., and Ventura, P., "We Claim this Class for Computer Science: A Non-Mathematician's Discrete Structures Course"; ACM SIGCSE Bulletin, Proceedings of the 35th SIGCSE Technical Symposium on Computer Science Education, Vol. 36, No. 1, March 2004, pp. 442--446.
[5]
Han, J. and Kamber, M, "Data Mining, Concepts and Techniques", Academic Press, 2001.
[6]
National Institute of Standards and Technology, http://www.nist.gov/dads/HTML/dynamicprog.html
[7]
National Institute of Standards and Technology, http://www.nist.gov/dads/HTML/principle.html
[8]
National Institute of Standards and Technology, http://www.nist.gov/dads/HTML/optimization.html
[9]
Park J., Chen, M, and Yu P., "An Effective Hash-Based Algorithm for Mining Association Rules", Proceedings of the 1995 ACM-SIGMOD International Conference on the Management of Data (SIGCMOD '95), San Jose, CA, May 1995, pp. 175--186.
[10]
Tomer, D. S., Baldwin, D., Smith, C. H., Henderson, P. B.,& Vadisigi, V. (2000). CS1 and CS2: Foundations of Computer Science and Discrete Mathematics. Panel presented at the 31st SIGCSE technical symposium on Computer Science Education, Austin, Texas; Vol. 32, No. 1, March 2000, pp. 397--398.

Cited By

View all
  • (2023)Spreadsheets As Hands-on Learning Tools In a Discrete Math/Structures CourseJournal of Computing Sciences in Colleges10.5555/3606402.360642138:8(158-172)Online publication date: 1-Apr-2023
  • (2021)Market Basket Analysis Approach to Machine Learning2021 12th International Conference on Computing Communication and Networking Technologies (ICCCNT)10.1109/ICCCNT51525.2021.9580175(1-9)Online publication date: 6-Jul-2021
  • (2018)Enhancement of Supermarket Business and Market Plan by Using Hierarchical Clustering and Association Mining Technique2018 International Conference on Networking and Network Applications (NaNA)10.1109/NANA.2018.8648716(384-389)Online publication date: Oct-2018
  • Show More Cited By

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
SIGCSE '06: Proceedings of the 37th SIGCSE technical symposium on Computer science education
March 2006
612 pages
ISBN:1595932593
DOI:10.1145/1121341
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 03 March 2006

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. computer science education
  2. discrete structures
  3. dynamic programming
  4. market basket analysis
  5. sets

Qualifiers

  • Article

Conference

SIGCSE06
Sponsor:

Acceptance Rates

Overall Acceptance Rate 1,595 of 4,542 submissions, 35%

Upcoming Conference

SIGCSE Virtual 2024
1st ACM Virtual Global Computing Education Conference
December 5 - 8, 2024
Virtual Event , NC , USA

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)7
  • Downloads (Last 6 weeks)3
Reflects downloads up to 10 Oct 2024

Other Metrics

Citations

Cited By

View all
  • (2023)Spreadsheets As Hands-on Learning Tools In a Discrete Math/Structures CourseJournal of Computing Sciences in Colleges10.5555/3606402.360642138:8(158-172)Online publication date: 1-Apr-2023
  • (2021)Market Basket Analysis Approach to Machine Learning2021 12th International Conference on Computing Communication and Networking Technologies (ICCCNT)10.1109/ICCCNT51525.2021.9580175(1-9)Online publication date: 6-Jul-2021
  • (2018)Enhancement of Supermarket Business and Market Plan by Using Hierarchical Clustering and Association Mining Technique2018 International Conference on Networking and Network Applications (NaNA)10.1109/NANA.2018.8648716(384-389)Online publication date: Oct-2018
  • (2018)Design of facility layout with lean service and market basket analysis method to simplification of service process in the supermarketMATEC Web of Conferences10.1051/matecconf/201819714006197(14006)Online publication date: 12-Sep-2018
  • (2011)Teaching discrete structuresProceedings of the 42nd ACM technical symposium on Computer science education10.1145/1953163.1953247(275-280)Online publication date: 9-Mar-2011
  • (2010)Problem-directed discrete structures courseProceedings of the 41st ACM technical symposium on Computer science education10.1145/1734263.1734315(148-151)Online publication date: 10-Mar-2010
  • (2007)Effectiveness of a language implementation project in building appreciation for formal specificationJournal of Computing Sciences in Colleges10.5555/1231091.123111922:6(173-183)Online publication date: 1-Jun-2007
  • (2007)Enhancing student learning in database courses with large data sets2007 37th annual frontiers in education conference - global engineering: knowledge without borders, opportunities without passports10.1109/FIE.2007.4418135(S2D-13-S2D-17)Online publication date: Oct-2007
  • (2018)An Active and Collaborative Approach to Teaching Discrete StructuresProceedings of the 49th ACM Technical Symposium on Computer Science Education10.1145/3159450.3159582(822-827)Online publication date: 21-Feb-2018

View Options

Get Access

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media