Archives
/
papers-we-love_papers-we-love
mirror of https://github.com/papers-we-love/papers-we-love
1
0
Fork 0
Code Issues Projects Releases Wiki Activity
You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
Branches Tags
${ item.name }
Create tag ${ searchTerm }
Create branch ${ searchTerm }
from 'd2acf0fc3b'
${ noResults }
papers-we-love_papers-we-love/information_retrieval
History
Zachary Jones d2acf0fc3b
Update to all READMEs for hosted content 		9 years ago
..
README.md Update to all READMEs for hosted content 9 years ago
graph_of_word_and_tw_idf.pdf added tw-idf paper and pdf 10 years ago

README.md

Information Retrieval

Information retrieval is the activity of obtaining information resources relevant to an information need from a collection of information resources. (Says Wikipedia).

The included documents are

  • 📜 Graph of Word and TW-IDF - Francois Rousseau & Michalis Vazirgiannis

    The traditional IR system stores term-specific statistics (typically a term's frequency in each document - which we call TF) in an index. Such a model ignores dependencies between terms and considers a document's terms to occur independently of each other (and is aptly called the bag-of-words model). In this paper the authors use a statistic that uses a graph representation of a document to encode dependencies between terms and replace the TF statistic with a new TW statistic based on the graph constructed and achieve significantly better results that popular existing models. This paper won a honorable mention at CIKM 2013.

  • The Anatomy of a Large-Scale Hypertextual Web Search Engine