Sciweavers

Share
PAKDD
2010
ACM

Distributed Knowledge Discovery with Non Linear Dimensionality Reduction

8 years 9 months ago
Distributed Knowledge Discovery with Non Linear Dimensionality Reduction
Data mining tasks results are usually improved by reducing the dimensionality of data. This improvement however is achieved harder in the case that data lay on a non linear manifold and are distributed across network nodes. Although numerous algorithms for distributed dimensionality reduction have been proposed, all assume that data reside in a linear space. In order to address the non-linear case, we introduce D-Isomap, a novel distributed non linear dimensionality reduction algorithm, particularly applicable in large scale, structured peer-to-peer networks. Apart from unfolding a non linear manifold, our algorithm is capable of approximate reconstruction of the global dataset at peer level a very attractive feature for distributed data mining problems. We extensively evaluate its performance through experiments on both artificial and real world datasets. The obtained results show the suitability and viability of our approach for knowledge discovery in distributed environments.
Panagis Magdalinos, Michalis Vazirgiannis, Dialect
Added 14 Feb 2011
Updated 14 Feb 2011
Type Journal
Year 2010
Where PAKDD
Authors Panagis Magdalinos, Michalis Vazirgiannis, Dialecti Valsamou
Comments (0)
books