68 страниц. 2012 год. LAP Lambert Academic Publishing Web community is a good data management technique. Finding web communities from a web graph is a challenging task. Different approaches have been proposed for finding web communities. In this book we have tried to provide a general framework for identifying web communities using link based approaches. We have explored and analyzed two widely used link based approaches based on bipartite core and maximum flow algorithm. We have tried to compare these approaches on various parameters. Based on problems/limitations of these methods, we have discussed some extensions to the approaches and novel approach to find web communities based on co-variance analysis has been proposed. Finally some innovations and experiments for web community identification have been presented.