Providing an Efficient Method to Identify Structural Balanced Social Network Charts using Data Mining Techniques
As social communications become widespread, social networks are expanding day by day, and the number of members is increasing. In this regard, one of the most important issues on social networks is the prediction of the link or the friend's suggestion, which is usually done using similarities...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
College of Computer and Information Technology – University of Wasit, Iraq
2022-03-01
|
| Series: | Wasit Journal of Computer and Mathematics Science |
| Subjects: | |
| Online Access: | https://wjcm.uowasit.edu.iq/index.php/wjcm/article/view/22 |
| _version_ | 1797198957888143360 |
|---|---|
| author | Razieh Asgarnezhad Safaa Saad Abdull Majeed Zainab Aqeel Abbas Sarah Sinan Salman |
| author_facet | Razieh Asgarnezhad Safaa Saad Abdull Majeed Zainab Aqeel Abbas Sarah Sinan Salman |
| author_sort | Razieh Asgarnezhad |
| collection | DOAJ |
| description |
As social communications become widespread, social networks are expanding day by day, and the number of members is increasing. In this regard, one of the most important issues on social networks is the prediction of the link or the friend's suggestion, which is usually done using similarities among users. In the meantime, clustering methods are very popular, but because of the high convergence velocity dimensions, clustering methods are usually low. In this research, using spectral clustering and diminishing dimensions, reducing the amount of information, reduces clustering time and reduces computational complexity and memory. In this regard, the spectroscopic clustering method, using a balanced index, determines the number of optimal clusters, and then performs clustering on the normal values of the normalized Laplace matrix. First, the clusters are divided into two parts and computed for each cluster of the harmonic distribution index. Each cluster whose index value for it is greater than 1 will be redistributed to two other clusters, and this will continue until the cluster has an index of less than 1. Finally, the similarity between the users within the cluster and between the clusters is calculated and the most similar people are introduced together. The best results for the Opinions, Google+ and Twitter data sets are 95.95, 86.44 and 95.45, respectively. The computational results of the proposed method and comparison with previous valid methods showed the superiority of the proposed approach.
|
| first_indexed | 2024-03-07T19:03:50Z |
| format | Article |
| id | doaj.art-e783f4f2af5149d89042b6cd9913f6db |
| institution | Directory Open Access Journal |
| issn | 2788-5879 2788-5887 |
| language | English |
| last_indexed | 2024-04-24T07:08:07Z |
| publishDate | 2022-03-01 |
| publisher | College of Computer and Information Technology – University of Wasit, Iraq |
| record_format | Article |
| series | Wasit Journal of Computer and Mathematics Science |
| spelling | doaj.art-e783f4f2af5149d89042b6cd9913f6db2024-04-21T18:58:26ZengCollege of Computer and Information Technology – University of Wasit, IraqWasit Journal of Computer and Mathematics Science2788-58792788-58872022-03-011110.31185/wjcm.Vol1.Iss1.22Providing an Efficient Method to Identify Structural Balanced Social Network Charts using Data Mining TechniquesRazieh Asgarnezhad0Safaa Saad Abdull Majeed1Zainab Aqeel Abbas2Sarah Sinan Salman3Department of Computer Engineering Isfahan (Khorasan) Branch Islamic Azad University Isfahan , IranDepartment of Computer Engineering Isfahan (Khorasan) Branch Islamic Azad University Isfahan, IranDepartment of Computer Engineering Isfahan (Khorasan) Branch Islamic Azad University Isfahan , IranDepartment of Computer Engineering Isfahan (Khorasan) Branch Islamic Azad University Isfahan , Iran As social communications become widespread, social networks are expanding day by day, and the number of members is increasing. In this regard, one of the most important issues on social networks is the prediction of the link or the friend's suggestion, which is usually done using similarities among users. In the meantime, clustering methods are very popular, but because of the high convergence velocity dimensions, clustering methods are usually low. In this research, using spectral clustering and diminishing dimensions, reducing the amount of information, reduces clustering time and reduces computational complexity and memory. In this regard, the spectroscopic clustering method, using a balanced index, determines the number of optimal clusters, and then performs clustering on the normal values of the normalized Laplace matrix. First, the clusters are divided into two parts and computed for each cluster of the harmonic distribution index. Each cluster whose index value for it is greater than 1 will be redistributed to two other clusters, and this will continue until the cluster has an index of less than 1. Finally, the similarity between the users within the cluster and between the clusters is calculated and the most similar people are introduced together. The best results for the Opinions, Google+ and Twitter data sets are 95.95, 86.44 and 95.45, respectively. The computational results of the proposed method and comparison with previous valid methods showed the superiority of the proposed approach. https://wjcm.uowasit.edu.iq/index.php/wjcm/article/view/22Efficient Method Identify StructuralBalanced Social Network Charts,Data Mining Techniques |
| spellingShingle | Razieh Asgarnezhad Safaa Saad Abdull Majeed Zainab Aqeel Abbas Sarah Sinan Salman Providing an Efficient Method to Identify Structural Balanced Social Network Charts using Data Mining Techniques Wasit Journal of Computer and Mathematics Science Efficient Method Identify Structural Balanced Social Network Charts, Data Mining Techniques |
| title | Providing an Efficient Method to Identify Structural Balanced Social Network Charts using Data Mining Techniques |
| title_full | Providing an Efficient Method to Identify Structural Balanced Social Network Charts using Data Mining Techniques |
| title_fullStr | Providing an Efficient Method to Identify Structural Balanced Social Network Charts using Data Mining Techniques |
| title_full_unstemmed | Providing an Efficient Method to Identify Structural Balanced Social Network Charts using Data Mining Techniques |
| title_short | Providing an Efficient Method to Identify Structural Balanced Social Network Charts using Data Mining Techniques |
| title_sort | providing an efficient method to identify structural balanced social network charts using data mining techniques |
| topic | Efficient Method Identify Structural Balanced Social Network Charts, Data Mining Techniques |
| url | https://wjcm.uowasit.edu.iq/index.php/wjcm/article/view/22 |
| work_keys_str_mv | AT raziehasgarnezhad providinganefficientmethodtoidentifystructuralbalancedsocialnetworkchartsusingdataminingtechniques AT safaasaadabdullmajeed providinganefficientmethodtoidentifystructuralbalancedsocialnetworkchartsusingdataminingtechniques AT zainabaqeelabbas providinganefficientmethodtoidentifystructuralbalancedsocialnetworkchartsusingdataminingtechniques AT sarahsinansalman providinganefficientmethodtoidentifystructuralbalancedsocialnetworkchartsusingdataminingtechniques |