Skip to main content

A Document Clustering Algorithm Based on Semi-constrained Hierarchical Latent Dirichlet Allocation

  • Conference paper
Knowledge Science, Engineering and Management (KSEM 2014)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 8793))

Abstract

The bag-of-words model used for some clustering methods is often unsatisfactory as it ignores the relationship between the important terms that do not cooccur literally. In this paper, a document clustering algorithm based on semi-constrained Hierarchical Latent Dirichlet Allocation (HLDA) is proposed, the frequent itemsets is considered as the input of this algorithm, some keywords are extracted as the prior knowledge from the original corpus and each keyword is associated with an internal node, which is thought as a constrained node and adding constraint to the path sampling processing. Experimental results show that the semi-constrained HLDA algorithm outperforms the LDA, HLDA and semi-constrained LDA algorithms.

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 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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Zhao, Y., Karypis, G.: Empirical and Theoretical Comparisons of Selected Criterion Functions for Document Clustering. Machine Learning 55(3), 311–331 (2004)

    Article  MATH  Google Scholar 

  2. Merwe, V.D., Engelbrecht, A.P.: Data Clustering Using Particle Swarm Optimization. In: 2003 IEEE Congress on Evolutionary Computation, pp. 215–220. IEEE Press, New York (2003)

    Google Scholar 

  3. Jain, A.K., Murty, M.N., Flynn, P.J.: Data Clustering: A Review. ACM Computing Survey 31(3), 264–323 (1999)

    Article  Google Scholar 

  4. David, B., Griffites, T., Tennbaum, J.: Hierarchical Topic Models and the Nested Chinese Restaurant Process. In: Advances in Neural Information Processing Systems, vol. 16, pp. 106–113 (2004)

    Google Scholar 

  5. Willett, P.: Document Clustering Using An Inverted File Approach. Journal of Information Science 2, 223–231 (1990)

    Article  Google Scholar 

  6. Liu, X., Gong, Y.: Document Clustering with Cluster Refinement and Model Selection Capabilities. In: 25th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, pp. 117–122. ACM Press, New York (2002)

    Google Scholar 

  7. Deerwester, S.C., Dumais, S.T., Landauer, T.K.: Indexing by Latent Semantic Analysis. Journal of the American Society for Information Science 41(6), 391–407 (1990)

    Article  Google Scholar 

  8. Chan, P.K., Schlag, D.F., Zien, J.Y.: Spectral K-way Ratio-cut Partitioning An Clustering. IEEE Council on Electronic Design Automation 13(9), 1088–1096 (1994)

    Google Scholar 

  9. Shi, J., Malik, J.: Normalized Cuts and Image Segmentation. IEEE Transactions on Pattern Analysis and Machine Intelligence 22(8), 888–905 (2000)

    Article  Google Scholar 

  10. Ding, C., He, X., Zha, H., Simon, H.D.: A Min-max Cut Algorithm for Graph Partitioning and Data Clustering. In: 2001 IEEE International Conference on Data Mining, pp. 107–114. IEEE Press, New York (2001)

    Chapter  Google Scholar 

  11. David, M.B., Andrew, Y.N., Michael, I.J.: Latent Dirichlet Allocation. Journal of Machine Learning 3, 993–1022 (2003)

    MATH  Google Scholar 

  12. Teh, Y.W., Jordan, M.I., David, M.B.: Hierarchical Dirichlet Processes. Journal of the American Statistical Association 101(476), 1566–1581 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  13. Mao, X.L., Ming, Z.Y., Chua, T.S., Li, S., Yan, H.F., Li, X.M.: SSHLDA: A Semi-supervised Hierarchical Topic Model. In: 2012 Joint Conference on Empirical Methods in Natural Language Processing and Computational Natural Language Learning, pp. 800–809. ACL Press, Stroudsburg (2012)

    Google Scholar 

  14. Han, J.W., Pei, J., Yin, Y.W., Mao, R.Y.: Mining Frequent Patterns without Candidate Generation. In: 2000 ACM SIGMOD International Conference on Management of Data, pp. 1–12. ACM Press, New York (2000)

    Chapter  Google Scholar 

  15. Danushka, B., Yutaka, M., Mitsuru, I.: Measuring Semantic Similarity between Words Using Web Search Engines. In: 16th International Conference on World Wide Web, pp. 757–766. ACM Press, New York (2007)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Xu, J., Zhou, S., Qiu, L., Liu, S., Li, P. (2014). A Document Clustering Algorithm Based on Semi-constrained Hierarchical Latent Dirichlet Allocation. In: Buchmann, R., Kifor, C.V., Yu, J. (eds) Knowledge Science, Engineering and Management. KSEM 2014. Lecture Notes in Computer Science(), vol 8793. Springer, Cham. https://doi.org/10.1007/978-3-319-12096-6_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-12096-6_5

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-12095-9

  • Online ISBN: 978-3-319-12096-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics