✦ 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
DOI: 10.1016/j.csda.2013.01.001

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

[ACM Press the tenth annual symposium -

[ACM Press the tenth annual symposium - Stony Brook, New York, United States (1994.06.06-1994.06.08)] Proceedings of the tenth annual symposium on Computational geometry - SCG '94 - A fast algorithm for constructing sparse Euclidean spanners

✍ Das, Gautam; Narasimhan, Giri 📂 Article 📅 1994 🏛 ACM Press ⚖ 689 KB

[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