Skip to main content

Keywords Popularity Analysis Based on Hidden Markov Model

  • Conference paper
  • First Online:
Human Centered Computing (HCC 2016)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 9567))

Included in the following conference series:

  • 1477 Accesses

Abstract

This paper first analyzes the existing methods for identifying popular keywords. By studying the methods on how to define the popular keywords with their occurrence frequency, a new approach to analyze the keyword popularity will be proposed. The paper first built a new model based on the Hidden Markov Model, then introduced several parameters who impacts the feature of the model and described how the model works. Using the Stirling formula and the Viterbi algorithm to simplify the calculation. Adjusting the model’s parameters by comparing the experimental results and the output of the system. Finally, obtained a higher accuracy, effective keyword popularity analysis system.

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 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. Kleinberg, J.: Bursty and hierarchical structure in streams (2001)

    Google Scholar 

  2. Zhou, S., ShiQian, X., ChengYi, P.: Probability theory and mathematical statistics, pp. 32–42, 149–172 (2011)

    Google Scholar 

  3. Allan, J., Papka, R., Lavrenko, V.: On-line new event detection and tracking. In: Proceedings of SIGIR International Conference Information Retrieval (1998)

    Google Scholar 

  4. Rabiner, L.R.: A tutorial on hidden markov models and selected applications in speech recognition. Proc. IEEE 77(2), 257–286 (1989)

    Article  Google Scholar 

  5. Rabiner, L.R., Juang, B.H.: An introduction to HMMs. IEEE ASSP Mag. 3(1), 4–16 (1986)

    Article  Google Scholar 

  6. Viterbi, A.J.: Error bounds for convolutional codes and an asymptotically optimum decoding algorithm. IEEE Trans. Inf. Theory 13(2), 260–269 (1967)

    Article  MATH  Google Scholar 

  7. Yang, Y., Ault, T., Pierce, T., Lattimer, C.W.: Improving text categorization methods for event tracking. In: Proceedings of SIGIR International Conference Information Retrieval (2000)

    Google Scholar 

  8. Li, Y.-C.: A note on an identity of the gamma function and Stirling’s formula. Real Anal. Exch. 32(1), 267–272 (2006/2007)

    Google Scholar 

Download references

Acknowledgement

This work was supported by the open project of Science and Technology on Information Transmission and Dissemination in Communication Networks Laboratory (ITD-U14002 /KX142600009).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Liang Xue .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this paper

Cite this paper

Xue, L., Wang, Z., Zhang, W., Zhang, H. (2016). Keywords Popularity Analysis Based on Hidden Markov Model. In: Zu, Q., Hu, B. (eds) Human Centered Computing. HCC 2016. Lecture Notes in Computer Science(), vol 9567. Springer, Cham. https://doi.org/10.1007/978-3-319-31854-7_43

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-31854-7_43

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-31853-0

  • Online ISBN: 978-3-319-31854-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics