25,330 Hits in 6.1 sec

Comparison and Evaluation of Information Retrieval Models

2018 VFAST Transactions on Software Engineering  
For every aspect IR is being used in there are different models being used in them.  ...  There are so many models in so many applications,each having some relation to one another.In this paper we will evaluate and compare various IR model techniques and algorithms and see which model excels  ...  (if a document is missing even one word of the query it is not retrieved). Vector ModelGeneralized Vector Model  Latent Semantic Indexing Model 2. Related Work 2.1.Set-Theoretic 2.1.1.  ... 
doi:10.21015/vtse.v13i1.496 fatcat:ojfklng6frgxdd7vmopsmfj5vy

Latent semantic indexing model for Boolean query formulation (poster session)

Dae-Ho Baek, HeuiSeok Lim, Hae-Chang Rim
2000 Proceedings of the 23rd annual international ACM SIGIR conference on Research and development in information retrieval - SIGIR '00  
A new model named Boolean Latent Semantic Indexing model based on the Singular Value Decomposition and Boolean query formulation is introduced.  ...  While the Singular Value Decomposition alleviates the problems of lexical matching in the traditional information retrieval model, Boolean query formulation can help users to make precise representation  ...  Conclusions We have proposed a new model called Boolean LSI model for information retrieval. This new model allows one to combine Boolean query formulation with characteristics of the LSI model.  ... 
doi:10.1145/345508.345612 dblp:conf/sigir/BaekLR00 fatcat:ugiuwi4zrjco3ps3hwnvbt3dhi

Automatic boolean query suggestion for professional search

Youngho Kim, Jangwon Seo, W. Bruce Croft
2011 Proceedings of the 34th international ACM SIGIR conference on Research and development in Information - SIGIR '11  
Recent surveys have also verified that professional searchers continue to have a strong preference for Boolean queries because they provide a record of what documents were searched.  ...  Compared with a recent effective query generation system, we demonstrate that our technique is effective and general.  ...  Boolean Query Ranking To select a reasonable number of effective queries from a pool of generated Boolean queries, we propose a Boolean query ranking model and introduce features for the model.  ... 
doi:10.1145/2009916.2010026 dblp:conf/sigir/KimSC11 fatcat:nmiyrne52bhhlmwppk32dh5lvm

Some research problems in automatic information retrieval

G. Salton
1983 Proceedings of the 6th annual international ACM SIGIR conference on Research and development in information retrieval - SIGIR '83  
query processing techniques.  ...  Certain recent advances in information retrieval research are then mentioned, including the formulation of new probabilistic retrieval models, and the development of automatic document analysis and Boolean  ...  This model can be used directly to rank the documents for retrieval purposes and also to derive optimum weighting functions for query terms, known as term ~ weights.  ... 
doi:10.1145/511793.511830 dblp:conf/sigir/Salton83 fatcat:wx747m4mnrg23auh4tdxtr2sba

Evaluation of an inference network-based retrieval model

Howard Turtle, W. Bruce Croft
1991 ACM Transactions on Information Systems  
A network-based retrieval model is described and compared to conventional probabilistic and Boolean models.  ...  The performance of a retrieval system based on the inference network model is evaluated and compared to performance with conventional retrieval models,  ...  For tf, idf, or tf. idf weights a weighted-sum link matrix is used. Query concept nodes.  ... 
doi:10.1145/125187.125188 fatcat:byqcaa2zljcjdflsliz2smsi7a

Implication-based and cardinality-based inclusions in information retrieval

Patrick Bosc, Laurent Ughetto, Olivier Pivert, Vincent Claveau
2009 2009 IEEE International Conference on Fuzzy Systems  
Moreover, this paper shows the added-value of this graded inclusion-based model, which gives new and theoretically grounded ways for a user to easily weight his query terms, to include negative information  ...  in his queries, or to expand them with related terms.  ...  A. Division of relations and the Boolean IR model In the relational model of data, a universe is modeled as a set of relations, manipulated with operations known as the relational algebra.  ... 
doi:10.1109/fuzzy.2009.5277249 dblp:conf/fuzzIEEE/BoscUPC09 fatcat:nftgwqzl4bfohnmgamnlzp5gnm

A survey in traditional information retrieval models

Hai Dong, Farookh Khadeer Hussain, Elizabeth Chang
2008 2008 2nd IEEE International Conference on Digital Ecosystems and Technologies  
Index Terms-index-term based information retrieval models, Boolean models, algebraic models, probabilistic models.  ...  As a matter of fact, many so-called semantic search algorithms are derived from the traditional indexterm-based search models.  ...  For a vector-based ranking, the normalized query term weight is derived from the weights defined by the vector model, where the normalization is done using the norm of query vector.  ... 
doi:10.1109/dest.2008.4635214 fatcat:azzki4wfq5drbk7p2yds63a2vi

A Survey of Information Retrieval Models for Malayalam Language Processing

