The inverted index data structure is a central component of a typical search engine indexing algorithm. A goal of a search engine implementation is to optimize the speed of the query: find the documents where word X occurs.
A full inverted index is a database index which maps keys to locations. An inverted index maps keys to locations which are file specifiers, while a full inverted index is a multimap from keys to location pairs
.
Once an inverted index is created for a document collection, a retrieval system can answer a keyword query quickly by looking up which documents contain the query keywords.
Ways of dimensionality Reduction for Text ...
 See also: Dimensionality reduction, Dimensionality, Mapping, Data mining, Image processing
  
|
RSS
