فهرست:
فصل 1- مقدمه.. 7
1-1- شبکه های اجتماعی.. 7
1-2- تقسیمبندی شبکههای اجتماعی.. 9
1-3- اهمیت شبکههای اجتماعی.. 10
1-4- تحلیل شبکههای اجتماعی.. 11
1-5- شبکهها و ویژگی آنها 11
1-6- تشکلها در شبکههای اجتماعی.. 13
1-7- اهمیت شناسایی تشکلها 16
1-8- انگیزه از انجام این پایان نامه. 17
1-9- نگاه کلی به فصول رساله. 19
فصل 2- فصل دوم: مروری بر کارهای انجام شده. 21
2-1- مقدمه. 21
2-2- روشهای ارائه شده 22
2-3- روشهای مبتنی بر لینک... 22
2-3-1- بهینه کردن یک هدف سراسری.. 22
2-3-2- بدون بهینه سازی هیچ معیاری.. 27
2-3-3- روشهای مبتنی بر مدل.. 27
2-4- روشهی مبتنی بر محتوا 29
2-4-1- روش CUT. 29
2-4-2- روش LTCA. 30
فصل 3- ارائه راه حل و روشهای پیشنهادی... 32
3-1- مقدمه. 32
3-2- روش SBM... 34
3-3- روش LDA.. 37
3-4- روش پیشنهادی.. 40
3-4-1- روش CDBLC.. 41
3-5- جمعبندی.. 51
فصل 4- نتایج... 53
4-1- مقدمه. 53
4-2- مجموعه دادهها 54
4-2-1- مجموعه دادهی Cora. 54
4-2-2- مجموعه دادهی Twitter 55
4-3- معیارهای ارزیابی.. 56
4-3-1- معیار Modularity. 57
4-3-2- معیار Normalized Mutual Information. 58
4-3-3- معیار Perplexity. 59
4-4- نتایج و تحلیلها 60
4-4-1- مجموعه دادهی Cora. 61
فصل 5- بحث و نتیجه‌گیری... 67
5-1- نتیجه گیری.. 67
5-2- پیشنهادات برای کارهای آتی.. 71
فهرست منابع.. 72
منبع:
[1] B. A. Myers, “A brief history of human-computer interaction technology,” interactions, vol. 5, no. 2, pp. 44–54, 1998.
[2] R. Harper, T. Rodden, Y. Rogers, and A. Sellen, “Being Human: HCI in the Year 2020.,” 2008.
[3] N. B. Ellison, “Social network sites: Definition, history, and scholarship,” J. Comput. Commun., vol. 13, no. 1, pp. 210–230, 2007.
[4] S. Fortunato, “Community detection in graphs,” Phys. Rep., vol. 486, no. 3, pp. 75–174, 2010.
[5] H. Zhang, B. Qiu, C. L. Giles, H. C. Foley, and J. Yen, “An LDA-based community structure discovery approach for large-scale social networks,” in Intelligence and Security Informatics, 2007 IEEE, 2007, pp. 200–207.
[6] A. Celisse, J.-J. Daudin, and L. Pierre, “Consistency of maximum-likelihood and variational estimators in the stochastic block model,” Electron. J. Stat., vol. 6, pp. 1847–1899, 2012.
[7] X. Cheng, C. Dale, and J. Liu, “Statistics and social network of youtube videos,” in Quality of Service, 2008. IWQoS 2008. 16th International Workshop on, 2008, pp. 229–238.
[8] S. Wasserman and K. Faust, “Social network analysis in the social and behavioral sciences,” Soc. Netw. Anal. Methods Appl., vol. 1994, pp. 1–27, 1994.
[9] M. Faloutsos, P. Faloutsos, and C. Faloutsos, “On power-law relationships of the internet topology,” in ACM SIGCOMM Computer Communication Review, 1999, vol. 29, no. 4, pp. 251–262.
[10] D. J. Watts and S. H. Strogatz, “Collective dynamics of ‘small-world’networks,” Nature, vol. 393, no. 6684, pp. 440–442, 1998.
[11] S. Milgram, “The small world problem,” Psychol. Today, vol. 2, no. 1, pp. 60–67, 1967.
[12] J. Guare, Six degrees of separation: A play. Random House LLC, 1990.
[13] R. Albert, H. Jeong, and A.-L. Barabási, “Internet: Diameter of the world-wide web,” Nature, vol. 401, no. 6749, pp. 130–131, 1999.
[14] M. E. J. Newman, “The structure and function of complex networks,” SIAM Rev., vol. 45, no. 2, pp. 167–256, 2003.
[15] M. E. J. Newman, S. H. Strogatz, and D. J. Watts, “Random graphs with arbitrary degree distributions and their applications,” Phys. Rev. E, vol. 64, no. 2, p. 26118, 2001.
[16] M. E. J. Newman, “Detecting community structure in networks,” Eur. Phys. J. B-Condensed Matter Complex Syst., vol. 38, no. 2, pp. 321–330, 2004.
[17] L. Danon, A. Diaz-Guilera, J. Duch, and A. Arenas, “Comparing community structure identification,” J. Stat. Mech. Theory Exp., vol. 2005, no. 09, p. P09008, 2005.
[18] S. E. Schaeffer, “Graph clustering,” Comput. Sci. Rev., vol. 1, no. 1, pp. 27–64, 2007.
[19] J. Leskovec, D. Huttenlocher, and J. Kleinberg, “Predicting positive and negative links in online social networks,” in Proceedings of the 19th international conference on World wide web, 2010, pp. 641–650.
[20] T. Schank and D. Wagner, Approximating clustering-coefficient and transitivity. Universität Karlsruhe, Fakultät für Informatik, 2004.
[21] M. Girvan and M. E. J. Newman, “Community structure in social and biological networks,” Proc. Natl. Acad. Sci., vol. 99, no. 12, pp. 7821–7826, 2002.
[22] P.-O. Fjällström, “Algorithms for graph partitioning: A survey,” Linköping Electron. Artic. Comput. Inf. Sci., vol. 3, no. 10, 1998.
[23] M. E. J. Newman, “Modularity and community structure in networks,” Proc. Natl. Acad. Sci., vol. 103, no. 23, pp. 8577–8582, 2006.
[24] S. Zhang, R.-S. Wang, and X.-S. Zhang, “Identification of overlapping community structure in complex networks using fuzzy c-means clustering,” Phys. A Stat. Mech. its Appl., vol. 374, no. 1, pp. 483–490, 2007.
[25] M. E. J. Newman and M. Girvan, “Finding and evaluating community structure in networks,” Phys. Rev. E, vol. 69, no. 2, p. 26113, 2004.
[26] U. Brandes and T. Erlebach, Network analysis: methodological foundations, vol. 3418. Springer, 2005.
[27] B. W. Kernighan and S. Lin, “An efficient heuristic procedure for partitioning graphs,” Bell Syst. Tech. J., vol. 49, no. 2, pp. 291–307, 1970.
[28] M. E. J. Newman, “Spectral methods for community detection and graph partitioning,” Phys. Rev. E, vol. 88, no. 4, p. 42822, 2013.
[29] G. Palla, I. Derényi, I. Farkas, and T. Vicsek, “Uncovering the overlapping community structure of complex networks in nature and society,” Nature, vol. 435, no. 7043, pp. 814–818, 2005.
[30] H.-W. Shen, X.-Q. Cheng, and J.-F. Guo, “Exploring the structural regularities in networks,” Phys. Rev. E, vol. 84, no. 5, p. 56111, 2011.
[31] Z. Yin, L. Cao, Q. Gu, and J. Han, “Latent community topic analysis: Integration of community discovery with topic modeling,” ACM Trans. Intell. Syst. Technol., vol. 3, no. 4, p. 63, 2012.
[32] T. Yang, Y. Chi, S. Zhu, Y. Gong, and R. Jin, “Detecting communities and their evolutions in dynamic social networks—a Bayesian approach,” Mach. Learn., vol. 82, no. 2, pp. 157–189, 2011.
[33] E. M. Airoldi, D. M. Blei, S. E. Fienberg, E. P. Xing, and T. Jaakkola, “Mixed membership stochastic block models for relational data with application to protein-protein interactions,” in Proceedings of the international biometrics society annual meeting, 2006, p. I5.
[34] P. W. Holland, K. B. Laskey, and S. Leinhardt, “Stochastic blockmodels: First steps,” Soc. Networks, vol. 5, no. 2, pp. 109–137, 1983.
[35] J. M. Hofman and C. H. Wiggins, “Bayesian approach to network modularity,” Phys. Rev. Lett., vol. 100, no. 25, p. 258701, 2008.
[36] D. M. Blei, A. Y. Ng, and M. I. Jordan, “Latent dirichlet allocation,” J. Mach. Learn. Res., vol. 3, pp. 993–1022, 2003.
[37] D. Li, B. He, Y. Ding, J. Tang, C. Sugimoto, Z. Qin, E. Yan, J. Li, and T. Dong, “Community-based topic modeling for social tagging,” in Proceedings of the 19th ACM international conference on Information and knowledge management, 2010, pp. 1565–1568.
[38] S. Wasserman, Social network analysis: Methods and applications, vol. 8. Cambridge university press, 1994.
[39] M. E. J. Newman, “The mathematics of networks,” new palgrave Encycl. Econ., vol. 2, pp. 1–12, 2008.
[40] Y. Gong and W. Xu, Machine learning for multimedia content analysis, vol. 30. Springer, 2007.
[41] W. Xu and Y. Gong, “Document clustering by concept factorization,” in Proceedings of the 27th annual international ACM SIGIR conference on Research and development in information retrieval, 2004, pp. 202–209.
[42] A. Lancichinetti, S. Fortunato, and J. Kertész, “Detecting the overlapping and hierarchical community structure in complex networks,” New J. Phys., vol. 11, no. 3, p. 33015, 2009.
[43] L. Azzopardi, M. Girolami, and K. van Risjbergen, “Investigating the relationship between language model perplexity and IR precision-recall measures,” in Proceedings of the 26th annual international ACM SIGIR conference on Research and development in informaion retrieval, 2003, pp. 369–370.
[44] N. Coccaro and D. Jurafsky, “Towards better integration of semantic predictors in statistical language modeling.,” in ICSLP, 1998.
[45] T. L. Griffiths and M. Steyvers, “Finding scientific topics,” Proc. Natl. Acad. Sci. U. S. A., vol. 101, no. Suppl 1, pp. 5228–5235, 2004.