Retrieval for text stream by random projection
dc.contributor.author | Oh'Uchi, Hirohito | |
dc.contributor.author | Miura, Takao | |
dc.contributor.author | Shioya, Isamu | |
dc.contributor.editor | Doroshenko, Anatoly E. | |
dc.contributor.editor | Halpin, Terry A. | |
dc.contributor.editor | Liddle, Stephen W. | |
dc.contributor.editor | Mayr, Heinrich C. | |
dc.date.accessioned | 2019-10-15T12:40:38Z | |
dc.date.available | 2019-10-15T12:40:38Z | |
dc.date.issued | 2004 | |
dc.description.abstract | In this investigation we discuss powerful yet efficient retrieval mechanism for text stream such as news stream. Difficulty comes from the fact how to manage incremental information while keeping efficiency. Recently random projection has been paid much attention on dynamic dimensionality reduction. Here we show this novel technique is really useful for querying text stream in terms of cost and accuracy. We examine some experimental results and excellent efficiency in computation and memory usage. | en |
dc.identifier.isbn | 3-88579-377-6 | |
dc.identifier.pissn | 1617-5468 | |
dc.identifier.uri | https://dl.gi.de/handle/20.500.12116/29093 | |
dc.language.iso | en | |
dc.publisher | Gesellschaft für Informatik e.V. | |
dc.relation.ispartof | Information systems technology and its applications, 3rd international conference ISTA'2004 | |
dc.relation.ispartofseries | Lecture Notes in Informatics (LNI) - Proceedings, Volume P-48 | |
dc.title | Retrieval for text stream by random projection | en |
dc.type | Text/Conference Paper | |
gi.citation.endPage | 164 | |
gi.citation.publisherPlace | Bonn | |
gi.citation.startPage | 151 | |
gi.conference.date | June 15-17, 2004 | |
gi.conference.location | Salt Lake City, Utah, USA | |
gi.conference.sessiontitle | Regular Research Papers |
Dateien
Originalbündel
1 - 1 von 1