Distributed dimension reduction algorithms for widely dispersed data
It is well known that information retrieval, clustering and visualization can often be improved by reducing the dimensionality of high dimensional data. Classical techniques offer optimality but are much too slow for extremely large databases. The problem becomes harder yet when data are distributed...
Saved in:
| Main Author: | |
|---|---|
| Other Authors: | , , , |
| Format: | conferenceObject |
| Published: |
2002
|
| Online Access: | http://hdl.handle.net/10725/7497 http://libraries.lau.edu.lb/research/laur/terms-of-use/articles.php http://www.actapress.com/Abstract.aspx?paperId=24561 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|