32 citations · 74 across the 12 of their papers we have counts for
Showing 2020Show all
2 papers · 1 filter
cs.LG2020★ 3 cited
DriftSurf: A Risk-competitive Learning Algorithm under Concept Drift
Ashraf Tahmasbi, Ellango Jothimurugesan, Srikanta Tirthapura +1
When learning from streaming data, a change in the data distribution, also known as concept drift, can render a previously-learned model inaccurate and require training a new model…
cs.DC2020
Shared-Memory Parallel Maximal Clique Enumeration from Static and Dynamic Graphs
Apurba Das, Seyed-Vahid Sanei-Mehri, Srikanta Tirthapura
Maximal Clique Enumeration (MCE) is a fundamental graph mining problem, and is useful as a primitive in identifying dense structures in a graph. Due to the high computational cost…