Abstract
In educational data mining, frequent patterns and association rules are popular to help us get insights into the characteristics of the students and their study. Nonetheless, frequent patterns and rules discovered in the existing works are simple with no temporal information along the student’s study paths. Indeed, many sequential pattern and rule mining techniques just considered a sequence of ordered events with no explicit time. In order to achieve sequential rules with explicit timestamps in temporal educational databases that contain timestamp-extended sequences, our work defines a tree-based rule mining algorithm from the frequent sequences generated and organized in a prefix tree enhanced with explicit timestamps. Experimental results on real educational datasets have shown that the proposed algorithm can provide more informative sequential rules with explicit timestamps. Besides, it is more efficient than the brute-force list-based algorithm by optimizing the manipulations on the prefix tree for sequential rules with explicit timestamps.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Academic Affairs Office, Ho Chi Minh City University of Technology, Vietnam, http://www.aao.hcmut.edu.vn/dhcq.html (2014)
Campagni, R., Merlini, D., Sprugnoli, R.: Sequential patterns analysis in a student database. In: ECML-PKDD workshop, Mining and exploiting interpretable local patterns, I-Pat 2012, Bristol (2012)
Chen, Y.C., Jiang, J.C., Peng, W.C., Lee, S.Y.: An efficient algorithm for mining time interval-based patterns in large database. In: Proceedings of the 19th international conference on information and knowledge management, pp. 49–58. ACM, New York (2010)
Djenouri, Y., Drias, H., Habbas, Z.: Hybrid intelligent method for association rules mining using multiple strategies. Int. J. Appl. Metaheuristic Comput. (IJAMC) 5(1), 46–64 (2014)
Fournier-Viger, P., Faghihi, U., Nkambou, R., Nguifo, E.M.: CMRules: Mining sequential rules common to several sequences. Knowl. Based Syst. 25(1), 63–76 (2012)
GarcÃa, E., Romero, C., Ventura, S., Castro, D.C.C., Calders, T.G.K.: Association rule mining in learning management systems. In: Romero, C., Ventura, S., Pechenizkiy, M., Baker,R. (eds.) Handbook of Educational Data Mining, pp. 93–106. CRC Press (2011)
Gharib, T.F., Nassar, H., Taha, M., Abraham, A.: An efficient algorithm for incremental mining of temporal association rules. Data Knowl. Eng. 69(8), pp. 800–815. Elsevier Press (2010)
Hirate, Y., Yamana, H.: Generalized sequential pattern mining with item intervals. J. comput. 1(3), pp. 51–60. Academy Publisher (2006)
Hoang, T.H.V., Vo, T.N.C., Nguyen, H.P.: Frequent temporal pattern mining incrementally from educational databases in an academic credit system. In: Advanced technologies for communications (ATC) international conference, pp. 315–320 (2014)
MartÃn, D., Rosete, A., Alcalá-Fdez, J., Herrera, F.: QAR-CIP-NSGA-II: A new multi-evolutionary algorithm to mine quantitative association rules. Inf. Sci. 258, 1–28 (2014)
Mashat, A.F., Fouad, M.M., Philip, S.Y., Gharib, T.F.: Discovery of association rules from university admission system data. Int. J. Mod. Educ. Comput. Sci. (IJMECS) 5(4), 1 (2013)
Pham, T.T., Luo, J., Hong, T.P., Vo, B.: An efficient method for mining non-redundant sequential rules using attributed prefix-trees. Eng. Appl. Artif. Intell. 32, 88–99 (2014)
Spiliopoulou, M.: Managing interesting rules in sequence mining. Principles of Data Mining and Knowledge Discovery, pp. 554–560. Springer, Berlin (1999)
Van, T.T., Vo, B., Le, B.: Mining sequential rules based on prefix-tree. New Challenges for Intelligent Information and Database Systems, pp. 147–156. Springer, Berlin (2011)
Verma, K., Vyas, O.P.: Efficient calendar based temporal association rule. ACM SIGMOD Rec. 34(3), 63–70 (2005)
Winarko, E., Roddick, J.F.: ARMADA–An algorithm for discovering richer relative temporal association rules from interval-based data. Data Knowl. Eng. 63(1), 76–90 (2007)
Yin, K.C., Hsieh, Y.L., Yang, D.L., Hung, M.C.: Association rule mining considering local frequent patterns with temporal intervals. Appl. Math. 8(4), 1879–1890 (2014)
Yuan, D., Lee, K., Cheng, H., Krishna, G., Li, Z., Ma, X., Zhou, Y., Han, J.: CISpan: Comprehensive incremental mining algorithms of closed sequential patterns for multi-versional software mining. SDM 8, 84–95 (2008)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this chapter
Cite this chapter
Van, H.T.H., Chau, V.T.N., Phung, N.H. (2016). An Efficient Tree-based Rule Mining Algorithm for Sequential Rules with Explicit Timestamps in Temporal Educational Databases. In: Król, D., Madeyski, L., Nguyen, N. (eds) Recent Developments in Intelligent Information and Database Systems. Studies in Computational Intelligence, vol 642. Springer, Cham. https://doi.org/10.1007/978-3-319-31277-4_36
Download citation
DOI: https://doi.org/10.1007/978-3-319-31277-4_36
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-31276-7
Online ISBN: 978-3-319-31277-4
eBook Packages: EngineeringEngineering (R0)