this is for holding javascript data
Mircea Trifan edited Related Work.tex
about 10 years ago
Commit id: f8d4c82d83ef439dc943448af49dddd074f4a897
deletions | additions
diff --git a/Related Work.tex b/Related Work.tex
index 8955c01..b673082 100644
--- a/Related Work.tex
+++ b/Related Work.tex
...
\section{Related Work}
\cite{Costa_2010} describes how the Discret Fourier Transform (DFT) can be used for Information Retrieval (IR). A query is represented as a sum of individual query terms represented as sinusoidal curves. The query function is transformed in the frequency domain through DFT resulting a spectrum. Each document is considered to be a set of filters that filter the query spectrum resulting a power that ranks the documents. The more the power of the spectrum is decreased the higher the document ranks. The model is named Least Spectral Power Ranking (LSPR).
The model can be used for recommender systems.
\cite{Caputo_2009}