English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

This is a discussion of paper "Treelets--An adaptive multi-scale basis forsparse unordered data" [arXiv:0707.0481] by Ann B. Lee, Boaz Nadler and LarryWasserman. In this paper the authors defined a new type of dimension reductionalgorithm, namely, the treelet algorithm. The treelet method has the merit ofbeing completely data driven, and its decomposition is easier to interpret ascompared to PCR. It is suitable in some certain situations, but it also has itsown limitations. I will discuss both the strength and the weakness of thismethod when applied to microarray data analysis.

Discussion of: Treelets--An adaptive multi-scale basis for sparse unordered data