Arşiv logosu
  • Türkçe
  • English
  • Giriş
    Yeni kullanıcı mısınız? Kayıt için tıklayın. Şifrenizi mi unuttunuz?
Arşiv logosu
  • Koleksiyonlar
  • DSpace İçeriği
  • Analiz
  • Türkçe
  • English
  • Giriş
    Yeni kullanıcı mısınız? Kayıt için tıklayın. Şifrenizi mi unuttunuz?
  1. Ana Sayfa
  2. Yazara Göre Listele

Yazar "Kadem, Hasibe Candan" seçeneğine göre listele

Listeleniyor 1 - 2 / 2
Sayfa Başına Sonuç
Sıralama seçenekleri
  • Küçük Resim Yok
    Öğe
    Integration of Algorithmic and Local Approaches for Link Prediction: An Analysis on Protein-Protein Interactions and Social Networks
    (Gazi Univ, 2025) Kadem, Hasibe Candan; Altuntas, Volkan
    Complex network analysis is applied in various fields such as network-based systems, social media recommendation systems, shopping platforms, and treatment methodologies. In this context, predicting the probability of connection between two nodes has become a focal point. Another significant aspect is the prediction of connections between proteins, especially with the increase in epidemic diseases. Link prediction methods, based on graph structures, aim to predict interactions between two nodes and measure the probability of connection between them. These methods proceed by relying on similarity values and can have multiple approaches, including local, global, and algorithmic. This study has emerged from a combination of algorithmic and local network approaches. Support Vector Machines are employed to predict connections in gene-protein networks and social network structures. Data sets from multiple social media platforms and human protein-protein interaction (PPI) data were utilized. Derived data were created by calculating local index values, including the number of neighbors, Adamic Adar index, Jaccard coefficient, and label values for each node. To enhance success rates, a model was developed that applied the discretization method as a preprocessing technique across all data sets. Machine learning algorithms such as Bayesian Networks, Multilayer Perceptron (MLP), Random Forest, and k-Nearest Neighborhood (kNN) were compared and evaluated. The results indicate that the Twitch dataset, which has the highest number of edges, produced successful outcomes. The contribution of edge numbers in the network structure to performance is highlighted, and it is observed that more successful metric values were obtained for the data with applied discretization.
  • Küçük Resim Yok
    Öğe
    Integration of Algorithmic and Local Approaches for Link Prediction: An Analysis on Protein-Protein Interactions and Social Networks
    (2025) Kadem, Hasibe Candan; Altuntas, Volkan
    Complex network analysis is applied in various fields such as network-based systems, social media recommendation systems, shopping platforms, and treatment methodologies. In this context, predicting the probability of connection between two nodes has become a focal point. Another significant aspect is the prediction of connections between proteins, especially with the increase in epidemic diseases. Link prediction methods, based on graph structures, aim to predict interactions between two nodes and measure the probability of connection between them. These methods proceed by relying on similarity values and can have multiple approaches, including local, global, and algorithmic. This study has emerged from a combination of algorithmic and local network approaches. Support Vector Machines are employed to predict connections in gene-protein networks and social network structures. Data sets from multiple social media platforms and human protein-protein interaction (PPI) data were utilized. Derived data were created by calculating local index values, including the number of neighbors, Adamic Adar index, Jaccard coefficient, and label values for each node. To enhance success rates, a model was developed that applied the discretization method as a preprocessing technique across all data sets. Machine learning algorithms such as Bayesian Networks, Multilayer Perceptron (MLP), Random Forest, and k-Nearest Neighborhood (kNN) were compared and evaluated. The results indicate that the Twitch dataset, which has the highest number of edges, produced successful outcomes. The contribution of edge numbers in the network structure to performance is highlighted, and it is observed that more successful metric values were obtained for the data with applied discretization.

| Bursa Teknik Üniversitesi | Kütüphane | Açık Erişim Politikası | Rehber | OAI-PMH |

Bu site Creative Commons Alıntı-Gayri Ticari-Türetilemez 4.0 Uluslararası Lisansı ile korunmaktadır.


Mimar Sinan Mahallesi Mimar, Sinan Bulvarı, Eflak Caddesi, No: 177, 16310, Yıldırım, Bursa, Türkiye
İçerikte herhangi bir hata görürseniz lütfen bize bildirin

DSpace 7.6.1, Powered by İdeal DSpace

DSpace yazılımı telif hakkı © 2002-2026 LYRASIS

  • Çerez ayarları
  • Gizlilik politikası
  • Son Kullanıcı Sözleşmesi
  • Geri bildirim Gönder