Search results

Jump to navigation Jump to search
View (previous 20 | ) (20 | 50 | 100 | 250 | 500)
  • .... (1976). "Classification of Ranking Algorithms". ''International Forum on Information and Documentation''. '''1''' (4): 12–25.</ref> ...ument Ranking by Information Retrieval Systems''], Syracuse, NY: School of Information Studies, Syracuse University.</ref> ...
    2 KB (312 words) - 11:44, 9 June 2024
  • ...der to rank matching documents according to their [[Relevance (information retrieval)|relevance]] to a given search query. [[Category:Information retrieval techniques]] ...
    2 KB (357 words) - 02:05, 9 October 2024
  • ...ages=569–584 | doi= 10.1007/3-540-49653-X_34}}</ref> used in [[information retrieval]]. A language model is constructed for each document in the collection. It ...nning, Prabhakar Raghavan, Hinrich Schütze: An Introduction to Information Retrieval, page 241. Cambridge University Press, 2009</ref> ...
    3 KB (536 words) - 18:05, 23 January 2023
  • ...way to formally define a query and document relationship in [[Information retrieval]]. This formalization is a [[logical consequence|logical implication]] with ...16 | s2cid=16840138 }}</ref> applied uncertain inference to an information retrieval system for office documents they called ''OFFICER''. In office documents th ...
    4 KB (656 words) - 03:32, 26 December 2024
  • {{Short description|Information retrieval technique}} ...oolean model]] and the [[Fuzzy set]] theory. There are two classical fuzzy retrieval models: Mixed Min and Max (MMM) and the Paice model. Both models do not pro ...
    9 KB (1,421 words) - 22:36, 15 September 2024
  • ...ef name="cyu76" /><ref name="jones77" /> is a probabilistic [[information retrieval]] technique. The model makes some simple assumptions to make the estimation terms in the query such that the retrieval effectiveness will be high. Let <math>p_i</math> and <math>q_i</math> be th ...
    7 KB (1,013 words) - 00:39, 2 January 2025
  • ...ome the drawbacks of the Boolean model that has been used in [[information retrieval]]. The Boolean model doesn't consider term weights in queries, and the resu ...last2=Fox | first3= Harry | last3=Wu | title=Extended Boolean information retrieval | journal=Communications of the ACM | volume=26 | issue=11 | pages=1022–103 ...
    8 KB (1,218 words) - 19:31, 10 September 2024
  • ...datasets of pairwise preference comparisons, rankings, or other preference information. ...lems in "[[learning to rank]]". According to different types of preference information observed, the tasks are categorized as three main problems in the book ''Pr ...
    8 KB (1,185 words) - 05:29, 21 November 2024
  • ...t pulse|ultrashort laser pulses]]. Well established ultrafast measurement techniques such as [[frequency-resolved optical gating]] and its simplified version [[ ..., such as the spectra, non-trivial ambiguities are found by the Blind FROG retrieval algorithm.<ref>{{cite journal|last=Seifert|first=Birger|author2=Heinrich St ...
    10 KB (1,579 words) - 07:45, 16 May 2021
  • In [[natural language processing]] and [[information retrieval]], '''cluster labeling''' is the problem of picking descriptive, human-read ...D., Prabhakar Raghavan, and Hinrich Schütze. ''Introduction to Information Retrieval''. Cambridge: Cambridge UP, 2008. ''Cluster Labeling''. Stanford Natural La ...
    10 KB (1,615 words) - 16:09, 26 January 2023
  • ...Database Systems |chapter=Semantic Compression for Specialised Information Retrieval Systems |series=Studies in Computational Intelligence |volume=283 |pages=11 information on semantic relationships, specifically [[hyponymy]]. Moving upwards in wor ...
    6 KB (754 words) - 18:15, 27 March 2024
  • ..., and compute functions of their shared information, without revealing the information itself to either process. It is a form of [[secret sharing]].{{r|gi}} ...nt function is known, then it is possible to perform [[private information retrieval]]. ...
    3 KB (496 words) - 04:59, 30 November 2024
  • ...ernational ACM SIGIR Conference on Research and Development in Information Retrieval |chapter=BitFunnel |date=2017-08-07|pages=605–614|location=New York, NY, US ...tation was released as through the [[Special Interest Group on Information Retrieval]] of the [[Association for Computing Machinery]] in 2017 and won the Best P ...
    6 KB (807 words) - 21:31, 25 October 2024
  • ...ns, included in every branch of the tree. Before answering a [[information retrieval|window-query]] by traversing the sub-branches, the prioritized R-tree first [[Category:Database index techniques]] ...
    2 KB (342 words) - 19:48, 27 May 2024
  • ...]ing and relevancy rankings. Its first use was in the [[SMART Information Retrieval System]].<ref>{{cite journal | title = Matrices, Vector Spaces, and Information Retrieval ...
    10 KB (1,468 words) - 02:57, 30 September 2024
  • {{Short description|Sorting method in information retrieval}} ...ing algorithms to provide users with accurate and [[relevance (information retrieval)|relevant]] results.<ref>{{Cite web |title=Google's Search Algorithm and Ra ...
    16 KB (2,433 words) - 02:00, 10 December 2024
  • ...[[algorithm]]s and related applications. Using a [[Relevance (information retrieval)|graded relevance]] scale of documents in a search-engine result set, DCG s ..."Cumulated gain-based evaluation of IR techniques". ''ACM Transactions on Information Systems'' '''20'''(4), 422–446 (2002) ...
    12 KB (1,899 words) - 22:16, 12 May 2024
  • ...s|title=On Clustering Validation Techniques|journal=Journal of Intelligent Information Systems|date=1 January 2001|volume=17|issue=2/3|pages=107–145|doi=10.1023/A ...</math> is the ''positive predictive rate'', also known as ''[[Information retrieval#Precision|precision]]''. ...
    8 KB (1,198 words) - 23:20, 7 January 2025
  • ...Manning, P. Raghavan and H. Schütze (2008). ''Introduction to Information Retrieval''. Cambridge University Press, p.&nbsp;260.</ref> or '''[[George James Lids ...nd often unhelpful, particularly in probability-based [[machine learning]] techniques such as [[artificial neural network]]s and [[hidden Markov model]]s. By art ...
    12 KB (1,696 words) - 01:13, 15 January 2025
  • ...[[data item]] when different [[Database|data sources]] provide conflicting information on it. ...irst6=Xue|title=Proceedings of the 24th ACM International on Conference on Information and Knowledge Management |chapter=An Integrated Bayesian Approach for Effec ...
    15 KB (2,171 words) - 07:15, 27 May 2024
View (previous 20 | ) (20 | 50 | 100 | 250 | 500)