5 citations · 10 across the 6 of their papers we have counts for
Showing 2013Show all
2 papers · 1 filter
cs.DB2013
Identifying Correlated Heavy-Hitters in a Two-Dimensional Data Stream
Bibudh Lahiri, Arko Provo Mukherjee, Srikanta Tirthapura
We consider online mining of correlated heavy-hitters from a data stream. Given a stream of two-dimensional data, a correlated aggregate query first extracts a substream by applyin…
cs.DS2013★ 5 cited
Mining Maximal Cliques from an Uncertain Graph
Arko Provo Mukherjee, Pan Xu, Srikanta Tirthapura
We consider mining dense substructures (maximal cliques) from an uncertain graph, which is a probability distribution on a set of deterministic graphs. For parameter 0 < α < 1, we…