TY - GEN
T1 - A boolean model in information retrieval for search engines
AU - Lashkari, Arash Habibi
AU - Mahdavi, Fereshteh
AU - Ghomi, Vahid
PY - 2009
Y1 - 2009
N2 - an information retrieval (IR) process begins when a user enters a query into the system. Queries are formal statements of information needs, for example search strings in web search engines. In IR a query does not uniquely identify a single object in the collection. Instead, several objects may match the query, perhaps with different degrees of relevancy. An object is an entity which keeps or stores information in a database. User queries are matched to objects stored in the database. Depending on the application the data objects may be, for example, text documents, images or videos. The documents themselves are not kept or stored directly in the IR system, but are instead represented in the system by document surrogates. Most IR systems compute a numeric score on how well each object in the database match the query, and rank the objects according to this value. The top ranking objects are then shown to the user. The process may then be iterated if the user wishes to refine the query. In this paper we try to explain IR methods and asses them from two view points and finally propose a simple method for ranking terms and documents on IR and implement the method and check the result.
AB - an information retrieval (IR) process begins when a user enters a query into the system. Queries are formal statements of information needs, for example search strings in web search engines. In IR a query does not uniquely identify a single object in the collection. Instead, several objects may match the query, perhaps with different degrees of relevancy. An object is an entity which keeps or stores information in a database. User queries are matched to objects stored in the database. Depending on the application the data objects may be, for example, text documents, images or videos. The documents themselves are not kept or stored directly in the IR system, but are instead represented in the system by document surrogates. Most IR systems compute a numeric score on how well each object in the database match the query, and rank the objects according to this value. The top ranking objects are then shown to the user. The process may then be iterated if the user wishes to refine the query. In this paper we try to explain IR methods and asses them from two view points and finally propose a simple method for ranking terms and documents on IR and implement the method and check the result.
UR - http://www.scopus.com/inward/record.url?scp=70349485136&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=70349485136&partnerID=8YFLogxK
U2 - 10.1109/ICIME.2009.101
DO - 10.1109/ICIME.2009.101
M3 - Conference contribution
AN - SCOPUS:70349485136
SN - 9780769535951
T3 - Proceedings - 2009 International Conference on Information Management and Engineering, ICIME 2009
SP - 385
EP - 389
BT - Proceedings - 2009 International Conference on Information Management and Engineering, ICIME 2009
T2 - 2009 International Conference on Information Management and Engineering, ICIME 2009
Y2 - 3 April 2009 through 5 April 2009
ER -