Tarek Hamrouni

Orcid: 0000-0001-7453-6447

According to our database1, Tarek Hamrouni authored at least 58 papers between 2005 and 2023.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Review on data replication strategies in single vs. interconnected cloud systems: Focus on data correlation-aware strategies.
Concurr. Comput. Pract. Exp., 2023

2022
Optimal autonomic management of service-based business processes in the cloud.
Soft Comput., 2022

Data correlation and fuzzy inference system-based data replication in federated cloud systems.
Simul. Model. Pract. Theory, 2022

A new temporal locality-based workload prediction approach for SaaS services in a cloud environment.
J. King Saud Univ. Comput. Inf. Sci., 2022

2021
Popularity and correlation aware data replication strategy based on half-life concept and clustering in cloud system.
Concurr. Comput. Pract. Exp., 2021

Service-oriented replication strategies for improving quality-of-service in cloud computing: a survey.
Clust. Comput., 2021

Combining task scheduling and data replication for SLA compliance and enhancement of provider profit in clouds.
Appl. Intell., 2021

2020
Cloud provider profit-aware and triadic concept analysis-based data replication strategy for tenant performance improvement.
Int. J. High Perform. Comput. Netw., 2020

SCoRMiner: Automated Discovery of Network Service and Application Dependencies using a graph mining approach.
Proceedings of the Knowledge-Based and Intelligent Information & Engineering Systems: Proceedings of the 24th International Conference KES-2020, 2020

SLA-aware task scheduling and data replication for enhancing provider profit in clouds.
Proceedings of the Knowledge-Based and Intelligent Information & Engineering Systems: Proceedings of the 24th International Conference KES-2020, 2020

2019
Replication in Data Grids: Metrics and Strategies.
CoRR, 2019

2018
Evaluation of site availability exploitation towards performance optimization in data grids.
Clust. Comput., 2018

2017
DDSoR: A Dependency Aware Dynamic Service Replication Strategy for Efficient Execution of Service-Oriented Applications in the Cloud.
Proceedings of the 2017 International Conference on High Performance Computing & Simulation, 2017

DISQUEV: Looking for Distribution Quality Evolution as a New Metric for Evaluating Replication Strategies.
Proceedings of the 14th IEEE/ACS International Conference on Computer Systems and Applications, 2017

2016
Data popularity measurements in distributed systems: Survey and design directions.
J. Netw. Comput. Appl., 2016

Objective assessment of the performance of data grid replication strategies based on distribution quality.
Int. J. Web Eng. Technol., 2016

A survey of dynamic replication and replica selection strategies based on data mining techniques in data grids.
Eng. Appl. Artif. Intell., 2016

Adaptive measurement method for data popularity in distributed systems.
Clust. Comput., 2016

Barycenter-Based Placement Strategy Towards Improving Replicas Distribution Quality.
Proceedings of the On the Move to Meaningful Internet Systems: OTM 2016 Conferences, 2016

2015
Placement strategies in data grids.
Multiagent Grid Syst., 2015

A data mining correlated patterns-based periodic decentralized replication strategy for data grids.
J. Syst. Softw., 2015

Impact of the distribution quality of file replicas on replication strategies.
J. Netw. Comput. Appl., 2015

Efficient mining of new concise representations of rare correlated patterns\m{1}.
Intell. Data Anal., 2015

A Critical Survey of Data Grid Replication Strategies Based on Data Mining Techniques.
Proceedings of the International Conference on Computational Science, 2015

2014
Towards Faster Mining of Disjunction-Based Concise Representations of Frequent Patterns.
Int. J. Artif. Intell. Tools, 2014

New Replication Strategy Based on Maximal Frequent Correlated Pattern Mining for Data Grids.
Proceedings of the 15th International Conference on Parallel and Distributed Computing, 2014

New Evaluation Criterion of File Replicas Placement for Replication Strategies in Data Grids.
Proceedings of the 2014 Ninth International Conference on P2P, 2014

2013
Looking for a structural characterization of the sparseness measure of (frequent closed) itemset contexts.
Inf. Sci., 2013

Efficient construction of the lattice of frequent closed patterns and simultaneous extraction of generic bases of rules.
CoRR, 2013

2012
Motifs corrélés rares : caractérisation et nouvelles représentations concises exactes.
Proceedings of the Mesurer et évaluer la Qualité des Données et des Connaissances, 2012

