Melola Discovery

← Melola Discovery

Akses terbuka Jurnal SINTA 1

Intelligent cluster connectionist recommender system using implicit graph friendship algorithm for social networks

IAES International Journal of Artificial Intelligence · Vol. 9 No. 3 (2020) · hlm. 497–506

DOI
10.11591/ijai.v9.i3.pp497-506
ISSN
2252-8938, 2089-4872
Terbit
2020-09-01
Penerbit
Institute of Advanced Engineering and Science
Bahasa
eng
Lisensi
creativecommons.org/licenses/by-sa/4.0

Abstrak

Implicit clusters are formed as a result of the many interactions between users and their contacts. Online social platforms today provide special link-types that allows effective communication. Thus, many users can hardly categorize their contacts into groups such as “family”, “friends” etc. However, such contact clusters are easily represented via implicit graphs. This has arisen the need to analyze users’ implicit social graph and enable the automatic add/delete of contacts from/to a group via a suggestion algorithm – making the group creation process dynamic (instead of static, where users are manually added or removed). The study implements the friend suggest algorithm, which analyzes a user’s implicit social graph to create custom contact group using an interaction-based metric to estimate a user’s affinity to his contacts and groups. The algorithm starts with a small seed set of contacts – already categorized by a user as friends/groups; And, then suggest other contacts to be added to a group. The result inherent demonstrates the importance of both the implicit group relationships and the interaction-based affinity in suggesting friends.

Kata kunci

Jaringan kolaborasi para penulis

26 penulis · 122 tautan kepenulisan bersama · 78 lintas organisasi

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

  • Federal University of Petroleum Resource Effurun
  • Dennis Osadebay University
  • Delta State University
  • Southern Delta University, Ozoro
  • University of Calabar
  • Novena University
  • Universitas Dian Nuswantoro
  • Organisasi lain
  • Afiliasi tidak diketahui
  • 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
Rume Elizabeth YoroDennis Osadebay University3
Maureen Ifeanyi AkazueDelta State University2
Margaret Dumebi OkporSouthern Delta University, Ozoro2
Wilfred AdigweSouthern Delta University, Ozoro2
Rita Erhovwo AkoFederal University of Petroleum Resource Effurun2
Victor Ochuko GetelomaFederal University of Petroleum Resource Effurun2
Fidelis Obukohwo AghwareAfiliasi tidak diketahui1
Bridget Ogheneovo MalasoweAfiliasi tidak diketahui1
Obinna NwankwoNovena University1
Fidelis ObukohwoAghwareAfiliasi tidak diketahui1
Ayei Egu IborUniversity of Calabar1
Andrew Okonji EbokaAfiliasi tidak diketahui1
David Ademola OyemadeFederal University of Petroleum Resource Effurun1
Patrick Ogholuwarami EjehDennis Osadebay University1
Abel Efetobore EdjeDelta State University1
Christopher Chukwufunaya OdiakaoseDennis Osadebay University1
Edim Bassey EdimUniversity of Calabar1
De Rosal Ignatius Moses SetiadiUniversitas Dian Nuswantoro1
Kizito Eluemunor AnaziaAfiliasi tidak diketahui1
Ejaita Abugor OkpakoAfiliasi tidak diketahui1
Felix OmoruwouFederal University of Petroleum Resource Effurun1
Eferhire Valentine UgbotuUniversity of Salford1
Tabitha Chukwudi AghaunorRobert Morris University1
Amanda Enadona OweimeitoEdwin Clark University1

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.

Sumber metadata: OAI-PMH (metadata jurnal) http://ijai.iaescore.com/index.php/IJAI/oai, pertama di-harvest 8 Nov 2026, terakhir terlihat 16 Nov 2026.
Metadata asli (oai_dc)
<oai_dc:dc xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/  http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">Intelligent cluster connectionist recommender system using implicit graph friendship algorithm for social networks</dc:title>
	<dc:creator>Ojugo, Arnold Adimabua</dc:creator>
	<dc:creator>Otakore, Debby Oghenevwede</dc:creator>
	<dc:subject xml:lang="en-US">Machine Learning, Intelligent System, Graph Theory</dc:subject>
	<dc:subject xml:lang="en-US">Cluster, Ego-centric networks, Implicit contact, Recommender, Social graphs, Tie-strenght</dc:subject>
	<dc:description xml:lang="en-US">Implicit clusters are formed as a result of the many interactions between users and their contacts. Online social platforms today provide special link-types that allows effective communication. Thus, many users can hardly categorize their contacts into groups such as “family”, “friends” etc. However, such contact clusters are easily represented via implicit graphs. This has arisen the need to analyze users’ implicit social graph and enable the automatic add/delete of contacts from/to a group via a suggestion algorithm – making the group creation process dynamic (instead of static, where users are manually added or removed). The study implements the friend suggest algorithm, which analyzes a user’s implicit social graph to create custom contact group using an interaction-based metric to estimate a user’s affinity to his contacts and groups. The algorithm starts with a small seed set of contacts – already categorized by a user as friends/groups; And, then suggest other contacts to be added to a group. The result inherent demonstrates the importance of both the implicit group relationships and the interaction-based affinity in suggesting friends.</dc:description>
	<dc:publisher xml:lang="en-US">Institute of Advanced Engineering and Science</dc:publisher>
	<dc:contributor xml:lang="en-US">Social graphs</dc:contributor>
	<dc:contributor xml:lang="en-US">Implicit contact</dc:contributor>
	<dc:contributor xml:lang="en-US">Ego-centric networks</dc:contributor>
	<dc:contributor xml:lang="en-US">Tie-strenght</dc:contributor>
	<dc:contributor xml:lang="en-US">Cluster</dc:contributor>
	<dc:contributor xml:lang="en-US">Recommender</dc:contributor>
	<dc:date>2020-09-01</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US"></dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ijai.iaescore.com/index.php/IJAI/article/view/20404</dc:identifier>
	<dc:identifier>10.11591/ijai.v9.i3.pp497-506</dc:identifier>
	<dc:source xml:lang="en-US">IAES International Journal of Artificial Intelligence (IJ-AI); Vol 9, No 3: September 2020; 497-506</dc:source>
	<dc:source>2252-8938</dc:source>
	<dc:source>2089-4872</dc:source>
	<dc:source>10.11591/ijai.v9.i3</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ijai.iaescore.com/index.php/IJAI/article/view/20404/12985</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2020 Institute of Advanced Engineering and Science</dc:rights>
	<dc:rights xml:lang="en-US">http://creativecommons.org/licenses/by-sa/4.0</dc:rights>
</oai_dc:dc>