Beauty of Mathematics (Third Edition) cover

Beauty of Mathematics (Third Edition)

Rating 4.7
Word count
317K words
Chapters
38
ISBN
9787115537973

Tags

Summary

Beauty of Mathematics grew out of a series of articles Wu Jun began serializing on the Google China blog in 2006. The articles received millions of hits online and were widely reprinted. Wu later rewrote almost every piece, making abstruse mathematical principles more accessible so that non-specialist readers could appreciate the beauty of mathematics and of information processing. The book’s main thread is natural language processing and information retrieval. It begins with the relationship between writing, language, and numbers and information, tracing humanity’s understanding of how machines comprehend natural language through the methodological shift “from rules to statistics.” It then discusses statistical language models, Chinese word segmentation, hidden Markov models, information entropy and mutual information, Boolean algebra and indexing, graph theory and web crawlers, PageRank, measures of relevance, finite-state machines and dynamic programming, the law of cosines and text classification, matrix operations, information fingerprints, cryptography, the maximum entropy model, pinyin input methods, Bloom filters, Bayesian networks, conditional random fields, the Viterbi algorithm, expectation maximization, logistic regression and search advertising, MapReduce, and other major topics, interspersed with stories of figures such as Jelinek, Singhal, Marcus, and Viterbi. The third edition adds three chapters to the original content: the mathematical foundations of blockchain (elliptic curve encryption), the mathematical principles of quantum key distribution, and Hilbert’s tenth problem and the mathematical limits of machine intelligence; it also includes an appendix on computational complexity. The book uses examples to connect applications, algorithms, models, and the mathematics behind them, emphasizing simplification, solving engineering problems with mathematics, and thinking innovatively beyond fixed patterns.

Editor's review

很多人是在搜索引擎、输入法和推荐系统里第一次体会到数学的用处,却从没读过把这些技术背后的原理讲清楚的书。《数学之美》就是为此而写:它不堆砌公式,而是从一个具体问题出发,讲到算法、模型和数学思想,马尔可夫链、余弦相似度、信息熵这些名词在吴军笔下变得亲切可感。本书第一版曾获国家图书馆第八届文津图书奖,并多次被高校列为信息学科推荐读物,是科普类长销书。第三版在第二版增补大数据与机器学习内容的基础上,又新增区块链的数学基础、量子密钥分发的数学原理、人工智能的数学极限三章;第31至34章可视为面向前沿热点的延伸阅读,与前面讲自然语言处理和搜索的章节相互独立,可单独选读。如果你读过不少“讲数学之美”的鸡汤,却没真正搞清楚一个算法为什么有效,这本书能补上从直觉到理解的那一段。

Who it's for

A good fit for

  • 理工科本科生、研究生,想打通数学课与工程实践之间的隔阂
  • 程序员、算法工程师,希望理解搜索、NLP、推荐背后的数学原理
  • 对人工智能感兴趣的文科与跨专业读者,想找一本不必推导公式的入门读物
  • 高中理科生与教师,可作为了解信息科学应用的拓展读物

Not a good fit for

  • 希望直接获得可运行代码与工程实现细节的开发者
  • 只想读严格数学教材、追求定理证明与习题训练的读者
  • 对信息科学、计算机技术完全没有兴趣的一般读者

Reading tips

  1. 可先读第1—3章建立“统计代替规则”的整体框架,再按兴趣挑章节精读
  2. 读每章时先想清楚要解决的问题,再看模型如何描述,最后回看数学在其中的作用
  3. 把第31—34章当作独立的延伸阅读,不必按顺序读完前30章
  4. 配套查阅附录中的计算复杂度概念,遇到生疏术语回到原章节复习

About the publisher

Posts & Telecom Press China · Founded in 1953

Posts & Telecom Press is known for its strengths in science and technology, computing, and information and communications titles, and has extended its publishing into photography, art, software learning, and inspirational growth, giving it a fairly diverse range. Its catalog includes computing and communications works such as Refactoring and Patterns (Revised Edition) and Huawei Switch Learning Guide (Second Edition), alongside bilingual collector's editions such as The Little Prince (Chinese-English-French illustrated collector's edition), The Great Gatsby, and Three Days to See. Beijing Ten Years: 1980-1990 and Ghost Blade: WLOP Personal Illustration Collection reflect its presence in photography and art. Its authors include Antoine de Saint-Exupéry, Helen Keller, Joshua Kerievsky, Wang Da, Zhang Zhaozeng, and WLOP.