Arjun Babu, Sindhu L.
2014 International Journal of Computer Applications  
General Terms Information Retrieval (IR), Malayalam, IR Models Keywords Boolean Model, vector space Model, Probabilistic Model, Bayesian network Model, Inference Network Model, Latent  ...  A suitable method for an effective Malayalam monolingual information retrieval system is also proposed here.  ...  The system uses a generative model to find the probability that a document in one language is relevant given query in another language.  ... 
doi:10.5120/18820-0230 fatcat:tm37gfyvrvbtfhyzzybow225bq

A probabilistic relational algebra for the integration of information retrieval and database systems

Norbert Fuhr, Thomas Rölleke
1997 ACM Transactions on Information Systems  
We present a probabilistic relational algebra (PRA) which is a generalization of standard relational algebra.  ...  We introduce the concept of vague predicates which yield probabilistic weights instead of Boolean values, thus allowing for queries with vague selection conditions.  ...  Here we have modeled both the indexing weights and the weights of the documents for the query as tuple weights in a relation.  ... 
doi:10.1145/239041.239045 fatcat:dmfa4ouxcvebzd3ceedmnrzxf4

Page 55 of SRELS Journal of Information Management Vol. 25, Issue 1 [page]

1988 SRELS Journal of Information Management  
A methodology for in- corporating Boolean features into Probabilistic model has also been recently suggested (6). 3.  ...  Database suppliers do not provide this data in their update tapes and generating the index term weights at processing site will in- crease the turn-around time for tape processing.  ... 

A Survey of Information Retrieval Techniques

Mang'are Fridah Nyamisa
2017 Advances in Networks  
The major information retrieval mechanisms commonly employed include vector space model, Boolean model, Fuzzy Set model, and probabilistic retrieval model.  ...  These models are used to find similarities between the query and the documents to retrieve documents that reflect the query.  ...  For instance, the Boolean model does not consider term weights in queries. In addition, the result set of a Boolean query is often either too small or too big.  ... 
doi:10.11648/ fatcat:i3ahtt53bfd2rcc5aytt6jvb6e

Different interpretations of fuzzy gradual-inclusion-based IR models

Laurent Ughetto, Vincent Claveau
2011 Proceedings of the 7th conference of the European Society for Fuzzy Logic and Technology (EUSFLAT-2011)  
In this model, derived from the division of fuzzy relations, the gradual inclusion of a query in a document is modeled by a fuzzy implication.  ...  The links with logical models to IR are also recalled. More generally, this paper discusses the links between these models, shown from the point of view of our fuzzy models.  ...  document d i for a query q i , as expressed in the Boolean model.  ... 
doi:10.2991/eusflat.2011.109 dblp:conf/eusflat/UghettoC11 fatcat:ritnhgzikbhadfgkf3fjyxj6xy

Probabilistic search team weighting---some negative results

N. Fuhr, P. Muller
1987 Proceedings of the 10th annual international ACM SIGIR conference on Research and development in information retrieval - SIGIR '87  
In this paper, we investigate the feasibility of this method for boolean retrieval with terms from a prescribed indexing vocabulary.  ...  On the other hand, models based on probabilistic indexing outperform the ranking procedures using search term weights.  ...  parameters qi of the RPI model are request-specific, because they have to be related to the output set of the actual request. boolean query structure generates certain dependencies between the index terms  ... 
doi:10.1145/42005.42007 dblp:conf/sigir/FuhrM87 fatcat:5om5aldbm5bvxkl4npmlw5hpke

The PUCRS-PLN Group Participation at CLEF 2006

Marco Gonzalez, Vera Lúcia Strube de Lima
2006 Conference and Labs of the Evaluation Forum  
We participated with the TR+ Model based on nominalization, binary lexical relations (BLR), Boolean queries, and the evidence concept.  ...  Our alternative strategy for lexical normalization, the nominalization, is the transformation of a word (adjective, verb, or adverb) into a semantically corresponding noun.  ...  Section 2 introduces the TR+ Model based on the nominalization process, the binary lexical relation recognition, a new term weighting schema based on the evidence concept, and the Boolean query formulation  ... 
dblp:conf/clef/GonzalezL06a fatcat:r3mihjxdanhvlii7ofwyyxbwfi

Annotation Search: The FAST Way [chapter]

Nicola Ferro
2009 Lecture Notes in Computer Science  
The paper proposes a general framework for developing such algorithms that specifically deals with the problem of accessing and retrieving topical information from annotations and annotated documents.  ...  Acknowledgements The work reported has been partially supported by the TELplus Targeted Project for digital libraries, as part of the eContentplus Program of the European Commission (Contract ECP-2006-  ...  Note that for not-queries you have to substitute 1 − sim(a, t i ) to sim(a, t i ) as term weight.  ... 
doi:10.1007/978-3-642-04346-8_4 fatcat:payvfrrygbgi5elmp2hzczj2wy
« Previous Showing results 1 — 15 out of 25,330 results