Pilot corpus: NIH-funded biomedical datasets. Any DOI can be scored on demand — network effects sharpen as coverage grows.

Graph Matching Between Bipartite and Unipartite Networks: To Collapse, or Not to Collapse, That Is the Question

IEEE Transactions on Network Science and Engineering(2021)10.1109/tnse.2021.3086508Source: DataRank Database

Graph Matching Between Bipartite and Unipartite Networks: To Collapse, or Not to Collapse, That Is the Question is a research paper published in IEEE Transactions on Network Science and Engineering (2021). On theSindex it has a DataRank of 0.104. It has been cited 1 time.

N/A

0.104DataRank · unranked

Scored on demand from live citation data

Open Access1 citations

Download PDF

Cite:

DataRank reads this dataset's downstream impact straight off the citation graph — no black box, no proprietary weighting. How is this computed?

›Methodology & internals

datarank_citation_only_1hop_v6· scope data_onlyMethodology

Pipeline:MetadataData-paper checkEnrichmentCitation networkScoring

Enrichment:Funding (5 grants)Impact (FWCI 0.14)OA: greenTopics (25)IDs (PubMed, PMC, OpenAlex)

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.

Run a calibrated FAIR evaluation for this paper →

We only score data papers we can read in full — never from an abstract alone.

DataRank Breakdown

Base Score 100%Citation Network 0%

Base Score Contribution

0.104

From this paper's citation signal

Citation Network Contribution

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 →

Authors (3)

Carey E. Priebe ORCID,Vince Lyzinski ORCID,Jesús Arroyo ORCID

Live enrichment

PubMed:35224127 PMC:PMC8865401 OpenAlex:https://openalex.org/W3004979518

Defense Advanced Research Projects Agency

Grant: FA8750-18-2-0035

National Institutes of Health

Grant: BRAIN U01-NS108637

NINDS NIH HHS

Grant: U01 NS108637

National Institutes of Health

Grant: 1U01NS108637-01

A 5-dimensional connectomics approach to the neural basis of behavior

Air Force Research Laboratory

FWCI

0.14

Citation Percentile

0.6%

Citation Trend

2022

greenLicense: IEEE Copyright

repositoryhttps://arxiv.org/pdf/2002.01648

publisherhttp://xplorestaging.ieee.org/ielx7/6488902/9644929/09447239.pdf?arnumber=9447239

repositoryhttp://arxiv.org/abs/2002.01648

journalhttps://doi.org/10.1109/tnse.2021.3086508

Fields of Study

Advanced Graph Neural NetworksGraph Theory and AlgorithmsComplex Network Analysis Techniques0202 electrical engineering, electronic engineering, information engineering02 engineering and technology0101 mathematics01 natural sciences

Keywords

Bipartite graphComputer scienceMatching (statistics)Theoretical computer scienceGraphBlossom algorithmMathematicsBipartite NetworksGraphical LassoGraph MatchingUndirected Graphical ModelsMethodology (stat.ME)FOS: Computer and information sciencesComputer Science - Machine LearningStatistics - Machine LearningMachine Learning (stat.ML)Statistics - MethodologyMachine Learning (cs.LG)