About: Rocchio algorithm

Facets (new session)
Description
Metadata
Settings
- Rule:
- Inverse Functional Properties:
- "Same As":

About: Rocchio algorithm Goto Sponge NotDistinct Permalink

An Entity of Type : owl:Thing, within Data Space : dbpedia.demo.openlinksw.com associated with source document(s)
QRcode icon

http://dbpedia.demo.openlinksw.com/describe/?url=http%3A%2F%2Fdbpedia.org%2Fresource%2FRocchio_algorithm&invfp=IFP_OFF&sas=SAME_AS_OFF

The Rocchio algorithm is based on a method of relevance feedback found in information retrieval systems which stemmed from the SMART Information Retrieval System developed between 1960 and 1964. Like many other retrieval systems, the Rocchio algorithm was developed using the vector space model. Its underlying assumption is that most users have a general conception of which documents should be denoted as relevant or irrelevant. Therefore, the user's search query is revised to include an arbitrary percentage of relevant and irrelevant documents as a means of increasing the search engine's recall, and possibly the precision as well. The number of relevant and irrelevant documents allowed to enter a query is dictated by the weights of the a, b, c variables listed below in the Algorithm section

Attributes	Values
rdfs:label	Rocchio algorithm (en)
rdfs:comment	The Rocchio algorithm is based on a method of relevance feedback found in information retrieval systems which stemmed from the SMART Information Retrieval System developed between 1960 and 1964. Like many other retrieval systems, the Rocchio algorithm was developed using the vector space model. Its underlying assumption is that most users have a general conception of which documents should be denoted as relevant or irrelevant. Therefore, the user's search query is revised to include an arbitrary percentage of relevant and irrelevant documents as a means of increasing the search engine's recall, and possibly the precision as well. The number of relevant and irrelevant documents allowed to enter a query is dictated by the weights of the a, b, c variables listed below in the Algorithm section (en)
foaf:depiction
dcterms:subject	Search algorithms
Wikipage page ID	25130414 (xsd:integer)
Wikipage revision ID	1123733235 (xsd:integer)
Link from a Wikipage to another Wikipage	Coordinate Algorithm Vector space Information retrieval Search algorithms Relevance feedback Myanmar Burma Centroid Time complexity Tuple Search engine Relevance (information retrieval) Nearest centroid classifier Summation SMART Information Retrieval System Variable (mathematics) Vector space model Euclidean distance Rocchio Classification Formula (mathematical logic) dbr:Wikt:relevant
Link from a Wikipage to an external page	http://cs.nyu.edu/courses/fall07/G22.2580-001/lec7.html http://nlp.stanford.edu/IR-book/pdf/09expand.pdf http://nlp.stanford.edu/IR-book/pdf/14vcat.pdf http://sigir.org/files/museum/pub-08/XXIII-1.pdf
sameAs	Rocchio algorithm Rocchio algorithm Rocchio algorithm Rocchio algorithm
dbp:wikiPageUsesTemplate	dbt:Reflist
thumbnail	wiki-commons:Special:FilePath/Rocchioclassgraph.jpg?width=300
has abstract	The Rocchio algorithm is based on a method of relevance feedback found in information retrieval systems which stemmed from the SMART Information Retrieval System developed between 1960 and 1964. Like many other retrieval systems, the Rocchio algorithm was developed using the vector space model. Its underlying assumption is that most users have a general conception of which documents should be denoted as relevant or irrelevant. Therefore, the user's search query is revised to include an arbitrary percentage of relevant and irrelevant documents as a means of increasing the search engine's recall, and possibly the precision as well. The number of relevant and irrelevant documents allowed to enter a query is dictated by the weights of the a, b, c variables listed below in the Algorithm section. (en)
prov:wasDerivedFrom	wikipedia-en:Rocchio_algorithm?oldid=1123733235&ns=0
page length (characters) of wiki page	6534 (xsd:nonNegativeInteger)
foaf:isPrimaryTopicOf	wikipedia-en:Rocchio_algorithm
is Link from a Wikipage to another Wikipage of	Relevance feedback Vocabulary mismatch K-means clustering Nearest centroid classifier Artificial imagination Recommender system Rocchio's algorithm
is Wikipage redirect of	Rocchio's algorithm
is foaf:primaryTopic of	wikipedia-en:Rocchio_algorithm

Faceted Search & Find service v1.17_git139 as of Feb 29 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 08.03.3330 as of Mar 19 2024, on Linux (x86_64-generic-linux-glibc212), Single-Server Edition (378 GB total memory, 49 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software