Abstract
Mobile phone is one of the most prevalent communication tools today with the popularity of mobile devices and wireless technologies. Mobile social network systems are increasingly available. A mobile social network plays an essential role as the spread of information and relationship. This paper propose a new algorithm called group detection algorithm for mining interesting groups in a Campus Mobile Social Network (CMSN) where individuals communicate with one another using mobile phones with short numbers. We use our metric to analyze received and dialed call records within an organization to extract social hierarchy. We analyze the behavior of the communication patterns with taking into account the actual call detail records received and dialed by users. The proposal algorithm is composed of two main components, an algorithm for mining groups and a dynamic programming algorithm for selecting subgroups to combine into a big group. Empirical studies on a large real-world campus mobile social network show that performance of our algorithm is an effective algorithm for extracting groups in CMSN.
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 callDisclaimer: 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.
