Experiments on the Efficiency of Cluster Searches

dc.contributor.author	Can, Fazli	en_US
dc.contributor.author	Anderson, David	en_US
dc.date.accessioned	2008-07-22T19:31:31Z	en_US
dc.date.accessioned	2013-07-10T15:06:27Z
dc.date.available	2008-07-22T19:31:31Z	en_US
dc.date.available	2013-07-10T15:06:27Z
dc.date.issued	1991-03-01	en_US
dc.date.submitted	2008-03-17	en_US
dc.identifier.uri
dc.identifier.uri	http://hdl.handle.net/2374.MIA/230	en_US
dc.description.abstract	The efficiency of various cluster based retrieval (CBR) strategies is analyzed. The possibility of combining CBR and inverted index search (11s) is investigated. A method for combining the two approaches is proposed and shown to be cost effective in terms of paging and CPU time. The observations prove that the new method is much more efficient than conventional approaches. In the experiments, the effect of the number of selected clusters, centroid length, page size, and matching function is considered. The experiments show that the storage overhead of the new method would be moderately higher than that of IIS. The paper also examines the question: Is it beneficial to combine CBR and full search in terms of effectiveness?	en_US
dc.title	Experiments on the Efficiency of Cluster Searches	en_US
dc.type	Text	en_US
dc.type.genre	Report	en_US

Browse