Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Abd Errahmane Kiouche

dblp:234/6027 · DBLP profile ↗
← Back
7ranked-venue papers
5as first author
5since 2021 · last 2025
0000-0003-2247-4859ORCID · verified

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 6 · 4 first-author · 4 since 2021Databases, data management, data science and information retrieval · 1 · 1 first-author · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Databases, data mining, and information retrieval
1 paper
Graph data management · 100%
Artificial intelligence
1 paper
Graph learning · 100%
Theoretical computer science
1 paper
Graph algorithms and graph theory · 100%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Graph data management › graph transformation
graph sparsification
0.812024
Neighborhood-Preserving Graph Sparsification · Proc. VLDB Endow. 2024
Machine learning › Graph learning › graph neural network
node classification
0.212024
Neighborhood-Preserving Graph Sparsification · Proc. VLDB Endow. 2024
Graph algorithms and graph theory
shortest path
0.212024
Neighborhood-Preserving Graph Sparsification · Proc. VLDB Endow. 2024

Methods — techniques the papers use, named apart from their topics

graph sparsification · 2.3
YearPublicationVenuePosition
2025 A fast hybrid entropy-attribute diversity sampling based graph kernel
Abd Errahmane Kiouche, Hamida Seba, Aymen Ourdjini
Pattern Recognit. Lett.1
2024 Detection of advanced persistent threats using hashing and graph-based learning on streaming data
Walid Megherbi, Abd Errahmane Kiouche, Mohammed Haddad 0001, Hamida Seba
Appl. Intell.2
2024 Neighborhood-Preserving Graph Sparsification
abstract
We introduce a new graph sparsification method that targets the neighborhood information available for each node. Our approach is motivated by the fact that neighborhood information is used by several mining and learning tasks on graphs as well as reachability queries. The result of our sparsification technique is a sparsified graph that can be used instead of the original graph in the above tasks while still ensuring fairly good approximations for the results. Moreover, our sparsification method allows users to control the size of the resulting sparsified graph by adjusting the amount of information loss tolerated by the targeted applications. Our extensive experiments conducted on various real and synthetic graphs show that our sparsification considerably reduces the size of the graphs by achieving 40% sparsification rate on average on several input graphs. Furthermore, in the experimental study we show the utility and efficiency of our sparsification algorithm for notable data-driven tasks, such as node classification, graph classification and shortest path approximations.
Abd Errahmane Kiouche, Julien Baste, Mohammed Haddad 0001, Hamida Seba, Angela Bonifati
Proc. VLDB Endow.1
2021 A simple graph embedding for anomaly detection in a stream of heterogeneous labeled graphs
Abd Errahmane Kiouche, Sofiane Lagraa, Karima Amrouche, Hamida Seba
Pattern Recognit.1
2021 A maximum diversity-based path sparsification for geometric graph matching
Abd Errahmane Kiouche, Hamida Seba, Karima Amrouche
Pattern Recognit. Lett.1
2020 An efficient hybrid multi-objective memetic algorithm for the frequency assignment problem
Abd Errahmane Kiouche, Malika Bessedik, Fatima Benbouzid-Si Tayeb, Mohamed Reda Keddar
Eng. Appl. Artif. Intell.1
2019 A Novel Multi-Objective Immune Memetic Algorithm for the Frequency Assignment Problem
abstract
This paper presents a multi-objective immune memetic algorithm to the challenge of solving the Frequency Assignment Problem (FAP) in cellular networks seeking the minimization of the network’s total interference, the maximum interference and the number of used frequencies. The originality of the proposed approach lies in integrating a FAP-specific local search into its evolutionary process instead of crossover and mutation, as well as a guided diversification strategy for better performances. Moreover, the algorithm is supplemented with a clonal selection, inherited from Artificial Immune Systems (AIS), which aims to improve the algorithm exploration and exploitation abilities. Computational experiments performed over COST259 instances show the efficiency of the newly proposed evolutionary multi-objective algorithm and corroborated by the comparisons we did with the most frequently referred algorithm in the related literature. Furthermore, the effect of the main parameters and the interaction between them is analyzed using statistical tools.
Malika Bessedik, Fatima Benbouzid-Si Tayeb, Abd Errahmane Kiouche, Mohamed Reda Keddar
KES3