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...
محفوظ في:
| المؤلف الرئيسي: | |
|---|---|
| مؤلفون آخرون: | , , , |
| التنسيق: | conferenceObject |
| منشور في: |
2002
|
| الوصول للمادة أونلاين: | 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 |
| الوسوم: |
إضافة وسم
لا توجد وسوم, كن أول من يضع وسما على هذه التسجيلة!
|