Repository logo
  • English
  • Català
  • Čeština
  • Deutsch
  • Español
  • Français
  • Gàidhlig
  • Italiano
  • Latviešu
  • Magyar
  • Nederlands
  • Polski
  • Português
  • Português do Brasil
  • Srpski (lat)
  • Suomi
  • Svenska
  • Türkçe
  • Tiếng Việt
  • Қазақ
  • বাংলা
  • हिंदी
  • Ελληνικά
  • Српски
  • Yкраї́нська
  • Log In
    Have you forgotten your password?
Repository logo
  • Communities & Collections
  • All of Digital Repository
  • English
  • Català
  • Čeština
  • Deutsch
  • Español
  • Français
  • Gàidhlig
  • Italiano
  • Latviešu
  • Magyar
  • Nederlands
  • Polski
  • Português
  • Português do Brasil
  • Srpski (lat)
  • Suomi
  • Svenska
  • Türkçe
  • Tiếng Việt
  • Қазақ
  • বাংলা
  • हिंदी
  • Ελληνικά
  • Српски
  • Yкраї́нська
  • Log In
    Have you forgotten your password?
  1. Home
  2. Browse by Author

Browsing by Author "Farid Nouioua"

Now showing 1 - 2 of 2
Results Per Page
Sort Options
  • Loading...
    Thumbnail Image
    ItemOpen Access
    Annales Universitatis Paedagogicae Cracoviensis Studia Mathematica XX (2021)
    (2021) Farid Nouioua; Bilal Basti
    This paper investigates the problem of the existence and uniqueness of solutions under the generalized self-similar forms to the space-fractional diffusion equation. Therefore, through applying the properties of Schauder’s and Banach’s fixed point theorems; we establish several results on the global existence and blow-up of generalized self-similar solutions to this equation
  • Loading...
    Thumbnail Image
    ItemMetadata only
    Fast approach for link prediction in complex networks based on graph decomposition
    (2023) Abdelhamid Saif; Farid Nouioua; Samir Akhrouf
    Social networks such as Facebook, Twitter, etc. have dramatically increased in recent years. These databases are huge and their use is time consuming. In this work, we present an optimal calculation in graph mining for link prediction to reduce the runtime. For that purpose, we propose a novel approach that operates on the connected components of a network instead of the whole network. We show that thanks to this decomposition, the results of all link prediction algorithms using local and path-based similarity measure scan be achieved with much less amount of computations and hence within much shorter runtime. We show that this gain depends on the distribution of nodes in components and may be captured by the Gini and the variance measures. We propose a parallel architecture of the link prediction process based on the connected components decomposition. To validate this architecture, we have carried out an experimental study on a wide range of well-known datasets. The obtained results clearly confrm the efciency of exploiting the decomposition of the network into connected components in link prediction

All Rights Reserved - University of M'Sila - UMB Electronic Portal © 2024

  • Cookie settings
  • Privacy policy
  • Terms of Use