想要探寻搜索排名、产品推荐、社会化书签和在线匹配背后的力量吗？这本颇具魅力的书籍向你展现如何创建Web 2.0应用程序，从参与性？Internet应用程序产生的大量数据中挖掘金矿。运用本书中介绍的先进算法，你可以编写聪明的程序，以访问其他网站那些有趣的数据集，从自有应用程序的用户中收集数据，或者分析和理解你所发现的数据。 《集体智慧编程》将你带入机器学习和统计的世界，并且阐释了如何从你和他人每天收集的信息中获得关于用户体验、市场营销、个性品味及人类行为的结论。每个算法的描述都十分简明清晰，相关代码均可以立即用于你的网站、博客、Wiki或特定应用程序。本书讲解了下列主题： 可以让在线零售商推荐产品或媒体的协作过滤技术 用于在大数据集中发现同类项组的聚类方法 从数以百万计可能方案中选择问题最佳解决方案的最优化算法 贝叶斯过滤，用在基于单词类型和其他特征的垃圾信息过滤中 支持向量（support-vector）机器，用于在线交友网站中的速配 用于问题解决的演化智能——计算机如何通过多次玩同样的游戏，改进自身代码并获得技能提升 每一章都包含了相关练习，可通过扩展使算法变得更强大。超越简单的数据库支持应用程序模式，让 Internet数据财富为你所用。

The book is Volume 4A, because Volume 4 has itself become a multivolume undertaking. Combinatorial searching is a rich and important topic, and Knuth has too much to say about it that is new, interesting, and useful to fit into a single volume, or two, or maybe even three. This book alone includes approximately 1500 exercises, with answers for self-study, plus hundreds of useful facts that cannot be found in any other publication. Volume 4A surely belongs beside the first three volumes of this classic work in every serious programmer’s library.

《计算机程序设计艺术:半数值算法(第2卷)(英文版)(第3版)》主要内容：关于算法分析的这多卷论著已经长期被公认为经典计算机科学的定义性描述。迄今已出版的完整的三卷已经组成了程序设计理论和实践的惟一的珍贵资源，无数读者都赞扬Knuth的著作对个人的深远影响，科学家们为他的分析的美丽和优雅所惊叹，而从事实践的程序员已经成功地将他的“菜谱式”的解应用到日常问题上，所有人都由于Knuth在书中表现出的博学、清晰、精确和高度幽默而对他无比敬仰。 第2卷为半数值算法，分“随机数”和“算术”两章。本卷总结了主要算法范例及这些算法的基本理论，广泛剖析了计算机程序设计与数值分析间的相互联系。

The leading reference on probabilistic methods in combinatorics-now expanded and updated When it was first published in 1991, The Probabilistic Method became instantly the standard reference on one of the most powerful and widely used tools in combinatorics. Still without competition nearly a decade later, this new edition brings you up to speed on recent developments, while adding useful exercises and over 30ew material. It continues to emphasize the basic elements of the methodology, discussing in a remarkably clear and informal style both algorithmic and classical methods as well as modern applications. The Probabilistic Method, Second Edition begins with basic techniques that use expectation and variance, as well as the more recent martingales and correlation inequalities, then explores areas where probabilistic techniques proved successful, including discrepancy and random graphs as well as cutting-edge topics in theoretical computer science. A series of proofs, or "probabilistic lenses," are interspersed throughout the book, offering added insight into the application of the probabilistic approach. New and revised coverage includes: * Several improved as well as new results * A continuous approach to discrete probabilistic problems * Talagrand's Inequality and other novel concentration results * A discussion of the connection between discrepancy and VC-dimension * Several combinatorial applications of the entropy function and its properties * A new section on the life and work of Paul Erdös-the developer of the probabilistic method

本书在介绍算法时，重点介绍用干设计算法的策略．非常与众不同。书中介绍了剪枝搜索、分摊分析、随机算法、在线算法以及多项式近似方案等相对较新的思想和众多基于分摊分析新开发的算法，每个算法都与实例一起加以介绍，而且每个例子都利用图进行详细解释。此外，本书还提供了超过400幅图来帮助初学者理解。本书适合作为高等院校算法设计与分析课程的高年级本科生和低年级研究生的教材，也可供相美科技人员和专业人七参考使用。

Describes basic programming principles and their step-by- step applications.Numerous examples are included.