Theo dõi
Tarek Hamrouni
Tarek Hamrouni
Professeur d'Enseignement Supérieur, Faculté des Sciences de Tunis, Tunisie
Email được xác minh tại fst.rnu.tn
Tiêu đề
Trích dẫn bởi
Trích dẫn bởi
Năm
Frequent closed itemset based algorithms: A thorough structural and analytical survey
SB Yahia, T Hamrouni, EM Nguifo
ACM sIGKDD Explorations Newsletter 8 (1), 93-104, 2006
1242006
A novel data augmentation-based brain tumor detection using convolutional neural network
H Alsaif, R Guesmi, BM Alshammari, T Hamrouni, T Guesmi, A Alzamil, ...
Applied sciences 12 (8), 3773, 2022
782022
Service-oriented replication strategies for improving quality-of-service in cloud computing: a survey
S Slimani, T Hamrouni, F Ben Charrada
Cluster Computing 24, 361-392, 2021
712021
Towards an effective automatic query expansion process using an association rule mining approach
C Latiri, H Haddad, T Hamrouni
Journal of Intelligent Information Systems 39, 209-247, 2012
512012
A survey of dynamic replication and replica selection strategies based on data mining techniques in data grids
T Hamrouni, S Slimani, FB Charrada
Engineering Applications of Artificial Intelligence 48, 140-158, 2016
482016
Prince: An algorithm for generating rule bases without closure computations
T Hamrouni, SB Yahia, Y Slimani
Data Warehousing and Knowledge Discovery: 7th International Conference …, 2005
422005
Sweeping the disjunctive search space towards mining new exact concise representations of frequent itemsets
T Hamrouni, SB Yahia, EM Nguifo
Data & Knowledge Engineering 68 (10), 1091-1111, 2009
412009
A scalable association rule visualization towards displaying large amounts of knowledge
O Couturier, T Hamrouni, SB Yahia, EM Nguifo
2007 11th International Conference Information Visualization (IV'07), 657-663, 2007
372007
A data mining correlated patterns-based periodic decentralized replication strategy for data grids
T Hamrouni, S Slimani, FB Charrada
Journal of Systems and Software 110, 10-27, 2015
352015
Generalization of association rules through disjunction
T Hamrouni, S Ben Yahia, E Mephu Nguifo
Annals of Mathematics and Artificial Intelligence 59, 201-222, 2010
352010
Looking for a structural characterization of the sparseness measure of (frequent closed) itemset contexts
T Hamrouni, SB Yahia, EM Nguifo
Information Sciences 222, 343-361, 2013
342013
Bridging conjunctive and disjunctive search spaces for mining a new concise and exact representation of correlated patterns
NB Younes, T Hamrouni, SB Yahia
Discovery Science: 13th International Conference, DS 2010, Canberra …, 2010
332010
Succinct minimal generators: Theoretical foundations and applications
T Hamrouni, S Ben Yahia, E Mephu Nguifo
International journal of foundations of computer science 19 (02), 271-296, 2008
322008
Data popularity measurements in distributed systems: Survey and design directions
C Hamdeni, T Hamrouni, FB Charrada
Journal of Network and Computer Applications 72, 150-161, 2016
262016
Succinct system of minimal generators: A thorough study, limitations and new definitions
T Hamrouni, S Ben Yahia, E Mephu Nguifo
International Conference on Concept Lattices and Their Applications, 80-95, 2006
262006
Key roles of closed sets and minimal generators in concise representations of frequent patterns
T Hamrouni
Intelligent Data Analysis 16 (4), 581-631, 2012
252012
A critical survey of data grid replication strategies based on data mining techniques
T Hamrouni, S Slimani, FB Charrada
Procedia Computer Science 51, 2779-2788, 2015
182015
Data correlation and fuzzy inference system-based data replication in federated cloud systems
A Khelifa, R Mokadem, T Hamrouni, FB Charrada
Simulation modelling practice and theory 115, 102428, 2022
172022
Combining task scheduling and data replication for SLA compliance and enhancement of provider profit in clouds
A Khelifa, T Hamrouni, R Mokadem, FB Charrada
Applied Intelligence 51, 7494-7516, 2021
172021
Avoiding the itemset closure computation" pitfall".
T Hamrouni, SB Yahia, Y Slimani
CLA 2005, 46-59, 2005
172005
Hệ thống không thể thực hiện thao tác ngay bây giờ. Hãy thử lại sau.
Bài viết 1–20