{"_id":"QELYxjj8dw9BaFAW6","bibbaseid":"fuhr-modelsininformationretrieval-2001","author_short":["Fuhr, N."],"bibdata":{"bibtype":"incollection","type":"incollection","address":"Heidelberg et al.","title":"Models in Information Retrieval","abstract":"Retrieval models form the theoretical basis for computing the answer to a query. They differ not only in the syntax and expressiveness of the query language, but also in the representation of the documents. Following Rijsbergen's approach of regarding IR as uncertain inference, we can distinguish models according to the expressiveness of the underlying logic and the way uncertainty is handled. Classical retrieval models are based on propositional logic. Boolean retrieval ignores uncertainty, whereas fuzzy retrieval uses fuzzy logic for this purpose, and probabilistic retrieval is based on probability theory. In the vector space model, documents and queries are represented as vectors in a vector space spanned by the index terms, and uncertainty is modelled by considering geometric similarity. Probabilistic models make assumptions about the distribution of terms in relevant and nonrelevant documents in order to estimate the probability of relevance of a document for a query. Language models compute the probability that the query is generated from a document. For IR applications dealing not only with texts, but also with multimedia or factual data, propositional logic is not sufficient. Therefore, advanced IR models use restricted forms of predicate logic as basis. Terminological/description logics are rooted in semantic networks and terminological languages like e.g. KL-ONE. Datalog uses function-free horn clauses. Probabilistic versions of both approaches are able to cope with the intrinsic uncertainty of IR.","booktitle":"Lectures in Information Retrieval","publisher":"Springer","author":[{"propositions":[],"lastnames":["Fuhr"],"firstnames":["Norbert"],"suffixes":[]}],"editor":[{"propositions":[],"lastnames":["Agosti"],"firstnames":["M"],"suffixes":[]},{"propositions":[],"lastnames":["Crestani"],"firstnames":["F"],"suffixes":[]},{"propositions":[],"lastnames":["Pasi"],"firstnames":["G"],"suffixes":[]}],"year":"2001","pages":"21–50","bibtex":"@incollection{Fuhr:00a,\n\taddress = {Heidelberg et al.},\n\ttitle = {Models in {Information} {Retrieval}},\n\tabstract = {Retrieval models form the theoretical basis for\ncomputing the answer to a query. They differ not only\nin the syntax and expressiveness of the query language,\nbut also in the representation of the documents.\nFollowing Rijsbergen's approach of regarding IR as\nuncertain inference, we can distinguish models\naccording to the expressiveness of the underlying logic\nand the way uncertainty is handled. Classical retrieval\nmodels are based on propositional logic. Boolean\nretrieval ignores uncertainty, whereas fuzzy retrieval\nuses fuzzy logic for this purpose, and probabilistic\nretrieval is based on probability theory. In the vector\nspace model, documents and queries are represented as\nvectors in a vector space spanned by the index terms,\nand uncertainty is modelled by considering geometric\nsimilarity. Probabilistic models make assumptions about\nthe distribution of terms in relevant and nonrelevant\ndocuments in order to estimate the probability of\nrelevance of a document for a query. Language models\ncompute the probability that the query is generated\nfrom a document. For IR applications dealing not only\nwith texts, but also with multimedia or factual data,\npropositional logic is not sufficient. Therefore,\nadvanced IR models use restricted forms of predicate\nlogic as basis. Terminological/description logics are\nrooted in semantic networks and terminological\nlanguages like e.g. KL-ONE. Datalog uses function-free\nhorn clauses. Probabilistic versions of both approaches\nare able to cope with the intrinsic uncertainty of IR.},\n\tbooktitle = {Lectures in {Information} {Retrieval}},\n\tpublisher = {Springer},\n\tauthor = {Fuhr, Norbert},\n\teditor = {Agosti, M and Crestani, F and Pasi, G},\n\tyear = {2001},\n\tpages = {21--50},\n}\n\n","author_short":["Fuhr, N."],"editor_short":["Agosti, M","Crestani, F","Pasi, G"],"key":"Fuhr:00a","id":"Fuhr:00a","bibbaseid":"fuhr-modelsininformationretrieval-2001","role":"author","urls":{},"metadata":{"authorlinks":{}},"html":""},"bibtype":"incollection","biburl":"https://bibbase.org/zotero/ifromm","dataSources":["N4kJAiLiJ7kxfNsoh"],"keywords":[],"search_terms":["models","information","retrieval","fuhr"],"title":"Models in Information Retrieval","year":2001}