Association Rule Mining for Specific New Course

Main Article Content

Nhabhat Chaimongkol Phayung Meesad

Abstract

- Most language schools devote a significant portion of their budget on new courses to distinguish their school from their competitors and to increase the number of students. The schools should specify courses that fulfill the students‟ needs. This will raise the competitiveness of the schools. Also the schools will earn higher loyalties and profits because of the increase of new students. This article proposes a Mining Course Map (MCM) algorithm for investigating on the relationships among students‟ demands, type of course and transaction records. MCM is a modified association rule analysis based-on FP-growth algorithm. For comparison study, the proposed method was compared with Association Rule Miner And Deduction Analysis (ARMADA). The results show that the execution time of MCM is less than ARMADA which means that MCM is more efficient than the ARMADA. In addition, the results show that different knowledge and rules can be extracted from students to specify new courses for new and old members. This paper suggests that the school should extract knowledge from student demands. The knowledge can be used to manage new courses properly.

Keywords

Article Details

How to Cite
Chaimongkol, N., & Meesad, P. (2010). Association Rule Mining for Specific New Course. JOURNAL OF INFORMATION SCIENCE AND TECHNOLOGY, 1(1), 15-22. https://doi.org/10.14456/jist.2010.3
Section
Research Article: Soft Computing (Detail in Scope of Journal)

References

1. Keim, D, A., Pansea, C., Sipsa, M. and Northb, S. C, “Pixel based visual data mining of geo-spatial data”, Computer & Graphics, Vol. 28, 2004. pp. 327-344.

2. Hui, S. C. and Jha, G., “Data mining for customer service support,” Information & Management, Vol. 38, Issue 1, 2000. pp. 1-13.

3. Mehta, K. and Bhattacharyya, S., “Adquacy of training data for evolutionary mining of trading rules,” Decision Support Systems, Vol. 37, Issue 4 2004. pp 461-474.

4. Holmlund, M. and Strandvik, T., “Perception configurations in business relationships,” Management Decision, Vol. 37, Issue 9, 1999. pp. 686-696.

5. Liao, S. H., Hsieh, C. L. and Huang S. P., “Mining product maps for new product development,” Expert Systems with Applications, Vol. 34, Issue 1, 2008. pp. 20-62.

6. Manlone, J., Association Rule Miner And Deduction Analysis (ARMADA), User Manaual, 2003. pp. 1-20.

7. Said, A. M., Dominic, P.D.D. and Abdullah, A. B., “A Comparative Study of FP-growth Variations”, International Journal of Computer Science and Network Security, VOL.9 No.5, May 2009, pp. 266-272.

8. Jeffrey W. Seifert, Data mining: And overview, Congressional Research Service, Order Code RL31798, 2004.

9. Trewartha, D., Investigating Data Mining in MATLAB, Bachelor (Honours) of Science Thesis of Rhodes University, 2006.

10. Li, H., Wang, Y., Zhang, D., Zhang, M. and Chang, E., “PFP: Parallel FP-Growth for Query Recommendation”, ACM Recommendation Systems, October 2008.

11. Frawely, W. J., Shapiro, P. G., and Matheus, C. J. “Knowledge discovery in databases: An overview”, AAAI/MIT Press, 1991, pp. 1-27.

12. Erwin, A., Gopalan, R. P., and Achuthan, N. R. “CTU-Mine: An Efficient High Utility Itemset Mining Algorithm Using the Pattern Growth Approach”, IEEE 7th International Conferences on Computer and Information Technology, 2007, pp. 71-76.

13. Cunningham, S. J. and Holmes, G. “Developing innovative applications in agriculture using data mining,” the Proceedings of the Southeast Asia Regional Computer Confederation Conference, Singapore, 1999.

14. Wojciechowski, M., Galecki, K., and Gawronek, K. “Concurrent Processing of Frequent Itemset Queries Using FP-Growth Algorithm”, Proc. of the 1st ADBIS Workshop on Data Mining and Knowledge Discovery