TY - GEN
T1 - Streaming Classical Multidimensional Scaling
AU - Zhang, Xi
AU - Huang, Hao
AU - Mueller, Klaus
AU - Yoo, Shinjae
N1 - Publisher Copyright:
© 2018 IEEE.
PY - 2018/11/16
Y1 - 2018/11/16
N2 - Multidimensional scaling (MDS) is a widely used embedding method that preserves the similarity among data items in the embedded low dimensional space. While MDS has shown great versatility, it is computationally expensive and non-scalable as it requires operation on the whole data distance matrix. This can be problematic when the dataset is not fixed but is constantly growing over time, such as in streaming applications. To address this problem, we introduce a streaming, one-pass, limited memory version of the classical MDS algorithm, named scMDS, specifically designed for streaming high-dimensional data. In scMDS, m-dimensional samples are arriving sequentially and are embedded in a k-dimensional subspace (k ≪ m) with high approximation quality to batch classical MDS (cMDS). It also reduces the time complexity from O(mn 2 ) to O(mn t 2 ), where n is the size of the data stream and n t is the size of a data batch at time-streaming data processing we pair our algorithm with a t (n t ≪ n). To overcome the concept-drift during novel realignment method.
AB - Multidimensional scaling (MDS) is a widely used embedding method that preserves the similarity among data items in the embedded low dimensional space. While MDS has shown great versatility, it is computationally expensive and non-scalable as it requires operation on the whole data distance matrix. This can be problematic when the dataset is not fixed but is constantly growing over time, such as in streaming applications. To address this problem, we introduce a streaming, one-pass, limited memory version of the classical MDS algorithm, named scMDS, specifically designed for streaming high-dimensional data. In scMDS, m-dimensional samples are arriving sequentially and are embedded in a k-dimensional subspace (k ≪ m) with high approximation quality to batch classical MDS (cMDS). It also reduces the time complexity from O(mn 2 ) to O(mn t 2 ), where n is the size of the data stream and n t is the size of a data batch at time-streaming data processing we pair our algorithm with a t (n t ≪ n). To overcome the concept-drift during novel realignment method.
UR - https://www.scopus.com/pages/publications/85059453091
U2 - 10.1109/NYSDS.2018.8538942
DO - 10.1109/NYSDS.2018.8538942
M3 - Conference contribution
AN - SCOPUS:85059453091
T3 - 2018 New York Scientific Data Summit, NYSDS 2018 - Proceedings
BT - 2018 New York Scientific Data Summit, NYSDS 2018 - Proceedings
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2018 New York Scientific Data Summit, NYSDS 2018
Y2 - 6 August 2018 through 8 August 2018
ER -