Robust local tangent space alignment
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), ISSN: 0302-9743, Vol: 5863 LNCS, Issue: PART 1, Page: 293-301
2009
- 8Citations
- 3Captures
Metric Options: CountsSelecting the 1-year or 3-year option will change the metrics count to percentiles, illustrating how an article or review compares to other articles or reviews within the selected time period in the same journal. Selecting the 1-year option compares the metrics against other articles/reviews that were also published in the same calendar year. Selecting the 3-year option compares the metrics against other articles/reviews that were also published in the same calendar year plus the two years prior.
Example: if you select the 1-year option for an article published in 2019 and a metric category shows 90%, that means that the article or review is performing better than 90% of the other articles/reviews published in that journal in 2019. If you select the 3-year option for the same article published in 2019 and the metric category shows 90%, that means that the article or review is performing better than 90% of the other articles/reviews published in that journal in 2019, 2018 and 2017.
Citation Benchmarking is provided by Scopus and SciVal and is different from the metrics context provided by PlumX Metrics.
Example: if you select the 1-year option for an article published in 2019 and a metric category shows 90%, that means that the article or review is performing better than 90% of the other articles/reviews published in that journal in 2019. If you select the 3-year option for the same article published in 2019 and the metric category shows 90%, that means that the article or review is performing better than 90% of the other articles/reviews published in that journal in 2019, 2018 and 2017.
Citation Benchmarking is provided by Scopus and SciVal and is different from the metrics context provided by PlumX Metrics.
Conference Paper Description
This paper investigates noise manifold learning problem, which is a key issue in applying manifold learning to practical problem. A robust version of LTSA called RLTSA is proposed. The proposed RLTSA algorithm makes LTSA more robust from three aspects: firstly robust PCA algorithm is used instead of the standard SVD to reduce influence of noise on local tangent space coordinates; secondly RLTSA chooses neighborhoods that are approximated well by the local tangent space coordinates to align with the global coordinates; thirdly in the alignment step, the influence of noise on embedding result is further reduced by endowing clean data points and noise data points with different weights into local alignment errors. Experiments on both synthetic data sets and real data sets demonstrate the effectiveness of our RLTSA when dealing with noise manifold. © 2009 Springer-Verlag Berlin Heidelberg.
Bibliographic Details
http://www.scopus.com/inward/record.url?partnerID=HzOxMe3b&scp=76649097660&origin=inward; http://dx.doi.org/10.1007/978-3-642-10677-4_33; http://link.springer.com/10.1007/978-3-642-10677-4_33; https://dx.doi.org/10.1007/978-3-642-10677-4_33; https://link.springer.com/chapter/10.1007/978-3-642-10677-4_33; http://www.springerlink.com/index/10.1007/978-3-642-10677-4_33; http://www.springerlink.com/index/pdf/10.1007/978-3-642-10677-4_33
Springer Science and Business Media LLC
Provide Feedback
Have ideas for a new metric? Would you like to see something else here?Let us know