Abstract

The popularity of social networking on the Web and the explosive combination with data mining techniques open up vast and so far unexplored opportunities for social intelligence on the Web. A network community is a special sub-network that contains a group of nodes sharing similar linked patterns. Many community mining algorithms have been developed in the past. In this work, we have presented a new algorithm BFC (breadth first clustering) which uses statistical approach for community mining in social networks. The algorithm proceeds in breadth first way and incrementally extract communities from the network. This algorithm is simple, fast and can be scaled easily for large social networks. The effectiveness of this approach has been validated using network examples.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.