Using Partitioning Methods for Mining URL Weight in Social Networks
DOI:
https://doi.org/10.26438/ijcse/v7i2.928933Keywords:
Prartitioning Algorithm, Link Weight, Social NetworkAbstract
A standout amongst the most essential issues in such frameworks that has pulled in a great deal of interests as of late, is connect expectation. Systems can speak to a wide scope of complex frameworks, for example, social, natural and innovative frameworks. In such complex conditions, there are numerous difficulties and issues that can be contemplated and considered. Numerous examinations have been practiced on connection forecast in the course of the most recent couple of years, however the current methodologies are not tasteful in handing topological data as they have high time multifaceted nature. Numerous examines in conventional techniques expect that endpoint impact spoken to by endpoint degree, wants to encourage the association between huge degree endpoints. The proposed mining User-mindful Rare Sequential Topic Patterns in record streams comprises of three stages. At first, literary archives are crept from some small scale blog destinations or discussions, and establish a report stream as the contribution of our methodology. At that point, as preprocessing algorithm and partition algorithm utilized for the first stream is changed to a subject dimension archive stream and then separated into numerous sessions to distinguish total client practices. Our straight data structure empowers us to figure a tight headed for amazing pruning and to straightforwardly distinguish high utility examples in a productive and versatile way. Preprocessing algorithm and partition algorithm preprocessing algorithm and partition algorithm.
References
[1] L. Lü, C.-H. Jin, T. Zhou, Similarity index based on local paths for link prediction of complex networks, Phys. Rev. E 80 (4) (2009) 046122.
[2] W. Liu, L. Lü, Link prediction based on local random walk, EPL (Europhys. Lett.) 89 (5) (2010) 58007.
[3] D. Davis, R. Lichtenwalter, N.V. Chawla, Supervised methods for multi-relational link prediction, Soc. Netw. Anal. Min. 3 (2) (2013) 127–141.
[4] L. Lü, T. Zhou, Role of weak ties in link prediction of complex networks, in: Proceedings of the 1st ACM International Workshop on Complex Networks Meet Information & Knowledge Management, ACM, 2009, pp. 55–58.
[5] F. Lorrain, H.C. White, Structural equivalence of individuals in social networks, J. Math. Sociol. 1 (1) (1971) 49–80.
[6] L. Yao, L. Wang, L. Pan, K. Yao, Link prediction based on common-neighbors for dynamic social network, Procedia Comput. Sci. 83 (2016) 82–89.
[7] T. Zhou, L. Lü, Y.-C. Zhang, Predicting missing links via local information, Eur. Phys. J. B 71 (4) (2009) 623–630.
[8] E. Ravasz, A.L. Somera, D.A. Mongru, Z.N. Oltvai, A.-L. Barabási, Hierarchical organization of modularity in metabolic networks, Science 297 (5586) (2002) 1551–1555.
[9] T. Sørensen, A method of establishing groups of equal amplitude in plant sociology based on similarity of species and its application to analyses of the vegetation on Danish commons, Biol. Skr. 5 (1948) 1–34.
[10] G. Salton, M.J. McGill, Introduction to modern information retrieval (1986).
[11] P. Jaccard, Etude comparative de la distribution florale dans une portion des Alpes et du Jura, Impr. Corbaz, 1901.
[12] E.A. Leicht, P. Holme, M.E. Newman, Vertex similarity in networks, Phys. Rev. E 73 (2) (2006) 026120.
[13] Y.-L. Wang, T. Zhou, J.-J. Shi, J. Wang, D.-R. He, Empirical analysis of dependence between stations in Chinese railway network, Physica A 388 (14) (2009) 2949–2955.
[14] L. Katz, A new status index derived from sociometric analysis, Psychometrika 18 (1) (1953) 39–43.
[15] D.J. Klein, M. Randic´, Resistance distance, J. Math. Chem. 12 (1) (1993) 81–95.
[16] F. Fouss, A. Pirotte, J.-M. Renders, M. Saerens, Random-walk computation of similarities between nodes of a graph with application to collaborative recommendation, IEEE Trans. Knowl. Data Eng. 19 (3) (2007) 355–369.
[17] G. Jeh, J. Widom, Simrank: a measure of structural-context similarity, in: Proceedings of the Eighth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, ACM, 2002, pp. 538–543.
[18] X. Li, H. Chen, Recommendation as link prediction in bipartite graphs: a graph kernel-based machine learning approach, Decis. Support Syst. 54 (2) (2013) 880–890.
[19] S. Scellato, A. Noulas, C. Mascolo, Exploiting place features in link prediction on location-based social networks, in: Proceedings of the 17th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, ACM, 2011, pp. 1046–1054.
[20] R.N. Lichtenwalter, N.V. Chawla, Vertex collocation profiles: subgraph counting for link analysis and prediction, in: Proceedings of the 21st International Conference on World Wide Web, ACM, 2012, pp. 1019–1028.
[21] M. Al Hasan, V. Chaoji, S. Salem, M. Zaki, Link prediction using supervised learning, SDM06: Workshop on Link Analysis, Counter.
Downloads
Published
How to Cite
Issue
Section
License
This work is licensed under a Creative Commons Attribution 4.0 International License.
Authors contributing to this journal agree to publish their articles under the Creative Commons Attribution 4.0 International License, allowing third parties to share their work (copy, distribute, transmit) and to adapt it, under the condition that the authors are given credit and that in the event of reuse or distribution, the terms of this license are made clear.
