.png){kind=logo}
Stock image for illustration purposes only - book cover, edition or condition may vary.
Algorithms for Sparsity-Constrained Optimization
Sohail Bahmani
€ 193.69
FREE Delivery in Ireland
Description for Algorithms for Sparsity-Constrained Optimization
Hardback. This thesis presents a wholly new technique in the structural analysis of data that uses a 'greedy' algorithm to derive optimal sparse solutions, enabling faster and more accurate results in formerly problematic areas of machine learning and signal processing. Series: Springer Theses. Num Pages: 128 pages, 1 black & white illustrations, 12 colour illustrations, 2 colour tables, biography. BIC Classification: PBWH; TTBM; UYT. Category: (P) Professional & Vocational. Dimension: 235 x 155 x 13. Weight in Grams: 368.
This thesis demonstrates techniques that provide faster and more accurate solutions to a variety of problems in machine learning and signal processing. The author proposes a "greedy" algorithm, deriving sparse solutions with guarantees of optimality. The use of this algorithm removes many of the inaccuracies that occurred with the use of previous models.
This thesis demonstrates techniques that provide faster and more accurate solutions to a variety of problems in machine learning and signal processing. The author proposes a "greedy" algorithm, deriving sparse solutions with guarantees of optimality. The use of this algorithm removes many of the inaccuracies that occurred with the use of previous models.
Product Details
Publisher
Springer International Publishing AG
Format
Hardback
Publication date
2013
Series
Springer Theses
Condition
New
Weight
354g
Number of Pages
107
Place of Publication
Cham, Switzerland
ISBN
9783319018805
SKU
V9783319018805
Shipping Time
Usually ships in 15 to 20 working days
Ref
99-15
About Sohail Bahmani
Dr. Bahmani completed his thesis at Carnegie Mellon University and is currently employed by the Georgia Institute of Technology.
Reviews for Algorithms for Sparsity-Constrained Optimization