Contents

  1. Preface to the Third Edition
  2. Chapter 1 Writing and Language vs. Numbers and Information
  3. Chapter 2 Natural Language Processing—From Rules to Statistics
  4. Chapter 3 Statistical Language Models
  5. Chapter 4 On Chinese Word Segmentation
  6. Chapter 5 Hidden Markov Models
  7. Chapter 6 The Measurement and Role of Information
  8. Chapter 7 Jelinek and Modern Language Processing
  9. Chapter 8 The Beauty of Simplicity—Boolean Algebra and Search Engine Indexing
  10. Chapter 9 Graph Theory and Web Crawlers
  11. Chapter 10 PageRank—Google’s Democratic Voting Method for Ranking Web Pages
  12. Chapter 11 How to Determine the Relevance of a Web Page to a Query
  13. Chapter 12 Finite-State Machines and Dynamic Programming—The Most Basic Techniques for Maps and Local Search
  14. Chapter 13 The Designer of Google’s AK-47—Dr. Amit Singhal
  15. Chapter 14 The Law of Cosines and News Classification
  16. Chapter 15 Matrix Operations and Two Classification Problems in Text Processing
  17. Chapter 16 Information Fingerprints and Their Applications
  18. Chapter 17 Thoughts on the TV Drama Plot Against—On the Mathematical Principles of Cryptography
  19. Chapter 18 All That Glitters Is Not Gold—On Search Engine Anti-Spam
  20. Chapter 19 On the Importance of Mathematical Models
  21. Chapter 20 Don’t Put All Your Eggs in One Basket—On the Maximum Entropy Model
  22. Chapter 21 The Mathematical Principles of Pinyin Input Methods
  23. Chapter 22 Marcus, the Godfather of Natural Language Processing, and His Outstanding Students
  24. Chapter 23 Bloom Filters
  25. Chapter 24 Extensions of Markov Chains—Bayesian Networks
  26. Chapter 25 Conditional Random Fields, Grammar Analysis, and More
  27. Chapter 26 Viterbi and His Viterbi Algorithm
  28. Chapter 27 God’s Algorithm—The Expectation-Maximization Algorithm
  29. Chapter 28 Logistic Regression and Search Advertising
  30. Chapter 29 The Divide-and-Conquer Algorithm and the Foundations of Google Cloud Computing
  31. Chapter 30 Google Brain and Artificial Neural Networks
  32. Chapter 31 The Mathematical Foundations of Blockchain—The Principles of Elliptic Curve Encryption
  33. Chapter 32 The Power of Big Data—On the Importance of Data
  34. Chapter 33 The Benefits of Randomness—The Mathematical Principles of Quantum Key Distribution
  35. Chapter 34 The Limits of Mathematics—Hilbert’s Tenth Problem and the Limits of Machine Intelligence
  36. Appendix: Computational Complexity
  37. Postscript to the Third Edition
  38. Index

FAQ

没学过高等数学,能读懂这本书吗?
可以。作者有意避开繁琐的公式推导,主要通过例子讲清算法的思路,只要了解基本的概率、向量等高中和大学低年级知识,就能跟上大部分讨论;个别章节可能需要适当补一点线性代数或概率知识。
第三版相比第二版多了什么?
第三版新增三章:区块链的数学基础(椭圆曲线加密原理)、量子密钥分发的数学原理,以及希尔伯特第十问题与机器智能的数学极限;同时对部分章节做了修订,全书共34章,并附计算复杂度附录。
这本书适合用来准备算法面试吗?
它更偏向讲原理和数学直觉,不是刷题和面试题集。理解书中PageRank、文本分类、最大熵等主题的来龙去脉,对面试中讲清思路有帮助,但具体编码训练还需另外的题库和项目练习。
这本书的内容是否已经过时?
书中前半部分涉及的搜索、分词、统计语言模型等是经典原理,至今仍是理解现代系统的基础;第三版补充了较新的主题。作者也强调学的是思考方式,不必将其视为最新技术的操作手册。

Comments

Find this book

This site is an index: you start “Search all sources” in your browser, and the entries it lists all point to third-party sites; please judge their availability yourself.

About the author

Wu Jun Author · United States · 1967

Wu Jun, born in Beijing in 1967, is a computer scientist, bestselling author, and Silicon Valley venture investor. He graduated from Tsinghua University and Johns Hopkins University, where he earned a doctorate in computer science. He previously served as a senior research scientist at Google and as vice president of Tencent, and was a principal designer of Google's Chinese, Japanese, and Korean search algorithms. His writing spans technology, social culture, and humanistic reflection. Five of his works are carried here, including The Tongzhi Restoration: The Last Resistance of Chinese Conservatism, 1862–1874; Scenic Cultural Power: Interpreting Urban Development through the New Chicago School; Smart Optical Networks: Key Technologies, Applications, and Future Evolution; Cultivating the Mind; and The Deer People Speak: Essential E-commerce Customer Service Skills. These titles cover social culture, social science, computer science, Eastern philosophy, and management. He is known for turning specialized subjects into clear, readable narratives that balance informational density with accessibility.

More by the same author

Top rated in the same category