http://mlwiki.org/index.php?title=Sources_Index&feed=atom&action=history
Sources Index - Revision history
2024-03-28T17:19:37Z
Revision history for this page on the wiki
MediaWiki 1.25.3
http://mlwiki.org/index.php?title=Sources_Index&diff=821&oldid=prev
Alexey at 20:29, 21 May 2018
2018-05-21T20:29:21Z
<p></p>
<table class='diff diff-contentalign-left'>
<col class='diff-marker' />
<col class='diff-content' />
<col class='diff-marker' />
<col class='diff-content' />
<tr style='vertical-align: top;'>
<td colspan='2' style="background-color: white; color:black; text-align: center;">← Older revision</td>
<td colspan='2' style="background-color: white; color:black; text-align: center;">Revision as of 20:29, 21 May 2018</td>
</tr><tr><td colspan="2" class="diff-lineno" id="L48" >Line 48:</td>
<td colspan="2" class="diff-lineno">Line 48:</td></tr>
<tr><td class='diff-marker'> </td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>* Larsen, Bjornar et al. "Fast and effective text mining using linear-time document clustering." 1999. [http://comminfo.rutgers.edu/~muresan/IR/Docs/Articles/sigkddLarsen1999.pdf] [[Document Clustering]]</div></td><td class='diff-marker'> </td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>* Larsen, Bjornar et al. "Fast and effective text mining using linear-time document clustering." 1999. [http://comminfo.rutgers.edu/~muresan/IR/Docs/Articles/sigkddLarsen1999.pdf] [[Document Clustering]]</div></td></tr>
<tr><td class='diff-marker'> </td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>* Lee, K., Lee, Y. et al "Parallel data processing with MapReduce: a survey" 2012. [http://www.cs.arizona.edu/~bkmoon/papers/sigmodrec11.pdf] [[Hadoop]], [[MapReduce]], [[Hadoop MapReduce]]</div></td><td class='diff-marker'> </td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>* Lee, K., Lee, Y. et al "Parallel data processing with MapReduce: a survey" 2012. [http://www.cs.arizona.edu/~bkmoon/papers/sigmodrec11.pdf] [[Hadoop]], [[MapReduce]], [[Hadoop MapReduce]]</div></td></tr>
<tr><td colspan="2"> </td><td class='diff-marker'>+</td><td style="color:black; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;"><div><ins style="font-weight: bold; text-decoration: none;">* Lee K., Jalali A., Dasdan A. "Real time bid optimization with smooth budget delivery in online advertising", 2013. [https://arxiv.org/abs/1305.3011] [[Budget Pacing]]</ins></div></td></tr>
<tr><td class='diff-marker'> </td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>* Li, Yong H., et al. "Classification of text documents." 1998. [http://julio.staff.ipb.ac.id/files/2014/09/LiJ98.pdf] [[Term Clustering]]</div></td><td class='diff-marker'> </td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>* Li, Yong H., et al. "Classification of text documents." 1998. [http://julio.staff.ipb.ac.id/files/2014/09/LiJ98.pdf] [[Term Clustering]]</div></td></tr>
<tr><td class='diff-marker'> </td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>* Liu, Tao, et al. "An evaluation on feature selection for text clustering." 2003. [http://www.aaai.org/Papers/ICML/2003/ICML03-065.pdf] [[Term Contribution]]</div></td><td class='diff-marker'> </td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>* Liu, Tao, et al. "An evaluation on feature selection for text clustering." 2003. [http://www.aaai.org/Papers/ICML/2003/ICML03-065.pdf] [[Term Contribution]]</div></td></tr>
</table>
Alexey
http://mlwiki.org/index.php?title=Sources_Index&diff=758&oldid=prev
Alexey at 20:50, 25 April 2017
2017-04-25T20:50:54Z
<p></p>
<table class='diff diff-contentalign-left'>
<col class='diff-marker' />
<col class='diff-content' />
<col class='diff-marker' />
<col class='diff-content' />
<tr style='vertical-align: top;'>
<td colspan='2' style="background-color: white; color:black; text-align: center;">← Older revision</td>
<td colspan='2' style="background-color: white; color:black; text-align: center;">Revision as of 20:50, 25 April 2017</td>
</tr><tr><td colspan="2" class="diff-lineno" id="L15" >Line 15:</td>
<td colspan="2" class="diff-lineno">Line 15:</td></tr>
<tr><td class='diff-marker'> </td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>=== D ===</div></td><td class='diff-marker'> </td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>=== D ===</div></td></tr>
<tr><td class='diff-marker'> </td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>* Datar, Mayur, et al. "Locality-sensitive hashing scheme based on p-stable distributions." 2004. [http://www.cs.princeton.edu/courses/archive/spring05/cos598E/bib/p253-datar.pdf] [[Locality Sensitive Hashing]], [[Euclidean LSH]]</div></td><td class='diff-marker'> </td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>* Datar, Mayur, et al. "Locality-sensitive hashing scheme based on p-stable distributions." 2004. [http://www.cs.princeton.edu/courses/archive/spring05/cos598E/bib/p253-datar.pdf] [[Locality Sensitive Hashing]], [[Euclidean LSH]]</div></td></tr>
<tr><td colspan="2"> </td><td class='diff-marker'>+</td><td style="color:black; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;"><div><ins style="font-weight: bold; text-decoration: none;">* De Kok D., Brouwer H. "Natural language processing for the working programmer", 2011. [[Collocation Extraction]]</ins></div></td></tr>
<tr><td class='diff-marker'> </td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>* De Smet, Yves. "An introduction to multicriteria decision aid: The PROMETHEE and GAIA methods." [[PROMETHEE]]</div></td><td class='diff-marker'> </td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>* De Smet, Yves. "An introduction to multicriteria decision aid: The PROMETHEE and GAIA methods." [[PROMETHEE]]</div></td></tr>
<tr><td class='diff-marker'> </td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>* Deerwester, Scott C., et al. "Indexing by latent semantic analysis." 1990. [http://www.cob.unt.edu/itds/faculty/evangelopoulos/dsci5910/LSA_Deerwester1990.pdf] [[Latent Semantic Analysis]]</div></td><td class='diff-marker'> </td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>* Deerwester, Scott C., et al. "Indexing by latent semantic analysis." 1990. [http://www.cob.unt.edu/itds/faculty/evangelopoulos/dsci5910/LSA_Deerwester1990.pdf] [[Latent Semantic Analysis]]</div></td></tr>
<tr><td colspan="2" class="diff-lineno" id="L46" >Line 46:</td>
<td colspan="2" class="diff-lineno">Line 47:</td></tr>
<tr><td class='diff-marker'> </td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>* Landauer, T. et al. "An introduction to latent semantic analysis." 1998. [http://tottdp.googlecode.com/files/LandauerFoltz-Laham1998.pdf] [[Latent Semantic Analysis]]</div></td><td class='diff-marker'> </td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>* Landauer, T. et al. "An introduction to latent semantic analysis." 1998. [http://tottdp.googlecode.com/files/LandauerFoltz-Laham1998.pdf] [[Latent Semantic Analysis]]</div></td></tr>
<tr><td class='diff-marker'> </td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>* Larsen, Bjornar et al. "Fast and effective text mining using linear-time document clustering." 1999. [http://comminfo.rutgers.edu/~muresan/IR/Docs/Articles/sigkddLarsen1999.pdf] [[Document Clustering]]</div></td><td class='diff-marker'> </td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>* Larsen, Bjornar et al. "Fast and effective text mining using linear-time document clustering." 1999. [http://comminfo.rutgers.edu/~muresan/IR/Docs/Articles/sigkddLarsen1999.pdf] [[Document Clustering]]</div></td></tr>
<tr><td colspan="2"> </td><td class='diff-marker'>+</td><td style="color:black; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;"><div><ins style="font-weight: bold; text-decoration: none;">* Lee, K., Lee, Y. et al "Parallel data processing with MapReduce: a survey" 2012. [http://www.cs.arizona.edu/~bkmoon/papers/sigmodrec11.pdf] [[Hadoop]], [[MapReduce]], [[Hadoop MapReduce]]</ins></div></td></tr>
<tr><td class='diff-marker'> </td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>* Li, Yong H., et al. "Classification of text documents." 1998. [http://julio.staff.ipb.ac.id/files/2014/09/LiJ98.pdf] [[Term Clustering]]</div></td><td class='diff-marker'> </td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>* Li, Yong H., et al. "Classification of text documents." 1998. [http://julio.staff.ipb.ac.id/files/2014/09/LiJ98.pdf] [[Term Clustering]]</div></td></tr>
<tr><td class='diff-marker'> </td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>* Liu, Tao, et al. "An evaluation on feature selection for text clustering." 2003. [http://www.aaai.org/Papers/ICML/2003/ICML03-065.pdf] [[Term Contribution]]</div></td><td class='diff-marker'> </td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>* Liu, Tao, et al. "An evaluation on feature selection for text clustering." 2003. [http://www.aaai.org/Papers/ICML/2003/ICML03-065.pdf] [[Term Contribution]]</div></td></tr>
<tr><td colspan="2" class="diff-lineno" id="L51" >Line 51:</td>
<td colspan="2" class="diff-lineno">Line 53:</td></tr>
<tr><td class='diff-marker'> </td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"></td><td class='diff-marker'> </td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"></td></tr>
<tr><td class='diff-marker'> </td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>=== M ===</div></td><td class='diff-marker'> </td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>=== M ===</div></td></tr>
<tr><td colspan="2"> </td><td class='diff-marker'>+</td><td style="color:black; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;"><div><ins style="font-weight: bold; text-decoration: none;">Manning C., Schütze H. "Foundations of statistical natural language processing", 1999. [[Collocation Extraction]]</ins></div></td></tr>
<tr><td colspan="2"> </td><td class='diff-marker'>+</td><td style="color:black; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;"><div><ins style="font-weight: bold; text-decoration: none;"></ins></div></td></tr>
<tr><td class='diff-marker'> </td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>=== N ===</div></td><td class='diff-marker'> </td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>=== N ===</div></td></tr>
<tr><td class='diff-marker'> </td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>=== O ===</div></td><td class='diff-marker'> </td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>=== O ===</div></td></tr>
<tr><td class='diff-marker'>−</td><td style="color:black; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #ffe49c; vertical-align: top; white-space: pre-wrap;"><div>* Oikonomakou, <del class="diffchange diffchange-inline">Nora</del>, <del class="diffchange diffchange-inline">and Michalis </del>Vazirgiannis. "A review of web document clustering approaches." Data mining and knowledge discovery handbook. 2010. [https://scholar.google.com/scholar?cluster=1261203777431390097&hl=ru&as_sdt=0,5] [[Cluster Analysis]] [[Agglomerative Clustering]] [[K-Means]]</div></td><td class='diff-marker'>+</td><td style="color:black; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;"><div>* Oikonomakou, <ins class="diffchange diffchange-inline">N</ins>, Vazirgiannis<ins class="diffchange diffchange-inline">, M</ins>. "A review of web document clustering approaches." Data mining and knowledge discovery handbook. 2010. [https://scholar.google.com/scholar?cluster=1261203777431390097&hl=ru&as_sdt=0,5] [[Cluster Analysis]] [[Agglomerative Clustering]] [[K-Means]]</div></td></tr>
<tr><td class='diff-marker'>−</td><td style="color:black; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #ffe49c; vertical-align: top; white-space: pre-wrap;"><div>* Osinski, <del class="diffchange diffchange-inline">Stanislaw</del>. "Improving quality of search results clustering with approximate matrix factorisations." 2006. [http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.107.74&rep=rep1&type=pdf] [[Non-Negative Matrix Factorization]]</div></td><td class='diff-marker'>+</td><td style="color:black; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;"><div>* Osinski, <ins class="diffchange diffchange-inline">S</ins>. "Improving quality of search results clustering with approximate matrix factorisations." 2006. [http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.107.74&rep=rep1&type=pdf] [[Non-Negative Matrix Factorization<ins class="diffchange diffchange-inline">]]</ins></div></td></tr>
<tr><td colspan="2"> </td><td class='diff-marker'>+</td><td style="color:black; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;"><div><ins class="diffchange diffchange-inline">* Ordonez, C, et al, "Relational versus non-relational database systems for data warehousing." 2010. [http://www2.cs.uh.edu/~ordonez/w-2010-DOLAP-relnonrel.pdf] [[Hadoop]], [[Hadoop MapReduce</ins>]]</div></td></tr>
<tr><td class='diff-marker'> </td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"></td><td class='diff-marker'> </td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"></td></tr>
<tr><td class='diff-marker'> </td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>=== P ===</div></td><td class='diff-marker'> </td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>=== P ===</div></td></tr>
<tr><td class='diff-marker'>−</td><td style="color:black; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #ffe49c; vertical-align: top; white-space: pre-wrap;"><div>* Pagael, <del class="diffchange diffchange-inline">Rober, and Moritz </del>Schubotz. "Mathematical Language Processing Project." 2014. [http://arxiv.org/abs/1407.0167] [[Mathematical Definition Extraction]] [[Math-Aware POS Tagging]]</div></td><td class='diff-marker'>+</td><td style="color:black; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;"><div>* Pagael <ins class="diffchange diffchange-inline">R</ins>, Schubotz <ins class="diffchange diffchange-inline">M</ins>. "Mathematical Language Processing Project." 2014. [http://arxiv.org/abs/1407.0167] [[Mathematical Definition Extraction]] [[Math-Aware POS Tagging]]</div></td></tr>
<tr><td class='diff-marker'>−</td><td style="color:black; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #ffe49c; vertical-align: top; white-space: pre-wrap;"><div>* Paulevé, <del class="diffchange diffchange-inline">Loïc, </del>et al. "Locality sensitive hashing: A comparison of hash function types and querying mechanisms." 2010. [https://hal.inria.fr/inria-00567191/document] [[Locality Sensitive Hashing]], [[K-Means LSH]]</div></td><td class='diff-marker'>+</td><td style="color:black; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;"><div>* Paulevé, <ins class="diffchange diffchange-inline">L. </ins>et al. "Locality sensitive hashing: A comparison of hash function types and querying mechanisms." 2010. [https://hal.inria.fr/inria-00567191/document] [[Locality Sensitive Hashing]], [[K-Means LSH]<ins class="diffchange diffchange-inline">]</ins></div></td></tr>
<tr><td colspan="2"> </td><td class='diff-marker'>+</td><td style="color:black; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;"><div><ins class="diffchange diffchange-inline">* Petrović S. et al. "Comparison of collocation extraction measures for document indexing", 2006. [http://bib.irb.hr/datoteka/251298.110-4-157-203.pdf</ins>]</div></td></tr>
<tr><td class='diff-marker'> </td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"></td><td class='diff-marker'> </td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"></td></tr>
<tr><td class='diff-marker'> </td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"></td><td class='diff-marker'> </td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"></td></tr>
</table>
Alexey
http://mlwiki.org/index.php?title=Sources_Index&diff=630&oldid=prev
Alexey at 11:26, 5 July 2015
2015-07-05T11:26:35Z
<p></p>
<p><b>New page</b></p><div>== Sources Index ==<br />
Only papers I read and used as sources (or small books that don't deserve a separate wiki page)<br />
* ordered by first author<br />
* ABCDEFGHIJKLMNOPQRSTUVWXYZ<br />
<br />
<br />
=== A ===<br />
* Aggarwal, Charu C., and ChengXiang Zhai. "A survey of text clustering algorithms." Mining Text Data. 2012. [[Document Clustering]], [[K-Means]], [[K-Medoids]], [[Co-Clustering]], [[Two-Phase Document Clustering]], [[Non-Negative Matrix Factorization]], [[Semi-Supervised Clustering]], [[Topic Models]], [[Probabilistic LSA]], [[Term Strength]], [[Term Contribution]], [[Stop Words]]<br />
<br />
=== B ===<br />
=== C ===<br />
* Cristianini, Nello, John Shawe-Taylor, and Huma Lodhi. "Latent semantic kernels." 2002. [http://eprints.soton.ac.uk/259781/1/LatentSemanticKernals_JIIS_18.pdf] [[Kernel Methods]] [[Latent Semantic Kernels]]<br />
* Cutting, et al. "Scatter/gather: A cluster-based approach to browsing large document collections." 1992. [http://courses.washington.edu/info320/au11/readings/Week4.Cutting.et.al.1992.Scatter-Gather.pdf] [[Scatter/Gather]]<br />
<br />
=== D ===<br />
* Datar, Mayur, et al. "Locality-sensitive hashing scheme based on p-stable distributions." 2004. [http://www.cs.princeton.edu/courses/archive/spring05/cos598E/bib/p253-datar.pdf] [[Locality Sensitive Hashing]], [[Euclidean LSH]]<br />
* De Smet, Yves. "An introduction to multicriteria decision aid: The PROMETHEE and GAIA methods." [[PROMETHEE]]<br />
* Deerwester, Scott C., et al. "Indexing by latent semantic analysis." 1990. [http://www.cob.unt.edu/itds/faculty/evangelopoulos/dsci5910/LSA_Deerwester1990.pdf] [[Latent Semantic Analysis]]<br />
* Domingos, Pedro. "A few useful things to know about machine learning." 2012. [https://homes.cs.washington.edu/~pedrod/papers/cacm12.pdf] [[Overfitting]]<br />
<br />
=== E ===<br />
* Elsayed, Tamer, Jimmy Lin, and Douglas W. Oard. "Pairwise document similarity in large collections with MapReduce." 2008. [http://www.ece.umd.edu/~oard/pdf/acl08elsayed2.pdf] [[Inverted Index]]<br />
* Ertöz, Levent et al. "Finding clusters of different sizes, shapes, and densities in noisy, high dimensional data." 2003. [http://static.msi.umn.edu/rreports/2003/73.pdf] [[Document Clustering]], [[DBSCAN]], [[SNN Clustering]], [[Euclidean Distance]], [[Curse of Dimensionality]], [[Chameleon Clustering]], [[CURE Clustering]], [[ROCK Clustering]]<br />
<br />
=== F ===<br />
=== G ===<br />
* Gionis, Aristides, Piotr Indyk, and Rajeev Motwani. "Similarity search in high dimensions via hashing." 1999. [http://www.cs.princeton.edu/courses/archive/spring13/cos598C/Gionis.pdf] [[Locality Sensitive Hashing]], [[Bit Sampling LSH]]<br />
<br />
=== H ===<br />
* Hopcroft, John, and Ravindran Kannan. "Foundations of Data Science1." 2014. [[Power Iteration]]<br />
<br />
=== I ===<br />
=== J ===<br />
* Jauregui, Jeff. "Principal component analysis with linear algebra." 2012. [http://www.math.union.edu/~jaureguj/PCA.pdf] [[SVD]], [[Principal Component Analysis]]<br />
* Jing, Liping. "Survey of text clustering." 2008. [http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.112.3476&rep=rep1&type=pdf] [[Vector Space Model]], [[Document Clustering]], [[Cluster Analysis]], [[Subspace Clustering]], [[Semi-Supervised Clustering]]<br />
<br />
<br />
=== K ===<br />
* Kalman, Dan. "A singularly valuable decomposition: the SVD of a matrix." 1996. [http://www.math.washington.edu/~morrow/498_13/svd.pdf] [[SVD]]<br />
* Koll, Matthew B. "WEIRD: An approach to concept-based information retrieval." 1979. [[Latent Semantic Analysis]]<br />
* Korenius, Tuomo, Jorma Laurikkala, and Martti Juhola. "On principal component analysis, cosine and Euclidean measures in information retrieval." 2007. [http://www.sciencedirect.com/science/article/pii/S0020025507002630] [[Principal Component Analysis]], [[Latent Semantic Analysis]], [[Distance Functions]], [[Cosine Similarity]], [[Euclidean Distance]]<br />
* Kristianto, et al. "Extracting definitions of mathematical expressions in scientific papers." 2012. [https://kaigi.org/jsai/webprogram/2012/pdf/719.pdf] [[Mathematical Definition Extraction]], [[Math-Aware POS Tagging]]<br />
* Kristianto, et al. "Extracting Textual Descriptions of Mathematical Expressions in Scientific Papers." 2014. [http://www.dlib.org/dlib/november14/kristianto/11kristianto.html] [[Mathematical Definition Extraction]]<br />
<br />
=== L ===<br />
* Landauer, T. et al. "An introduction to latent semantic analysis." 1998. [http://tottdp.googlecode.com/files/LandauerFoltz-Laham1998.pdf] [[Latent Semantic Analysis]]<br />
* Larsen, Bjornar et al. "Fast and effective text mining using linear-time document clustering." 1999. [http://comminfo.rutgers.edu/~muresan/IR/Docs/Articles/sigkddLarsen1999.pdf] [[Document Clustering]]<br />
* Li, Yong H., et al. "Classification of text documents." 1998. [http://julio.staff.ipb.ac.id/files/2014/09/LiJ98.pdf] [[Term Clustering]]<br />
* Liu, Tao, et al. "An evaluation on feature selection for text clustering." 2003. [http://www.aaai.org/Papers/ICML/2003/ICML03-065.pdf] [[Term Contribution]]<br />
<br />
<br />
=== M ===<br />
=== N ===<br />
=== O ===<br />
* Oikonomakou, Nora, and Michalis Vazirgiannis. "A review of web document clustering approaches." Data mining and knowledge discovery handbook. 2010. [https://scholar.google.com/scholar?cluster=1261203777431390097&hl=ru&as_sdt=0,5] [[Cluster Analysis]] [[Agglomerative Clustering]] [[K-Means]]<br />
* Osinski, Stanislaw. "Improving quality of search results clustering with approximate matrix factorisations." 2006. [http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.107.74&rep=rep1&type=pdf] [[Non-Negative Matrix Factorization]]<br />
<br />
=== P ===<br />
* Pagael, Rober, and Moritz Schubotz. "Mathematical Language Processing Project." 2014. [http://arxiv.org/abs/1407.0167] [[Mathematical Definition Extraction]] [[Math-Aware POS Tagging]]<br />
* Paulevé, Loïc, et al. "Locality sensitive hashing: A comparison of hash function types and querying mechanisms." 2010. [https://hal.inria.fr/inria-00567191/document] [[Locality Sensitive Hashing]], [[K-Means LSH]]<br />
<br />
<br />
=== Q ===<br />
=== R ===<br />
=== S ===<br />
* Salton, et al. "A vector space model for automatic indexing." 1975. [http://cgis.cs.umd.edu/class/fall2009/cmsc828r/PAPERS/VSM_salton-2.pdf] [[Vector Space Model]]<br />
* Salton, Buckley. "Term-weighting approaches in automatic text retrieval." 1988. [http://www.cs.odu.edu/~jbollen/spring03_IR/readings/article1-29-03.pdf] [[TF-IDF]]<br />
* Schelter, Sebastian, et al. "Efficient Sample Generation for Scalable Meta Learning." [http://ssc.io/wp-content/uploads/2014/11/ICDE15_research_150.pdf]. 2014. [[Meta Learning]]<br />
* Schöneberg et al. "POS Tagging and its Applications for Mathematics." 2014. [[Math-Aware POS Tagging]]<br />
* Sculley, David. "Web-scale k-means clustering." 2010. [http://www.ra.ethz.ch/CDstore/www2010/www/p1177.pdf] [[K-Means]]<br />
* Sebastiani, Fabrizio. "Machine learning in automated text categorization." 2002. [http://arxiv.org/pdf/cs/0110053.pdf] [[Document Classification]], [[Term Clustering]]<br />
* Slaney, Malcolm, and Michael Casey. "Locality-sensitive hashing for finding nearest neighbors [lecture notes]." 2008. [http://web.iitd.ac.in/~sumeet/Slaney2008-LSHTutorial.pdf] [[Locality Sensitive Hashing]], [[Euclidean LSH]]<br />
* Steinbach, Michael, et al. "A comparison of document clustering techniques." 2000. [[Document Clustering]], [[K-Means]]<br />
* Strang, Gilbert. "The fundamental theorem of linear algebra." 1993. [http://www.engineering.iastate.edu/~julied/classes/CE570/Notes/strangpaper.pdf] [[SVD]]<br />
<br />
<br />
=== T ===<br />
=== U ===<br />
=== V ===<br />
=== W ===<br />
* Wilbur, W. John, "The automatic identification of stop words." 1992. [http://www.researchgate.net/publication/247786801_The_automatic_identification_of_stop_words] [[Stop Words]], [[Term Strength]]<br />
<br />
=== X ===<br />
* Xu, Wei, Xin Liu, and Yihong Gong. "Document clustering based on non-negative matrix factorization." 2003. [http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.117.2293&rep=rep1&type=pdf] [[Cluster Analysis]], [[Non-Negative Matrix Factorization]]<br />
<br />
=== Y ===<br />
<br />
=== Z ===<br />
* Zhai, ChengXiang. "Statistical language models for information retrieval." (Book) 2008. [[Information Retrieval]], [[Statistical Language Models]], [[Multinomial Distribution]], [[Smoothing for Language Models]], [[TF-IDF]], [[Probabilistic Retrieval Model]]<br />
* Zhukov, Leonid, and David Gleich. "Topic identification in soft clustering using PCA and ICA". 2004. [http://leonidzhukov.ru/papers/soft-clustering-pca-ica.pdf] [[Latent Semantic Analysis]]<br />
<br />
[[Category:Papers]]<br />
[[Category:Notes]]</div>
Alexey