We consider Maximal Clique Enumeration (MCE) from a large graph. A maximal clique is perhaps the most fundamental dense substructure in a graph, and MCE is an important tool to discover denselyâ€¦ (More)

We consider online mining of correlated heavy-hitters (CHH) from a data stream. Given a stream of two-dimensional data, a correlated aggregate query first extracts a substream by applying a predicateâ€¦ (More)

We consider the enumeration of maximal bipartite cliques (bicliques) from a large graph, a task central to many data mining problems arising in social network analysis and bioinformatics. We presentâ€¦ (More)

2015 IEEE 31st International Conference on Dataâ€¦

2015

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 consider theâ€¦ (More)

We consider the enumeration of dense substructures (maximal cliques) from an uncertain graph. For parameter <inline-formula><tex-math notation="LaTeX">$0 < \alpha < 1$</tex-math><alternatives>â€¦ (More)