text: user1771: I am using Louvain clustering (1,2) to cluster cells in scRNAseq data, as implemented by scanpy.
  One of the parameter required for this kind of clustering is the number of neighbors used to construct the neighborhood graph of cells (docs).
  Larger values result in a more global view of the manifold, leading to lower number of clusters, while reducing the number of neighbors goes in the opposite direction. However, it is unclear how to choose this parameter.
  The resolution parameter seems to work in the opposite way.
  Do you know of any methodology and/or rule-of-thumb to define these parameters? E.g. depending on the size of the dataset?
  
  Levine, Jacob H., et al. "Data-driven phenotypic dissection of AML reveals progenitor-like cells that correlate with prognosis." Cell 162.1 (2015): 184-197.
  Blondel, Vincent D., et al. "Fast unfolding of communities in large networks." Journal of statistical mechanics: theory and experiment 2008.10 (2008): P10008.
  
  
  user787: A general rule of thumb is that in order to improve the variance $n$ times you need $n^2$ neighbours. This is only applicable if you consider the $n^2$ nearest neighbours of a cell to be biologically identical (i.e. "similar enough"); if your data includes 10 types of cells with 10 cells each, then using the 20 nearest neighbours for smoothing will obscure the data.
  As far as I know, there is no single best answer to this question. I would suggest trying different numbers and sticking to what agrees more with the biology of the dataset.
  
  user4766: I read a paper where the authors used different combinations of parameters to iteratively perform LSI until some criteria. Maybe a similar strategy can be applied to Louvain clustering as well?
  The paper can be found here: https://www.nature.com/articles/s41587-019-0332-7.
  You can also check their code to see how they implemented it.
  
original_text: 1771: <p>I am using Louvain clustering (1,2) to cluster cells in scRNAseq data, as implemented by <a href="https://scanpy.readthedocs.io" rel="noreferrer">scanpy</a>.</p>
  
  <p>One of the parameter required for this kind of clustering is the number of neighbors used to construct the neighborhood graph of cells (<a href="https://scanpy.readthedocs.io/en/latest/api/scanpy.api.pp.neighbors.html#scanpy.api.pp.neighbors" rel="noreferrer">docs</a>).</p>
  
  <p>Larger values result in a more global view of the manifold, leading to lower number of clusters, while reducing the number of neighbors goes in the opposite direction. However, it is unclear how to choose this parameter.</p>
  
  <p>The resolution parameter seems to work in the opposite way.</p>
  
  <p>Do you know of any methodology and/or rule-of-thumb to define these parameters? E.g. depending on the size of the dataset?</p>
  
  <ol>
  <li>Levine, Jacob H., et al. "Data-driven phenotypic dissection of AML reveals progenitor-like cells that correlate with prognosis." Cell 162.1 (2015): 184-197.</li>
  <li>Blondel, Vincent D., et al. "Fast unfolding of communities in large networks." Journal of statistical mechanics: theory and experiment 2008.10 (2008): P10008.</li>
  </ol>
   787: <p>A general rule of thumb is that in order to improve the variance $n$ times you need $n^2$ neighbours. This is only applicable if you consider the $n^2$ nearest neighbours of a cell to be biologically identical (i.e. "similar enough"); if your data includes 10 types of cells with 10 cells each, then using the 20 nearest neighbours for smoothing will obscure the data.</p>
  
  <p>As far as I know, there is no single best answer to this question. I would suggest trying different numbers and sticking to what agrees more with the biology of the dataset.</p>
   4766: <p>I read a paper where the authors used different combinations of parameters to iteratively perform LSI until some criteria. Maybe a similar strategy can be applied to Louvain clustering as well?</p>
  
  <p>The paper can be found here: <a href="https://www.nature.com/articles/s41587-019-0332-7" rel="nofollow noreferrer">https://www.nature.com/articles/s41587-019-0332-7</a>.
  You can also check their code to see how they implemented it.</p>
  