Please use this identifier to cite or link to this item: https://hdl.handle.net/10356/97798
Title: A lattice-based approach for mathematical search using Formal Concept Analysis
Authors: Nguyen, Tam T.
Hui, Siu Cheung
Chang, Kuiyu
Keywords: DRNTU::Engineering::Computer science and engineering::Mathematics of computing
Issue Date: 2011
Series/Report no.: Expert systems with applications
Abstract: Mathematical (or math) search is a challenging problem as math expressions are highly symbolic and structured. The vast majority of math search systems that adopt conventional text retrieval techniques are ineffective in searching math expressions. In this paper, we propose a lattice-based approach for math search. The proposed approach is based on Formal Concept Analysis (FCA), which is a powerful data analysis technique. In the proposed approach, math expressions are first converted into the corresponding MathML representation, from which math features are extracted. Next, the extracted features are used to construct a mathematical concept lattice. At the query time, the query expression is processed and inserted into the mathematical concept lattice, and the relevant expressions are retrieved and ranked. Finally, search results can be visualized and nevigated via a dynamic graph, thanks to the lattice structure. The proposed lattice-based math search approach is benchmarked against a conventional best match retrieval technique and results show it to be almost 10% better in terms of F1 for the top 30 retrieved results.
URI: https://hdl.handle.net/10356/97798
http://hdl.handle.net/10220/11240
DOI: 10.1016/j.eswa.2011.11.085
Schools: School of Computer Engineering 
Rights: © 2011 Elsevier Ltd.
Fulltext Permission: none
Fulltext Availability: No Fulltext
Appears in Collections:SCSE Journal Articles

SCOPUSTM   
Citations 20

28
Updated on May 6, 2025

Web of ScienceTM
Citations 10

22
Updated on Oct 25, 2023

Page view(s) 20

732
Updated on May 4, 2025

Google ScholarTM

Check

Altmetric


Plumx

Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.