Show simple item record

dc.contributor.authorCan, Fazlien_US
dc.date.accessioned2008-07-22T19:31:03Zen_US
dc.date.accessioned2013-07-10T15:06:36Z
dc.date.available2008-07-22T19:31:03Zen_US
dc.date.available2013-07-10T15:06:36Z
dc.date.issued1991-08-01en_US
dc.date.submitted2008-03-17en_US
dc.identifier.uri
dc.identifier.urihttp://hdl.handle.net/2374.MIA/187en_US
dc.description.abstractClustering of very large document databases is essential to reduce the spacehime complexity of information retrieval. The periodic updating of clusters is required due to the dynamic nature of databases. An algorithm for incremental clustering at discrete times is introduced, Its complexity and cost analysis and an investigation of the expected behavior of the algorithm are provided. Through empirical testing, it is shown that the algorithm is achieving its purpose in terms of being cost effective, generating statistically valid clusters that are compatible with those of reclustering, and providing effective information retrieval.en_US
dc.titleExperiments on Incremental Clusteringen_US
dc.typeTexten_US
dc.type.genreReporten_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record