Publisher of Iranian Journals and Conference Proceedings

Please waite ..
Publisher of Iranian Journals and Conference Proceedings
Login |Register |Help |عضویت کتابخانه ها
Paper
Title

Proposing a Useful Algorithm in order to Find Almost-Balanced Sub graphs of Social Network using Spectral Balance Index

Year: 1397
COI: TECCONF04_059
Language: EnglishView: 278
This Paper With 10 Page And PDF Format Ready To Download

Buy and Download

با استفاده از پرداخت اینترنتی بسیار سریع و ساده می توانید اصل این Paper را که دارای 10 صفحه است به صورت فایل PDF در اختیار داشته باشید.
آدرس ایمیل خود را در کادر زیر وارد نمایید:

Authors

Bahareh Abedi - Department of Computer, Faculty of Engineering, Islamic Azad University, Zahedan Branch, Zahedan, Iran
Javad Hosseinkhani - Department of Computer, Faculty of Engineering, Islamic Azad University, Zahedan Branch, Zahedan,Iran

Abstract:

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 Epinions, 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.

Keywords:

Paper COI Code

This Paper COI Code is TECCONF04_059. Also You can use the following address to link to this article. This link is permanent and is used as an article registration confirmation in the Civilica reference:

https://civilica.com/doc/928905/

How to Cite to This Paper:

If you want to refer to this Paper in your research work, you can simply use the following phrase in the resources section:
Abedi, Bahareh and Hosseinkhani, Javad,1397,Proposing a Useful Algorithm in order to Find Almost-Balanced Sub graphs of Social Network using Spectral Balance Index,Forth National Conference on Electrical and Computer Engineering,Tehran,https://civilica.com/doc/928905

Research Info Management

Certificate | Report | من نویسنده این مقاله هستم

اطلاعات استنادی این Paper را به نرم افزارهای مدیریت اطلاعات علمی و استنادی ارسال نمایید و در تحقیقات خود از آن استفاده نمایید.

Scientometrics

The specifications of the publisher center of this Paper are as follows:
Type of center: Azad University
Paper count: 5,223
In the scientometrics section of CIVILICA, you can see the scientific ranking of the Iranian academic and research centers based on the statistics of indexed articles.

New Papers

New Researchs

Share this page

More information about COI

COI stands for "CIVILICA Object Identifier". COI is the unique code assigned to articles of Iranian conferences and journals when indexing on the CIVILICA citation database.

The COI is the national code of documents indexed in CIVILICA and is a unique and permanent code. it can always be cited and tracked and assumed as registration confirmation ID.

Support