🏆 Finalist — NIH Data Sharing Index (“S-Index”) Challenge
Demo corpus. Scores are computed on a select set of biomedical paper/datasets and may be inaccurate for papers outside this corpus — DataRank relies on network effects that improve with scale. We aim to expand this into a fully open resource pending additional funding.

Support-Vector Networks

Machine Learning(1995)10.1023/a:1022627411411Source: DataRank Database

Support-Vector Networks is a research paper published in Machine Learning (1995). On theSindex it has a DataRank of 1.6. It has been cited 32,454 times.

N/A
1.6DataRank · unranked
1.6
Open Access32454 citations · base score 10.4
Cite:
datarank_citation_only_1hop_v6· scope data_onlyMethodology
Data sources & pipeline
Pipeline:MetadataData-paper checkEnrichmentCitation networkScoring
Enrichment:Pending

FAIR Checklist

Context only (not used in score)
Findable (1/2)
  • Has DOI
Accessible (1/2)
  • Open Access
Interoperable (0/2)
    Reusable (0/3)

      FAIR checklist signals are shown for context only and do not affect DataRank scoring.

      DataRank Breakdown

      Base Score 100%Citation Network 0%

      Base Score Contribution

      1.6

      From this paper's citation signal

      Citation Network Contribution

      0

      Citation network not refreshed for this result

      This paper's DataRank is currently driven only by its base citation score. Citation network data was not refreshed for this result.

      Learn more about DataRank methodology →
      Why this DataRank?

      DataRank blends this paper's own citation count with the influence of the papers that cite it. Here, roughly 100% comes from its base citations and 0% from the citation network.

      Base score B(p)
      log1p(citation_count) — grows sub-linearly, so a paper with 1,000 citations is not 10× a paper with 100.
      Network N(p)
      Σ over citers of log1p(Cq) ÷ max(outdegreeq, 1). Being cited by a highly-cited paper with few references counts most.
      Damping factor d = 0.85
      DataRank = (1−d)·B(p) + d·N(p) — the two cards above are each already multiplied by their share.
      Self-citations excluded
      Citers sharing any OpenAlex author ID with this paper are filtered out before the network sum.

      Citers are pulled from OpenAlex sorted by cited_by_count:descand capped per paper, so when the cap binds we keep the highest-signal references and the score is reproducible across reruns.

      Read the full methodology →

      Authors (2)

      Vladimir N. Vapnik,Corinna Cortes

      Related Papers (10)

      Random Forests
      N/A
      1.8DataRank · unranked
      Machine Learning(2001)
      co-citedsame journal
      10.1023/a:1010933404324
      Nature Reviews Genetics(2015)
      co-cited
      10.1038/nrg3920
      Long Short-Term Memory
      N/A
      1.7DataRank · unranked
      Neural Computation(1997)
      co-cited
      10.1162/neco.1997.9.8.1735
      Proceedings of the IEEE(1998)
      co-cited
      10.1109/5.726791
      Deep learning
      N/A
      1.7DataRank · unranked
      Nature(2015)
      co-cited
      10.1038/nature14539
      The Annals of Statistics(2001)
      co-cited
      10.1214/aos/1013203451
      Journal of the Royal Statistical Society Series B: Statistical Methodology(1996)
      co-cited
      10.1111/j.2517-6161.1996.tb02080.x
      Support vector machines
      N/A
      1.3DataRank · unranked
      IEEE Intelligent Systems and their Applications(1998)
      co-cited
      10.1109/5254.708428
      Journal of the Royal Statistical Society Series B: Statistical Methodology(1974)
      co-cited
      10.1111/j.2517-6161.1974.tb00994.x