Title: Enumerating Maximal Bicliques from a Large Graph using MapReduce
Speaker: Arko Provo Mukherjee, ECpE Graduate Student
Abstract: Enumeration of maximal bipartite cliques (bicliques) from a large graph is a task central to many practical data mining problems in social network analysis and bioinformatics. We present novel parallel algorithms for this problem using the MapReduce platform, and an experimental evaluation using Hadoop MapReduce.