Proposal of Network Generation Model based on Latent Preference Topic
Authors: 
Ikuto Akayama, Yoshinori Hijikata, Toshiya Kuramochi, Nobuchika SakataAuthors Info & Claims
Article No.: 89, Pages 1 - 7
Abstract
People select whom to follow on social networking sites based on the topics that interest them. In this paper, we propose a new generation model for complex networks to mimic people's following behavior. In our proposed model, a node selects a target node to make a directed link based on the latent topic. We examine the features of the networks generated by our model through computer simulation. In the simulations, we calculate the average path length, clustering coefficient, and power exponent, which are representative evaluation indices of the network, and check whether they satisfy the properties of complex networks.
References
[1]
R. Albert and A.L. Barabási. 2002. Statistical mechanics of complex networks. Rev. Mod. Phys. 74, 1 (2002), 47--97.
[2]
A.L. Barabási and R. Albert. 1999. Emergence of Scaling in Random Networks. Science 286 (1999), 509--512.
[3]
A.L. Barabási, R. Albert, and H. Jeong. 1999. Mean-field theory for scale-free random networks. Physica A 272, 1 (1999), 173--187.
[4]
G. Bianconi and A.L. Barabási. 2001. Competition and multiscaling in evolving networks. Europhysics Letters (EPL) 54, 4 (2001), 436--442.
[5]
D.M. Blei, A.Y. Ng, and M.I. Jordan. 2003. Latent Dirichlet Allocation. Journal of Machine Learning Research 3 (2003), 993--1022.
[6]
Y. Cha and J. Cho. 2012. Social-network analysis using topic models. In Proceedings of the 35th international ACM SIGIR conference on Research and development in information retrieval (SIGIR '12). ACM Press, New York, NY, USA, 565--574.
[7]
P. Erdös and A. Rényi. 1960. On the Evolution of Random Graphs. PUBLICATION OF THE MATHEMATICAL INSTITUTE OF THE HUNGARIAN ACADEMY OF SCIENCES (1960), 17--61.
[8]
G. Fagiolo. 2007. Clustering in complex directed networks. Phys. Rev. E. 76, 2 (2007), 026107.
[9]
K. Henderson and T. Eliassi-Rad. 2009. Applying latent dirichlet allocation to group discovery in large graphs. In Proceedings of the 2009 ACM symposium on Applied Computing (SAC '09). ACM Press, New York, NY, USA, 1456--1461.
[10]
P. Holme and B. Kim. 2002. Growing scale-free networks with tunable clustering. Phys. Rev. E. 65, 2 (2002), 026107.
[11]
H. Kwak, C. Lee, H. Park, and S. Moon. 2010. What is Twitter, a social network or a news media?. In Proceedings of the 19th international conference on World wide web (WWW '10). ACM Press, New York, NY, USA, 591--600.
[12]
M.E.J. Newman. 2003. The Structure and Function of Complex Networks. SIAM Rev 45, 2 (2003), 167--256.
[13]
M.E.J. Newman and M. Girvan. 2004. Finding and evaluating community structure in networks. Phys. Rev. E. 69, 2 (2004), 026113.
[14]
H. Okamoto. 2011. Topic-Dependent Document Ranking: Citation Network Analysis by Analogy to Memory Retrieval in the Brain. In Artificial Neural Networks and Machine Learning ICANN 2011, T. Honkela, W. Duch, M. Girolami, and S. Kaski (Eds.). Vol. 6791. Springer, Berlin, Heidelberg, 371--378.
[15]
K. Shinoda, Y. Matsuo, and H. Nakashima. 2007. Emergence of global network property based on multi-agent voting model. In Proceedings of the 6th international joint conference on Autonomous agents and multiagent systems. ACM Press, New York, NY, USA, 1--8.
[16]
J. Travers and S. Milgram. 1969. An Experimental Study of the Small World Problem. Sociometry 32, 4 (1969), 425--443.
[17]
A. Vázquez. 2003. Growing network with local rules: Preferential attachment, clustering hierarchy, and degree correlations. Phys. Rev. E. 67, 5 (2003), 056104.
[18]
Duncan J. Watts and Steven H. Strogatz. 1998. Collective dynamics of small-world' networks. Nature 393, 6684 (1998), 440--442.
[19]
K. Yuta, N. Ono, and Y. Fujiwara. 2007. A Gap in the Community-Size Distribution of a Large-Scale Social Networking Site. (2007). arXiv:physics/0701168
Index Terms
- Proposal of Network Generation Model based on Latent Preference Topic
Recommendations
Social Network Analysis Based on Topic Model with Temporal Factor
On social networks, each message has many features where the interested topics and the actors sending and receiving topics are important features. Unlike the traditional approach, which views each message belonging to a topic, the topic model is based ...
Research on Multi-document Summarization Based on LDA Topic Model
IHMSC '14: Proceedings of the 2014 Sixth International Conference on Intelligent Human-Machine Systems and Cybernetics - Volume 02Compared with VSM (Vector Space Model) and graph-ranking models, LDA (Latent Dirichlet Allocation) Model can discover latent topics in the corpus and latent topics are beneficial to use sentence-ranking mechanisms to form a good summary. In the paper, ...
User-sentiment topic model: refining user's topics with sentiment information
MDS '12: Proceedings of the ACM SIGKDD Workshop on Mining Data SemanticsIn large social networks, users feel free to share their feelings about anything they are interested in and many research works have focused on modeling users' interests on social network for product recommendations or personal services. Unfortunately, ...
Comments
Please enable JavaScript to view thecomments powered by Disqus.Information & Contributors
Information
Published In
January 2018
628 pages
ISBN:9781450363853
DOI:10.1145/3164541
Copyright © 2018 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]
In-Cooperation
- SKKU: SUNGKYUNKWAN UNIVERSITY
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 05 January 2018
Check for updates
Author Tags
Qualifiers
- Research-article
- Research
- Refereed limited
Conference
IMCOM '18
IMCOM '18: The 12th International Conference on Ubiquitous Information Management and Communication
January 5 - 7, 2018
Langkawi, Malaysia
Acceptance Rates
IMCOM '18 Paper Acceptance Rate 100 of 255 submissions, 39%;
Overall Acceptance Rate 213 of 621 submissions, 34%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 45Total Downloads
- Downloads (Last 12 months)1
- Downloads (Last 6 weeks)0
Reflects downloads up to 04 Oct 2024
Other Metrics
Citations
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in