À la recherche des motifs corrélés. Proposition d'une nouvelle représentation concise exacte associée à la mesure bond.
Tech. Sci. Informatiques, 2012

Towards an effective automatic query expansion process using an association rule mining approach.
J. Intell. Inf. Syst., 2012

Key roles of closed sets and minimal generators in concise representations of frequent patterns.
Intell. Data Anal., 2012

New Exact Concise Representation of Rare Correlated Patterns: Application to Intrusion Detection.
Proceedings of the Advances in Knowledge Discovery and Data Mining, 2012

Algorithmes d'extraction et d'interrogation d'une représentation concise exacte des motifs corrélés rares : Application à la détection d'intrusions.
Proceedings of the Extraction et gestion des connaissances (EGC'2012), Actes, janvier 31, 2012

2011
Nouvelle représentation concise exacte des motifs corrélés rares : Application à la détection d'intrusions.
CoRR, 2011

2010
Generalization of association rules through disjunction.
Ann. Math. Artif. Intell., 2010

Optimized Mining of a Concise Representation for Frequent Patterns based on Disjunctions Rather than Conjunctions.
Proceedings of the Twenty-Third International Florida Artificial Intelligence Research Society Conference, 2010

A New Concise and Exact Representation of Data Cubes.
Proceedings of the Advances in Knowledge Discovery and Management, 2010

CND-Cube : Nouvelle représentation concise sans perte d'information d'un cube de données.
Proceedings of the Extraction et gestion des connaissances (EGC'2010), 2010

Bridging Conjunctive and Disjunctive Search Spaces for Mining a New Concise and Exact Representation of Correlated Patterns.
Proceedings of the Discovery Science - 13th International Conference, 2010

2009
Mining Concise Representations of Frequent Patterns through Conjunctive and Disjunctive Search Spaces. (Fouille de représentations concises des motifs fréquents à travers les espaces de recherche conjonctif et disjonctif).
PhD thesis, 2009

Mining concise representations of frequent patterns through conjunctive and disjunctive search spaces.
SIGKDD Explor., 2009

Sweeping the disjunctive search space towards mining new exact concise representations of frequent itemsets.
Data Knowl. Eng., 2009

Closed Non Derivable Data Cubes Based on Non Derivable Minimal Generators.
Proceedings of the Advanced Data Mining and Applications, 5th International Conference, 2009

2008
Succinct Minimal Generators: Theoretical Foundations and Applications.
Int. J. Found. Comput. Sci., 2008

2007
A scalable association rule visualization towards displaying large amounts of knowledge.
Proceedings of the 11th International Conference on Information Visualisation, 2007

About the Lossless Reduction of the Minimal Generator Family of a Context.
Proceedings of the Formal Concept Analysis, 5th International Conference, 2007

Les itemsets essentiels fermés : une nouvelle représentation concise.
Proceedings of the Extraction et gestion des connaissances (EGC'2007), 2007

Vers une plate-forme interactive pour la visualisation de grands ensembles de règles d'association.
Proceedings of the Extraction et gestion des connaissances (EGC'2007), 2007

Towards a Finer Assessment of Extraction Contexts Sparseness.
Proceedings of the 18th International Workshop on Database and Expert Systems Applications (DEXA 2007), 2007

A New Concise Representation of Frequent Patterns through Disjunctive Search Space.
Proceedings of the Fifth International Conference on Concept Lattices and Their Applications, 2007

2006
Frequent closed itemset based algorithms: a thorough structural and analytical survey.
SIGKDD Explor., 2006

Generic Association Rule Bases: Are They so Succinct?.
Proceedings of the Concept Lattices and Their Applications, 2006

Succinct System of Minimal Generators: A Thorough Study, Limitations and New Definitions.
Proceedings of the Concept Lattices and Their Applications, 2006

2005
PRINCE: Extraction optimisée des bases génériques de règles sans calcul de fermetures.
Proceedings of the Actes du XXIIIème Congrès INFORSID, Grenoble, France, 24-27 mai, 2005, 2005

Prince: An Algorithm for Generating Rule Bases Without Closure Computations.
Proceedings of the Data Warehousing and Knowledge Discovery, 2005

Avoiding the itemset closure computation "pitfall".
Proceedings of the CLA 2005 International Workshop on Concept Lattices and their Applications Olomouc, 2005


  Loading...