Discovery Of Strain Support On Community Relatives In Social Networks

SRINAGA VENKATA SUJITH KANDAMURI, K SUDHAKAR BABU

Abstract


We offer a variety of algorithms to solve this new problem-solving process through three stages: pre-processing to find relevant topics, setting up sessions for multiple users, building all members STPs are the (expected) values ​​for individuals through the development of design, and selection in URSTPs Recipients of STPs. Critical and sensitive information, a detailed study is available. Supporting the assumptions is simply the standard measure for evaluating the consistency of a model, and it is understood that the amount or percentage of information involved in the design is in the underlying database. Acquired patterns are not particularly attractive for this purpose, as they are rare but very important for individuals to exhibit personal and negative behaviors that are complemented by reduced self-esteem. We propose a framework for solving this problem in practice, and designing appropriate algorithms to help. Initially, we provide first-hand treatment and evidence-based methods to cover the topic and plan the session. This method can be considered as a good match between the titles you purchased and endorsed by the STP and other topics that may have occurred in the purchases purchased by a particular class. The results suggest that our approach is able to capture and reveal the personal behavior of internet users in a transparent way.


References


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

Refbacks

  • There are currently no refbacks.




Copyright © 2012 - 2023, All rights reserved.| ijitr.com

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 http://creativecommons.org/licenses/by/3.0/deed.en_GB.