Jerry Lonlac

Orcid: 0000-0003-3278-9969

According to our database1, Jerry Lonlac authored at least 31 papers between 2012 and 2024.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
On the Discovery of Frequent Gradual Patterns: A Symbolic AI-Based Framework.
SN Comput. Sci., October, 2024

A methodological and theoretical framework for implementing explainable artificial intelligence (XAI) in business applications.
Comput. Ind., February, 2024

Modélisation des Données de Maintenance des Bâtiments : Vers une Approche Sémantique.
Proceedings of the Extraction et Gestion des Connaissances, 2024

Une Etude Comparative entre Motifs Graduels et Corrélations Statistiques.
Proceedings of the Extraction et Gestion des Connaissances, 2024

2023
GRAPGT: GRAdual patterns with gradualness threshold.
Int. J. Gen. Syst., July, 2023

Top-k Learned Clauses for Modern SAT Solvers.
Int. J. Artif. Intell. Tools, February, 2023

A Comprehensive Analysis on Associative Classification in Building Maintenance Datasets.
Proceedings of the Advances and Trends in Artificial Intelligence. Theory and Applications, 2023

Extraction d'itemsets graduels de haute utilité.
Proceedings of the Extraction et Gestion des Connaissances, 2023

Utility-Oriented Gradual Itemsets Mining Using High Utility Itemsets Mining.
Proceedings of the Big Data Analytics and Knowledge Discovery, 2023

Extracting Frequent Gradual Patterns Based on SAT.
Proceedings of the 12th International Conference on Data Science, 2023

2022
Une approche basée sur les motifs graduels pour la recommandation dans un contexte de consommation répétée.
Proceedings of the Extraction et Gestion des Connaissances, 2022

2021
A Constraint-based Approach for Enumerating Gradual Itemsets.
Proceedings of the 33rd IEEE International Conference on Tools with Artificial Intelligence, 2021

Extracting Frequent (Closed) Seasonal Gradual Patterns Using Closed Itemset Mining.
Proceedings of the 33rd IEEE International Conference on Tools with Artificial Intelligence, 2021

GPoID : Extraction de Motifs Graduels pour les Bases de Données Imprécises.
Proceedings of the Extraction et Gestion des Connaissances, 2021

2020
A novel algorithm for searching frequent gradual patterns from an ordered data set.
Intell. Data Anal., 2020

Extracting Seasonal Gradual Patterns from Temporal Sequence Data Using Periodic Patterns Mining.
CoRR, 2020

Discovering Frequent Gradual Itemsets with Imprecise Data.
CoRR, 2020

Mining Frequent Seasonal Gradual Patterns.
Proceedings of the Big Data Analytics and Knowledge Discovery, 2020

2019
Extracting Frequent Gradual Patterns Using Constraints Modeling.
CoRR, 2019

Mining Gradual Itemsets Using Sequential Pattern Mining.
Proceedings of the 2019 IEEE International Conference on Fuzzy Systems, 2019

2018
Revisiting the Learned Clauses Database Reduction Strategies.
Int. J. Artif. Intell. Tools, 2018

An Approach for Extracting Frequent (Closed) Gradual Patterns Under Temporal Constraint.
Proceedings of the 2018 IEEE International Conference on Fuzzy Systems, 2018

Fouille de Motifs Graduels Fermés Fréquents Sous Contrainte de la Temporalité.
Proceedings of the Extraction et Gestion des Connaissances, 2018

2017
Towards Learned Clauses Database Reduction Strategies Based on Dominance Relationship.
CoRR, 2017

Une Approche d'Extraction de Motifs Graduels (Fermés) Fréquents Sous Contrainte de la Temporalité.
Proceedings of the 17ème Journées Francophones Extraction et Gestion des Connaissances, 2017

2014
Résolution étendue par substitution dynamique des fonctions booléennes.
Rev. d'Intelligence Artif., 2014

Extending modern SAT solvers for models enumeration.
Proceedings of the 15th IEEE International Conference on Information Reuse and Integration, 2014

Diversification by Clauses Deletion Strategies in Portfolio Parallel SAT Solving.
Proceedings of the 26th IEEE International Conference on Tools with Artificial Intelligence, 2014

2013
Adding New Bi-Asserting Clauses for Faster Search in Modern SAT Solvers.
Proceedings of the Tenth Symposium on Abstraction, Reformulation, and Approximation, 2013

2012
Intensification Search in Modern SAT Solvers - (Poster Presentation).
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2012, 2012

Extending Resolution by Dynamic Substitution of Boolean Functions.
Proceedings of the IEEE 24th International Conference on Tools with Artificial Intelligence, 2012


  Loading...