Many approaches in the field of nonmonotonic and “commonsense” reasoning are actually different representations of the same basic ideas and constructions. This book gives a logical formalization of the original, explanatory approach to nonmonotonic reasoning. It uses the basic formalism of biconsequence relations, as well as derived systems of default, autoepistemic and causal inference, to cover in a single framework such diverse systems as default logic, autoepistemic and modal nonmonotonic logics, input/output and causal logics, argumentation theory, and semantics of general logic programs with negation as failure. This approach provides a clear separation between logical (monotonic) and nonmonotonic aspects of nonmonotonic reasoning. The separation allows, in particular, to single out the logics underlying modern logic programming and restore thereby the connection between logic programming and logic.Contents:Scott Consequence RelationsBiconsequence RelationsFour-Valued LogicsNonmonotonic SemanticsDefault Consequence RelationsArgumentation TheoryProduction and Causal InferenceEpistemic Consequence RelationsModal Nonmonotonic Logics
Readership: Graduate students and researchers in artificial intelligence and logicians.
Keywords:Nonmonotonic Reasoning;Logic;Artificial Intelligence;Logic Programming;Biconsequence Relations;Causal Inference;Nonmonotonic LogicsKey Features:Provides a uniform generalized theory of explanatory nonmonotonic reasoningFocuses on the logical, monotonic basis of nonmonotonic reasoningShifts attention to recent, non-epistemic approaches to nonmonotonic reasoningReviews:“The reviewed book is written with immense erudition and an unusual, almost superhuman knowledge of the area … the author is, probably, the most knowledgeable individual in the area of nonmonotonic reasoning … I will gladly keep this book on my shelf and, I am sure, I will often look it up if some argument, in broadly understood NMR, will be needed. It is likely I will find it there.”Theory and Practice of Logic Programming
“Artfully envisions a breathtakingly better world.” —Los Angeles Times
“Elaborate, smart and persuasive.” —The Boston Globe
“A pleasure to read.” —The Wall Street Journal
One of CBS News’s Best Fall Books of 2005 • Among St Louis Post-Dispatch’s Best Nonfiction Books of 2005 • One of Amazon.com’s Best Science Books of 2005
A radical and optimistic view of the future course of human development from the bestselling author of How to Create a Mind and The Age of Spiritual Machines who Bill Gates calls “the best person I know at predicting the future of artificial intelligence”
For over three decades, Ray Kurzweil has been one of the most respected and provocative advocates of the role of technology in our future. In his classic The Age of Spiritual Machines, he argued that computers would soon rival the full range of human intelligence at its best. Now he examines the next step in this inexorable evolutionary process: the union of human and machine, in which the knowledge and skills embedded in our brains will be combined with the vastly greater capacity, speed, and knowledge-sharing ability of our creations.
From the Trade Paperback edition.
Artificial Intelligence helps choose what books you buy, what movies you see, and even who you date. It puts the "smart" in your smartphone and soon it will drive your car. It makes most of the trades on Wall Street, and controls vital energy, water, and transportation infrastructure. But Artificial Intelligence can also threaten our existence.
In as little as a decade, AI could match and then surpass human intelligence. Corporations and government agencies are pouring billions into achieving AI's Holy Grail—human-level intelligence. Once AI has attained it, scientists argue, it will have survival drives much like our own. We may be forced to compete with a rival more cunning, more powerful, and more alien than we can imagine.
Through profiles of tech visionaries, industry watchdogs, and groundbreaking AI systems, Our Final Invention explores the perils of the heedless pursuit of advanced AI. Until now, human intelligence has had no rival. Can we coexist with beings whose intelligence dwarfs our own? And will they allow us to?
Ray Kurzweil is arguably today’s most influential—and often controversial—futurist. In How to Create a Mind, Kurzweil presents a provocative exploration of the most important project in human-machine civilization—reverse engineering the brain to understand precisely how it works and using that knowledge to create even more intelligent machines.
Kurzweil discusses how the brain functions, how the mind emerges from the brain, and the implications of vastly increasing the powers of our intelligence in addressing the world’s problems. He thoughtfully examines emotional and moral intelligence and the origins of consciousness and envisions the radical possibilities of our merging with the intelligent technology we are creating.
Certain to be one of the most widely discussed and debated science books of the year, How to Create a Mind is sure to take its place alongside Kurzweil’s previous classics which include Fantastic Voyage: Live Long Enough to Live Forever and The Age of Spiritual Machines.
From the Hardcover edition.
Jeff Hawkins, the man who created the PalmPilot, Treo smart phone, and other handheld devices, has reshaped our relationship to computers. Now he stands ready to revolutionize both neuroscience and computing in one stroke, with a new understanding of intelligence itself.
Hawkins develops a powerful theory of how the human brain works, explaining why computers are not intelligent and how, based on this new theory, we can finally build intelligent machines.
The brain is not a computer, but a memory system that stores experiences in a way that reflects the true structure of the world, remembering sequences of events and their nested relationships and making predictions based on those memories. It is this memory-prediction system that forms the basis of intelligence, perception, creativity, and even consciousness.
In an engaging style that will captivate audiences from the merely curious to the professional scientist, Hawkins shows how a clear understanding of how the brain works will make it possible for us to build intelligent machines, in silicon, that will exceed our human ability in surprising ways.
Written with acclaimed science writer Sandra Blakeslee, On Intelligence promises to completely transfigure the possibilities of the technology age. It is a landmark book in its scope and clarity.
The antidote to fuzzy thinking, with furry animals!
Have you read (or stumbled into) one too many irrational online debates? Ali Almossawi certainly had, so he wrote An Illustrated Book of Bad Arguments! This handy guide is here to bring the internet age a much-needed dose of old-school logic (really old-school, a la Aristotle).
Here are cogent explanations of the straw man fallacy, the slippery slope argument, the ad hominem attack, and other common attempts at reasoning that actually fall short—plus a beautifully drawn menagerie of animals who (adorably) commit every logical faux pas. Rabbit thinks a strange light in the sky must be a UFO because no one can prove otherwise (the appeal to ignorance). And Lion doesn’t believe that gas emissions harm the planet because, if that were true, he wouldn’t like the result (the argument from consequences).
Once you learn to recognize these abuses of reason, they start to crop up everywhere from congressional debate to YouTube comments—which makes this geek-chic book a must for anyone in the habit of holding opinions.
Logic For Dummies tracks an introductory logic course at the college level. Concrete, real-world examples help you understand each concept you encounter, while fully worked out proofs and fun logic problems encourage you students to apply what you’ve learned.
Logically Fallacious is one of the most comprehensive collections of logical fallacies with all original examples and easy to understand descriptions, perfect for educators, debaters, or anyone who wants to improve his or her reasoning skills.
"Expose an irrational belief, keep a person rational for a day. Expose irrational thinking, keep a person rational for a lifetime." - Bo Bennett
In the world's top research labs and universities, the race is on to invent the ultimate learning algorithm: one capable of discovering any knowledge from data, and doing anything we want, before we even ask. In The Master Algorithm, Pedro Domingos lifts the veil to give us a peek inside the learning machines that power Google, Amazon, and your smartphone. He assembles a blueprint for the future universal learner-the Master Algorithm-and discusses what it will mean for business, science, and society. If data-ism is today's philosophy, this book is its bible.
From the Trade Paperback edition.
This highly versatile text provides mathematical background used in a wide variety of disciplines, including mathematics and mathematics education, computer science, biology, chemistry, engineering, communications, and business.
Some of the major features and strengths of this textbook
More than 1,600 exercises, ranging from elementary to challenging, are included with hints/answers to all odd-numbered exercises.
Descriptions of proof techniques are accessible and lively.
Students benefit from the historical discussions throughout the textbook.
Combining stories of great writers and philosophers with quotations and riddles, this completely original text for first courses in mathematical logic examines problems related to proofs, propositional logic and first-order logic, undecidability, and other topics. 2013 edition.
However, few mathematicians of the time were equipped to understand the young scholar's complex proof. Ernest Nagel and James Newman provide a readable and accessible explanation to both scholars and non-specialists of the main ideas and broad implications of Gödel's discovery. It offers every educated person with a taste for logic and philosophy the chance to understand a previously difficult and inaccessible subject.
Marking the 50th anniversary of the original publication of Gödel's Proof, New York University Press is proud to publish this special anniversary edition of one of its bestselling and most frequently translated books. With a new introduction by Douglas R. Hofstadter, this book will appeal students, scholars, and professionals in the fields of mathematics, computer science, logic and philosophy, and science.
The selection of topics conveys not only their role in this historical development of mathematics but also their value as bases for understanding the changing nature of mathematics. Among the topics covered in this wide-ranging text are: mathematics before Euclid, Euclid's Elements, non-Euclidean geometry, algebraic structure, formal axiomatics, the real numbers system, sets, logic and philosophy and more. The emphasis on axiomatic procedures provides important background for studying and applying more advanced topics, while the inclusion of the historical roots of both algebra and geometry provides essential information for prospective teachers of school mathematics.
The readable style and sets of challenging exercises from the popular earlier editions have been continued and extended in the present edition, making this a very welcome and useful version of a classic treatment of the foundations of mathematics. "A truly satisfying book." — Dr. Bruce E. Meserve, Professor Emeritus, University of Vermont.
The present volume reprints the first English translation of Giidel's far-reaching work. Not only does it make the argument more intelligible, but the introduction contributed by Professor R. B. Braithwaite (Cambridge University}, an excellent work of scholarship in its own right, illuminates it by paraphrasing the major part of the argument.
This Dover edition thus makes widely available a superb edition of a classic work of original thought, one that will be of profound interest to mathematicians, logicians and anyone interested in the history of attempts to establish axioms that would provide a rigorous basis for all mathematics. Translated by B. Meltzer, University of Edinburgh. Preface. Introduction by R. B. Braithwaite.
Beginning with a survey of set theory and its role in mathematics, the text proceeds to definitions and examples of categories and explains the use of arrows in place of set-membership. The introduction to topos structure covers topos logic, algebra of subobjects, and intuitionism and its logic, advancing to the concept of functors, set concepts and validity, and elementary truth. Explorations of categorial set theory, local truth, and adjointness and quantifiers conclude with a study of logical geometry.
The second edition adds a discussion of vector auto-regressive, structural vector auto-regressive, and structural vector error-correction models. To analyze the interactions between the investigated variables, further impulse response function and forecast error variance decompositions are introduced as well as forecasting. The author explains how these model types relate to each other.
The two-part selection of puzzles and paradoxes begins with examinations of the nature of infinity and some curious systems related to Gödel's theorem. The first three chapters of Part II contain generalized Gödel theorems. Symbolic logic is deferred until the last three chapters, which give explanations and examples of first-order arithmetic, Peano arithmetic, and a complete proof of Gödel's celebrated result involving statements that cannot be proved or disproved. The book also includes a lively look at decision theory, better known as recursion theory, which plays a vital role in computer science.
Two of the authors co-wrote The Elements of Statistical Learning (Hastie, Tibshirani and Friedman, 2nd edition 2009), a popular reference book for statistics and machine learning researchers. An Introduction to Statistical Learning covers many of the same topics, but at a level accessible to a much broader audience. This book is targeted at statisticians and non-statisticians alike who wish to use cutting-edge statistical learning techniques to analyze their data. The text assumes only a previous course in linear regression and no knowledge of matrix algebra.
"Seamless R and C++ integration with Rcpp" is simply a wonderful book. For anyone who uses C/C++ and R, it is an indispensable resource. The writing is outstanding. A huge bonus is the section on applications. This section covers the matrix packages Armadillo and Eigen and the GNU Scientific Library as well as RInside which enables you to use R inside C++. These applications are what most of us need to know to really do scientific programming with R and C++. I love this book. -- Robert McCulloch, University of Chicago Booth School of Business
Rcpp is now considered an essential package for anybody doing serious computational research using R. Dirk's book is an excellent companion and takes the reader from a gentle introduction to more advanced applications via numerous examples and efficiency enhancing gems. The book is packed with all you might have ever wanted to know about Rcpp, its cousins (RcppArmadillo, RcppEigen .etc.), modules, package development and sugar. Overall, this book is a must-have on your shelf. -- Sanjog Misra, UCLA Anderson School of Management
The Rcpp package represents a major leap forward for scientific computations with R. With very few lines of C++ code, one has R's data structures readily at hand for further computations in C++. Hence, high-level numerical programming can be made in C++ almost as easily as in R, but often with a substantial speed gain. Dirk is a crucial person in these developments, and his book takes the reader from the first fragile steps on to using the full Rcpp machinery. A very recommended book! -- Søren Højsgaard, Department of Mathematical Sciences, Aalborg University, Denmark
"Seamless R and C ++ Integration with Rcpp" provides the first comprehensive introduction to Rcpp. Rcpp has become the most widely-used language extension for R, and is deployed by over one-hundred different CRAN and BioConductor packages. Rcpp permits users to pass scalars, vectors, matrices, list or entire R objects back and forth between R and C++ with ease. This brings the depth of the R analysis framework together with the power, speed, and efficiency of C++.
Dirk Eddelbuettel has been a contributor to CRAN for over a decade and maintains around twenty packages. He is the Debian/Ubuntu maintainer for R and other quantitative software, edits the CRAN Task Views for Finance and High-Performance Computing, is a co-founder of the annual R/Finance conference, and an editor of the Journal of Statistical Software. He holds a Ph.D. in Mathematical Economics from EHESS (Paris), and works in Chicago as a Senior Quantitative Analyst.
After a brief overview, the approach begins with elementary toposes and advances to internal category theory, topologies and sheaves, geometric morphisms, and logical aspects of topos theory. Additional topics include natural number objects, theorems of Deligne and Barr, cohomology, and set theory. Each chapter concludes with a series of exercises, and an appendix and indexes supplement the text.
The book is intended for graduate students and researchers in machine learning, statistics, and related areas; it can be used either as a textbook or as a reference text for a research seminar.
Covering all the mathematical techniques required to resolve geometric problems and design computer programs for computer graphic applications, each chapter explores a specific mathematical topic prior to moving forward into the more advanced areas of matrix transforms, 3D curves and surface patches. Problem-solving techniques using vector analysis and geometric algebra are also discussed.
All the key areas are covered including: Numbers, Algebra, Trigonometry, Coordinate geometry, Transforms, Vectors, Curves and surfaces, Barycentric coordinates, Analytic geometry.
Plus – and unusually in a student textbook – a chapter on geometric algebra is included.
In science fiction, artificial intelligence takes the shape of computers that can speak like people, think for themselves, and sometimes act against us. Sometimes the machines seem to know everything, and symbolize implacable and unknowable power, as in The Matrix. Such machines can also embody the limits of logic, and by extension our own powers of reason. In Arthur C. Clarke's 2001: A Space Odyssey, HAL was a computer of vast capability driven insane by the demands of his programming – to honestly and completely report information – when those instructions conflicted with orders to keep state secrets. Star Trek has given us the android, Lieutenant Commander Data, who strives to be more human. None of these visions came true in quite the way science fiction writers imagined, even though in many ways computers surpass their fictional counterparts. This eBook reviews work in the field and covers topics from chess-playing to quantum computing. The writers tackle how to make computers more powerful, how we define consciousness, what the hard problems are and even how computers might be built once the limits of silicon chips have been reached. Artificial intelligence also raises some thorny ethical questions, such as whether morality can be programmed. These are kinds of issues that make artificial intelligence and computing fascinating. Building an intelligent machine brings together the human desire to create and the question of what makes us what we are. If anyone ever builds a true thinking machine, that last question becomes much more complicated, not less. Data and HAL would probably agree.
Starting with sets and rules of inference, this text covers functions, relations, operation, and the integers. Additional topics include proofs in analysis, cardinality, and groups. Six appendixes offer supplemental material. Teachers will welcome the return of this long-out-of-print volume, appropriate for both one- and two-semester courses.
The extensively revised second edition provides further clarification of matters that typically give rise to difficulty in the classroom and restructures the chapters on logic to emphasize the role of consequence relations and higher-level rules, as well as including more exercises and solutions.
Topics and features: teaches finite mathematics as a language for thinking, as much as knowledge and skills to be acquired; uses an intuitive approach with a focus on examples for all general concepts; brings out the interplay between the qualitative and the quantitative in all areas covered, particularly in the treatment of recursion and induction; balances carefully the abstract and concrete, principles and proofs, specific facts and general perspectives; includes highlight boxes that raise common queries and clear away confusions; provides numerous exercises, with selected solutions, to test and deepen the reader’s understanding.
This clearly-written text/reference is a must-read for first-year undergraduate students of computing. Assuming only minimal mathematical background, it is ideal for both the classroom and independent study.
With all the wit and charm that have delighted readers of his previous books, Smullyan transports us once again to that magical island where knights always tell the truth and knaves always lie. Here we meet a new and amazing array of characters, visitors to the island, seeking to determine the natives’ identities. Among them: the census-taker McGregor; a philosophical-logician in search of his flighty bird-wife, Oona; and a regiment of Reasoners (timid ones, normal ones, conceited, modest, and peculiar ones) armed with the rules of propositional logic (if X is true, then so is Y). By following the Reasoners through brain-tingling exercises and adventures—including journeys into the “other possible worlds” of Kripke semantics—even the most illogical of us come to understand Gödel’s two great theorems on incompleteness and undecidability, some of their philosophical and mathematical implications, and why we, like Gödel himself, must remain Forever Undecided!
The book begins by tracing the development of cryptology from that of an arcane practice used, for example, to conceal alchemic recipes, to the modern scientific method that is studied and employed today. The remainder of the book explores the modern aspects and applications of cryptography, covering symmetric- and public-key cryptography, cryptographic protocols, key management, message authentication, e-mail and Internet security, and advanced applications such as wireless security, smart cards, biometrics, and quantum cryptography. The author also includes non-cryptographic security issues and a chapter devoted to information theory and coding. Nearly 200 diagrams, examples, figures, and tables along with abundant references and exercises complement the discussion.
Written by leading authority and best-selling author on the subject Richard A. Mollin, Codes: The Guide to Secrecy from Ancient to Modern Times is the essential reference for anyone interested in this exciting and fascinating field, from novice to veteran practitioner.
The book's first five chapters give an exposition of the theory of infinity-categories that emphasizes their role as a generalization of ordinary categories. Many of the fundamental ideas from classical category theory are generalized to the infinity-categorical setting, such as limits and colimits, adjoint functors, ind-objects and pro-objects, locally accessible and presentable categories, Grothendieck fibrations, presheaves, and Yoneda's lemma. A sixth chapter presents an infinity-categorical version of the theory of Grothendieck topoi, introducing the notion of an infinity-topos, an infinity-category that resembles the infinity-category of topological spaces in the sense that it satisfies certain axioms that codify some of the basic principles of algebraic topology. A seventh and final chapter presents applications that illustrate connections between the theory of higher topoi and ideas from classical topology.
It covers the topics traditionally treated in a first course, but also highlights new and emerging themes. Chapters are broken down into `lecture' sized pieces, motivated and illustrated by numerous theoretical and computational examples.
Over 200 exercises are provided and these are starred according to their degree of difficulty. Solutions to all exercises are available to authorized instructors.
The book covers key foundation topics:
o Taylor series methods
o Runge--Kutta methods
o Linear multistep methods
and a range of modern themes:
o Adaptive stepsize selection
o Long term dynamics
o Modified equations
o Geometric integration
o Stochastic differential equations
The prerequisite of a basic university-level calculus class is assumed, although appropriate background results are also summarized in appendices. A dedicated website for the book containing extra information can be found via www.springer.com
Deep learning is a form of machine learning that enables computers to learn from experience and understand the world in terms of a hierarchy of concepts. Because the computer gathers knowledge from experience, there is no need for a human computer operator to formally specify all the knowledge that the computer needs. The hierarchy of concepts allows the computer to learn complicated concepts by building them out of simpler ones; a graph of these hierarchies would be many layers deep. This book introduces a broad range of topics in deep learning.
The text offers mathematical and conceptual background, covering relevant concepts in linear algebra, probability theory and information theory, numerical computation, and machine learning. It describes deep learning techniques used by practitioners in industry, including deep feedforward networks, regularization, optimization algorithms, convolutional networks, sequence modeling, and practical methodology; and it surveys such applications as natural language processing, speech recognition, computer vision, online recommendation systems, bioinformatics, and videogames. Finally, the book offers research perspectives, covering such theoretical topics as linear factor models, autoencoders, representation learning, structured probabilistic models, Monte Carlo methods, the partition function, approximate inference, and deep generative models.
Deep Learning can be used by undergraduate or graduate students planning careers in either industry or research, and by software engineers who want to begin using deep learning in their products or platforms. A website offers supplementary material for both readers and instructors.
This concise and easy-to-read textbook/reference presents an algorithmic approach to mathematical analysis, with a focus on modelling and on the applications of analysis. Fully integrating mathematical software into the text as an important component of analysis, the book makes thorough use of examples and explanations using MATLAB, Maple, and Java applets. Mathematical theory is described alongside the basic concepts and methods of numerical analysis, supported by computer experiments and programming exercises, and an extensive use of figure illustrations.
Topics and features: thoroughly describes the essential concepts of analysis, covering real and complex numbers, trigonometry, sequences and series, functions, derivatives and antiderivatives, definite integrals and double integrals, and curves; provides summaries and exercises in each chapter, as well as computer experiments; discusses important applications and advanced topics, such as fractals and L-systems, numerical integration, linear regression, and differential equations; presents tools from vector and matrix algebra in the appendices, together with further information on continuity; includes definitions, propositions and examples throughout the text, together with a list of relevant textbooks and references for further reading; supplementary software can be downloaded from the book’s webpage at www.springer.com.
This textbook is essential for undergraduate students in Computer Science. Written to specifically address the needs of computer scientists and researchers, it will also serve professionals looking to bolster their knowledge in such fundamentals extremely well.
In the beginning was Josh Levine, an idealistic programming genius who dreamed of wresting control of the market from the big exchanges that, again and again, gave the giant institutions an advantage over the little guy. Levine created a computerized trading hub named Island where small traders swapped stocks, and over time his invention morphed into a global electronic stock market that sent trillions in capital through a vast jungle of fiber-optic cables.
By then, the market that Levine had sought to fix had turned upside down, birthing secretive exchanges called dark pools and a new species of trading machines that could think, and that seemed, ominously, to be slipping the control of their human masters.
Dark Pools is the fascinating story of how global markets have been hijacked by trading robots--many so self-directed that humans can't predict what they'll do next.
Implementations, as well as interesting, real-world examples of each data structure and algorithm, are included.
Using both a programming style and a writing style that are exceptionally clean, Kyle Loudon shows you how to use such essential data structures as lists, stacks, queues, sets, trees, heaps, priority queues, and graphs. He explains how to use algorithms for sorting, searching, numerical analysis, data compression, data encryption, common graph problems, and computational geometry. And he describes the relative efficiency of all implementations. The compression and encryption chapters not only give you working code for reasonably efficient solutions, they offer explanations of concepts in an approachable manner for people who never have had the time or expertise to study them in depth.
Anyone with a basic understanding of the C language can use this book. In order to provide maintainable and extendible code, an extra level of abstraction (such as pointers to functions) is used in examples where appropriate. Understanding that these techniques may be unfamiliar to some programmers, Loudon explains them clearly in the introductory chapters.
Contents include:PointersRecursionAnalysis of algorithmsData structures (lists, stacks, queues, sets, hash tables, trees, heaps, priority queues, graphs)Sorting and searchingNumerical methodsData compressionData encryptionGraph algorithmsGeometric algorithms
- Compact modal logic reference
- Computational approaches fully discussed
- Contemporary applications of modal logic covered in depth
Research on distributions associated with sorting algorithms has grown dramatically over the last few decades, spawning many exact and limiting distributions of complexity measures for many sorting algorithms. Yet much of this information has been scattered in disparate and highly specialized sources throughout the literature. In Sorting: A Distribution Theory, leading authority Hosam Mahmoud compiles, consolidates, and clarifies the large volume of available research, providing a much-needed, comprehensive treatment of the entire emerging distributional theory of sorting.
Mahmoud carefully constructs a logical framework for the analysis of all standard sorting algorithms, focusing on the development of the probability distributions associated with the algorithms, as well as other issues in probability theory such as measures of concentration and rates of convergence. With an emphasis on narrative rather than technical explanations, this exceptionally well-written book makes new results easily accessible to a broad spectrum of readers, including computer professionals, scientists, mathematicians, and engineers. Sorting: A Distribution Theory:
* Contains introductory material on complete and partial sorting
* Explains insertion sort, quick sort, and merge sort, among other methods
* Offers verbal descriptions of the mechanics of the algorithms as well as the necessary code
* Illustrates the distribution theory of sorting using a broad array of both classical and modern techniques
* Features a variety of end-of-chapter exercises
See Additional Notes at the back of the book for instructions to download the accompanying interactive App which brings the 250+ topics to life by allowing you to insert your own values. Visually on a phone or tablet it looks almost identical to the eBook pages, except you can edit the inputs to update the graphics and calculations to reflect those changes.
There is also a comprehensive PC version to download with even more features both applications can be unlocked with your eBook purchase receipt for no additional charge.
Education Bundle: eBook + PC software + App at a tiny fraction of the previously published price.
Programming Collective Intelligence takes you into the world of machine learning and statistics, and explains how to draw conclusions about user experience, marketing, personal tastes, and human behavior in general -- all from information that you and others collect every day. Each algorithm is described clearly and concisely with code that can immediately be used on your web site, blog, Wiki, or specialized application. This book explains:Collaborative filtering techniques that enable online retailers to recommend products or mediaMethods of clustering to detect groups of similar items in a large datasetSearch engine features -- crawlers, indexers, query engines, and the PageRank algorithmOptimization algorithms that search millions of possible solutions to a problem and choose the best oneBayesian filtering, used in spam filters for classifying documents based on word types and other featuresUsing decision trees not only to make predictions, but to model the way decisions are madePredicting numerical values rather than classifications to build price modelsSupport vector machines to match people in online dating sitesNon-negative matrix factorization to find the independent features in a datasetEvolving intelligence for problem solving -- how a computer develops its skill by improving its own code the more it plays a gameEach chapter includes exercises for extending the algorithms to make them more powerful. Go beyond simple database-backed applications and put the wealth of Internet data to work for you.
"Bravo! I cannot think of a better way for a developer to first learn these algorithms and methods, nor can I think of a better way for me (an old AI dog) to reinvigorate my knowledge of the details."
-- Dan Russell, Google
"Toby's book does a great job of breaking down the complex subject matter of machine-learning algorithms into practical, easy-to-understand examples that can be directly applied to analysis of social interaction across the Web today. If I had this book two years ago, it would have saved precious time going down some fruitless paths."
-- Tim Wolters, CTO, Collective Intellect
Thorough updates reflect the technical changes and modernizations that have taken place in the field since the last edition, including new material on Data Transformations, Ensemble Learning, Massive Data Sets, Multi-instance Learning, plus a new version of the popular Weka machine learning software developed by the authors. Witten, Frank, and Hall include both tried-and-true techniques of today as well as methods at the leading edge of contemporary research.
The book is targeted at information systems practitioners, programmers, consultants, developers, information technology managers, specification writers, data analysts, data modelers, database R&D professionals, data warehouse engineers, data mining professionals. The book will also be useful for professors and students of upper-level undergraduate and graduate-level data mining and machine learning courses who want to incorporate data mining as part of their data management knowledge base and expertise.Provides a thorough grounding in machine learning concepts as well as practical advice on applying the tools and techniques to your data mining projectsOffers concrete tips and techniques for performance improvement that work by transforming the input or output in machine learning methodsIncludes downloadable Weka software toolkit, a collection of machine learning algorithms for data mining tasks—in an updated, interactive interface. Algorithms in toolkit cover: data pre-processing, classification, regression, clustering, association rules, visualization
This major new edition features many topics not covered in the original, including graphical models, random forests, ensemble methods, least angle regression & path algorithms for the lasso, non-negative matrix factorization, and spectral clustering. There is also a chapter on methods for ``wide'' data (p bigger than n), including multiple testing and false discovery rates.
Trevor Hastie, Robert Tibshirani, and Jerome Friedman are professors of statistics at Stanford University. They are prominent researchers in this area: Hastie and Tibshirani developed generalized additive models and wrote a popular book of that title. Hastie co-developed much of the statistical modeling software and environment in R/S-PLUS and invented principal curves and surfaces. Tibshirani proposed the lasso and is co-author of the very successful An Introduction to the Bootstrap. Friedman is the co-inventor of many data-mining tools including CART, MARS, projection pursuit and gradient boosting.