로그인회원가입 장바구니마이페이지
kangcom
전체
Home >   >   > 

Implementing Useful Algorithms in C++

   
지은이 Dmytro Kedyk   |   출판사 Independently Published  |   발행일 2020년 12월 08일   |   언어 : 영어
 
판매가 56,000원54,880원 2%
마일리지 1% 560원
발행일 2020-12-08
ISBN 8605325305 |  9798605325307
기타정보 원서 | 698쪽 | $ 34.95 | Paperback
예상입고일 10~15일 소요예정 (근무일기준)
배송비 무료배송
    정가, 판매가는 항공 운임료 포함
프로그래밍언어
   
주의사항
  • - 현지사정에 의해 지연, 품절 될 수 있습니다.
  • - 해외주문원서는 취소 및 반품이 불가능합니다.(단, 파본이나 오발송은 제외 입니다.)
  • - 수입절차/입고소요기간 자세히
  •  

    Programmers use algorithms and data structures all the time, usually through numerous available APIs. Ideally an algorithm is correct, easy to understand, applicable to many problems, efficient, and free of intellectual property claims. This book covers algorithms and data structures learned in an algorithms class and many that aren't, including statistical algorithms, external memory algorithms, numerical methods, optimization, string algorithms, and data compression.

    About a fourth of the book is devoted to machine learning. There is much more theory than in the rest of the book because in machine learning relevant theory is more practical than algorithms. New learning algorithms are proposed often, and it's easy to get lost without understanding how learning actually works. In particular, getting comfortable with the concept of estimation error substantially improves the ability to reason about statistical algorithms.

    Another fourth is about numerical algorithms. Separate chapters cover matrix algorithms (such as eigenvalue calculation for spectral clustering), working with functions (integration, root finding, etc.), and optimization (both continuous and convex).

    Expect to learn something new in every chapter. Many topics appear only in specialized books and papers, including collections of random number generators and hash functions for various use cases, priority queues that allow random access for applications like Djikstra's shortest path algorithm, the simplex method for linear programming, efficient dictionaries for variable-length keys, Monte Carlo and bootstrap methods for statistical computing, top-performing learning algorithms such as random forest, etc. One of the goals of the book is answering all questions you might have had since taking an algorithms class.

    Algorithm descriptions have tested C++ code, illustrations, performance analysis, and suggestions for optimizations and extensions. Still, the book is advanced, requiring some algorithmic maturity. After working through it, you will know more about algorithms and machine learning than before, even if you are already an expert. This is the book the author wishes he had when he started studying algorithms.
    준비 중입니다.
    준비 중입니다.
    등록된 서평이 없습니다.
     
    전체평균(0)
    회원평점   회원서평수 0
    Independently Published 출판사의 신간
    Crochet For Beginners: Complete Step by Step Illustrated Guide on How to Start Crocheting in Simple and Funny Mode
    Sarah Parker 저
    18,240원
    (5%↓+1%)
     
    이메일주소수집거부