A Boolean Model in information retrieval for search engines

• Main Authors: Lashkari, A.H., Mahdavi, F., Ghomi, V.
• Format: Conference or Workshop Item
• Published: 2009
• Subjects: QA75 Electronic computers. Computer science
• Online Access: http://eprints.um.edu.my/2283/; http://apps.webofknowledge.com/full_record.do?product=WOS&search_mode=Refine&qid=2&SID=Z2BBHmNGL5fBoDkL6fD&page=16&doc=152&cacheurlFromRightClick=no
• Institution: Universiti Malaya

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.