An improved density peaks-based clustering method for social circle discovery in social networks

2016 ◽  
Vol 179 ◽  
pp. 219-227 ◽  
Author(s):  
Mengmeng Wang ◽  
Wanli Zuo ◽  
Ying Wang
Author(s):  
Poonam Rani ◽  
MPS Bhatia ◽  
Devendra K Tayal

The paper presents an intelligent approach for the comparison of social networks through a cone model by using the fuzzy k-medoids clustering method. It makes use of a geometrical three-dimensional conical model, which astutely represents the user experience views. It uses both the static as well as the dynamic parameters of social networks. In this, we propose an algorithm that investigates which social network is more fruitful. For the experimental results, the proposed work is employed on the data collected from students from different universities through the Google forms, where students are required to rate their experience of using different social networks on different scales.


2021 ◽  
Vol 10 (3) ◽  
pp. 161
Author(s):  
Hao-xuan Chen ◽  
Fei Tao ◽  
Pei-long Ma ◽  
Li-na Gao ◽  
Tong Zhou

Spatial analysis is an important means of mining floating car trajectory information, and clustering method and density analysis are common methods among them. The choice of the clustering method affects the accuracy and time efficiency of the analysis results. Therefore, clarifying the principles and characteristics of each method is the primary prerequisite for problem solving. Taking four representative spatial analysis methods—KMeans, Density-Based Spatial Clustering of Applications with Noise (DBSCAN), Clustering by Fast Search and Find of Density Peaks (CFSFDP), and Kernel Density Estimation (KDE)—as examples, combined with the hotspot spatiotemporal mining problem of taxi trajectory, through quantitative analysis and experimental verification, it is found that DBSCAN and KDE algorithms have strong hotspot discovery capabilities, but the heat regions’ shape of DBSCAN is found to be relatively more robust. DBSCAN and CFSFDP can achieve high spatial accuracy in calculating the entrance and exit position of a Point of Interest (POI). KDE and DBSCAN are more suitable for the classification of heat index. When the dataset scale is similar, KMeans has the highest operating efficiency, while CFSFDP and KDE are inferior. This paper resolves to a certain extent the lack of scientific basis for selecting spatial analysis methods in current research. The conclusions drawn in this paper can provide technical support and act as a reference for the selection of methods to solve the taxi trajectory mining problem.


2019 ◽  
Vol 84 (1) ◽  
pp. 9-20
Author(s):  
Xuhui Zhu ◽  
Junliang Shang ◽  
Yan Sun ◽  
Feng Li ◽  
Jin-Xing Liu ◽  
...  

Author(s):  
PRANAV NERURKAR ◽  
MADHAV CHANDANE ◽  
SUNIL BHIRUD

Social circles, groups, lists, etc. are functionalities that allow users of online social network (OSN) platforms to manually organize their social media contacts. However, this facility provided by OSNs has not received appreciation from users due to the tedious nature of the task of organizing the ones that are only contacted periodically. In view of the numerous benefits of this functionality, it may be advantageous to investigate measures that lead to enhancements in its efficacy by allowing for automatic creation of customized groups of users (social circles, groups, lists, etc). The field of study for this purpose, i.e. creating coarse-grained descriptions from data, consists of two families of techniques, community discovery and clustering. These approaches are infeasible for the purpose of automation of social circle creation as they fail on social networks. A reason for this failure could be lack of knowledge of the global structure of the social network or the sparsity that exists in data from social networking websites. As individuals do in real life, OSN clients dependably attempt to broaden their groups of contacts in order to fulfill different social demands. This means that ‘homophily’ would exist among OSN users and prove useful in the task of social circle detection. Based on this intuition, the current inquiry is focused on understanding ‘homophily’ and its role in the process of social circle formation. Extensive experiments are performed on egocentric networks (ego is user, alters are friends) extracted from prominent OSNs like Facebook, Twitter, and Google+. The results of these experiments are used to propose a unified framework: feature extraction for social circles discovery (FESC). FESC detects social circles by jointly modeling ego-net topology and attributes of alters. The performance of FESC is compared with standard benchmark frameworks using metrics like edit distance, modularity, and running time to highlight its efficacy.


2017 ◽  
Vol 28 (06) ◽  
pp. 1750082 ◽  
Author(s):  
Yang Ma ◽  
Guangquan Cheng ◽  
Zhong Liu ◽  
Xingxing Liang

Link prediction in social networks has become a growing concern among researchers. In this paper, the clustering method was used to exploit the grouping tendency of nodes, and a clustering index (CI) was proposed to predict potential links with characteristics of scientific cooperation network taken into consideration. Results showed that CI performed better than the traditional indices for scientific coauthorship networks by compensating for their disadvantages. Compared with traditional algorithms, this method for a specific type of network can better reflect the features of the network and achieve more accurate predictions.


Information ◽  
2021 ◽  
Vol 12 (12) ◽  
pp. 501
Author(s):  
Yuanyuan Meng ◽  
Xiyu Liu

Community detection is a significant research field of social networks, and modularity is a common method to measure the division of communities in social networks. Many classical algorithms obtain community partition by improving the modularity of the whole network. However, there is still a challenge in community division, which is that the traditional modularity optimization is difficult to avoid resolution limits. To a certain extent, the simple pursuit of improving modularity will cause the division to deviate from the real community structure. To overcome these defects, with the help of clustering ideas, we proposed a method to filter community centers by the relative connection coefficient between vertices, and we analyzed the community structure accordingly. We discuss how to define the relative connection coefficient between vertices, how to select the community centers, and how to divide the remaining vertices. Experiments on both real and synthetic networks demonstrated that our algorithm is effective compared with the state-of-the-art methods.


2021 ◽  
Vol 27 (11) ◽  
pp. 1203-1221
Author(s):  
Amal Rekik ◽  
Salma Jamoussi

Clustering data streams in order to detect trending topic on social networks is a chal- lenging task that interests the researchers in the big data field. In fact, analyzing such data needs several requirements to be addressed due to their large amount and evolving nature. For this purpose, we propose, in this paper, a new evolving clustering method which can take into account the incremental nature of the data and meet with its principal requirements. Our method explores a deep learning technique to learn incrementally from unlabelled examples generated at high speed which need to be clustered instantly. To evaluate the performance of our method, we have conducted several experiments using the Sanders, HCR and Terr-Attacks datasets.


2022 ◽  
Vol 2022 ◽  
pp. 1-13
Author(s):  
Zhihe Wang ◽  
Yongbiao Li ◽  
Hui Du ◽  
Xiaofen Wei

Aiming at density peaks clustering needs to manually select cluster centers, this paper proposes a fast new clustering method with auto-select cluster centers. Firstly, our method groups the data and marks each group as core or boundary groups according to its density. Secondly, it determines clusters by iteratively merging two core groups whose distance is less than the threshold and selects the cluster centers at the densest position in each cluster. Finally, it assigns boundary groups to the cluster corresponding to the nearest cluster center. Our method eliminates the need for the manual selection of cluster centers and improves clustering efficiency with the experimental results.


Sign in / Sign up

Export Citation Format

Share Document