Topic Detection and Tracking Method for Tibetan Network

Abstract:

Internet has become an important tool to gain information; how to effectively detect hot topics from a lot of network information sources, e.g., Tibetan network, seems to be an urgent issue. Traditional hot topic is mainly based on the number of comments to get and the topic contents are usually not considered. In this letter, we study the approach of content-based relevance, i.e., based on user browsing behavior and the topic attention degree to discover the hot topic. And use the complex network theory to analyze the tracking model.

• Periodical: Advanced Materials Research (Volumes 860-863)
• Pages: 2914-2917
• DOI: https://doi.org/10.4028/www.scientific.net/AMR.860-863.2914
• Online since: December 2013
• Authors: Jing Wei Deng, Kai Ying Deng*, Ying Xing Li
• Keywords: Complex Network, Random Walk Model, Topic Detection, Tracking

References

[1] S. Wasserman and K. Faust, Social Network Analysis, Cambridge University Press, Cambridge, UK, (1994).

[2] J. Scott, Social Network Analysis: A Handbook, 2nd ed., Sage, London, (2000).

[3] R. Q. Su, W. X. Wang and Y. C. Lai. Detecting hidden nodes in complex networks from time series. Physical review E 85, 065201(R) (2012) 1-4.

[4] Newman M E J. The structure and function of complex networks [J]. SIAM, (2003), 45(2): 167-256.

[5] Changki Lee, Gary Geunbae Lee, Myunggil Jang. Dependency structure language model for topic detection and tracking. Information Processing and Management, (2007), 43, 1249-1259.

DOI: 10.1016/j.ipm.2006.02.007

[6] Bun K. K, Ishizuka M. Topic Extraction from News Archive Using TF*PDF Algorithm [A]. The Third International Conference on Web Information Systems Engineering (WISE'00), Singapore, (2002). 73.

DOI: 10.1109/wise.2002.1181645

[7] Liang T. P, Lai H.J. Discovering User Interests form Web Browsing Behavior: An Application to Internet News Services [A]. Proceeding of the 35th Hawaii International Conference on System Sciences, (2002).

DOI: 10.1109/hicss.2002.994214

[8] Kamvar, S. D., Haveliwala, T. H. and Golub, G. H. Adaptive methods for the computation of PageRank. Linear Algebra Appl., (2004), 386, 51-65.

DOI: 10.1016/j.laa.2003.12.008

[9] Kim, S. J. and Lee, S. H. An improved computation of the PageRank algorithm, Proceeding of the European Conference on Information Retrieval, (2002), 73-85.

[10] Sun, H. and Wei, Y. M. A note on the PageRank algorithm, Applied Mathematics and Computation, (2006), 179, 799-806.

DOI: 10.1016/j.amc.2005.11.120

[11] S. N. Dorogovtsev, F. F. Mendes and A. N. Samukhin. How to generate a random growing network. Cond–mat/ 0112143, (2001), 1-2.

[12] L. Congnan, L. Yanjun, Chung S. M. Text document clustering based on neighbors[J]. Data and Knowledge Engineering, (2009), 68 (11): 1271-1288.

DOI: 10.1016/j.datak.2009.06.007