bloggerrized

<div dir="ltr" style="text-align: left;" trbidi="on"> <div class="navbar-fixed-top" style="background-color: #820000;"> <table cellpadding="0" class="main" style="margin-bottom: 10px; margin-left: 10px; margin-right: 10px; margin-top: 10px;"><tbody> <tr> <td class="main"><div class="Title"> CS 276 / LING 286: <a class="zem_slink" href="http://en.wikipedia.org/wiki/Information_retrieval" rel="wikipedia" target="_blank" title="Information retrieval">Information Retrieval</a> and Web Search         Spring 2013 </div> <div class="Lecturers"> Chris Manning, <a class="zem_slink" href="http://en.wikipedia.org/wiki/Pandu" rel="wikipedia" target="_blank" title="Pandu">Pandu</a> Nayak, and Prabhakar Raghavan </div> <a class="buttons" href="http://www.stanford.edu/class/cs276/#courseinfo">Course Info</a>    <a class="buttons" href="http://www.stanford.edu/class/cs276/#syllabus">Syllabus</a>    <a class="buttons" href="https://stanford.coursera.org/cs276-001"> Coursera </a>    <a class="buttons" href="http://piazza.com/stanford/spring2013/cs276"> Piazza </a>    <a class="buttons" href="http://www.stanford.edu/class/cs276/#books"> Books </a> </td> </tr> </tbody></table> </div> <div class="hero-unit hidden-phone"> <div id="courseinfo"> CS 276/286 LING: Information Retrieval <a class="zem_slink" href="http://en.wikipedia.org/wiki/Dan_%28rank%29" rel="wikipedia" target="_blank" title="Dan (rank)">dan</a> Web Cari Spring 2013 </div> <div class="Lecturers"> Chris Manning, Pandu Nayak, dan Prabhakar Raghavan </div> <a class="buttons" href="http://translate.googleusercontent.com/translate_c?depth=1&hl=id&ie=UTF8&langpair=auto%7Cid&rurl=translate.google.com&tbb=1&u=http://www.stanford.edu/class/cs276/&usg=ALkJrhjUROmIC7GHyyqwhCZObgI52jWliw#courseinfo">Kursus Info</a> <a class="buttons" href="http://translate.googleusercontent.com/translate_c?depth=1&hl=id&ie=UTF8&langpair=auto%7Cid&rurl=translate.google.com&tbb=1&u=http://www.stanford.edu/class/cs276/&usg=ALkJrhjUROmIC7GHyyqwhCZObgI52jWliw#syllabus">Silabus</a> <a class="buttons" href="https://translate.googleusercontent.com/translate_c?depth=1&hl=id&ie=UTF8&langpair=auto%7Cid&rurl=translate.google.com&tbb=1&u=https://stanford.coursera.org/cs276-001&usg=ALkJrhjhDj2QjPqrqiy-jfpupHvGuFAF1A">Coursera</a> <a class="buttons" href="http://translate.googleusercontent.com/translate_c?depth=1&hl=id&ie=UTF8&langpair=auto%7Cid&rurl=translate.google.com&tbb=1&u=http://piazza.com/stanford/spring2013/cs276&usg=ALkJrhik06zh1AErVDPuNJUMJoDn-Vgm6A">Piazza</a> <a class="buttons" href="http://translate.googleusercontent.com/translate_c?depth=1&hl=id&ie=UTF8&langpair=auto%7Cid&rurl=translate.google.com&tbb=1&u=http://www.stanford.edu/class/cs276/&usg=ALkJrhjUROmIC7GHyyqwhCZObgI52jWliw#books">Buku</a> <div class="hero-unit hidden-phone"> <div id="courseinfo"> </div> <div style="color: #336666; font-size: 22pt;"> CS 276/286 LING: Retrieval Informasi dan Web Search </div> Kuliah: 3 unit, Tu / Th 4:15-05:30 di Auditorium <a class="zem_slink" href="http://maps.google.com/maps?ll=37.3707277778,-121.963738889&spn=0.01,0.01&q=37.3707277778,-121.963738889%20(Nvidia)&t=h" rel="geolocation" target="_blank" title="Nvidia">NVIDIA</a> (tersedia secara online melalui <a href="http://translate.googleusercontent.com/translate_c?depth=1&hl=id&ie=UTF8&langpair=auto%7Cid&rurl=translate.google.com&tbb=1&u=http://scpd.stanford.edu/search/publicCourseSearchDetails.do%3Fmethod%3Dload%26courseId%3D11807&usg=ALkJrhjHHP_d2TQUDK0FQ4xEhDOdZk6BGA">SCPD</a> ) Staf e-mail: <a href="mailto:cs276-spr1213-staff@lists.stanford.edu">cs276-spr1213-staff@lists.stanford.edu</a> <h2> Kursus Deskripsi </h2> Teknik dasar dan lanjutan untuk sistem informasi berbasis teks: pengindeksan teks efisien, <a class="zem_slink" href="http://en.wikipedia.org/wiki/Boolean_algebra" rel="wikipedia" target="_blank" title="Boolean algebra">Boolean</a> dan vektor model pengambilan space, masalah evaluasi dan antarmuka, pencarian Web termasuk merangkak, algoritma berbasis link-, dan Web metadata, pengelompokan teks / Web, klasifikasi; pertambangan teks . <a href="http://translate.googleusercontent.com/translate_c?depth=1&hl=id&ie=UTF8&langpair=auto%7Cid&rurl=translate.google.com&tbb=1&u=http://www.stanford.edu/class/cs276/courseinfo.html&usg=ALkJrhgofo2JIVwmUqEc0EX-ZlIqpBsXgA">Kebijakan Informasi (grading, dll)</a> Prasyarat: CS 107, CS 109, CS 161. Idealnya seluruh CS Mayor Inti. <h2> Online Resources </h2> Coursera: CS 276 akan memanfaatkan video online dan kuis serta ceramah hidup kelas, presentasi, dan laboratorium. Kunjungi <a href="https://translate.googleusercontent.com/translate_c?depth=1&hl=id&ie=UTF8&langpair=auto%7Cid&rurl=translate.google.com&tbb=1&u=https://stanford.coursera.org/cs276-001&usg=ALkJrhjhDj2QjPqrqiy-jfpupHvGuFAF1A">Coursera</a> untuk menemukan potongan video dan latihan online. Kami akan posting tugas pemrograman yang diperlukan dan masalah set melalui Coursera, jadi mendaftar segera (dengan <a class="zem_slink" href="http://www.forbes.com/colleges/stanford-university/" rel="forbes" target="_blank" title="Stanford University">Stanford</a> ID Anda)! Piazza: Kami sangat menyarankan agar Anda posting pertanyaan tentang tugas, kuliah atau materi kuliah umum di <a href="http://translate.googleusercontent.com/translate_c?depth=1&hl=id&ie=UTF8&langpair=auto%7Cid&rurl=translate.google.com&tbb=1&u=http://piazza.com/stanford/spring2013/cs276&usg=ALkJrhik06zh1AErVDPuNJUMJoDn-Vgm6A">Piazza</a> . Ini memfasilitasi diskusi antara siswa, dan memungkinkan orang lain untuk mendapatkan keuntungan dari diskusi juga. Bahkan jika Anda pikir pertanyaan Anda adalah khusus untuk pelaksanaan Anda, Anda dapat menggunakan fitur 'pertanyaan pribadi' untuk mengatasi pertanyaan kepada staf khusus. Kami akan menggunakan Piazza untuk mengirim saja pengumuman, jadi pastikan untuk mendaftar di Piazza segera juga. Berikut adalah cepat <a href="http://translate.googleusercontent.com/translate_c?depth=1&hl=id&ie=UTF8&langpair=auto%7Cid&rurl=translate.google.com&tbb=1&u=http://www.youtube.com/watch%3Fv%3DDoKY0DXMvDs&usg=ALkJrhhtVOAdW-ClKhaZpjfOTOnGA2uxSw">pengenalan video</a> . Staf Email: Jika Anda benar-benar memiliki pertanyaan tentang situasi Anda secara khusus, bahwa Anda tidak berpikir tidak sesuai untuk forum kelas (bahkan bukan pertanyaan pribadi), silahkan email staf <a class="zem_slink" href="http://en.wikipedia.org/wiki/Mailing_list" rel="wikipedia" target="_blank" title="Mailing list">mailing list</a> di <a href="mailto:cs276-spr1213-staff@lists.stanford.edu">cs276-spr1213-staf @ daftar. stanford.edu</a> . <div class="MsoNormal1"> Pengumuman: Jika Anda tidak terdaftar dalam kursus tapi ingin menerima saja pengumuman, Anda dapat berlangganan ke mailing list tamu <a href="https://translate.googleusercontent.com/translate_c?depth=1&hl=id&ie=UTF8&langpair=auto%7Cid&rurl=translate.google.com&tbb=1&u=https://mailman.stanford.edu/mailman/listinfo/cs276-spr1213-guests&usg=ALkJrhgko82G5Elsj_hnO3KXdvhjBltfTw">cs276-spr1213-tamu</a> . </div> <h2> CS 276 Informasi Staf </h2> Profesor: <a href="http://translate.googleusercontent.com/translate_c?depth=1&hl=id&ie=UTF8&langpair=auto%7Cid&rurl=translate.google.com&tbb=1&u=http://nlp.stanford.edu/%7Emanning/&usg=ALkJrhgZQvwqtPDHX4rsf7o48HtWZdxh2g">Chris Manning</a> , Jam Kantor: Wednesday 3-<a class="zem_slink" href="http://www.last.fm/music/4PM" rel="lastfm" target="_blank" title="4PM">4 PM</a>, Gates 158 <a href="http://translate.googleusercontent.com/translate_c?depth=1&hl=id&ie=UTF8&langpair=auto%7Cid&rurl=translate.google.com&tbb=1&u=http://www.pandunayak.com/&usg=ALkJrhig4bP45-gJ6FmyJz1cawGxsyEHAw">Pandu Nayak</a> , Jam kantor: setelah kelas dengan pengaturan sebelumnya <a href="http://translate.googleusercontent.com/translate_c?depth=1&hl=id&ie=UTF8&langpair=auto%7Cid&rurl=translate.google.com&tbb=1&u=http://theory.stanford.edu/%7Epragh/&usg=ALkJrhg9CCMJI29oeuUa6ZUuPsTL7SolOg">Prabhakar Raghavan</a> , Jam kantor: setelah kelas dengan pengaturan sebelumnya TA: Sonal Gupta (Kepala TA), Shui Hu, Anshul Mittal, Rukmani RaviSundaram, Thang Luong <h2> Jam TA Office </h2> Untuk jadwal rinci, memeriksa kalender Google menggunakan ID: f0qejqeg52qo292jk3i44lqd04@group.calendar.google.com Jam Daytime Office <ul> <li> Senin: Gates B24A 10 11:00 </li> <li> Rabu: Gates B26B 11:00-12:00 </li> <li> Jumat: Gates B26B 10 11:00 </li> </ul> <div id="syllabus"> Coding Sesi </div> <ul> <li> Selasa: Bldg 160 Room 332 6-9 </li> <li> Rabu: Bldg 160 Room 332 6-09:00 </li> </ul> Untuk siswa SCPD, kami akan tersedia melalui Google hangout, link yang akan diposting di Piazza. <h2> Silabus </h2> Rincian jadwal, video, slide dan daftar bacaan akan diperbarui sebagai kuartal berlangsung. <div> <a href="https://www.blogger.com/blogger.g?blogID=3861076408851542502" imageanchor="1" style="clear: left; float: left; margin-bottom: 1em; margin-right: 1em;"></a><a href="https://www.blogger.com/blogger.g?blogID=3861076408851542502" imageanchor="1" style="clear: right; float: right; margin-bottom: 1em; margin-left: 1em;"></a><table border="1px solid black" style="width: 100%px;"><tbody> <tr style="background-color: #ffff99;"><td> Tanggal </td><td> Dalam Kelas </td><td> Tugas </td><td> Siapa </td><td> Bahan </td></tr> <tr><td style="width: 5%;"> Tue 2 Apr </td><td style="width: 30%;"> Pengantar saja: Diskusi isu dalam pencarian ditambah Web 1: pencarian Web, iklan, SEO </td><td> </td><td> PN </td><td> Coursera: Boolean Retrieval (IIR Ch. 1) Catatan: [ <a href="http://translate.googleusercontent.com/translate_c?depth=1&hl=id&ie=UTF8&langpair=auto%7Cid&rurl=translate.google.com&tbb=1&u=http://www.stanford.edu/class/cs276/handouts/lecture1-intro.ppt&usg=ALkJrhhLZT8GIKVCl3dTjQQVH4CyyaiuBg">powerpoint</a> ] [ <a href="http://translate.googleusercontent.com/translate_c?depth=1&hl=id&ie=UTF8&langpair=auto%7Cid&rurl=translate.google.com&tbb=1&u=http://www.stanford.edu/class/cs276/handouts/lecture1-intro-handout-6-per.pdf&usg=ALkJrhjviF0YzsJv1ICRi5Gcpi3_tox4vQ">PDF / 6</a> ] [ <a href="http://translate.googleusercontent.com/translate_c?depth=1&hl=id&ie=UTF8&langpair=auto%7Cid&rurl=translate.google.com&tbb=1&u=http://www.stanford.edu/class/cs276/handouts/lecture1-intro-handout-1-per.pdf&usg=ALkJrhilKGsRHWbF1qk-5yFBPhRVPe1PNw">PDF / 1</a> ] Bacaan: <a href="http://translate.googleusercontent.com/translate_c?depth=1&hl=id&ie=UTF8&langpair=auto%7Cid&rurl=translate.google.com&tbb=1&u=http://nlp.stanford.edu/IR-book/pdf/01bool.pdf&usg=ALkJrhh6WInCAI3QOYguvZCkPK4vE1cSWw">IIR Ch.</a> <a href="http://translate.googleusercontent.com/translate_c?depth=1&hl=id&ie=UTF8&langpair=auto%7Cid&rurl=translate.google.com&tbb=1&u=http://nlp.stanford.edu/IR-book/pdf/01bool.pdf&usg=ALkJrhh6WInCAI3QOYguvZCkPK4vE1cSWw">1</a> MG 3.2 MIR 8.2 <a href="http://translate.googleusercontent.com/translate_c?depth=1&hl=id&ie=UTF8&langpair=auto%7Cid&rurl=translate.google.com&tbb=1&u=http://www.rhymezone.com/shakespeare/&usg=ALkJrhhhmGgZcv8omjVLNkcFeOWbjyG-jQ">Drama Shakespeare</a> </td></tr> <tr><td style="width: 5%;"> Thu 4 Apr </td><td style="width: 30%;"> Pembicara tamu: Jeff Dean pada evolusi pencarian Google dan sistem pencarian </td><td> PA1 out </td><td> Jeff </td><td> Coursera: Daftar Kosakata Syarat dan Postingan (IIR Ch. 2) Catatan: [ <a href="http://translate.googleusercontent.com/translate_c?depth=1&hl=id&ie=UTF8&langpair=auto%7Cid&rurl=translate.google.com&tbb=1&u=http://www.stanford.edu/class/cs276/handouts/lecture2-dictionary.ppt&usg=ALkJrhgvlqutHn1UN_M7UGTdAF1eeKsSyg">powerpoint</a> ] [ <a href="http://translate.googleusercontent.com/translate_c?depth=1&hl=id&ie=UTF8&langpair=auto%7Cid&rurl=translate.google.com&tbb=1&u=http://www.stanford.edu/class/cs276/handouts/lecture2-dictionary-handout-6-per.pdf&usg=ALkJrhjBzmG-g8QGf6pl8OOvYMpR7KbJAw">PDF / 6</a> ] [ <a href="http://translate.googleusercontent.com/translate_c?depth=1&hl=id&ie=UTF8&langpair=auto%7Cid&rurl=translate.google.com&tbb=1&u=http://www.stanford.edu/class/cs276/handouts/lecture2-dictionary-handout-1-per.pdf&usg=ALkJrhhf9LhanByQHRmZruFyND6Sce6Bqg">PDF / 1</a> ] Bacaan: <a href="http://translate.googleusercontent.com/translate_c?depth=1&hl=id&ie=UTF8&langpair=auto%7Cid&rurl=translate.google.com&tbb=1&u=http://nlp.stanford.edu/IR-book/pdf/02voc.pdf&usg=ALkJrhjLuluhfXCkjKCf2kTXnaXiqm-b7Q">IIR Ch.</a> <a href="http://translate.googleusercontent.com/translate_c?depth=1&hl=id&ie=UTF8&langpair=auto%7Cid&rurl=translate.google.com&tbb=1&u=http://nlp.stanford.edu/IR-book/pdf/02voc.pdf&usg=ALkJrhjLuluhfXCkjKCf2kTXnaXiqm-b7Q">2</a> MG 3.6, 4.3 MIR 7.2 <a href="http://translate.googleusercontent.com/translate_c?depth=1&hl=id&ie=UTF8&langpair=auto%7Cid&rurl=translate.google.com&tbb=1&u=http://www.sims.berkeley.edu/%7Ehearst/irbook/porter.html&usg=ALkJrhhgymg6wVQ2FtXtwAAd6xz9UxDOGw">Stemmer Porter (MIR)</a> , <a href="http://translate.googleusercontent.com/translate_c?depth=1&hl=id&ie=UTF8&langpair=auto%7Cid&rurl=translate.google.com&tbb=1&u=http://www.tartarus.org/%7Emartin/PorterStemmer/&usg=ALkJrhiyecw7tiBn2Cv8zIS6JgH5T2RNjA">Porter berasal algoritma (Official)</a> <a href="http://translate.googleusercontent.com/translate_c?depth=1&hl=id&ie=UTF8&langpair=auto%7Cid&rurl=translate.google.com&tbb=1&u=http://citeseerx.ist.psu.edu/viewdoc/summary%3Fdoi%3D10.1.1.17.524&usg=ALkJrhirxBERMhyEmh7Dr97qGtI0c48_Xw">Daftar melewatkan masak (Pugh 1990)</a> <a href="http://translate.googleusercontent.com/translate_c?depth=1&hl=id&ie=UTF8&langpair=auto%7Cid&rurl=translate.google.com&tbb=1&u=http://portal.acm.org/citation.cfm%3Fid%3D1028102&usg=ALkJrhixE8ENyb9ODbG4EVBiDGfyIxpmAA">Frase cepat query dengan indeks gabungan (Williams, Zobel, Bahle 2004)</a> <a href="http://translate.googleusercontent.com/translate_c?depth=1&hl=id&ie=UTF8&langpair=auto%7Cid&rurl=translate.google.com&tbb=1&u=http://portal.acm.org/citation.cfm%3Fid%3D564415&usg=ALkJrhhaecUwfVT4x_gdM00FGqtgtYoAkQ">Frase efisien query dengan indeks tambahan (Bahle, Williams, Zobel 2002)</a> <a href="http://translate.googleusercontent.com/translate_c?depth=1&hl=id&ie=UTF8&langpair=auto%7Cid&rurl=translate.google.com&tbb=1&u=http://portal.acm.org/citation.cfm%3Fid%3D1251264&usg=ALkJrhg7XpP9wgLCcE71tcF4IoXR2y3iJQ">MapReduce: pengolahan data disederhanakan pada kelompok besar (Dean dan Ghemawat 2004)</a> </td></tr> <tr><td style="width: 5%;"> Tue 9 Apr </td><td style="width: 30%;"> Kelas laboratorium: Menulis algoritma merge untuk kedekatan query menggunakan indeks posisional <a href="http://translate.googleusercontent.com/translate_c?depth=1&hl=id&ie=UTF8&langpair=auto%7Cid&rurl=translate.google.com&tbb=1&u=http://beta.primarypad.com/p/Tkbx3s2Olc&usg=ALkJrhjuAwsyXelkFAQe7N_dNm1U1CPpyw">PrimaryPad</a> Bersama gdoc: <a href="http://translate.googleusercontent.com/translate_c?depth=1&hl=id&ie=UTF8&langpair=auto%7Cid&rurl=translate.google.com&tbb=1&u=http://bit.ly/HgCAdP&usg=ALkJrhhZQHL--orGoxiZpV6WBFr8bK_HIA">http://bit.ly/HgCAdP</a> <a href="http://translate.googleusercontent.com/translate_c?depth=1&hl=id&ie=UTF8&langpair=auto%7Cid&rurl=translate.google.com&tbb=1&u=http://www.stanford.edu/class/cs276/python_map_red/intersect.py&usg=ALkJrhixnjdBwt2QNd5MZIOBLADFLnE1UA">Persimpangan kerangka</a> <a href="http://translate.googleusercontent.com/translate_c?depth=1&hl=id&ie=UTF8&langpair=auto%7Cid&rurl=translate.google.com&tbb=1&u=http://www.stanford.edu/class/cs276/python_map_red/positional.py&usg=ALkJrhh5wnwFeb4uP6gwLD2nvZa4FPZ81A">Kerangka Positional</a> <a href="http://translate.googleusercontent.com/translate_c?depth=1&hl=id&ie=UTF8&langpair=auto%7Cid&rurl=translate.google.com&tbb=1&u=http://www.stanford.edu/class/cs276/restricted/positional.py&usg=ALkJrhh9nhI8J3vvFxiczAlJqDecjK13mg">Jawaban Positional</a> [Membutuhkan sunet ID] </td><td> PS1 Out </td><td> CM </td><td> Coursera: Index Konstruksi (IIR Ch. 4) Catatan [ <a href="http://translate.googleusercontent.com/translate_c?depth=1&hl=id&ie=UTF8&langpair=auto%7Cid&rurl=translate.google.com&tbb=1&u=http://www.stanford.edu/class/cs276/handouts/lecture4-indexconstruction.ppt&usg=ALkJrhhCbAJPLgdq0aZwmV1Z6HIh7Ij00w">powerpoint</a> ] [ <a href="http://translate.googleusercontent.com/translate_c?depth=1&hl=id&ie=UTF8&langpair=auto%7Cid&rurl=translate.google.com&tbb=1&u=http://www.stanford.edu/class/cs276/handouts/lecture4-indexconstruction-handout-6-per.pdf&usg=ALkJrhhxO0wg8pSWxtqaIyH5r3ZjEwUY0A">PDF / 6</a> ] [ <a href="http://translate.googleusercontent.com/translate_c?depth=1&hl=id&ie=UTF8&langpair=auto%7Cid&rurl=translate.google.com&tbb=1&u=http://www.stanford.edu/class/cs276/handouts/lecture4-indexconstruction-handout-1-per.pdf&usg=ALkJrhgkJod5S2-1_9BmLinCjIo6KamW-w">PDF / 1</a> ] Bacaan <a href="http://translate.googleusercontent.com/translate_c?depth=1&hl=id&ie=UTF8&langpair=auto%7Cid&rurl=translate.google.com&tbb=1&u=http://nlp.stanford.edu/IR-book/pdf/04const.pdf&usg=ALkJrhj7R0mOizxnH8G0CMXrEO46cuOPvQ">IIR Ch.</a> <a href="http://translate.googleusercontent.com/translate_c?depth=1&hl=id&ie=UTF8&langpair=auto%7Cid&rurl=translate.google.com&tbb=1&u=http://nlp.stanford.edu/IR-book/pdf/04const.pdf&usg=ALkJrhj7R0mOizxnH8G0CMXrEO46cuOPvQ">4</a> MG Ch. 5 <a href="http://translate.googleusercontent.com/translate_c?depth=1&hl=id&ie=UTF8&langpair=auto%7Cid&rurl=translate.google.com&tbb=1&u=http://citeseerx.ist.psu.edu/viewdoc/summary%3Fdoi%3D10.1.1.13.5871&usg=ALkJrhitaWfXDJmUzEo_vBp-Uw6tvjezSg">Konstruksi yang efisien indeks single-pass untuk database teks (Heinz dan Zobel 2003)</a> </td></tr> <tr><td> Thu 11 Apr </td><td> Lab kelas: Algoritma untuk daftar posting kompresi <a href="http://translate.googleusercontent.com/translate_c?depth=1&hl=id&ie=UTF8&langpair=auto%7Cid&rurl=translate.google.com&tbb=1&u=http://free.primarypad.com/p/gisfgz6VxB&usg=ALkJrhhCgzGf82jVtwi-9oAh5Xxbo73x3Q">PrimaryPad</a> <a href="http://translate.googleusercontent.com/translate_c?depth=1&hl=id&ie=UTF8&langpair=auto%7Cid&rurl=translate.google.com&tbb=1&u=http://www.stanford.edu/class/cs276/python_map_red/compress.py&usg=ALkJrhjyxHEFj7dfjIziLidb0KpgUJY8aA">compress.py</a> <a href="https://translate.googleusercontent.com/translate_c?depth=1&hl=id&ie=UTF8&langpair=auto%7Cid&rurl=translate.google.com&tbb=1&u=https://docs.google.com/spreadsheet/ccc%3Fkey%3D0Apzus10Blrn3dEROXzJhRm5tZkYwR0VfSnd6MWVoVFE&usg=ALkJrhg-w3yJ2860EuG3OEz4x1M1aUDBQQ">Hasil gdoc spreadsheet</a> <a href="http://translate.googleusercontent.com/translate_c?depth=1&hl=id&ie=UTF8&langpair=auto%7Cid&rurl=translate.google.com&tbb=1&u=http://www.stanford.edu/class/cs276/Jeff-Dean-compression-slides.pdf&usg=ALkJrhggGda3ayGjifJrXXIExFl4e3zRdA">Slide kompresi Jeff Dean</a> <a href="http://translate.googleusercontent.com/translate_c?depth=1&hl=id&ie=UTF8&langpair=auto%7Cid&rurl=translate.google.com&tbb=1&u=http://www.stanford.edu/class/cs276/Simple-9.pdf&usg=ALkJrhidkPUcdQKRY0LRQN5PPMazcJ7sUA">Simple-9</a> (Anh / Moffat) Wikipedia: <a href="http://translate.googleusercontent.com/translate_c?depth=1&hl=id&ie=UTF8&langpair=auto%7Cid&rurl=translate.google.com&tbb=1&u=http://en.wikipedia.org/wiki/Golomb_coding&usg=ALkJrhgCH2jSK2f1qwbfPcvwztYeLHivfg">Golumb / Beras</a> , <a href="http://translate.googleusercontent.com/translate_c?depth=1&hl=id&ie=UTF8&langpair=auto%7Cid&rurl=translate.google.com&tbb=1&u=http://en.wikipedia.org/wiki/Huffman_coding&usg=ALkJrhiyqdkP2PRZjZfh25MzPdKS0SsAJQ">Huffman</a> , <a href="http://translate.googleusercontent.com/translate_c?depth=1&hl=id&ie=UTF8&langpair=auto%7Cid&rurl=translate.google.com&tbb=1&u=http://en.wikipedia.org/wiki/Gamma_code&usg=ALkJrhjMKp7cz4pagxq2SmwTE5StQpzjVw">kode gamma Elias</a> , <a href="http://translate.googleusercontent.com/translate_c?depth=1&hl=id&ie=UTF8&langpair=auto%7Cid&rurl=translate.google.com&tbb=1&u=http://en.wikipedia.org/wiki/Unary_coding&usg=ALkJrhg57rkC_Q72kBLXXdbQ0Vtw3xhiKA">kode unary</a> </td><td> </td><td> CM </td><td> Coursera: Indeks Kompresi (IIR Ch. 5) Catatan: [ <a href="http://translate.googleusercontent.com/translate_c?depth=1&hl=id&ie=UTF8&langpair=auto%7Cid&rurl=translate.google.com&tbb=1&u=http://www.stanford.edu/class/cs276/handouts/lecture5-compression.ppt&usg=ALkJrhhVo-NcAv7PzmrCKJppWh8pzG-v3g">powerpoint</a> ] [ <a href="http://translate.googleusercontent.com/translate_c?depth=1&hl=id&ie=UTF8&langpair=auto%7Cid&rurl=translate.google.com&tbb=1&u=http://www.stanford.edu/class/cs276/handouts/lecture5-compression-handout-6-per.pdf&usg=ALkJrhi6wq4qg2gh2Bj76OFILsl3IeykDg">PDF / 6</a> ] [ <a href="http://translate.googleusercontent.com/translate_c?depth=1&hl=id&ie=UTF8&langpair=auto%7Cid&rurl=translate.google.com&tbb=1&u=http://www.stanford.edu/class/cs276/handouts/lecture5-compression-handout-1-per.pdf&usg=ALkJrhgU_8mhId7V_MFwEt2hjdnIP_nQIw">PDF / 1</a> ] Bacaan: <a href="http://translate.googleusercontent.com/translate_c?depth=1&hl=id&ie=UTF8&langpair=auto%7Cid&rurl=translate.google.com&tbb=1&u=http://nlp.stanford.edu/IR-book/pdf/05comp.pdf&usg=ALkJrhjxT676TPm8AmLdCDxTYiWhKyp2Mw">IIR Ch.</a> <a href="http://translate.googleusercontent.com/translate_c?depth=1&hl=id&ie=UTF8&langpair=auto%7Cid&rurl=translate.google.com&tbb=1&u=http://nlp.stanford.edu/IR-book/pdf/05comp.pdf&usg=ALkJrhjxT676TPm8AmLdCDxTYiWhKyp2Mw">5</a> MG 3.3, 3.4 <a href="http://translate.googleusercontent.com/translate_c?depth=1&hl=id&ie=UTF8&langpair=auto%7Cid&rurl=translate.google.com&tbb=1&u=http://portal.acm.org/citation.cfm%3Fid%3D564416&usg=ALkJrhiq9NZf1hBditG9mXGdfeY0o9n5Lw">Kompresi indeks terbalik untuk evaluasi permintaan cepat (Scholer et al 2002.)</a> <a href="http://translate.googleusercontent.com/translate_c?depth=1&hl=id&ie=UTF8&langpair=auto%7Cid&rurl=translate.google.com&tbb=1&u=http://www.springerlink.com/content/j66851228120170t/&usg=ALkJrhi1mcER7w4pXWRVMLY6kw2eG4yFvg">Kompresi indeks terbalik menggunakan kode biner kata-blok (Anh dan Moffat 2005)</a> </td></tr> <tr><td style="width: 5%;"> Tue 16 Apr </td><td style="width: 30%;"> Koreksi ejaan [ <a href="http://translate.googleusercontent.com/translate_c?depth=1&hl=id&ie=UTF8&langpair=auto%7Cid&rurl=translate.google.com&tbb=1&u=http://www.stanford.edu/class/cs276/handouts/spell_correction_4_16_2013.ppt&usg=ALkJrhhOEfXYzcdLIpTXTk4qSJ_bzME1MQ">powerpoint</a> ] [ <a href="http://translate.googleusercontent.com/translate_c?depth=1&hl=id&ie=UTF8&langpair=auto%7Cid&rurl=translate.google.com&tbb=1&u=http://www.stanford.edu/class/cs276/handouts/spell_correction_4_16_2013_6.pdf&usg=ALkJrhiVkS0t_kUE0_tdyi_SAEWsVoOC8A">PDF / 6</a> ] [ <a href="http://translate.googleusercontent.com/translate_c?depth=1&hl=id&ie=UTF8&langpair=auto%7Cid&rurl=translate.google.com&tbb=1&u=http://www.stanford.edu/class/cs276/handouts/spell_correction_4_16_2013_1.pdf&usg=ALkJrhgKegHXkoDp2wMSvtlTqGHZL6Ir5g">PDF / 1</a> ] </td><td> Karena PS1 </td><td> PR </td><td> Coursera: Kamus dan Toleran Retrieval (IIR Ch. 3) Catatan: [ <a href="http://translate.googleusercontent.com/translate_c?depth=1&hl=id&ie=UTF8&langpair=auto%7Cid&rurl=translate.google.com&tbb=1&u=http://www.stanford.edu/class/cs276/handouts/lecture3-tolerant-retrieval.ppt&usg=ALkJrhhsIP-Escyw1zZ93E8BAhL_Bzb3ZQ">powerpoint</a> ] [ <a href="http://translate.googleusercontent.com/translate_c?depth=1&hl=id&ie=UTF8&langpair=auto%7Cid&rurl=translate.google.com&tbb=1&u=http://www.stanford.edu/class/cs276/handouts/lecture3-tolerant-retrieval-handout-6-per.pdf&usg=ALkJrhiRxWrE2s2allYWR8QuTcLvZzprcw">PDF / 6</a> ] [ <a href="http://translate.googleusercontent.com/translate_c?depth=1&hl=id&ie=UTF8&langpair=auto%7Cid&rurl=translate.google.com&tbb=1&u=http://www.stanford.edu/class/cs276/handouts/lecture3-tolerant-retrieval-handout-1-per.pdf&usg=ALkJrhjLzyrgcwW2Od0B6ApUyHC3WEsxOA">PDF / 1</a> ] Bacaan: <a href="http://translate.googleusercontent.com/translate_c?depth=1&hl=id&ie=UTF8&langpair=auto%7Cid&rurl=translate.google.com&tbb=1&u=http://norvig.com/spell-correct.html&usg=ALkJrhgAvoKSp1BbFQCv2hGAiV8P1axq_w">Bagaimana menulis korektor ejaan (Peter Norvig)</a> <a href="http://translate.googleusercontent.com/translate_c?depth=1&hl=id&ie=UTF8&langpair=auto%7Cid&rurl=translate.google.com&tbb=1&u=http://nlp.stanford.edu/IR-book/pdf/03dict.pdf&usg=ALkJrhjlvwxJW10jKeyqbyhMzfY_QB-GlQ">IIR Ch.</a> <a href="http://translate.googleusercontent.com/translate_c?depth=1&hl=id&ie=UTF8&langpair=auto%7Cid&rurl=translate.google.com&tbb=1&u=http://nlp.stanford.edu/IR-book/pdf/03dict.pdf&usg=ALkJrhjlvwxJW10jKeyqbyhMzfY_QB-GlQ">3</a> MG 4.2 <a href="http://translate.googleusercontent.com/translate_c?depth=1&hl=id&ie=UTF8&langpair=auto%7Cid&rurl=translate.google.com&tbb=1&u=http://portal.acm.org/citation.cfm%3Fid%3D146380&usg=ALkJrhitMeTlDaS4TDAJ7vUh5phvS8xwSg">Teknik untuk secara otomatis mengoreksi kata-kata dalam teks (Kukich 1992)</a> <a href="http://translate.googleusercontent.com/translate_c?depth=1&hl=id&ie=UTF8&langpair=auto%7Cid&rurl=translate.google.com&tbb=1&u=http://citeseerx.ist.psu.edu/viewdoc/summary%3Fdoi%3D10.1.1.18.9400&usg=ALkJrhgELb9C75ssadtwyg76s2_oAkbrhQ">Menemukan pertandingan perkiraan dalam leksikon besar (Zobel dan Dart 1995)</a> <a href="http://translate.googleusercontent.com/translate_c?depth=1&hl=id&ie=UTF8&langpair=auto%7Cid&rurl=translate.google.com&tbb=1&u=http://citeseerx.ist.psu.edu/viewdoc/summary%3Fdoi%3D10.1.1.49.1392&usg=ALkJrhhsiZHP3hTaCM-1GJ1dS0mv0WM9Sw">Generasi dan PERINGKAT Spelling Koreksi Kesalahan (Tillenius) Efisien</a> </td></tr> <tr><td style="width: 5%;"> Thu 18 Apr </td><td style="width: 30%;"> Lab Kelas: Mapreduce dengan Python <a href="http://translate.googleusercontent.com/translate_c?depth=1&hl=id&ie=UTF8&langpair=auto%7Cid&rurl=translate.google.com&tbb=1&u=http://beta.primarypad.com/p/aXg6p9bRST&usg=ALkJrhj1OtZ6ZOl7sdEA3wr7hjMY9UwVbQ">PrimaryPad</a> <a href="http://translate.googleusercontent.com/translate_c?depth=1&hl=id&ie=UTF8&langpair=auto%7Cid&rurl=translate.google.com&tbb=1&u=http://www.stanford.edu/class/cs276/python_map_red/mapreduce.py&usg=ALkJrhigvMQTwshf-RgZ_TaMCOfMwKYigg">mapreduce.py</a> <a href="http://translate.googleusercontent.com/translate_c?depth=1&hl=id&ie=UTF8&langpair=auto%7Cid&rurl=translate.google.com&tbb=1&u=http://www.stanford.edu/class/cs276/python_map_red/count_words.py&usg=ALkJrhjMMkEqI2DXTMQ8puFTEi6SDyo2sQ">count_words.py</a> <a href="http://translate.googleusercontent.com/translate_c?depth=1&hl=id&ie=UTF8&langpair=auto%7Cid&rurl=translate.google.com&tbb=1&u=http://www.stanford.edu/class/cs276/python_map_red/lmtrain.py&usg=ALkJrhjy-iNxxKG3zfITnqA08jRXZW0Qow">lmtrain.py</a> <a href="http://translate.googleusercontent.com/translate_c?depth=1&hl=id&ie=UTF8&langpair=auto%7Cid&rurl=translate.google.com&tbb=1&u=http://www.stanford.edu/class/cs276/python_map_red/idf.py&usg=ALkJrhgGsUL0-DdRndE4_xdeg0Bfxh67QA">idf.py</a> <a href="http://translate.googleusercontent.com/translate_c?depth=1&hl=id&ie=UTF8&langpair=auto%7Cid&rurl=translate.google.com&tbb=1&u=http://www.stanford.edu/class/cs276/python_map_red/index.py&usg=ALkJrhhvQDikMaXBNabpOYbxtRlk0In66A">index.py</a> <a href="http://translate.googleusercontent.com/translate_c?depth=1&hl=id&ie=UTF8&langpair=auto%7Cid&rurl=translate.google.com&tbb=1&u=http://www.stanford.edu/class/cs276/python_map_red/anchors.py&usg=ALkJrhg9IO7Xg0spx3aeWTxajBKOlld-7A">anchors.py</a> <a href="http://translate.googleusercontent.com/translate_c?depth=1&hl=id&ie=UTF8&langpair=auto%7Cid&rurl=translate.google.com&tbb=1&u=http://www.stanford.edu/class/cs276/python_map_red/index_with_anchors.py&usg=ALkJrhjZVpUI7YizEWS6QlNg3GJXdqIDJQ">index_with_anchors.py</a> </td><td> PA1 karena PA2 out </td><td> PN </td><td> Coursera: Vector Space Model (IIR Ch. 6) Catatan: [ <a href="http://translate.googleusercontent.com/translate_c?depth=1&hl=id&ie=UTF8&langpair=auto%7Cid&rurl=translate.google.com&tbb=1&u=http://www.stanford.edu/class/cs276/handouts/lecture6-tfidf.ppt&usg=ALkJrhj8VScZ_jGKb0_puaSYNeLdrpi5cg">powerpoint</a> ] [ <a href="http://translate.googleusercontent.com/translate_c?depth=1&hl=id&ie=UTF8&langpair=auto%7Cid&rurl=translate.google.com&tbb=1&u=http://www.stanford.edu/class/cs276/handouts/lecture6-tfidf-handout-6-per.pdf&usg=ALkJrhgsLBSieOpPSabSRAI1BvHvXmdtdQ">PDF / 6</a> ] [ <a href="http://translate.googleusercontent.com/translate_c?depth=1&hl=id&ie=UTF8&langpair=auto%7Cid&rurl=translate.google.com&tbb=1&u=http://www.stanford.edu/class/cs276/handouts/lecture6-tfidf-handout-1-per.pdf&usg=ALkJrhhX86A0REhMz7-esacBCD79u-3Agw">PDF / 1</a> ] [ <a href="http://translate.googleusercontent.com/translate_c?depth=1&hl=id&ie=UTF8&langpair=auto%7Cid&rurl=translate.google.com&tbb=1&u=http://research.google.com/archive/mapreduce-osdi04-slides/index.html&usg=ALkJrhhbdUT_L5J2ebrH9zQ7JG18XzVh_A">Jeff Dean Slides</a> ] Bacaan: <a href="http://translate.googleusercontent.com/translate_c?depth=1&hl=id&ie=UTF8&langpair=auto%7Cid&rurl=translate.google.com&tbb=1&u=http://nlp.stanford.edu/IR-book/pdf/06vect.pdf&usg=ALkJrhgpF5sg5NHbRadVemjV6ZB4Ua6y-A">IIR 6.2 - 6.4.3</a> </td></tr> <tr><td style="width: 5%;"> Tue 23 Apr </td><td style="width: 30%;"> Probabilistic IR: Binary Independence Model [ <a href="http://translate.googleusercontent.com/translate_c?depth=1&hl=id&ie=UTF8&langpair=auto%7Cid&rurl=translate.google.com&tbb=1&u=http://www.stanford.edu/class/cs276/handouts/lecture11-probir.pptx&usg=ALkJrhjQ6KtJ1m5L-VdjyaArC4D8gqaDgg">powerpoint</a> ] [ <a href="http://translate.googleusercontent.com/translate_c?depth=1&hl=id&ie=UTF8&langpair=auto%7Cid&rurl=translate.google.com&tbb=1&u=http://www.stanford.edu/class/cs276/handouts/lecture11-probir-6per.pdf&usg=ALkJrhjOvbGeswVe9VcjrYlhpw72wEf9-g">PDF / 6</a> ] [ <a href="http://translate.googleusercontent.com/translate_c?depth=1&hl=id&ie=UTF8&langpair=auto%7Cid&rurl=translate.google.com&tbb=1&u=http://www.stanford.edu/class/cs276/handouts/lecture11-probir.pdf&usg=ALkJrhjjoZAk_IXna93FxF3MohL6AyXAcA">PDF / 1</a> ] </td><td> PS2 Out </td><td> PN </td><td> Bacaan: <a href="http://translate.googleusercontent.com/translate_c?depth=1&hl=id&ie=UTF8&langpair=auto%7Cid&rurl=translate.google.com&tbb=1&u=http://nlp.stanford.edu/IR-book/pdf/11prob.pdf&usg=ALkJrhiijaGqQHrnsE04Z8_l8WnZe7BjSg">IIR 11</a> </td></tr> <tr><td style="width: 5%;"> Thu 25 Apr </td><td style="width: 30%;"> BM25, BM25F, dan sinyal peringkat [ <a href="http://translate.googleusercontent.com/translate_c?depth=1&hl=id&ie=UTF8&langpair=auto%7Cid&rurl=translate.google.com&tbb=1&u=http://www.stanford.edu/class/cs276/handouts/lecture12-bm25etc.pptx&usg=ALkJrhiS1FgBzzweRtfuYt7RkhVojue69w">powerpoint</a> ] [ <a href="http://translate.googleusercontent.com/translate_c?depth=1&hl=id&ie=UTF8&langpair=auto%7Cid&rurl=translate.google.com&tbb=1&u=http://www.stanford.edu/class/cs276/handouts/lecture12-bm25etc-6per.pdf&usg=ALkJrhiutOF5wKlb5_Yj3Ho1vJpjsWNpGQ">PDF / 6</a> ] [ <a href="http://translate.googleusercontent.com/translate_c?depth=1&hl=id&ie=UTF8&langpair=auto%7Cid&rurl=translate.google.com&tbb=1&u=http://www.stanford.edu/class/cs276/handouts/lecture12-bm25etc.pdf&usg=ALkJrhiPJEJP91NUFFLz0lZs_vSFjqcHfg">PDF / 1</a> ] </td><td> </td><td> PN </td><td> Bacaan: <a href="http://translate.googleusercontent.com/translate_c?depth=1&hl=id&ie=UTF8&langpair=auto%7Cid&rurl=translate.google.com&tbb=1&u=http://nlp.stanford.edu/IR-book/pdf/11prob.pdf&usg=ALkJrhiijaGqQHrnsE04Z8_l8WnZe7BjSg">IIR 11</a> </td></tr> <tr><td style="width: 5%;"> Tue 30 Apr </td><td style="width: 30%;"> Evaluasi. Presisi / ingat, NDCG, dengan menggunakan rasio klik per tayang [ <a href="http://translate.googleusercontent.com/translate_c?depth=1&hl=id&ie=UTF8&langpair=auto%7Cid&rurl=translate.google.com&tbb=1&u=http://www.stanford.edu/class/cs276/handouts/lecture8-evaluation_2013.ppt&usg=ALkJrhjIZWGaiNoDnpDptfBZGaH74ltAGA">powerpoint</a> ] [ <a href="http://translate.googleusercontent.com/translate_c?depth=1&hl=id&ie=UTF8&langpair=auto%7Cid&rurl=translate.google.com&tbb=1&u=http://www.stanford.edu/class/cs276/handouts/lecture8-evaluation_2013_6_per_page.pdf&usg=ALkJrhj374uM4Lag5_T0Tp5vZEaq5mwTJA">PDF / 6</a> ] [ <a href="http://translate.googleusercontent.com/translate_c?depth=1&hl=id&ie=UTF8&langpair=auto%7Cid&rurl=translate.google.com&tbb=1&u=http://www.stanford.edu/class/cs276/handouts/lecture8-evaluation_2013_1_per_page.pdf&usg=ALkJrhjvlvbyojF1Bap8ERvrUJmInOFPpg">PDF / 1</a> ] </td><td> Karena PS2 </td><td> PR </td><td> Bacaan: <a href="http://translate.googleusercontent.com/translate_c?depth=1&hl=id&ie=UTF8&langpair=auto%7Cid&rurl=translate.google.com&tbb=1&u=http://nlp.stanford.edu/IR-book/pdf/08eval.pdf&usg=ALkJrhg4kXwfHgVzR5JLrP4WBbiyKJna1w">IIR Ch.</a> <a href="http://translate.googleusercontent.com/translate_c?depth=1&hl=id&ie=UTF8&langpair=auto%7Cid&rurl=translate.google.com&tbb=1&u=http://nlp.stanford.edu/IR-book/pdf/08eval.pdf&usg=ALkJrhg4kXwfHgVzR5JLrP4WBbiyKJna1w">8</a> MG 4.5 MIR Ch. 3 </td></tr> <tr><td style="width: 5%;"> Thu 2 Mei </td><td style="width: 30%;"> Masalah sistem dalam temu efisien dan scoring [ <a href="http://translate.googleusercontent.com/translate_c?depth=1&hl=id&ie=UTF8&langpair=auto%7Cid&rurl=translate.google.com&tbb=1&u=http://www.stanford.edu/class/cs276/handouts/efficient_scoring_cs276_2013.ppt&usg=ALkJrhip3pgFVdl3CxjKpKb02iih1F70ZA">powerpoint</a> ] [ <a href="http://translate.googleusercontent.com/translate_c?depth=1&hl=id&ie=UTF8&langpair=auto%7Cid&rurl=translate.google.com&tbb=1&u=http://www.stanford.edu/class/cs276/handouts/efficient_scoring_cs276_2013_6.pdf&usg=ALkJrhiUCNlPCGGMn7K-L4ZfBhg2Gjv7Sw">PDF / 6</a> ] [ <a href="http://translate.googleusercontent.com/translate_c?depth=1&hl=id&ie=UTF8&langpair=auto%7Cid&rurl=translate.google.com&tbb=1&u=http://www.stanford.edu/class/cs276/handouts/efficient_scoring_cs276_2013_1.pdf&usg=ALkJrhgroIcwlP24ElKfe79PBgitLFiytg">PDF / 1</a> ] </td><td> PA2 karena PA3 out </td><td> PR </td><td> Coursera: Skor Computing (IIR Ch. 7) Catatan: [ <a href="http://translate.googleusercontent.com/translate_c?depth=1&hl=id&ie=UTF8&langpair=auto%7Cid&rurl=translate.google.com&tbb=1&u=http://www.stanford.edu/class/cs276/handouts/lecture7-vectorspace.pptx&usg=ALkJrhhNNMeu_DGzFNUBkwdhKgjXZjD1UA">powerpoint</a> ] [ <a href="http://translate.googleusercontent.com/translate_c?depth=1&hl=id&ie=UTF8&langpair=auto%7Cid&rurl=translate.google.com&tbb=1&u=http://www.stanford.edu/class/cs276/handouts/lecture7-vectorspace-6per.pdf&usg=ALkJrhj3ZDytN3pnwaOGR-njODwD4s8IVg">PDF / 6</a> ] [ <a href="http://translate.googleusercontent.com/translate_c?depth=1&hl=id&ie=UTF8&langpair=auto%7Cid&rurl=translate.google.com&tbb=1&u=http://www.stanford.edu/class/cs276/handouts/lecture7-vectorspace-1per.pdf&usg=ALkJrhi7MgmNGhUzDVgcfgFeAXq3nuiA_g">PDF / 1</a> ] Bacaan: <a href="http://translate.googleusercontent.com/translate_c?depth=1&hl=id&ie=UTF8&langpair=auto%7Cid&rurl=translate.google.com&tbb=1&u=http://nlp.stanford.edu/IR-book/pdf/07system.pdf&usg=ALkJrhijbqwrYm_Jr4suAVjmgO2utNc9Jw">IIR Ch.</a> <a href="http://translate.googleusercontent.com/translate_c?depth=1&hl=id&ie=UTF8&langpair=auto%7Cid&rurl=translate.google.com&tbb=1&u=http://nlp.stanford.edu/IR-book/pdf/07system.pdf&usg=ALkJrhijbqwrYm_Jr4suAVjmgO2utNc9Jw">7</a> , <a href="http://translate.googleusercontent.com/translate_c?depth=1&hl=id&ie=UTF8&langpair=auto%7Cid&rurl=translate.google.com&tbb=1&u=http://nlp.stanford.edu/IR-book/pdf/06vect.pdf&usg=ALkJrhgpF5sg5NHbRadVemjV6ZB4Ua6y-A">IIR 6.1</a> </td></tr> <tr><td style="width: 5%;"> Tue 7 Mei </td><td style="width: 30%;"> Lucene Tutorial [ <a href="http://translate.googleusercontent.com/translate_c?depth=1&hl=id&ie=UTF8&langpair=auto%7Cid&rurl=translate.google.com&tbb=1&u=http://www.stanford.edu/class/cs276/handouts/lecture-lucene.pptx&usg=ALkJrhhEWgCJ17iAUOsehHIbxZhbGpcgfg">powerpoint</a> ] [ <a href="http://translate.googleusercontent.com/translate_c?depth=1&hl=id&ie=UTF8&langpair=auto%7Cid&rurl=translate.google.com&tbb=1&u=http://www.stanford.edu/class/cs276/handouts/lecture-lucene-6per.pdf&usg=ALkJrhipra_aMJoFEGnwN6JYWozYqpvuWw">PDF / 6</a> ] [ <a href="http://translate.googleusercontent.com/translate_c?depth=1&hl=id&ie=UTF8&langpair=auto%7Cid&rurl=translate.google.com&tbb=1&u=http://www.stanford.edu/class/cs276/handouts/lecture-lucene.pdf&usg=ALkJrhj7Fiv3vtlsLaIWIRvBGgjSXNKeiA">PDF / 1</a> ] </td><td> PS3 Out </td><td> PN </td><td> </td></tr> <tr><td style="width: 5%;"> Thu 9 Mei </td><td style="width: 30%;"> KLASIFIKASI 1 + 2: Naif Byes, kNN, batas keputusan [ <a href="http://translate.googleusercontent.com/translate_c?depth=1&hl=id&ie=UTF8&langpair=auto%7Cid&rurl=translate.google.com&tbb=1&u=http://www.stanford.edu/class/cs276/handouts/lecture10-textcat-nbayes.ppt&usg=ALkJrhhx-RjusrJgZDv857EX-FdEkI-iQA">powerpoint</a> ] [ <a href="http://translate.googleusercontent.com/translate_c?depth=1&hl=id&ie=UTF8&langpair=auto%7Cid&rurl=translate.google.com&tbb=1&u=http://www.stanford.edu/class/cs276/handouts/lecture10-textcat-nbayes-6.pdf&usg=ALkJrhhtxohtKbsiV53www6TtHrCBxq3Ew">PDF / 6</a> ] [ <a href="http://translate.googleusercontent.com/translate_c?depth=1&hl=id&ie=UTF8&langpair=auto%7Cid&rurl=translate.google.com&tbb=1&u=http://www.stanford.edu/class/cs276/handouts/lecture10-textcat-nbayes-1.pdf&usg=ALkJrhj7P3CVodgx_JD3WmVzJajJHekQPg">PDF / 1</a> ] </td><td> </td><td> PR </td><td> Bacaan: <a href="http://translate.googleusercontent.com/translate_c?depth=1&hl=id&ie=UTF8&langpair=auto%7Cid&rurl=translate.google.com&tbb=1&u=http://nlp.stanford.edu/IR-book/pdf/11prob.pdf&usg=ALkJrhiijaGqQHrnsE04Z8_l8WnZe7BjSg">IIR Ch.</a> <a href="http://translate.googleusercontent.com/translate_c?depth=1&hl=id&ie=UTF8&langpair=auto%7Cid&rurl=translate.google.com&tbb=1&u=http://nlp.stanford.edu/IR-book/pdf/11prob.pdf&usg=ALkJrhiijaGqQHrnsE04Z8_l8WnZe7BjSg">11</a> <a href="http://translate.googleusercontent.com/translate_c?depth=1&hl=id&ie=UTF8&langpair=auto%7Cid&rurl=translate.google.com&tbb=1&u=http://nlp.stanford.edu/IR-book/pdf/13bayes.pdf&usg=ALkJrhgjWC8mnWZafVbnPa6A-M2_LXXE8g">IIR Ch.</a> <a href="http://translate.googleusercontent.com/translate_c?depth=1&hl=id&ie=UTF8&langpair=auto%7Cid&rurl=translate.google.com&tbb=1&u=http://nlp.stanford.edu/IR-book/pdf/13bayes.pdf&usg=ALkJrhgjWC8mnWZafVbnPa6A-M2_LXXE8g">13</a> <a href="http://translate.googleusercontent.com/translate_c?depth=1&hl=id&ie=UTF8&langpair=auto%7Cid&rurl=translate.google.com&tbb=1&u=http://citeseerx.ist.psu.edu/viewdoc/summary%3Fdoi%3D10.1.1.17.6513&usg=ALkJrhglTUqfJ6KO02jfTV99CvQg-4FndQ">Mesin pembelajaran dalam kategorisasi teks otomatis (Sebastiani 2002)</a> <a href="http://translate.googleusercontent.com/translate_c?depth=1&hl=id&ie=UTF8&langpair=auto%7Cid&rurl=translate.google.com&tbb=1&u=http://citeseerx.ist.psu.edu/viewdoc/summary%3Fdoi%3D10.1.1.11.9519&usg=ALkJrhhTpmX997QAqBchLKZA45Ti8HKCMA">Sebuah pemeriksaan ulang metode kategorisasi teks (Yang et al. 1999)</a> <a href="http://translate.googleusercontent.com/translate_c?depth=1&hl=id&ie=UTF8&langpair=auto%7Cid&rurl=translate.google.com&tbb=1&u=http://citeseer.ist.psu.edu/mccallum98comparison.html&usg=ALkJrhj-sh97zIKkg_SPLPn4rCUjIJY4jQ">Perbandingan model event untuk naif Bayes klasifikasi teks (McCallum et al. 1998)</a> Tom Mitchell. Machine Learning. McGraw-Hill, 1997. Buka Calais Weka <a href="http://translate.googleusercontent.com/translate_c?depth=1&hl=id&ie=UTF8&langpair=auto%7Cid&rurl=translate.google.com&tbb=1&u=http://www.daviddlewis.com/resources/testcollections/reuters21578/&usg=ALkJrhgDn7sEp2x3d5zCkH1WtUUqJ7jR1g">Reuters-21578</a> <a href="http://translate.googleusercontent.com/translate_c?depth=1&hl=id&ie=UTF8&langpair=auto%7Cid&rurl=translate.google.com&tbb=1&u=http://www.stanford.edu/class/cs276/handouts/rennie.icml03.pdf&usg=ALkJrhh65NO9-YK3sOz7xeP1L5Po7zyhJQ">Mengatasi asumsi miskin Naive Bayes classifier (Rennie et al. 2003)</a> <a href="http://translate.googleusercontent.com/translate_c?depth=1&hl=id&ie=UTF8&langpair=auto%7Cid&rurl=translate.google.com&tbb=1&u=http://nlp.stanford.edu/IR-book/pdf/14vcat.pdf&usg=ALkJrhgTa4GoocwZaShooZ2-j9XwqrI2Hw">IIR Ch.</a> <a href="http://translate.googleusercontent.com/translate_c?depth=1&hl=id&ie=UTF8&langpair=auto%7Cid&rurl=translate.google.com&tbb=1&u=http://nlp.stanford.edu/IR-book/pdf/14vcat.pdf&usg=ALkJrhgTa4GoocwZaShooZ2-j9XwqrI2Hw">14</a> <a href="http://translate.googleusercontent.com/translate_c?depth=1&hl=id&ie=UTF8&langpair=auto%7Cid&rurl=translate.google.com&tbb=1&u=http://citeseerx.ist.psu.edu/viewdoc/summary%3Fdoi%3D10.1.1.17.6513&usg=ALkJrhglTUqfJ6KO02jfTV99CvQg-4FndQ">Mesin pembelajaran dalam kategorisasi teks otomatis (Sebastiani 2002)</a> Tom Mitchell. Machine Learning. McGraw-Hill, 1997. <a href="http://translate.googleusercontent.com/translate_c?depth=1&hl=id&ie=UTF8&langpair=auto%7Cid&rurl=translate.google.com&tbb=1&u=http://citeseer.ist.psu.edu/yang99reexamination.html&usg=ALkJrhj9dDtHTYIUyDgddtKx4IQj5S4AZQ"> </a> <a href="http://translate.googleusercontent.com/translate_c?depth=1&hl=id&ie=UTF8&langpair=auto%7Cid&rurl=translate.google.com&tbb=1&u=http://citeseer.ist.psu.edu/yang99reexamination.html&usg=ALkJrhj9dDtHTYIUyDgddtKx4IQj5S4AZQ">Sebuah pemeriksaan ulang metode kategorisasi teks (Yang et al. 1999)</a> <a href="http://translate.googleusercontent.com/translate_c?depth=1&hl=id&ie=UTF8&langpair=auto%7Cid&rurl=translate.google.com&tbb=1&u=http://citeseerx.ist.psu.edu/viewdoc/summary%3Fdoi%3D10.1.1.33.867&usg=ALkJrhg2wETAieL3CUkqD2Cl9o2pEq9Sxw">Mengevaluasi dan mengoptimalkan sistem klasifikasi teks otonom (Lewis 1995)</a> Trevor Hastie, Robert Tibshirani, Jerome Friedman Elemen statistik Learning:. Data Mining, Inferensi, dan Prediksi. Springer-Verlag, New York, 2001. </td></tr> <tr><td> Tue 14 Mei </td><td> KLASIFIKASI 3. Mesin dukungan vektor [ <a href="http://translate.googleusercontent.com/translate_c?depth=1&hl=id&ie=UTF8&langpair=auto%7Cid&rurl=translate.google.com&tbb=1&u=http://www.stanford.edu/class/cs276/handouts/lecture13-SVMs.ppt&usg=ALkJrhh6UKU1W2dRRHGHsry_eeM_OuqpRg">powerpoint</a> ] [ <a href="http://translate.googleusercontent.com/translate_c?depth=1&hl=id&ie=UTF8&langpair=auto%7Cid&rurl=translate.google.com&tbb=1&u=http://www.stanford.edu/class/cs276/handouts/lecture13-SVMs-6up.pdf&usg=ALkJrhiAA0fEFFCMQTj9jXdzE8lbMxnZvg">PDF / 6</a> ] [ <a href="http://translate.googleusercontent.com/translate_c?depth=1&hl=id&ie=UTF8&langpair=auto%7Cid&rurl=translate.google.com&tbb=1&u=http://www.stanford.edu/class/cs276/handouts/lecture13-SVMs.pdf&usg=ALkJrhiPm-jBDxDpez0oHo_Js_SgWRz71A">PDF / 1</a> ] </td><td> Karena PS3 </td><td> CM </td><td> Bacaan: <a href="http://translate.googleusercontent.com/translate_c?depth=1&hl=id&ie=UTF8&langpair=auto%7Cid&rurl=translate.google.com&tbb=1&u=http://nlp.stanford.edu/IR-book/pdf/15svm.pdf&usg=ALkJrhjlBaKYLhMwv76lkP5-wUbBdcQTdQ">IIR Ch.</a> <a href="http://translate.googleusercontent.com/translate_c?depth=1&hl=id&ie=UTF8&langpair=auto%7Cid&rurl=translate.google.com&tbb=1&u=http://nlp.stanford.edu/IR-book/pdf/15svm.pdf&usg=ALkJrhjlBaKYLhMwv76lkP5-wUbBdcQTdQ">15</a> <a href="http://translate.googleusercontent.com/translate_c?depth=1&hl=id&ie=UTF8&langpair=auto%7Cid&rurl=translate.google.com&tbb=1&u=http://citeseerx.ist.psu.edu/viewdoc/summary%3Fdoi%3D10.1.1.18.1083&usg=ALkJrhjTtXPggr2ewaFlCLKE_Ym7PU2-fg">Sebuah tutorial pada mesin dukungan vektor untuk pengenalan pola (Burges 1998)</a> <a href="http://translate.googleusercontent.com/translate_c?depth=1&hl=id&ie=UTF8&langpair=auto%7Cid&rurl=translate.google.com&tbb=1&u=http://ezproxy.stanford.edu:2072/xpls/abs_all.jsp%3Fisnumber%3D15361%26arnumber%3D708428%26count%3D14%26index%3D5&usg=ALkJrhj8kckWYsSiuhNNYMBlxOosfqGp6g">Menggunakan SVM untuk teks kategorisasi (Dumais1998)</a> <a href="http://translate.googleusercontent.com/translate_c?depth=1&hl=id&ie=UTF8&langpair=auto%7Cid&rurl=translate.google.com&tbb=1&u=http://portal.acm.org/citation.cfm%3Fid%3D288651&usg=ALkJrhjI8Tw_B2dH0Fqn0ZDPM8y74pxipw">Algoritma pembelajaran induktif dan representasi untuk teks kategorisasi (Dumaiset a. 1998)</a> <a href="http://translate.googleusercontent.com/translate_c?depth=1&hl=id&ie=UTF8&langpair=auto%7Cid&rurl=translate.google.com&tbb=1&u=http://citeseerx.ist.psu.edu/viewdoc/summary%3Fdoi%3D10.1.1.30.5594&usg=ALkJrhjNbap_iPyQ8jTQ0gFOXbEu9YEr3w">A Re-pemeriksaan metode kategorisasi teks (Yang et al. 1999)</a> <a href="http://translate.googleusercontent.com/translate_c?depth=1&hl=id&ie=UTF8&langpair=auto%7Cid&rurl=translate.google.com&tbb=1&u=http://citeseerx.ist.psu.edu/viewdoc/summary%3Fdoi%3D10.1.1.20.5553&usg=ALkJrhjemkwi-WyZTWn2Khf6RoWMpqnumg"> </a> <a href="http://translate.googleusercontent.com/translate_c?depth=1&hl=id&ie=UTF8&langpair=auto%7Cid&rurl=translate.google.com&tbb=1&u=http://citeseerx.ist.psu.edu/viewdoc/summary%3Fdoi%3D10.1.1.20.5553&usg=ALkJrhjemkwi-WyZTWn2Khf6RoWMpqnumg">Teks kategorisasi berdasarkan metode klasifikasi linear regularized (Zhang et al. 2001)</a> Trevor Hastie, Robert Tibshirani, Jerome Friedman Elemen statistik Learning:. Data Mining, Inferensi, dan Prediksi. Springer-Verlag, New York, 2001. <a href="http://translate.googleusercontent.com/translate_c?depth=1&hl=id&ie=UTF8&langpair=auto%7Cid&rurl=translate.google.com&tbb=1&u=http://www.daviddlewis.com/resources/testcollections/reuters21578/&usg=ALkJrhgDn7sEp2x3d5zCkH1WtUUqJ7jR1g">Reuters-21578</a> Thorsten Joachims. Belajar untuk Klasifikasikan Teks menggunakan Support Vector Machines. Kluwer, 2002. <a href="http://translate.googleusercontent.com/translate_c?depth=1&hl=id&ie=UTF8&langpair=auto%7Cid&rurl=translate.google.com&tbb=1&u=http://citeseerx.ist.psu.edu/viewdoc/summary%3Fdoi%3D10.1.1.8.2881&usg=ALkJrhhzRisP8RvIpiFdR5wu0mK7_OgcmQ">Sebuah analisis fungsi kerugian untuk metode klasifikasi dalam teks kategorisasi (Li et al. 2003)</a> </td></tr> <tr><td> Thu 16 Mei </td><td> Web 2: Belajar untuk peringkat. [ <a href="http://translate.googleusercontent.com/translate_c?depth=1&hl=id&ie=UTF8&langpair=auto%7Cid&rurl=translate.google.com&tbb=1&u=http://www.stanford.edu/class/cs276/handouts/lecture14-learning-ranking.ppt&usg=ALkJrhhWoNp84UjMJrMAPm92kQkuNqMy2w">powerpoint</a> ] [ <a href="http://translate.googleusercontent.com/translate_c?depth=1&hl=id&ie=UTF8&langpair=auto%7Cid&rurl=translate.google.com&tbb=1&u=http://www.stanford.edu/class/cs276/handouts/lecture14-learning-ranking-6up.pdf&usg=ALkJrhhyI_wZuyy_AqGksFj4cAMBrb0cmQ">PDF / 6</a> ] [ <a href="http://translate.googleusercontent.com/translate_c?depth=1&hl=id&ie=UTF8&langpair=auto%7Cid&rurl=translate.google.com&tbb=1&u=http://www.stanford.edu/class/cs276/handouts/lecture14-learning-ranking.pdf&usg=ALkJrhjXveXm6N3AJJuoUWVuV7chQ6p9CQ">PDF / 1</a> ] </td><td> PA3 karena PA4 out </td><td> CM </td><td> Bacaan: <a href="http://translate.googleusercontent.com/translate_c?depth=1&hl=id&ie=UTF8&langpair=auto%7Cid&rurl=translate.google.com&tbb=1&u=http://nlp.stanford.edu/IR-book/pdf/06vect.pdf&usg=ALkJrhgpF5sg5NHbRadVemjV6ZB4Ua6y-A">IIR 6.1.2-3</a> , <a href="http://translate.googleusercontent.com/translate_c?depth=1&hl=id&ie=UTF8&langpair=auto%7Cid&rurl=translate.google.com&tbb=1&u=http://nlp.stanford.edu/IR-book/pdf/15svm.pdf&usg=ALkJrhjlBaKYLhMwv76lkP5-wUbBdcQTdQ">IIR 15.4</a> <a href="http://translate.googleusercontent.com/translate_c?depth=1&hl=id&ie=UTF8&langpair=auto%7Cid&rurl=translate.google.com&tbb=1&u=http://citeseerx.ist.psu.edu/viewdoc/summary%3Fdoi%3D10.1.1.2.9065&usg=ALkJrhjNUaSUapD2Jv2Iozt81L9Oz2xluQ">Model diskriminatif untuk pencarian informasi (Nallapati 2004)</a> <a href="http://translate.googleusercontent.com/translate_c?depth=1&hl=id&ie=UTF8&langpair=auto%7Cid&rurl=translate.google.com&tbb=1&u=http://portal.acm.org/citation.cfm%3Fid%3D1148205&usg=ALkJrhh6Vwm3Lhro0hrTAR2bGdJ2lg48tA">Beradaptasi peringkat SVM untuk mendokumentasikan pengambilan (Cao et al. 2006)</a> <a href="http://translate.googleusercontent.com/translate_c?depth=1&hl=id&ie=UTF8&langpair=auto%7Cid&rurl=translate.google.com&tbb=1&u=http://portal.acm.org/citation.cfm%3Fid%3D1277790&usg=ALkJrhh2LRpUTyuAUjwEimvCf0noYbq5PQ">Sebuah metode vektor dukungan untuk mengoptimalkan presisi rata-rata (Yue et al. 2007)</a> <a href="http://translate.googleusercontent.com/translate_c?depth=1&hl=id&ie=UTF8&langpair=auto%7Cid&rurl=translate.google.com&tbb=1&u=http://research.microsoft.com/users/LETOR/&usg=ALkJrhh0ts_4MA4JuJb8TqDaajBiRyie5w">Dataset LETOR patokan</a> </td></tr> <tr><td> Tue 21 Mei </td><td> Diundang bicara: Sriram Sankar dari Facebook pada Grafik Pencarian </td><td> </td><td> Sriram Sankar </td><td> </td></tr> <tr><td> Thu 23 Mei </td><td> CLUSTERING 1: k-means, HAC [ <a href="http://translate.googleusercontent.com/translate_c?depth=1&hl=id&ie=UTF8&langpair=auto%7Cid&rurl=translate.google.com&tbb=1&u=http://www.stanford.edu/class/cs276/handouts/lecture14-clustering.ppt&usg=ALkJrhj4CLXpoz9Z-qED4XjuV3fQoZ0bRw">powerpoint</a> ] [ <a href="http://translate.googleusercontent.com/translate_c?depth=1&hl=id&ie=UTF8&langpair=auto%7Cid&rurl=translate.google.com&tbb=1&u=http://www.stanford.edu/class/cs276/handouts/lecture14-clustering-6per.pdf&usg=ALkJrhiXj4nktcwnZPZUorDqWuZ9ZGRzUQ">PDF / 6</a> ] [ <a href="http://translate.googleusercontent.com/translate_c?depth=1&hl=id&ie=UTF8&langpair=auto%7Cid&rurl=translate.google.com&tbb=1&u=http://www.stanford.edu/class/cs276/handouts/lecture14-clustering.pdf&usg=ALkJrhivnbpQTVD2NIHr3XCcAj6l9tTvrQ">PDF / 1</a> ] </td><td> </td><td> PN </td><td> Bacaan: <a href="http://translate.googleusercontent.com/translate_c?depth=1&hl=id&ie=UTF8&langpair=auto%7Cid&rurl=translate.google.com&tbb=1&u=http://nlp.stanford.edu/IR-book/pdf/16flat.pdf&usg=ALkJrhjx57wlKDJvxc1uyICi8D7poSEH5A">IIR Ch.</a> <a href="http://translate.googleusercontent.com/translate_c?depth=1&hl=id&ie=UTF8&langpair=auto%7Cid&rurl=translate.google.com&tbb=1&u=http://nlp.stanford.edu/IR-book/pdf/16flat.pdf&usg=ALkJrhjx57wlKDJvxc1uyICi8D7poSEH5A">16</a> , <a href="http://translate.googleusercontent.com/translate_c?depth=1&hl=id&ie=UTF8&langpair=auto%7Cid&rurl=translate.google.com&tbb=1&u=http://nlp.stanford.edu/IR-book/pdf/17hier.pdf&usg=ALkJrhg2uMla0YDm6wngarLpUdkbRLCnUg">IIR 17,1-3</a> </td></tr> <tr><td> Tue 28 May </td><td> CLUSTERING 2. LSI [ <a href="http://translate.googleusercontent.com/translate_c?depth=1&hl=id&ie=UTF8&langpair=auto%7Cid&rurl=translate.google.com&tbb=1&u=http://www.stanford.edu/class/cs276/handouts/lecture16-lsi.ppt&usg=ALkJrhgY9kybqtml7UwWqTLnB_Ao2RIcbQ">powerpoint</a> ] [ <a href="http://translate.googleusercontent.com/translate_c?depth=1&hl=id&ie=UTF8&langpair=auto%7Cid&rurl=translate.google.com&tbb=1&u=http://www.stanford.edu/class/cs276/handouts/lecture16-lsi-6up.pdf&usg=ALkJrhifaq5Lw6fmhqC3YtcDtK5phjfk2g">PDF / 6</a> ] [ <a href="http://translate.googleusercontent.com/translate_c?depth=1&hl=id&ie=UTF8&langpair=auto%7Cid&rurl=translate.google.com&tbb=1&u=http://www.stanford.edu/class/cs276/handouts/lecture16-lsi.pdf&usg=ALkJrhjOC19X9YLWEh-TfmE3fBHc6W5SoQ">PDF / 1</a> ] </td><td> PS4 Out </td><td> CM </td><td> Bacaan: <a href="http://translate.googleusercontent.com/translate_c?depth=1&hl=id&ie=UTF8&langpair=auto%7Cid&rurl=translate.google.com&tbb=1&u=http://nlp.stanford.edu/IR-book/pdf/18lsi.pdf&usg=ALkJrhgL5Ll-8yAxT8UaUht-IyOIrU2y7Q">IIR Ch.</a> <a href="http://translate.googleusercontent.com/translate_c?depth=1&hl=id&ie=UTF8&langpair=auto%7Cid&rurl=translate.google.com&tbb=1&u=http://nlp.stanford.edu/IR-book/pdf/18lsi.pdf&usg=ALkJrhgL5Ll-8yAxT8UaUht-IyOIrU2y7Q">18</a> </td></tr> <tr><td> Thu 30 Mei </td><td> Web 3: Analisis Link. [ <a href="http://translate.googleusercontent.com/translate_c?depth=1&hl=id&ie=UTF8&langpair=auto%7Cid&rurl=translate.google.com&tbb=1&u=http://www.stanford.edu/class/cs276/handouts/lecture17-linkanalysis.ppt&usg=ALkJrhifO3m06KHu-WADeJSFVPZnG4jyhA">powerpoint</a> ] [ <a href="http://translate.googleusercontent.com/translate_c?depth=1&hl=id&ie=UTF8&langpair=auto%7Cid&rurl=translate.google.com&tbb=1&u=http://www.stanford.edu/class/cs276/handouts/lecture17-linkanalysis_6per.pdf&usg=ALkJrhiHg3gTCwuDkXm0ohlUwMlppC1ewQ">PDF / 6</a> ] [ <a href="http://translate.googleusercontent.com/translate_c?depth=1&hl=id&ie=UTF8&langpair=auto%7Cid&rurl=translate.google.com&tbb=1&u=http://www.stanford.edu/class/cs276/handouts/lecture17-linkanalysis_1per.pdf&usg=ALkJrhg8-K4q22SB6ITvb3lKKCBwqkgmQA">PDF / 1</a> ] </td><td> PA4 karena </td><td> PR </td><td> Bacaan: <a href="http://translate.googleusercontent.com/translate_c?depth=1&hl=id&ie=UTF8&langpair=auto%7Cid&rurl=translate.google.com&tbb=1&u=http://nlp.stanford.edu/IR-book/pdf/21link.pdf&usg=ALkJrhglHfAsJ6M-SG9XcWUjJ1q33KBhHw">IIR Ch.</a> <a href="http://translate.googleusercontent.com/translate_c?depth=1&hl=id&ie=UTF8&langpair=auto%7Cid&rurl=translate.google.com&tbb=1&u=http://nlp.stanford.edu/IR-book/pdf/21link.pdf&usg=ALkJrhglHfAsJ6M-SG9XcWUjJ1q33KBhHw">21</a> <a href="http://translate.googleusercontent.com/translate_c?depth=1&hl=id&ie=UTF8&langpair=auto%7Cid&rurl=translate.google.com&tbb=1&u=http://portal.acm.org/citation.cfm%3Fid%3D988714&usg=ALkJrhgIUX-6h0Rw-D2MPQ9NGtZ7RZ_L4Q">Peringkat perbatasan web (Eiron et al. 2004)</a> <a href="http://translate.googleusercontent.com/translate_c?depth=1&hl=id&ie=UTF8&langpair=auto%7Cid&rurl=translate.google.com&tbb=1&u=http://citeseerx.ist.psu.edu/viewdoc/summary%3Fdoi%3D10.1.1.14.6417&usg=ALkJrhhhKsq4DhvyYCeARMa2URPaIC0hkg">Kerangka WebGraph I: teknik kompresi (. Boldi et al 2004)</a> <a href="http://translate.googleusercontent.com/translate_c?depth=1&hl=id&ie=UTF8&langpair=auto%7Cid&rurl=translate.google.com&tbb=1&u=http://portal.acm.org/citation.cfm%3Fid%3D775190&usg=ALkJrhhAM7f-JFi4K8y9Uwg2c33jDLpEhA">Metode ekstrapolasi untuk mempercepat perhitungan PageRank (Kamvar et al. 2003)</a> <a href="http://translate.googleusercontent.com/translate_c?depth=1&hl=id&ie=UTF8&langpair=auto%7Cid&rurl=translate.google.com&tbb=1&u=http://portal.acm.org/citation.cfm%3Fid%3D775152.775204&usg=ALkJrhiSW1MSmPzc_2MJAv3oJGPyIHFb9w">Mencari web kerja (Fagin et al. 2003</a> </td></tr> <tr><td> Tue 4 Jun </td><td> Web 4: Crawling, dekat-dups </td><td> PS4 karena </td><td> PR </td><td> Catatan: [ <a href="http://translate.googleusercontent.com/translate_c?depth=1&hl=id&ie=UTF8&langpair=auto%7Cid&rurl=translate.google.com&tbb=1&u=http://www.stanford.edu/class/cs276/handouts/lecture16-crawling-jun4.ppt&usg=ALkJrhhvlIxTyVBPif3pG9PmwMfuIHiY2g">powerpoint</a> ] [ <a href="http://translate.googleusercontent.com/translate_c?depth=1&hl=id&ie=UTF8&langpair=auto%7Cid&rurl=translate.google.com&tbb=1&u=http://www.stanford.edu/class/cs276/handouts/lecture16-crawling-jun4-6per.pdf&usg=ALkJrhjKRFz9cgTzrCKKmEtMeHSFrbovZA">PDF / 6</a> ] [ <a href="http://translate.googleusercontent.com/translate_c?depth=1&hl=id&ie=UTF8&langpair=auto%7Cid&rurl=translate.google.com&tbb=1&u=http://www.stanford.edu/class/cs276/handouts/lecture16-crawling-jun4-1per.pdf&usg=ALkJrhhDKXASMI1-t80Yxx1qN-Qwg-03WA">PDF / 1</a> ] Bacaan: <a href="http://translate.googleusercontent.com/translate_c?depth=1&hl=id&ie=UTF8&langpair=auto%7Cid&rurl=translate.google.com&tbb=1&u=http://nlp.stanford.edu/IR-book/pdf/20crawl.pdf&usg=ALkJrhhS6kgTsT6ZEc8K_s0UfCyLwfgGgA">IIR Ch.</a> <a href="http://translate.googleusercontent.com/translate_c?depth=1&hl=id&ie=UTF8&langpair=auto%7Cid&rurl=translate.google.com&tbb=1&u=http://nlp.stanford.edu/IR-book/pdf/20crawl.pdf&usg=ALkJrhhS6kgTsT6ZEc8K_s0UfCyLwfgGgA">20</a> <a href="https://translate.googleusercontent.com/translate_c?depth=1&hl=id&ie=UTF8&langpair=auto%7Cid&rurl=translate.google.com&tbb=1&u=https://webarchive.jira.com/wiki/download/attachments/5441/1999-Mercator.pdf&usg=ALkJrhipEx97TfCAJDdiXs7Ee69_QrwMWQ">Mercator: A scalable, web crawler extensible (. Heydon et al, 1999)</a> <a href="http://translate.googleusercontent.com/translate_c?depth=1&hl=id&ie=UTF8&langpair=auto%7Cid&rurl=translate.google.com&tbb=1&u=http://www.robotstxt.org/orig.html&usg=ALkJrhgcAkSu3gydEHmpuN2rlwOb9D3xtA">Sebuah standar untuk pengecualian robot</a> </td></tr> <tr><td> Thu 6 Jun </td><td id="books"> Tidak ada kelas. </td><td> </td><td> </td><td> </td></tr> <tr><td> Fri 7 Jun </td><td> Ujian akhir (12:15-3:15) <a href="http://translate.googleusercontent.com/translate_c?depth=1&hl=id&ie=UTF8&langpair=auto%7Cid&rurl=translate.google.com&tbb=1&u=http://www.stanford.edu/class/cs276/restricted/CS276_2012_Spring_Final_Exam.pdf&usg=ALkJrhjJDz_0RhB4uuwN0-GsxMa5fxASpA">Praktek Akhir</a> <a href="http://translate.googleusercontent.com/translate_c?depth=1&hl=id&ie=UTF8&langpair=auto%7Cid&rurl=translate.google.com&tbb=1&u=http://www.stanford.edu/class/cs276/restricted/CS276_2012_Spring_Final_Exam_Solutions.pdf&usg=ALkJrhhqXMV663P4ZwGANP-s3Bvw5yxtXg">Praktek Solusi Akhir</a> </td><td> </td><td> </td><td> </td></tr> </tbody></table> </div> <h3> Diperlukan Textbook: </h3> IIR = Pengantar Information Retrieval, oleh C. Manning, P. Raghavan, dan H. Schütze. Cambridge University Press, 2008. Buku ini tersedia dari toko buku Stanford (atau penyetor buku favorit Anda). Anda juga dapat men-download dan bab cetak di <a href="http://translate.googleusercontent.com/translate_c?depth=1&hl=id&ie=UTF8&langpair=auto%7Cid&rurl=translate.google.com&tbb=1&u=http://nlp.stanford.edu/IR-book/&usg=ALkJrhiCEUJ0PraDKqppkYInLZXQxI8OFQ">situs buku</a> . (Kami akan menghargai setiap laporan kesalahan ketik atau masalah-tingkat yang lebih tinggi untuk pencetakan ketiga. Terima kasih.) <h3> Lainnya Baik IR Books: </h3> MG = Mengelola Gigabytes, oleh I. Witten, A. Moffat, dan T. Bell. Irah = Information Retrieval: Algoritma dan Heuristic oleh D. Grossman dan O. Frieder. MIR = Informasi modern Retrieval, oleh R. Baeza-Yates dan Ribeiro-Neto B.. FOA = Menemukan Out Tentang, oleh R. Belew. MTW = Pertambangan Web, oleh S. Chakrabarti. FSNLP = Yayasan Statistik Natural Language Processing, oleh C. Manning dan H. Schütze. Buku-buku ini semua memiliki informasi yang berguna tentang topik yang kita bahas dan direkomendasikan sebagai referensi. MG sangat baik sebagai referensi rinci untuk IR teknis pada semester pertama tentu saja. MTW mencakup banyak topik dari bagian akhir kursus. Lebih banyak sumber daya rinci dapat ditemukan <a href="http://translate.googleusercontent.com/translate_c?depth=1&hl=id&ie=UTF8&langpair=auto%7Cid&rurl=translate.google.com&tbb=1&u=http://nlp.stanford.edu/IR-book/information-retrieval.html&usg=ALkJrhg59Sd522YMkNZA4wEnd3I4y2nOww">di sini</a> . <h3> Dosen: </h3> CM = Chris Manning PN = Pandu Nayak PR = Prabhakar Raghavan Program terkait: Pengantar Komputasi Advertising ( <a href="http://translate.googleusercontent.com/translate_c?depth=1&hl=id&ie=UTF8&langpair=auto%7Cid&rurl=translate.google.com&tbb=1&u=http://www.stanford.edu/class/msande239/&usg=ALkJrhi8ECeE69d76YcPJm55wK6d4H17Hw">http://www.stanford.edu/class/msande239/</a> )</div> <div id="courseinfo"> </div> <hr align="center" size="2" width="100%" /> </div> <div class="zemanta-pixie" style="height: 15px; margin-top: 10px;"> <a class="zemanta-pixie-a" href="http://www.zemanta.com/?px" title="Enhanced by Zemanta"><img alt="Enhanced by Zemanta" class="zemanta-pixie-img" src="http://img.zemanta.com/zemified_e.png?x-id=319d9a39-8ab6-4c08-995f-9b81c301a269" style="border: none; float: right;" /></a></div> </div>

Information Retrieval and Web Search

CS 276 / LING 286: Information Retrieval and Web Search Spring 2013 Chris Manning, Pandu Nayak, and Prabhakar Ra...