Algorithms for within-cluster searches using inverted files

Simple item page
dc.citation.epage716en_US
dc.citation.spage707en_US
dc.contributor.authorAltıngövde, İsmail Şengören_US
dc.contributor.authorCan, Fazlıen_US
dc.contributor.authorUlusoy, Özgüren_US
dc.coverage.spatialIstanbul, Turkey
dc.date.accessioned2016-02-08T11:49:24Z
dc.date.available2016-02-08T11:49:24Z
dc.date.issued2006-11en_US
dc.departmentDepartment of Computer Engineeringen_US
dc.descriptionDate of Conference: 1-3 November, 2006
dc.descriptionConference name: International Symposium on Computer and Information Sciences ISCIS 2006: Computer and Information Sciences
dc.description.abstractInformation retrieval over clustered document collections has two successive stages: first identifying the best-clusters and then the best-documents in these clusters that are most similar to the user query. In this paper, we assume that an inverted file over the entire document collection is used for the latter stage. We propose and evaluate algorithms for within-cluster searches, i.e., to integrate the best-clusters with the best-documents to obtain the final output including the highest ranked documents only from the best-clusters. Our experiments on a TREC collection including 210,158 documents with several query sets show that an appropriately selected integration algorithm based on the query length and system resources can significantly improve the query evaluation efficiency. © Springer-Verlag Berlin Heidelberg 2006.en_US
dc.identifier.doi10.1007/11902140_74en_US
dc.identifier.urihttp://hdl.handle.net/11693/27269
dc.language.isoEnglishen_US
dc.publisherSpringeren_US
dc.relation.isversionofhttps://doi.org/10.1007/11902140_74en_US
dc.source.titleISCIS: 21th International Symposium on Computer and Information Sciences Computer and Information Sciences – ISCIS 2006en_US
dc.subjectAlgorithmsen_US
dc.subjectData acquisitionen_US
dc.subjectFile organizationen_US
dc.subjectInformation retrieval systemsen_US
dc.subjectIntegrationen_US
dc.subjectQuery languagesen_US
dc.subjectIntegration algorithmen_US
dc.subjectInverted filesen_US
dc.subjectQuery setsen_US
dc.subjectSystem resourcesen_US
dc.subjectOnline searchingen_US
dc.titleAlgorithms for within-cluster searches using inverted filesen_US
dc.typeConference Paperen_US
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
Algorithms for within-cluster searches using inverted files.pdf
Size:
246.31 KB
Format:
Adobe Portable Document Format
Description:
Full printable version
Download
Collections
Department of Computer Engineering