Survey on Mining Partially Ordered Sequential Rules
Main Article Content
Abstract
Nowadays, various applications, such as stock market analysis and e-commerce, utilize sequential rule mining to extract important data. This process involves the identification of common multiple sequential rules from a given sequence database. One of the general forms of sequential rule mining is Partially Ordered Sequential rules, in which the listed items on the left and right sides of the rule do not need to be ordered. These partially ordered sequential rules are identified using the RuleGrowth Algorithm and the TRuleGrowth Algorithm. These algorithms enable the identification of partially ordered sequential rules for more generalized decision making. This paper focuses on such algorithms.
Article Details
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.
IJCERT Policy:
The published work presented in this paper is licensed under the Creative Commons Attribution 4.0 International (CC BY 4.0) license. This means that the content of this paper can be shared, copied, and redistributed in any medium or format, as long as the original author is properly attributed. Additionally, any derivative works based on this paper must also be licensed under the same terms. This licensing agreement allows for broad dissemination and use of the work while maintaining the author's rights and recognition.
By submitting this paper to IJCERT, the author(s) agree to these licensing terms and confirm that the work is original and does not infringe on any third-party copyright or intellectual property rights.
References
Pei, J., Han, J., Mortazavi-Asl, B., Pinto, H., Chen, Q., Dayal, U., & Hsu, M. (2004). Mining sequential patterns by pattern-growth: The pre-fixspan approach. IEEE Transactions on Knowledge and Data Engineering, 16(10), 1–17.
Agrawal, R., & Srikant, R. (1995). Mining sequential patterns. In Proceedings of the 11th International Conference on Data Engineering, pp. 3–14.
Pei, J., Han, J., Mortazavi-Asl, B., Pinto, H., Chen, Q., Dayal, U., & Hsu, M. (2004). Mining sequential patterns by pattern-growth: The pre-fixspan approach. IEEE Transactions on Knowledge and Data Engineering, 16(10), 1–17.
Zaki, M. J. (2001). SPADE: An efficient algorithm for mining frequent sequences. Machine Learning, 42(1–2), 31–60.
Lo, D., Khoo, S. C., & Wong, L. (2009). Non-redundant sequential rules—Theory and algorithm. Information Systems, 34(4/5), 438–453.
Zhao, Y., Zhang, H., Cao, L., Zhang, C., & Bohlscheid, H. (2009). Mining both positive and negative impact-oriented sequential rules from transactional data. In Proceedings of the 13th Pacific-Asia Conference on Knowledge Discovery and Data Mining, pp. 656–663.