<?xml version='1.0' encoding='UTF-8'?><?xml-stylesheet href="http://www.blogger.com/styles/atom.css" type="text/css"?><feed xmlns='http://www.w3.org/2005/Atom' xmlns:openSearch='http://a9.com/-/spec/opensearchrss/1.0/' xmlns:georss='http://www.georss.org/georss' xmlns:gd='http://schemas.google.com/g/2005' xmlns:thr='http://purl.org/syndication/thread/1.0'><id>tag:blogger.com,1999:blog-158731714278125517</id><updated>2011-11-24T10:28:17.566-08:00</updated><category term='machine_learning'/><category term='books'/><title type='text'>Bump Hunting</title><subtitle type='html'>Machine learning, Music and More.</subtitle><link rel='http://schemas.google.com/g/2005#feed' type='application/atom+xml' href='http://bumphunting.blogspot.com/feeds/posts/default'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/158731714278125517/posts/default?max-results=100'/><link rel='alternate' type='text/html' href='http://bumphunting.blogspot.com/'/><link rel='hub' href='http://pubsubhubbub.appspot.com/'/><author><name>Ted</name><uri>http://www.blogger.com/profile/14084184739434321794</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='32' height='32' src='http://4.bp.blogspot.com/_iHd5D9VLijw/Sk7Gw4W0c0I/AAAAAAAAAbE/JoyX-2z_cQ4/S220/gatchaman.jpg'/></author><generator version='7.00' uri='http://www.blogger.com'>Blogger</generator><openSearch:totalResults>9</openSearch:totalResults><openSearch:startIndex>1</openSearch:startIndex><openSearch:itemsPerPage>100</openSearch:itemsPerPage><entry><id>tag:blogger.com,1999:blog-158731714278125517.post-6335669706917700982</id><published>2011-08-17T15:26:00.000-07:00</published><updated>2011-08-17T15:36:09.613-07:00</updated><title type='text'>There are big courses, and then there are BIG courses</title><content type='html'>&lt;div class="MsoNormal"&gt;&lt;span style="color: #1f497d; font-family: &amp;quot;Calibri&amp;quot;,&amp;quot;sans-serif&amp;quot;; font-size: 11pt;"&gt;Having TA'd large lecture courses in grad school, I know how much work goes into teaching them.&amp;nbsp; But &lt;a href="http://blogs.scientificamerican.com/observations/2011/08/16/stanford-artificial-intelligence/"&gt;this&lt;/a&gt; is an entirely different scale:&lt;/span&gt;&lt;br /&gt;&lt;br /&gt;&lt;span style="color: #1f497d; font-family: &amp;quot;Calibri&amp;quot;,&amp;quot;sans-serif&amp;quot;; font-size: 11pt;"&gt;“Stanford University has opened up to the public an introductory artificial intelligence class, taught by two luminaries in the field: 70,000 people have signed up to receive registration information for the course (blogs.scientificamerican.com)”&lt;/span&gt;&amp;nbsp;&lt;/div&gt;&lt;div class="MsoNormal"&gt;&lt;br /&gt;&lt;/div&gt;&lt;div class="MsoNormal"&gt;&lt;span style="color: #1f497d; font-family: &amp;quot;Calibri&amp;quot;,&amp;quot;sans-serif&amp;quot;; font-size: 11pt;"&gt;70,000 is a lot of assignments to grade.&amp;nbsp; I feel feel sorry for the TA’s.&lt;/span&gt;&lt;/div&gt;&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/158731714278125517-6335669706917700982?l=bumphunting.blogspot.com' alt='' /&gt;&lt;/div&gt;</content><link rel='replies' type='application/atom+xml' href='http://bumphunting.blogspot.com/feeds/6335669706917700982/comments/default' title='Post Comments'/><link rel='replies' type='text/html' href='http://bumphunting.blogspot.com/2011/08/normal-0-false-false-false-en-us-x-none.html#comment-form' title='0 Comments'/><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/158731714278125517/posts/default/6335669706917700982'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/158731714278125517/posts/default/6335669706917700982'/><link rel='alternate' type='text/html' href='http://bumphunting.blogspot.com/2011/08/normal-0-false-false-false-en-us-x-none.html' title='There are big courses, and then there are BIG courses'/><author><name>Ted</name><uri>http://www.blogger.com/profile/14084184739434321794</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='32' height='32' src='http://4.bp.blogspot.com/_iHd5D9VLijw/Sk7Gw4W0c0I/AAAAAAAAAbE/JoyX-2z_cQ4/S220/gatchaman.jpg'/></author><thr:total>0</thr:total></entry><entry><id>tag:blogger.com,1999:blog-158731714278125517.post-1145014892398768367</id><published>2011-02-07T00:15:00.000-08:00</published><updated>2011-02-21T21:36:02.347-08:00</updated><title type='text'>Bill O'Reilly is Such an Embarassment</title><content type='html'>Bill O'Reilly's gall, hubris and ignorance are astounding:&lt;br /&gt;&lt;ul&gt;&lt;li&gt;&lt;a href="http://www.youtube.com/watch?v=3XEgkViLbTk"&gt;http://www.youtube.com/watch?v=3XEgkViLbTk&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a href="http://www.youtube.com/watch?v=UyHzhtARf8M"&gt;http://www.youtube.com/watch?v=UyHzhtARf8M&lt;/a&gt;&lt;br /&gt;&lt;/li&gt;&lt;/ul&gt;Fox has to get rid of him.  Who cares how much money he brings in.  If they had any standards, they'd let him go.  &lt;a href="http://www.colbertnation.com/the-colbert-report-videos/373357/february-03-2011/crisis-in-egypt---anderson-cooper---bill-o-reilly?xrs=share_copy"&gt;Stephen Colbert put it best&lt;/a&gt; (after the Anderson Cooper bit).  O'Reilly's understanding of the world really is from the 13th century.&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/158731714278125517-1145014892398768367?l=bumphunting.blogspot.com' alt='' /&gt;&lt;/div&gt;</content><link rel='replies' type='application/atom+xml' href='http://bumphunting.blogspot.com/feeds/1145014892398768367/comments/default' title='Post Comments'/><link rel='replies' type='text/html' href='http://bumphunting.blogspot.com/2011/02/bill-oreilly-is-such-embarassment.html#comment-form' title='0 Comments'/><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/158731714278125517/posts/default/1145014892398768367'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/158731714278125517/posts/default/1145014892398768367'/><link rel='alternate' type='text/html' href='http://bumphunting.blogspot.com/2011/02/bill-oreilly-is-such-embarassment.html' title='Bill O&apos;Reilly is Such an Embarassment'/><author><name>Ted</name><uri>http://www.blogger.com/profile/14084184739434321794</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='32' height='32' src='http://4.bp.blogspot.com/_iHd5D9VLijw/Sk7Gw4W0c0I/AAAAAAAAAbE/JoyX-2z_cQ4/S220/gatchaman.jpg'/></author><thr:total>0</thr:total></entry><entry><id>tag:blogger.com,1999:blog-158731714278125517.post-2855157952195818114</id><published>2010-09-02T12:06:00.000-07:00</published><updated>2011-07-27T22:42:25.021-07:00</updated><title type='text'>More on NP-Incomplete Problems (Ladner's Theorem)</title><content type='html'>I did a bit of searching regarding my previous post, and it is known that if P != NP then there do exist &lt;span style="font-style: italic;"&gt;NP Incomplete&lt;/span&gt; problems.  They're actually called "NP Intermediate" rather than "NP Incomplete"  problems.  I like my name "NP Incomplete" better but the term "complete" may have a  specific meaning that doesn't apply to the NP intermediate class --- I don't know.&lt;br /&gt;&lt;br /&gt;The existence of NP incomplete problems was proved (assuming P != NP) by Richard Ladner in 1975.  I haven't looked at it but hope to soon.  Some well known problems thought to be NP Intermediate are:&lt;br /&gt;&lt;ol&gt;&lt;li&gt;Graph Isomorphism&lt;/li&gt;&lt;li&gt;Factoring&lt;/li&gt;&lt;/ol&gt;Garey and Johnson also mentions Linear Programming as a candidate for NP intermediate, but we now know that LP's are in P.&amp;nbsp; It's good to remember we are making progress.&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/158731714278125517-2855157952195818114?l=bumphunting.blogspot.com' alt='' /&gt;&lt;/div&gt;</content><link rel='replies' type='application/atom+xml' href='http://bumphunting.blogspot.com/feeds/2855157952195818114/comments/default' title='Post Comments'/><link rel='replies' type='text/html' href='http://bumphunting.blogspot.com/2010/09/more-on-np-incomplete-problems-ladners.html#comment-form' title='0 Comments'/><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/158731714278125517/posts/default/2855157952195818114'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/158731714278125517/posts/default/2855157952195818114'/><link rel='alternate' type='text/html' href='http://bumphunting.blogspot.com/2010/09/more-on-np-incomplete-problems-ladners.html' title='More on NP-Incomplete Problems (Ladner&apos;s Theorem)'/><author><name>Ted</name><uri>http://www.blogger.com/profile/14084184739434321794</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='32' height='32' src='http://4.bp.blogspot.com/_iHd5D9VLijw/Sk7Gw4W0c0I/AAAAAAAAAbE/JoyX-2z_cQ4/S220/gatchaman.jpg'/></author><thr:total>0</thr:total></entry><entry><id>tag:blogger.com,1999:blog-158731714278125517.post-1867904271314376464</id><published>2010-08-13T23:44:00.000-07:00</published><updated>2010-08-14T00:55:43.328-07:00</updated><title type='text'>NP Incomplete Problems?</title><content type='html'>In the wake of Vinay Deolalikar's &lt;a href="http://www.scribd.com/doc/35539144/pnp12pt"&gt;maybe proof&lt;/a&gt; that P != NP, I found myself thinking about the old P ?= NP question.  I realized that while I know of a many problems that are NP complete, I don't know of any problems that are:&lt;br /&gt;&lt;br /&gt;1. in NP&lt;br /&gt;2. not known to be in P&lt;br /&gt;3. not known to be NP-complete&lt;br /&gt;&lt;br /&gt;Are there such "&lt;span style="font-weight: bold; font-style: italic;"&gt;NP&lt;/span&gt;&lt;span style="font-style: italic; font-weight: bold;"&gt; incomplete&lt;/span&gt;" problems?   And has anyone proved that if P not equal to NP, such NP-incomplete problems must exist?  It would be surprising if they didn't since the NP-complete problems are the hardest problems in NP.  Without an NP-incomplete class, there would be a sudden jump from so-called "easy" (in P) to hardest (NP-complete).&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/158731714278125517-1867904271314376464?l=bumphunting.blogspot.com' alt='' /&gt;&lt;/div&gt;</content><link rel='replies' type='application/atom+xml' href='http://bumphunting.blogspot.com/feeds/1867904271314376464/comments/default' title='Post Comments'/><link rel='replies' type='text/html' href='http://bumphunting.blogspot.com/2010/08/np-incomplete-problems.html#comment-form' title='0 Comments'/><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/158731714278125517/posts/default/1867904271314376464'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/158731714278125517/posts/default/1867904271314376464'/><link rel='alternate' type='text/html' href='http://bumphunting.blogspot.com/2010/08/np-incomplete-problems.html' title='NP Incomplete Problems?'/><author><name>Ted</name><uri>http://www.blogger.com/profile/14084184739434321794</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='32' height='32' src='http://4.bp.blogspot.com/_iHd5D9VLijw/Sk7Gw4W0c0I/AAAAAAAAAbE/JoyX-2z_cQ4/S220/gatchaman.jpg'/></author><thr:total>0</thr:total></entry><entry><id>tag:blogger.com,1999:blog-158731714278125517.post-1882059341563794787</id><published>2010-05-27T22:12:00.000-07:00</published><updated>2010-05-27T23:47:43.426-07:00</updated><title type='text'>NBC's "Law and Order" receives ultimate punishment</title><content type='html'>There may no longer be "&lt;a href="http://www.nbc.com/Law_and_Order/"&gt;Law and Order&lt;/a&gt;" in the world, but at least there's justice.  &lt;span id="articleText"&gt;&lt;span class="focusParagraph"&gt;&lt;a href="http://blogs.reuters.com/belinda-goldsmith/"&gt;Belinda Goldsmith&lt;/a&gt; reports that&lt;/span&gt;&lt;/span&gt; the long-running criminal justice drama has &lt;a href="http://in.reuters.com/article/idINIndia-48501420100514?feedType=RSS&amp;amp;feedName=everything&amp;amp;virtualBrandChannel=11709"&gt;finally been canceled&lt;/a&gt;.  Unfortunately, we will still be victimized by it's various spin-offs, as they are slated to continue.&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/158731714278125517-1882059341563794787?l=bumphunting.blogspot.com' alt='' /&gt;&lt;/div&gt;</content><link rel='replies' type='application/atom+xml' href='http://bumphunting.blogspot.com/feeds/1882059341563794787/comments/default' title='Post Comments'/><link rel='replies' type='text/html' href='http://bumphunting.blogspot.com/2010/05/nbcs-law-and-order-receives-ultimate.html#comment-form' title='0 Comments'/><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/158731714278125517/posts/default/1882059341563794787'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/158731714278125517/posts/default/1882059341563794787'/><link rel='alternate' type='text/html' href='http://bumphunting.blogspot.com/2010/05/nbcs-law-and-order-receives-ultimate.html' title='NBC&apos;s &quot;Law and Order&quot; receives ultimate punishment'/><author><name>Ted</name><uri>http://www.blogger.com/profile/14084184739434321794</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='32' height='32' src='http://4.bp.blogspot.com/_iHd5D9VLijw/Sk7Gw4W0c0I/AAAAAAAAAbE/JoyX-2z_cQ4/S220/gatchaman.jpg'/></author><thr:total>0</thr:total></entry><entry><id>tag:blogger.com,1999:blog-158731714278125517.post-8136900024559948498</id><published>2010-05-10T21:41:00.000-07:00</published><updated>2010-05-27T23:46:36.603-07:00</updated><title type='text'>A Supreme Court without Protestants?</title><content type='html'>&lt;span style="font-size:100%;"&gt;Headline from today's Boston Globe on the &lt;/span&gt;nomination of Elena Kagan:&lt;span style="font-size:100%;"&gt;&lt;a href="http://www.boston.com/news/nation/washington/articles/2010/05/11/protestants_may_no_longer_number_among_supreme_court_justices/"&gt;  "&lt;/a&gt;&lt;/span&gt;&lt;a href="http://www.boston.com/news/nation/washington/articles/2010/05/11/protestants_may_no_longer_number_among_supreme_court_justices/"&gt;&lt;span style="font-size:100%;"&gt;If she’s confirmed, court would have no Protestants."&lt;/span&gt;&lt;/a&gt;  Who is this relevant to in 2010?   I kind of thought we were past this stuff when we elected a black man for president...&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/158731714278125517-8136900024559948498?l=bumphunting.blogspot.com' alt='' /&gt;&lt;/div&gt;</content><link rel='replies' type='application/atom+xml' href='http://bumphunting.blogspot.com/feeds/8136900024559948498/comments/default' title='Post Comments'/><link rel='replies' type='text/html' href='http://bumphunting.blogspot.com/2010/05/headline-from-todays-boston-globe-on.html#comment-form' title='0 Comments'/><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/158731714278125517/posts/default/8136900024559948498'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/158731714278125517/posts/default/8136900024559948498'/><link rel='alternate' type='text/html' href='http://bumphunting.blogspot.com/2010/05/headline-from-todays-boston-globe-on.html' title='A Supreme Court without Protestants?'/><author><name>Ted</name><uri>http://www.blogger.com/profile/14084184739434321794</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='32' height='32' src='http://4.bp.blogspot.com/_iHd5D9VLijw/Sk7Gw4W0c0I/AAAAAAAAAbE/JoyX-2z_cQ4/S220/gatchaman.jpg'/></author><thr:total>0</thr:total></entry><entry><id>tag:blogger.com,1999:blog-158731714278125517.post-841484800812748341</id><published>2009-09-02T12:20:00.000-07:00</published><updated>2009-09-02T12:42:55.621-07:00</updated><title type='text'></title><content type='html'>The following seems note-worthy.  &lt;a href="http://www.codexon.com/posts/memory-size-of-python-objects"&gt;Codexon&lt;/a&gt; reports that in Python, an int on a 32-bit machine now takes up 12 bytes of storage.  This seems a little excessive.  I mean how much tag space is really needed here?  (Or is there other information stored as well? e.g., GC reference counts.)&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/158731714278125517-841484800812748341?l=bumphunting.blogspot.com' alt='' /&gt;&lt;/div&gt;</content><link rel='replies' type='application/atom+xml' href='http://bumphunting.blogspot.com/feeds/841484800812748341/comments/default' title='Post Comments'/><link rel='replies' type='text/html' href='http://bumphunting.blogspot.com/2009/09/following-seems-note-worthy.html#comment-form' title='0 Comments'/><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/158731714278125517/posts/default/841484800812748341'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/158731714278125517/posts/default/841484800812748341'/><link rel='alternate' type='text/html' href='http://bumphunting.blogspot.com/2009/09/following-seems-note-worthy.html' title=''/><author><name>Ted</name><uri>http://www.blogger.com/profile/14084184739434321794</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='32' height='32' src='http://4.bp.blogspot.com/_iHd5D9VLijw/Sk7Gw4W0c0I/AAAAAAAAAbE/JoyX-2z_cQ4/S220/gatchaman.jpg'/></author><thr:total>0</thr:total></entry><entry><id>tag:blogger.com,1999:blog-158731714278125517.post-5277379986927968558</id><published>2009-07-22T15:07:00.000-07:00</published><updated>2010-06-03T16:39:51.224-07:00</updated><title type='text'>What are good prequisite textbooks for someone interested in machine learning?</title><content type='html'>As mentioned in the last post, machine learning requires a good amount of background knowledge just to make sense of the topic. The core subject areas are:&lt;br /&gt;&lt;ul&gt;&lt;li&gt;calculus&lt;/li&gt;&lt;li&gt;linear algebra&lt;/li&gt;&lt;li&gt;&lt;span class="blsp-spelling-error" id="SPELLING_ERROR_0"&gt;combinatorics&lt;/span&gt; / discrete math&lt;br /&gt;&lt;/li&gt;&lt;li&gt;probability&lt;/li&gt;&lt;li&gt;statistics&lt;br /&gt;&lt;/li&gt;&lt;li&gt;information theory&lt;/li&gt;&lt;li&gt;real analysis&lt;/li&gt;&lt;li&gt;optimization theory&lt;br /&gt;&lt;/li&gt;&lt;/ul&gt;&lt;br /&gt;The following is a list of basic, introductory textbooks for each of these subjects :&lt;br /&gt;&lt;ul&gt;&lt;li&gt;&lt;a href="http://www.amazon.com/Calculus-Analytic-Geometry-George-Thomas/dp/0201531747"&gt;&lt;span style="font-style: italic;"&gt;Calculus and Analytic Geometry&lt;/span&gt;&lt;/a&gt; by Thomas &lt;span class="blsp-spelling-error" id="SPELLING_ERROR_1"&gt;Finney&lt;/span&gt;.  This was the plug and chug book we used in my college courses.&lt;/li&gt;&lt;/ul&gt;&lt;ul&gt;&lt;li&gt;&lt;a href="http://www.amazon.com/Linear-Algebra-Applications-Gilbert-Strang/dp/0030105676/ref=dp_ob_title_bk"&gt;&lt;span style="font-style: italic;"&gt;Linear Algebra and its Applications&lt;/span&gt;&lt;/a&gt; by Gilbert &lt;span class="blsp-spelling-error" id="SPELLING_ERROR_2"&gt;Strang&lt;/span&gt;.  Gilbert &lt;span class="blsp-spelling-error" id="SPELLING_ERROR_3"&gt;Strang&lt;/span&gt; also has another book, &lt;a href="http://www.amazon.com/Introduction-Linear-Algebra-Fourth-Gilbert/dp/0980232716/ref=pd_bxgy_b_img_c"&gt;&lt;span style="font-style: italic;"&gt;Introduction to Linear Algebra&lt;/span&gt;&lt;/a&gt;, which I haven't read.  I'm guessing either would be fine.&lt;/li&gt;&lt;/ul&gt;&lt;ul&gt;&lt;li&gt;&lt;span style="font-style: italic;"&gt;&lt;a href="http://www-cs-faculty.stanford.edu/%7Eknuth/gkp.html"&gt;Concrete Mathematics&lt;/a&gt; &lt;/span&gt;by Ronald L. Graham, Donald E. Knuth, Oren &lt;span class="blsp-spelling-error" id="SPELLING_ERROR_4"&gt;Patashnik&lt;/span&gt;.&lt;/li&gt;&lt;/ul&gt;&lt;ul&gt;&lt;li&gt;&lt;a href="http://www.amazon.com/First-Course-Probability-Sheldon-Ross/dp/0131856626"&gt;&lt;span style="font-style: italic;"&gt;A First Course in Probability&lt;/span&gt;&lt;/a&gt; by Sheldon Ross.  Additionally helpful is William Feller's &lt;span style="font-style: italic;"&gt;An Introduction to Probability Theory and Its Applications, Vol. 1&lt;/span&gt;.&lt;br /&gt;&lt;/li&gt;&lt;/ul&gt;&lt;ul&gt;&lt;li&gt;&lt;span style="font-style: italic;"&gt;&lt;a href="http://www.amazon.com/Mathematical-Statistics-Applications-W/dp/0534377416"&gt;Mathematical Statistics with Applications&lt;/a&gt; &lt;/span&gt;by &lt;span class="blsp-spelling-error" id="SPELLING_ERROR_5"&gt;Wackerly&lt;/span&gt;,  &lt;span class="blsp-spelling-error" id="SPELLING_ERROR_6"&gt;Mendenhall&lt;/span&gt; and &lt;span class="blsp-spelling-error" id="SPELLING_ERROR_7"&gt;Scheaffer&lt;/span&gt;.  This is a pretty standard stats book.&lt;br /&gt;&lt;/li&gt;&lt;/ul&gt;&lt;ul&gt;&lt;li&gt;&lt;span style="font-style: italic;"&gt;&lt;a href="http://www.elementsofinformationtheory.com/"&gt;Elements of Information Theory&lt;/a&gt; &lt;/span&gt;by Cover and Thomas.  I can't recommend this book highly enough.&lt;br /&gt;&lt;/li&gt;&lt;/ul&gt;&lt;ul&gt;&lt;li&gt;For real analysis, &lt;span class="blsp-spelling-error" id="SPELLING_ERROR_8"&gt;Marsden&lt;/span&gt; and Hoffman's &lt;a href="http://www.cds.caltech.edu/%7Emarsden/books/Elementary_Classical_Analys.html"&gt;&lt;span style="font-style: italic;"&gt;Elementary Classical Analysis&lt;/span&gt;&lt;/a&gt; is pretty standard.  It's not a great book though.  I find it annoying that the proofs are left for the ends of the chapters.&lt;/li&gt;&lt;/ul&gt;&lt;ul&gt;&lt;li&gt;&lt;a href="http://www.amazon.com/First-Course-Optimization-Theory/dp/0521497701"&gt;A First Course in Optimization Theory&lt;/a&gt; by Rangarajan K. Sundaram.&lt;br /&gt;&lt;br /&gt;&lt;/li&gt;&lt;li&gt;&lt;a href="http://www.blogger.com/post-edit.g?blogID=158731714278125517&amp;amp;postID=5277379986927968558"&gt;The Mathematics of Nonlinear Programming&lt;/a&gt; by Anthony L. Peressini, Francis E. Sullivan and J.J. Jr. Uhl&lt;br /&gt;&lt;/li&gt;&lt;/ul&gt;These books are very basic, at the undergraduate level for the most part.  However, if, like me, you weren't a math or engineering major, you will probably find them useful for quickly filling in the gaping holes in your education.  Later I'll post some introductory books at the graduate level.&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/158731714278125517-5277379986927968558?l=bumphunting.blogspot.com' alt='' /&gt;&lt;/div&gt;</content><link rel='replies' type='application/atom+xml' href='http://bumphunting.blogspot.com/feeds/5277379986927968558/comments/default' title='Post Comments'/><link rel='replies' type='text/html' href='http://bumphunting.blogspot.com/2009/07/what-are-good-prequisite-textbooks-for.html#comment-form' title='0 Comments'/><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/158731714278125517/posts/default/5277379986927968558'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/158731714278125517/posts/default/5277379986927968558'/><link rel='alternate' type='text/html' href='http://bumphunting.blogspot.com/2009/07/what-are-good-prequisite-textbooks-for.html' title='What are good prequisite textbooks for someone interested in machine learning?'/><author><name>Ted</name><uri>http://www.blogger.com/profile/14084184739434321794</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='32' height='32' src='http://4.bp.blogspot.com/_iHd5D9VLijw/Sk7Gw4W0c0I/AAAAAAAAAbE/JoyX-2z_cQ4/S220/gatchaman.jpg'/></author><thr:total>0</thr:total></entry><entry><id>tag:blogger.com,1999:blog-158731714278125517.post-3006885072096403125</id><published>2009-07-03T19:25:00.000-07:00</published><updated>2009-07-22T14:58:54.401-07:00</updated><category scheme='http://www.blogger.com/atom/ns#' term='machine_learning'/><category scheme='http://www.blogger.com/atom/ns#' term='books'/><title type='text'>What books should I read if I want to learn about machine learning?</title><content type='html'>I see this question posted on the web not infrequently and I wanted to throw in my two cents.  The real answer is that it greatly depends on your background and your interests.  Machine learning is vastly interdisciplinary, and the disciplines it builds on require individual study before learning about machine learning really becomes fruitful.  Aside from computer science, the prerequisite subjects for machine learning are, at the very least, real analysis, probability, statistics, information theory and optimization theory --- Quite a list!&lt;br /&gt;&lt;br /&gt;I was doing computer science at the undergraduate level when I became interested in machine learning.  Having taken courses in basic algorithm design, theory of computation, programming languages, and AI, I thought I had the necessary background to start doing some machine learning.  After all, it's still computer science, right?  Wrong --- in fact totally wrong.  The thing about machine learning as opposed to many other areas of computer science is that it's continuous rather than discrete math, or a lot of it is at least.  So if you have a math, physics, engineering or statistics background, you are in much better shape to start reading literature on machine learning than if you are versed in fundamental CS.  Of course, CS is useful, too, but it's less necessary in getting started.  In fact, many of the best people in machine learning did not come from the computer science.&lt;br /&gt;&lt;br /&gt;The other thing that makes answering this question difficult is that machine learning has more than a few sub-disciplines.  Picking the right book really depends on which of these you want to delve into.  Do you want to do theory?  Applications?  Applications in a particular domain? If you want to do natural language processing, then you shouldn't get a book on kernels.  However, if you want to understand  machine learning in general, then you should get a survey book.  There are some decent survey texts out there, but the better ones are only useful given some mathematical maturity.  Even then, it may be rough going.&lt;br /&gt;&lt;br /&gt;The best intro-to machine learning textbook I know of which is relatively accessible to people with a traditional computer science education is Tom Mitchell's &lt;a href="http://www.cs.cmu.edu/afs/cs.cmu.edu/user/mitchell/ftp/mlbook.html"&gt;&lt;span style="font-style: italic;"&gt;Machine Learning&lt;/span&gt;&lt;/a&gt;.  However, it is rudimentary and is quickly becoming completely out of date (how sad!).  There is also Russell and Norvig's &lt;a href="http://aima.cs.berkeley.edu/"&gt;&lt;span style="font-style: italic;"&gt;Artificial Intelligence: A Modern Approach&lt;/span&gt;&lt;/a&gt;, which covers topics in more classical AI at the expense of machine learning topics.&lt;br /&gt;&lt;br /&gt;I think the best survey texts on machine learning are probably Hastie, Tibshirani and Friedman's &lt;a href="http://www-stat.stanford.edu/%7Etibs/ElemStatLearn/"&gt;&lt;span style="font-style: italic;"&gt;Elements of Statistical Learning&lt;/span&gt;&lt;/a&gt;, whose recent arrival in an expanded 2nd edition is what prompted me to write this post, and Chris Bishop's &lt;a href="http://research.microsoft.com/en-us/um/people/cmbishop/prml/"&gt;&lt;span style="font-style: italic;"&gt;Pattern Recognition and Machine Learning&lt;/span&gt;&lt;/a&gt;, which attempts to be the end-all-be-all modern machine learning textbook.  However, these books require more facility in the above prerequisite subjects than the average computer scientist usually has.   Another commonly cited survey book in the same vein is Duda, Hart and Stork's &lt;a href="http://rii.ricoh.com/%7Estork/DHS.html"&gt;&lt;span style="font-style: italic;"&gt;Pattern Classification&lt;/span&gt;&lt;/a&gt;.  It's more basic than the previous two and I've found it to be less useful as well.&lt;br /&gt;&lt;br /&gt;If you are interested in natural language processing, you are in luck because the survey texts are more accessible to a general CS audience.  There's  Manning and Schutze's &lt;a href="http://nlp.stanford.edu/fsnlp/"&gt;Foundations of Statistical Natural Language Processing&lt;/a&gt;, and Jurafsky and Martin's &lt;a href="http://www.cs.colorado.edu/%7Emartin/slp.html"&gt;&lt;span style="font-style: italic;"&gt;Speech and Language Processing&lt;/span&gt;&lt;/a&gt;.  Fred Jelinek also has a wonderful book, &lt;span class="pagetitle"&gt;&lt;a href="http://mitpress.mit.edu/catalog/item/default.asp?ttype=2&amp;amp;tid=7447&amp;amp;xid=4&amp;amp;xcid=0"&gt;&lt;span style="font-style: italic;"&gt;Statistical Methods for Speech Recognition&lt;/span&gt;&lt;/a&gt;.&lt;/span&gt;&lt;br /&gt;&lt;br /&gt;So these are my suggestions. Other people will have others (which I am eager to hear about).  Later I will post my suggestions on good textbooks for the prereqs.  Happy 4th of July, everyone.&lt;br /&gt;&lt;br /&gt;--------------------------------------------------&lt;br /&gt;&lt;br /&gt;Here are a couple of additions to the ML book list, and best of all, they are &lt;span style="font-style: italic;"&gt;freely available&lt;/span&gt; online:&lt;br /&gt;&lt;br /&gt;(1) Nils J. Nilsson's &lt;a style="font-style: italic;" href="http://robotics.stanford.edu/people/nilsson/mlbook.html"&gt;Introduction to Machine Learning, Draft of Incomplete Notes&lt;/a&gt; is similar in spirit to Tom Mitchell's book.&lt;br /&gt;&lt;br /&gt;(2) David MacKay's &lt;a href="http://www.inference.phy.cam.ac.uk/mackay/itila/"&gt;&lt;span style="font-style: italic;"&gt;Information Theory, Inference, and Learning Algorithms&lt;/span&gt;&lt;/a&gt;.  This book has a different focus from the other intro books listed above.  Rather than provide a comprehensive survey of machine learning methods, it seeks to introduce machine learning by way of information theory and Bayesian modeling, and thus put the topic on solid theoretical footing.  Its focus is also on developing the intellectual abilities of the reader, which frankly makes it a far better introduction than the others above.  And from I've read so far, MacKay's writing is insanely entertaining.  I'm definitely looking forward to having more time to read this gem.&lt;br /&gt;&lt;br /&gt;&lt;span&gt;&lt;span style="font-family:Helvetica;"&gt;&lt;a name="notrealbook"&gt;&lt;span style="font-weight: bold;"&gt;&lt;/span&gt;&lt;/a&gt;&lt;/span&gt;&lt;/span&gt;&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/158731714278125517-3006885072096403125?l=bumphunting.blogspot.com' alt='' /&gt;&lt;/div&gt;</content><link rel='replies' type='application/atom+xml' href='http://bumphunting.blogspot.com/feeds/3006885072096403125/comments/default' title='Post Comments'/><link rel='replies' type='text/html' href='http://bumphunting.blogspot.com/2009/07/what-books-should-i-read-if-i-want-to.html#comment-form' title='0 Comments'/><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/158731714278125517/posts/default/3006885072096403125'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/158731714278125517/posts/default/3006885072096403125'/><link rel='alternate' type='text/html' href='http://bumphunting.blogspot.com/2009/07/what-books-should-i-read-if-i-want-to.html' title='What books should I read if I want to learn about machine learning?'/><author><name>Ted</name><uri>http://www.blogger.com/profile/14084184739434321794</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='32' height='32' src='http://4.bp.blogspot.com/_iHd5D9VLijw/Sk7Gw4W0c0I/AAAAAAAAAbE/JoyX-2z_cQ4/S220/gatchaman.jpg'/></author><thr:total>0</thr:total></entry></feed>
