activity
20152024
most citedDistortive Effects of Initial-Based Name Disambiguation on Measurements of Large-Scale Coauthorship Networks

69 citations · 112 across the 9 of their papers we have counts for

collaborators

12 papers

cs.SI2024

Structural Balance in Real-World Social Networks: Incorporating Direction and Transitivity in Measuring Partial Balance

Rezvaneh Rezapour, Ly Dinh, Lan Jiang +1

Structural balance theory predicts that triads in networks gravitate towards stable configurations. The theory has been verified for undirected graphs. Since real-world networks ar…

cs.CL2022

PyTAIL: Interactive and Incremental Learning of NLP Models with Human in the Loop for Online Data

Shubhanshu Mishra, Jana Diesner

Online data streams make training machine learning models hard because of distribution shift and new patterns emerging over time. For natural language processing (NLP) tasks that u…

cs.SI2021

WikiCSSH: Extracting and Evaluating Computer Science Subject Headings from Wikipedia

Kanyao Han, Pingjing Yang, Shubhanshu Mishra +1

Hierarchical domain-specific classification schemas (or subject heading vocabularies) are often used to identify, classify, and disambiguate concepts that occur in scholarly articl…

cs.SI202113 cited

Over-time measurement of triadic closure in coauthorship networks

Jinseok Kim, Jana Diesner

Applying the concept of triadic closure to coauthorship networks means that scholars are likely to publish a joint paper if they have previously coauthored with the same people. Pr…

cs.SI20217 cited

Formational bounds of link prediction in collaboration networks

Jinseok Kim, Jana Diesner

Link prediction in collaboration networks is often solved by identifying structural properties of existing nodes that are disconnected at one point in time, and that share a link l…

cs.SI20201 cited

Structural balance in signed digraphs: considering transitivity to measure balance in graphs constructed by using different link signing methods

Ly Dinh, Rezvaneh Rezapour, Lan Jiang +1

Structural balance theory assumes triads in networks to gravitate towards stable configurations. The theory has been verified for undirected graphs. Since real-world networks are o…