Skip to main content

Improving Document Similarity Calculation Using Cosine-Similarity Graphs

  • Conference paper
  • First Online:
Advanced Information Networking and Applications (AINA 2019)

Abstract

Data mining information using various indices and determining candidates that can be judged as having the same tendency based on similarity between documents is common. The accuracy of similarity largely depends on a sufficient amount of data and requires advanced analysis using natural language processing. In this paper, we present an approach for filtering based on the cosine similarity graph and clustering between candidates. For filtering candidates, we focus on the inflection point of the graphs when plotting by sorting similarities in descending order. By clustering among higher similarities, we aim at filtering candidates that cannot be removed without analyzing advanced natural language processing. The proposed method was applied to movie reviews and sightseeing location reviews written in Japanese. Although this study is a work in progress, it shows that candidates can be recommended without having to manually apply natural language processing, such as preparing stopwords for each category.

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 169.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.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

Notes

  1. 1.

    https://www.imdb.com/title/tt2527336.

  2. 2.

    https://www.imdb.com/title/tt2488496/.

  3. 3.

    https://www.imdb.com/title/tt3748528/.

  4. 4.

    https://www.imdb.com/title/tt1049413/.

  5. 5.

    https://www.imdb.com/title/tt2096673/.

  6. 6.

    https://www.imdb.com/title/tt0499549/.

  7. 7.

    https://www.imdb.com/title/tt2380307.

  8. 8.

    https://www.imdb.com/title/tt4088268.

  9. 9.

    https://www.imdb.com/title/tt7914416/.

References

  1. Adomavicius, G., Tuzhilin, A.: Toward the next generation of recommender systems: a survey of the state-of-the-art and possible extensions. IEEE Trans. Knowl. Data Eng. 17(6), 734–749 (2005)

    Article  Google Scholar 

  2. Le, Q., Mikolov, T.: Distributed representations of sentences and documents. In: Proceedings of the 31st International Conference on International Conference on Machine Learning, ICML 2014, vol. 32, pp. II–1188–II–1196 (2014)

    Google Scholar 

  3. MacQueen, J.: Some methods for classification and analysis of multivariate observations. In: Proceedings of the Fifth Berkeley Symposium on Mathematical Statistics and Probability, Volume 1: Statistics, pp. 281–297 (1967)

    Google Scholar 

  4. Töscher, A., Jahrer, M., Legenstein, R.: Improved neighborhood-based algorithms for large-scale recommender systems. In: Proceedings of the 2nd KDD Workshop on Large-Scale Recommender Systems and the Netflix Prize Competition, NETFLIX 2008, pp. 4:1–4:6 (2008)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Yasunao Takano .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Takano, Y. et al. (2020). Improving Document Similarity Calculation Using Cosine-Similarity Graphs. In: Barolli, L., Takizawa, M., Xhafa, F., Enokido, T. (eds) Advanced Information Networking and Applications. AINA 2019. Advances in Intelligent Systems and Computing, vol 926. Springer, Cham. https://doi.org/10.1007/978-3-030-15032-7_43

Download citation

Publish with us

Policies and ethics