Skip to main content

Performance Evaluation and Optimization of Math-Similarity Search

  • Conference paper
  • First Online:

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

Abstract

Similarity search in math is to find mathematical expressions that are similar to a user’s query. We conceptualized the similarity factors between mathematical expressions, and proposed an approach to math similarity search (MSS) by defining metrics based on those similarity factors [11]. Our preliminary implementation indicated the advantage of MSS compared to non-similarity based search. In order to more effectively and efficiently search similar math expressions, MSS is further optimized. This paper focuses on performance evaluation and optimization of MSS. Our results show that the proposed optimization process significantly improved the performance of MSS with respect to both relevance ranking and recall.

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

Buying options

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

Learn about institutional subscriptions

References

  1. Bar-Ilan, J.: Comparing rankings of search results on the web. Inf. Process. Manag. 41, 1511–1519 (2005). Elsevier

    Article  Google Scholar 

  2. The Digital Library of Mathematical Functions (DLMF), the National Institute of Standards and Technology (NIST). http://dlmf.nist.gov/

  3. Fagin, R., Kumar, R., Sivakumar, D.: Comparing top k lists. ACM-SIAM J. Discrete Math. 17(1), 134–160 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  4. Hartmann, W.: Signals, Sound, and Sensation. Springer, New York (1997)

    Google Scholar 

  5. Hawking, D., Craswell, N., Bailey, P., Griffiths, K.: Measuring search engine quality. Inf. Retr. 4, 33–59 (2001). Springer Netherlands

    Article  MATH  Google Scholar 

  6. Kendall, M.: Rank Correlation Methods. Hafner Publishing Co., New York (1955)

    MATH  Google Scholar 

  7. The 11th National Institute of Informatics Testbeds and Community for Information Access Research Workshop (2013–2014). http://ntcir-math.nii.ac.jp/

  8. An optional free subtask of the NTCIR-11 Math-2 Task (2014). http://ntcir11-wmc.nii.ac.jp

  9. Spearman, C.: The proof and measurement of association between two things. Am. J. Psychol. 15, 72–101 (1904)

    Article  Google Scholar 

  10. Vaughan, L.: New measurements for search engine evaluation proposed and tested. Inf. Process. Manag. 40(4), 677–691 (2004). Elsevier

    Article  MATH  Google Scholar 

  11. Zhang, Q., Youssef, A.: An approach to math-similarity search. In: Watt, S.M., Davenport, J.H., Sexton, A.P., Sojka, P., Urban, J. (eds.) CICM 2014. LNCS, vol. 8543, pp. 404–418. Springer, Heidelberg (2014)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Qun Zhang .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Zhang, Q., Youssef, A. (2015). Performance Evaluation and Optimization of Math-Similarity Search. In: Kerber, M., Carette, J., Kaliszyk, C., Rabe, F., Sorge, V. (eds) Intelligent Computer Mathematics. CICM 2015. Lecture Notes in Computer Science(), vol 9150. Springer, Cham. https://doi.org/10.1007/978-3-319-20615-8_16

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-20615-8_16

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-20614-1

  • Online ISBN: 978-3-319-20615-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics