𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A coordinate descent MM algorithm for fast computation of sparse logistic PCA

✍ Scribed by Lee, Seokho; Huang, Jianhua Z.


Book ID
119942851
Publisher
Elsevier Science
Year
2013
Tongue
English
Weight
577 KB
Volume
62
Category
Article
ISSN
0167-9473

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


[ACM Press the tenth annual symposium -
✍ Das, Gautam; Narasimhan, Giri πŸ“‚ Article πŸ“… 1994 πŸ› ACM Press βš– 689 KB

Gautam Das q t Giri Narasimhanà bstract Let G = (V, 1?) be a n-vertex connected graph with positive edge weights. A subgraph G' is a t-spanner if for all u, v c V, the distance between u and v in the subgraph is at most t times the corresponding distance in G. We design an O(n log2 n) time algorithm