<div dir="ltr">Thanks for pointing that out, I sort of picked it up by word of mouth so I'd assumed it had a bit more precedence in the academic world. <div><br><div><div>I'll look into it a little more, but I'd definitely be interested in contributing something else if that doesn't work out.</div></div></div><div><br></div><div>-Allan</div></div><div class="gmail_extra"><br><div class="gmail_quote">On Sat, Dec 3, 2016 at 4:45 PM, Andy <span dir="ltr"><<a href="mailto:t3kcit@gmail.com" target="_blank">t3kcit@gmail.com</a>></span> wrote:<br><blockquote class="gmail_quote" style="margin:0 0 0 .8ex;border-left:1px #ccc solid;padding-left:1ex">
<div bgcolor="#FFFFFF" text="#000000">
Hey Allan.<br>
<br>
None of the references apart from the last one seems to be published
in a peer-reviewed place, is that right?<br>
And "A stochastic uncoupling process for graphs" has 13 citations
since 2000. Unless there is a more prominent<br>
publication or evidence of heavy use, I think it's disqualified.<br>
Academia is certainly not the only metric for evaluation, so if you
have others, that's good, too ;)<br>
<br>
Best,<br>
Andy<br>
<br>
<div class="m_8192344549692176098moz-cite-prefix">On 12/03/2016 04:33 PM, Allan Visochek
wrote:<br>
</div>
<blockquote type="cite">
<div dir="ltr">Hey Andy,
<div><br>
</div>
<div>This algorithm does operate on sparse graphs so it may be
beyond the scope of sci-kit learn, let me know what you
think. </div>
<div>The website is <a href="http://micans.org/mcl/" target="_blank">here</a>, it
includes a brief description of how the algorithm operates
under Documentation -> Overview1 and Overview2. </div>
<div>The references listed on the website are included below.</div>
<div><br>
</div>
<div>Best,</div>
<div>-Allan</div>
<div><br>
</div>
<div>
<p class="m_8192344549692176098m_3662110346703346319gmail-asd_par"><a name="m_8192344549692176098_m_3662110346703346319_gcbfs">[1]</a> Stijn
van Dongen. <i>Graph Clustering by Flow Simulation</i>. PhD
thesis, University of Utrecht, May 2000.<br>
<a href="http://www.library.uu.nl/digiarchief/dip/diss/1895620/inhoud.htm" target="_blank">http://www.library.uu.nl/digia<wbr>rchief/dip/diss/1895620/inhoud<wbr>.htm</a></p>
<p class="m_8192344549692176098m_3662110346703346319gmail-asd_par"><a name="m_8192344549692176098_m_3662110346703346319_cafg">[2]</a> Stijn
van Dongen. <i>A cluster algorithm for graphs</i>. Technical
Report INS-R0010, National Research Institute for
Mathematics and Computer Science in the Netherlands,
Amsterdam, May 2000.<br>
<a href="http://www.cwi.nl/ftp/CWIreports/INS/INS-R0010.ps.Z" target="_blank">http://www.cwi.nl/ftp/CWIrepor<wbr>ts/INS/INS-R0010.ps.Z</a></p>
<p class="m_8192344549692176098m_3662110346703346319gmail-asd_par"><a name="m_8192344549692176098_m_3662110346703346319_supfg">[3]</a> Stijn
van Dongen. <i>A stochastic uncoupling process for graphs</i>.
Technical Report INS-R0011, National Research Institute for
Mathematics and Computer Science in the Netherlands,
Amsterdam, May 2000.<br>
<a href="http://www.cwi.nl/ftp/CWIreports/INS/INS-R0011.ps.Z" target="_blank">http://www.cwi.nl/ftp/CWIrepor<wbr>ts/INS/INS-R0011.ps.Z</a></p>
<p class="m_8192344549692176098m_3662110346703346319gmail-asd_par"><a name="m_8192344549692176098_m_3662110346703346319_pcfgcmce">[4]</a> Stijn van
Dongen. <i>Performance criteria for graph clustering and
Markov cluster experiments</i>. Technical Report
INS-R0012, National Research Institute for Mathematics and
Computer Science in the Netherlands, Amsterdam, May 2000.<br>
<a href="http://www.cwi.nl/ftp/CWIreports/INS/INS-R0012.ps.Z" target="_blank">http://www.cwi.nl/ftp/CWIrepor<wbr>ts/INS/INS-R0012.ps.Z</a></p>
<p class="m_8192344549692176098m_3662110346703346319gmail-asd_par"><a name="m_8192344549692176098_m_3662110346703346319_eaflsdopf">[5]</a> Enright
A.J., Van Dongen S., Ouzounis C.A. <i>An efficient algorithm
for large-scale detection of protein families</i>, Nucleic
Acids Research 30(7):1575-1584 (2002).</p>
</div>
</div>
<div class="gmail_extra"><br>
<div class="gmail_quote">On Sat, Dec 3, 2016 at 3:34 PM, Andy <span dir="ltr"><<a href="mailto:t3kcit@gmail.com" target="_blank">t3kcit@gmail.com</a>></span>
wrote:<br>
<blockquote class="gmail_quote" style="margin:0 0 0 .8ex;border-left:1px #ccc solid;padding-left:1ex">
<div bgcolor="#FFFFFF" text="#000000"> Hi Allan.<br>
Can you provide the original paper?<br>
It this something usually used on sparse graphs? We do
have algorithms that operate on data-induced<br>
graphs, like SpectralClustering, but we don't really
implement general graph algorithms (there's no PageRank or
community detection).<br>
<br>
Andy<br>
<br>
<br>
<div class="m_8192344549692176098m_-5298880587644186335moz-cite-prefix">On
12/03/2016 12:19 PM, Allan Visochek wrote:<br>
</div>
<blockquote type="cite">
<div dir="ltr">Hi there,
<div><br>
</div>
<div>My name is Allan Visochek, I'm a data scientist
and web developer and I love scikit-learn so first
of all, thanks so much for the work that you do. </div>
<div><br>
</div>
<div>I'm reaching out because I've found the markov
clustering algorithm to be quite useful for me in
some of my work and noticed that there is no
implementation in scikit-learn, is anybody working
on this? If not, id be happy to take this on. I'm
new to open source, but I've been working with
python for a few years now. </div>
<div><br>
</div>
<div>Best,</div>
<div>-Allan</div>
</div>
<br>
<fieldset class="m_8192344549692176098m_-5298880587644186335mimeAttachmentHeader"></fieldset>
<br>
<pre>______________________________<wbr>_________________
scikit-learn mailing list
<a class="m_8192344549692176098m_-5298880587644186335moz-txt-link-abbreviated" href="mailto:scikit-learn@python.org" target="_blank">scikit-learn@python.org</a>
<a class="m_8192344549692176098m_-5298880587644186335moz-txt-link-freetext" href="https://mail.python.org/mailman/listinfo/scikit-learn" target="_blank">https://mail.python.org/mailma<wbr>n/listinfo/scikit-learn</a>
</pre>
</blockquote>
</div>
______________________________<wbr>_________________
scikit-learn mailing list
<a href="mailto:scikit-learn@python.org" target="_blank">scikit-learn@python.org</a>
<a href="https://mail.python.org/mailman/listinfo/scikit-learn" rel="noreferrer" target="_blank">https://mail.python.org/mailma<wbr>n/listinfo/scikit-learn</a>
</blockquote></div>
</div>
<fieldset class="m_8192344549692176098mimeAttachmentHeader"></fieldset>
<pre>______________________________<wbr>_________________
scikit-learn mailing list
<a class="m_8192344549692176098moz-txt-link-abbreviated" href="mailto:scikit-learn@python.org" target="_blank">scikit-learn@python.org</a>
<a class="m_8192344549692176098moz-txt-link-freetext" href="https://mail.python.org/mailman/listinfo/scikit-learn" target="_blank">https://mail.python.org/<wbr>mailman/listinfo/scikit-learn</a>
</pre>
</blockquote>
</div><br>______________________________<wbr>_________________<br>
scikit-learn mailing list<br>
<a href="mailto:scikit-learn@python.org">scikit-learn@python.org</a><br>
<a href="https://mail.python.org/mailman/listinfo/scikit-learn" rel="noreferrer" target="_blank">https://mail.python.org/<wbr>mailman/listinfo/scikit-learn</a><br>
<br></blockquote></div><br></div>