Skip to main content

WalkToTopics: Inferring Topic Relations from a Feature Learning Perspective

  • Conference paper
  • First Online:
Book cover Knowledge Science, Engineering and Management (KSEM 2018)

Abstract

The increasing number of documents is leading to more and more topics nowadays. Understanding the relations between different topics evolved in documents become more important and challenging for users. Although many topic models have been devoted to analyzing topics, the study of topics’ potential relevances is still largely limited by various difficulties. Hence, we introduce WalkToTopics, an unsupervised topic mining and analysis model, for inferring potential relevances between different topics. Relying on an advanced feature learning technique to automatically summarize topic’s neighborhood features, WalkToTopics can reveal latent relations between different topics. Compared to existing approaches, our model is able to predict the relationship between any two individual topics of documents, and it does not require any prior knowledge of the existing topics’ relations and dictionaries. Moreover, WalkToTopics is a general model that also can work on exploring topic clusters or extracting sentiments, and can be applied to potential applications, such as ideas tracking and opinion summarization. Finally, we conducted two studies for common users and experts which both quantitatively and qualitatively demonstrate the effectiveness of WalkToTopics in helping users’ understanding of hidden relevances between topics on social media.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Blair, S.J., Bi, Y., Mulvenna, M.D.: Increasing topic coherence by aggregating topic models. In: Lehner, F., Fteimi, N. (eds.) KSEM 2016. LNCS, vol. 9983, pp. 69–81. Springer, Cham (2016). https://doi.org/10.1007/978-3-319-47650-6_6

    Chapter  Google Scholar 

  2. Blei, D.M., Lafferty, J.D.: Dynamic topic models. In: Proceedings of the 23rd International Conference on Machine Learning, pp. 113–120. ACM (2006)

    Google Scholar 

  3. Blei, D.M., Ng, A.Y., Jordan, M.I.: Latent Dirichlet allocation. J. Mach. Learn. Res. 3(Jan), 993–1022 (2003)

    MATH  Google Scholar 

  4. Cumming, G.: Understanding the New Statistics: Effect Sizes, Confidence Intervals, and Meta-Analysis. Routledge, Abingdon (2013)

    Google Scholar 

  5. Hu, Y., Xu, X., Li, L.: Analyzing topic-sentiment and topic evolution over time from social media. In: Lehner, F., Fteimi, N. (eds.) KSEM 2016. LNCS, vol. 9983, pp. 97–109. Springer, Cham (2016). https://doi.org/10.1007/978-3-319-47650-6_8

    Chapter  Google Scholar 

  6. Lin, C., He, Y., Everson, R., Ruger, S.: Weakly supervised joint sentiment-topic detection from text. IEEE Trans. Knowl. Data Eng. 24(6), 1134–1145 (2012)

    Article  Google Scholar 

  7. Mcauliffe, J.D., Blei, D.M.: Supervised topic models. In: Advances in Neural Information Processing Systems, pp. 121–128 (2008)

    Google Scholar 

  8. Mei, Q., Ling, X., Wondra, M., Su, H., Zhai, C.: Topic sentiment mixture: modeling facets and opinions in weblogs. In: Proceedings of the 16th international conference on World Wide Web, pp. 171–180. ACM (2007)

    Google Scholar 

  9. Newman, M.E., Girvan, M.: Finding and evaluating community structure in networks. Phys. Rev. E 69(2), 026113 (2004)

    Article  Google Scholar 

  10. Noack, A.: Modularity clustering is force-directed layout. Phys. Rev. E 79(2), 026102 (2009)

    Article  Google Scholar 

  11. Porter, M.: An algorithm for suffix stripping. Program 40(3), 211–218 (1980)

    Article  Google Scholar 

  12. Salton, G., McGill, M.J.: Introduction to Modern Information Retrieval. McGraw-Hill, Inc., New York (1983)

    MATH  Google Scholar 

  13. Walker, A.J.: An efficient method for generating discrete random variables with general distributions. ACM Trans. Math. Softw. 3(3), 253–256 (1977)

    Article  Google Scholar 

  14. Wang, X., McCallum, A.: Topics over time: a non-Markov continuous-time model of topical trends. In: Proceedings of the 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 424–433. ACM (2006)

    Google Scholar 

Download references

Acknowledgement

We thank all the anonymous reviewers for their insightful comments. This work is partially supported by National Natural Science Foundation of China (91546203), the Key Science Technology Project of Shandong Province (2015GGX101046), the Shandong Provincial Natural Science Foundation (ZR2014FM020), Major Scientific and Technological Innovation Projects of Shandong Province, China (No. 2017CXGC0704) and Fundamental Research Fund of Shandong Academy of Sciences (No. 2018:12-16).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Zeyu Wang .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Gao, L., Wang, Z., Guo, S. (2018). WalkToTopics: Inferring Topic Relations from a Feature Learning Perspective. In: Liu, W., Giunchiglia, F., Yang, B. (eds) Knowledge Science, Engineering and Management. KSEM 2018. Lecture Notes in Computer Science(), vol 11061. Springer, Cham. https://doi.org/10.1007/978-3-319-99365-2_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-99365-2_4

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-99364-5

  • Online ISBN: 978-3-319-99365-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics