Inlämning av Examensarbete / Submission of Thesis

Jun Cui MCS-2009:28, pp. 53. COM/School of Computing, 2009.

The work

Författare / Author: Jun Cui
cj102xjtu@gmail.com
Titel / Title: Query Expansion Research and Application in Search Engine Based on Concepts Lattice
Abstrakt Abstract:

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.

Ämnesord / Subject: Datavetenskap - Computer Science\General

Nyckelord / Keywords: Formal concept analysis, Query expansion, Concept lattice

Publication info

Dokument id / Document id:
Program:/ Programme Datavetenskapligt program/Computer Science
Registreringsdatum / Date of registration: 09/24/2009
Uppsatstyp / Type of thesis: Masterarbete/Master's Thesis (120 credits)

Context

Handledare / Supervisor: Yang Liu, Guohua Bai
liuyang2006@gmail.com, gba@bth.se
Examinator / Examiner: Guohua Bai
Organisation / Organisation: Blekinge Institute of Technology
Institution / School: COM/School of Computing

+46 455 38 50 00

Files & Access

Bifogad uppsats fil(er) / Files attached: masterthesis.pdf (488 kB, öppnas i nytt fönster)