Change search
ReferencesLink to record
Permanent link

Direct link
Query Expansion Research and Application in Search Engine Based on Concepts Lattice
Blekinge Institute of Technology, School of Computing.
2009 (English)Independent thesis Advanced level (degree of Master (Two Years))Student thesis
Abstract [en]

Formal concept analysis is increasingly applied to query expansion and data mining problems. In this paper I analyze and compare the current concept lattice construction algorithm, and choose iPred and Border algorithms to adapt for query expansion. After I adapt two concept lattice construction algorithms, I apply these four algorithms on one query expansion prototype system. The calculation time for four algorithms are recorded and analyzed. The result of adapted algorithms is good. Moreover I find the efficiency of concept lattice construction is not consistent with complex analysis result. In stead, it is high depend on the structure of data set, which is data source of concept lattice.

Place, publisher, year, edition, pages
2009. , 53 p.
Keyword [en]
Formal concept analysis, Query expansion, Concept lattice
National Category
Computer Science
URN: urn:nbn:se:bth-5762Local ID: diva2:833162
Available from: 2015-04-22 Created: 2009-09-24 Last updated: 2015-06-30Bibliographically approved

Open Access in DiVA

fulltext(477 kB)28 downloads
File information
File name FULLTEXT01.pdfFile size 477 kBChecksum SHA-512
Type fulltextMimetype application/pdf

By organisation
School of Computing
Computer Science

Search outside of DiVA

GoogleGoogle Scholar
Total: 28 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Total: 23 hits
ReferencesLink to record
Permanent link

Direct link