Distributed distance estimation for manifold learning and dimensionality reduction

Mehmet E. Yildiz, Frank Ciaramello, Anna Scaglione

Research output: Chapter in Book/Report/Conference proceedingConference contribution

8 Citations (Scopus)

Abstract

Given a network of N nodes with the i-th sensor's observation χi ε RM, the matrix containing all Euclidean distances among measurements ||χi - χj || ∀i, j ε {1, . . . , N} is a useful description of the data. While reconstructing a distance matrix has wide range of applications, we are particularly interested in the manifold reconstruction and its dimensionality reduction for data fusion and query. To make this map available to the all of the nodes in the network, we propose a fully decentralized consensus gossiping algorithm which is based on local neighbor communications, and does not require the existence of a central entity. The main advantage of our solution is that it is insensitive to changes in the network topology and it is fully decentralized. We describe the proposed algorithm in detail, study its complexity in terms of the number of inter-node radio transmissions and showcase its performance numerically.

Original languageEnglish (US)
Title of host publicationICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings
Pages3353-3356
Number of pages4
DOIs
StatePublished - 2009
Externally publishedYes
Event2009 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2009 - Taipei, Taiwan, Province of China
Duration: Apr 19 2009Apr 24 2009

Other

Other2009 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2009
CountryTaiwan, Province of China
CityTaipei
Period4/19/094/24/09

Fingerprint

Radio transmission
Distance measurement
Data fusion
Topology
Communication
Sensors

Keywords

  • Dimensionality reduction
  • Distributed computing
  • Manifold estimation

ASJC Scopus subject areas

  • Signal Processing
  • Software
  • Electrical and Electronic Engineering

Cite this

Yildiz, M. E., Ciaramello, F., & Scaglione, A. (2009). Distributed distance estimation for manifold learning and dimensionality reduction. In ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings (pp. 3353-3356). [4960343] https://doi.org/10.1109/ICASSP.2009.4960343

Distributed distance estimation for manifold learning and dimensionality reduction. / Yildiz, Mehmet E.; Ciaramello, Frank; Scaglione, Anna.

ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings. 2009. p. 3353-3356 4960343.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Yildiz, ME, Ciaramello, F & Scaglione, A 2009, Distributed distance estimation for manifold learning and dimensionality reduction. in ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings., 4960343, pp. 3353-3356, 2009 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2009, Taipei, Taiwan, Province of China, 4/19/09. https://doi.org/10.1109/ICASSP.2009.4960343
Yildiz ME, Ciaramello F, Scaglione A. Distributed distance estimation for manifold learning and dimensionality reduction. In ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings. 2009. p. 3353-3356. 4960343 https://doi.org/10.1109/ICASSP.2009.4960343
Yildiz, Mehmet E. ; Ciaramello, Frank ; Scaglione, Anna. / Distributed distance estimation for manifold learning and dimensionality reduction. ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings. 2009. pp. 3353-3356
@inproceedings{aeb9c61459d44f5cb2e70bd79194d55b,
title = "Distributed distance estimation for manifold learning and dimensionality reduction",
abstract = "Given a network of N nodes with the i-th sensor's observation χi ε RM, the matrix containing all Euclidean distances among measurements ||χi - χj || ∀i, j ε {1, . . . , N} is a useful description of the data. While reconstructing a distance matrix has wide range of applications, we are particularly interested in the manifold reconstruction and its dimensionality reduction for data fusion and query. To make this map available to the all of the nodes in the network, we propose a fully decentralized consensus gossiping algorithm which is based on local neighbor communications, and does not require the existence of a central entity. The main advantage of our solution is that it is insensitive to changes in the network topology and it is fully decentralized. We describe the proposed algorithm in detail, study its complexity in terms of the number of inter-node radio transmissions and showcase its performance numerically.",
keywords = "Dimensionality reduction, Distributed computing, Manifold estimation",
author = "Yildiz, {Mehmet E.} and Frank Ciaramello and Anna Scaglione",
year = "2009",
doi = "10.1109/ICASSP.2009.4960343",
language = "English (US)",
isbn = "9781424423545",
pages = "3353--3356",
booktitle = "ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings",

}

TY - GEN

T1 - Distributed distance estimation for manifold learning and dimensionality reduction

AU - Yildiz, Mehmet E.

AU - Ciaramello, Frank

AU - Scaglione, Anna

PY - 2009

Y1 - 2009

N2 - Given a network of N nodes with the i-th sensor's observation χi ε RM, the matrix containing all Euclidean distances among measurements ||χi - χj || ∀i, j ε {1, . . . , N} is a useful description of the data. While reconstructing a distance matrix has wide range of applications, we are particularly interested in the manifold reconstruction and its dimensionality reduction for data fusion and query. To make this map available to the all of the nodes in the network, we propose a fully decentralized consensus gossiping algorithm which is based on local neighbor communications, and does not require the existence of a central entity. The main advantage of our solution is that it is insensitive to changes in the network topology and it is fully decentralized. We describe the proposed algorithm in detail, study its complexity in terms of the number of inter-node radio transmissions and showcase its performance numerically.

AB - Given a network of N nodes with the i-th sensor's observation χi ε RM, the matrix containing all Euclidean distances among measurements ||χi - χj || ∀i, j ε {1, . . . , N} is a useful description of the data. While reconstructing a distance matrix has wide range of applications, we are particularly interested in the manifold reconstruction and its dimensionality reduction for data fusion and query. To make this map available to the all of the nodes in the network, we propose a fully decentralized consensus gossiping algorithm which is based on local neighbor communications, and does not require the existence of a central entity. The main advantage of our solution is that it is insensitive to changes in the network topology and it is fully decentralized. We describe the proposed algorithm in detail, study its complexity in terms of the number of inter-node radio transmissions and showcase its performance numerically.

KW - Dimensionality reduction

KW - Distributed computing

KW - Manifold estimation

UR - http://www.scopus.com/inward/record.url?scp=70349226729&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=70349226729&partnerID=8YFLogxK

U2 - 10.1109/ICASSP.2009.4960343

DO - 10.1109/ICASSP.2009.4960343

M3 - Conference contribution

AN - SCOPUS:70349226729

SN - 9781424423545

SP - 3353

EP - 3356

BT - ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings

ER -