Performance evaluation and optimization of math-similarity search
From MaRDI portal
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.
Recommendations
Cites work
Cited in
(5)- Part-of-math tagging and applications
- Evaluation of Static/Dynamic Cache for Similarity Search Engines
- Structural similarity search for mathematics retrieval
- OpenMP implementation of parallel longest common subsequence algorithm for mathematical expression retrieval
- An approach to math-similarity search
This page was built for publication: Performance evaluation and optimization of math-similarity search
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3453118)