Mathangi Peeusha Nikhitha Praise, M. Sunitha


We offer several algorithms to solve this innovative mining problem in three stages: pre-processing to extract probabilistic issues and identify sessions for multiple users, generate all STP candidates with support values ​​(expected) per user for pattern growth, and decide on URSTP by searching for rare analysis the user is sensitive in derived STPs. Little information is inevitable, extensive survey is available. Easily supporting the idea is the most common metric for evaluating sequence sequencing and is understood as the amount or proportion of the sequence of information contained within the target database. The acquired patterns are not always interesting for this purpose, because the rare but important patterns of individual and personal behaviors are reduced by reduced support. We recommend a framework to solve this problem pragmatically and design similar algorithms to help you. In the beginning, we offer pre-treatment procedures with the extraction of heuristic methods and the identification of sessions. This method can be considered as a sequential match between the purchased items identified by STP as well as the probabilistic problems that occur within the purchased documents that belong to a particular session. The results indicate that our approach can certainly capture personal behaviors of online users and express them in an understandable way.


Web Mining; Sequential Patterns; Document Streams; Rare Events;


K. Chen, L. Luesukprasert, and S. T. Chou, “Hot topic extraction based on timeline analysis and multidimensional sentence modeling,” IEEE Trans. Knowl. Data Eng., vol. 19, no. 8, pp. 1016–1025, 2007.

W. Li and A. McCallum, “Pachinko allocation: DAG-structured mixture models of topic correlations,” in Proc. ACM ICML’06, vol. 148, 2006, pp. 577–584.

J. Pei, J. Han, B. Mortazavi-Asl, H. Pinto, Q. Chen, U. Dayal, and M. Hsu, “PrefixSpan: Mining sequential patterns by prefixprojected growth,” in Proc. IEEE ICDE’01, 2001, pp. 215–224.

Z. Zhang, Q. Li, and D. Zeng, “Mining evolutionary topic patterns in community question answering systems,” IEEE Trans. Syst., Man, Cybern. A, vol. 41, no. 5, pp. 828–833, 2011.

T. Bernecker, H.-P. Kriegel, M. Renz, F. Verhein, and A. Zuefle, “Probabilistic frequent itemset mining in uncertain databases,” in Proc. ACM SIGKDD’09, 2009, pp. 119–128.

Jiaqi Zhu, Member, IEEE, Kaijun Wang, Yunkun Wu, Zhongyi Hu, and Hongan Wang, Member, IEEE, “Mining User-Aware Rare Sequential TopicPatterns in Document Streams”, IEEE Transactions on Knowledge and Data Engineering, 2016.

M. Spiliopoulou, B. Mobasher, B. Berendt, and M. Nakagawa, “A framework for the evaluation of session reconstruction heuristics in web-usage analysis,” INFORMS J. Comput., vol. 15, no. 2, pp. 171–190, 2003.

Full Text: PDF


  • There are currently no refbacks.

Copyright © 2012 - 2021, All rights reserved.|

Creative Commons License
International Journal of Innovative Technology and Research is licensed under a Creative Commons Attribution 3.0 Unported License.Based on a work at IJITR , Permissions beyond the scope of this license may be available at