Melola Discovery

← Melola Discovery

Akses terbuka Jurnal SINTA 1

Developing a trust model using graph and ranking trust of social messaging system

International Journal of Electrical and Computer Engineering (IJECE) · Vol. 13 No. 1 (2023)

DOI
10.11591/ijece.v13i1.pp997-1007
ISSN
2722-2578, 2088-8708
Terbit
2023-02-01
Penerbit
Institute of Advanced Engineering and Science
Lisensi
creativecommons.org/licenses/by-sa/4.0

Abstrak

Trust is an important issue in social interactions, especially in using cyberspace services. In this paper, a trust and evaluation model are proposed based on which the government can provide reliable services to users. The model is a distributed and hierarchical model. First, the number 12 trust criteria and the weight of these criteria were extracted using the analytical hierarchy process (AHP) and analytic network process (ANP) techniques. Second, to obtain the trust in the service examined, for each criterion, a graph of trusted entities is proposed. Then, a weighted graph with the number of trusted entities called trust pathways measure will be obtained. To test the model, the effect of the 12 criteria on three important evaluation factors over seven widely used social services was rated by three experts. The trust of each service was obtained, which was satisfactory as compared to a valid organizational evaluation. Finally, the correlation coefficient of this comparison was 70.37%, indicating that the results from this model were appropriate.

Jaringan kolaborasi para penulis

3 penulis · 3 tautan kepenulisan bersama

Arahkan kursor atau ketuk sebuah nama untuk menyorot rekan penulisnya. Klik dua kali untuk membuka halaman penulis.

  • University of Qom
  • Organisasi berbeda
  • Organisasi sama
  • Afiliasi tidak diketahui
  • Garis lebih tebal = lebih banyak artikel bersama · lingkaran lebih besar = lebih banyak artikel
Tampilkan sebagai tabel
Rekan penulisOrganisasiArtikel bersama

Afiliasi berasal dari OpenAlex; metadata OAI-PMH jurnal tidak memuatnya. Penulis tanpa ID OpenAlex dicocokkan berdasarkan nama, sehingga dua orang bisa tergabung atau satu orang bisa terpisah.

Data ini berasal dari Crossref (yang disetorkan penerbit), karena endpoint OAI-PMH milik jurnal tidak dapat di-harvest.

Sumber metadata: Crossref API (cadangan, berdasarkan ISSN) https://api.crossref.org/journals/2088-8708/works, pertama di-harvest 27 Okt 2026, terakhir terlihat 15 Nov 2026.
Metadata sebagai oai_dc, dikonversi dari Crossref
<oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"><dc:title>Developing a trust model using graph and ranking trust of social messaging system</dc:title><dc:creator>Heidarzadeh Kalahroudy, Mostafa</dc:creator><dc:creator>Fard, Kheirollah Rahsepar</dc:creator><dc:creator>Farjami, Yaghoob</dc:creator><dc:description>&lt;jats:p&gt;&amp;lt;p&amp;gt;Trust is an important issue in social interactions, especially in using cyberspace services. In this paper, a trust and evaluation model are proposed based on which the government can provide reliable services to users. The model is a distributed and hierarchical model. First, the number 12 trust criteria and the weight of these criteria were extracted using the analytical hierarchy process (AHP) and analytic network process (ANP) techniques. Second, to obtain the trust in the service examined, for each criterion, a graph of trusted entities is proposed. Then, a weighted graph with the number of trusted entities called trust pathways measure will be obtained. To test the model, the effect of the 12 criteria on three important evaluation factors over seven widely used social services was rated by three experts. The trust of each service was obtained, which was satisfactory as compared to a valid organizational evaluation. Finally, the correlation coefficient of this comparison was 70.37%, indicating that the results from this model were appropriate.&amp;lt;/p&amp;gt;&lt;/jats:p&gt;</dc:description><dc:publisher>Institute of Advanced Engineering and Science</dc:publisher><dc:date>2023-02-01</dc:date><dc:type>info:eu-repo/semantics/article</dc:type><dc:format>application/pdf</dc:format><dc:identifier>https://doi.org/10.11591/ijece.v13i1.pp997-1007</dc:identifier><dc:identifier>10.11591/ijece.v13i1.pp997-1007</dc:identifier><dc:source>International Journal of Electrical and Computer Engineering (IJECE); Vol 13 No 1 (2023); 997</dc:source><dc:source>2722-2578</dc:source><dc:source>2088-8708</dc:source><dc:relation>https://ijece.iaescore.com/index.php/IJECE/article/viewFile/29519/16310</dc:relation><dc:rights>http://creativecommons.org/licenses/by-sa/4.0</dc:rights></oai_dc:dc>