<script type="text/javascript">
<!--
document.write('<div id="oa_widget"></div>');
document.write('<script type="text/javascript" src="https://www.openaire.eu/index.php?option=com_openaire&view=widget&format=raw&projectId=undefined&type=result"></script>');
-->
</script>
Suppose, we are given V = {1, 2, …, n} ≡ [n], a set of n points, that can be clustered into k parts V i , i = 1, …, k; V i ∩ V j = ∅, ∀i ≠ j; the subsets V i ⊂ [n] and k are unknown to us. There is an oracle that can answer any pair-wise queries V × V → {±1}, where a query answer of +1 for (u, v) ∈ V ×V indicates u and v belong to the same cluster, and −1 indicates they do not. How many such queries are necessary and/or sufficient to find the clusters exactly?
citations This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 0 | |
popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |