no code implementations • 15 Mar 2024 • Elnaz Zafarani-Moattar, Mohammad Reza Kangavari, Amir Masoud Rahmani
Frequent pattern and clustering are selected for this research, and a hybrid of both is proposed as a new category.
no code implementations • 16 Nov 2021 • Elnaz Zafarani-Moattar, Mohammad Reza Kangavari, Amir Masoud Rahmani
Then, all the different combinations of embedding methods with distance metrics and clustering methods are investigated by silhouette metric.
no code implementations • 27 Jun 2021 • Sana Rahmani, Saeid Hosseini, Raziyeh Zall, Mohammad Reza Kangavari, Sara Kamran, Wen Hua
Based on the given extrinsic and intrinsic analysis results, we note that compared to other theoretical-based techniques, the proposed hierarchical clustering approach can better group the users within the adaptive tree.
no code implementations • 4 Jun 2021 • Sayna Esmailzadeh, Saeid Hosseini, Mohammad Reza Kangavari, Wen Hua
Leveraging short-text contents to estimate the occupation of microblog authors has significant gains in many applications.
no code implementations • 3 Jun 2021 • Sara Kamran, Raziyeh Zall, Mohammad Reza Kangavari, Saeid Hosseini, Sana Rahmani, Wen Hua
The latent knowledge in the emotions and the opinions of the individuals that are manifested via social networks are crucial to numerous applications including social management, dynamical processes, and public security.
no code implementations • 27 Oct 2019 • Saeed Najafipour, Saeid Hosseini, Wen Hua, Mohammad Reza Kangavari, Xiaofang Zhou
Our approach, on the one hand, computes the relevance score (edge weight) between the authors through considering a portmanteau of contents and concepts, and on the other hand, employs a stack-wise graph cutting algorithm to extract the communities of the related authors.
no code implementations • 6 Jul 2019 • Saeid Hosseini, Saeed Najafipour, Ngai-Man Cheung, Hongzhi Yin, Mohammad Reza Kangavari, Xiaofang Zhou
We can use the temporal and textual data of the nodes to compute the edge weights and then generate subgraphs with highly relevant nodes.