A review on the impact of data representation on model explainability

M Haghir Chehreghani - ACM Computing Surveys, 2024 - dl.acm.org
In recent years, advanced machine learning and artificial intelligence techniques have
gained popularity due to their ability to solve problems across various domains with high …

Sampling informative patterns from large single networks

MH Chehreghani, T Abdessalem, A Bifet… - Future Generation …, 2020 - Elsevier
The set of all frequent patterns that are extracted from a single network can be huge. A
technique recently proposed for obtaining a compact, informative and useful set of patterns …

Mining rooted ordered trees under subtree homeomorphism

M Haghir Chehreghani, M Bruynooghe - Data Mining and Knowledge …, 2016 - Springer
Mining frequent tree patterns has many applications in different areas such as XML data,
bioinformatics and World Wide Web. The crucial step in frequent pattern mining is frequency …

Frequent pattern mining in attributed trees: algorithms and applications

C Pasquier, J Sanhes, F Flouvat… - … and Information Systems, 2016 - Springer
Frequent pattern mining is an important data mining task with a broad range of applications.
Initially focused on the discovery of frequent itemsets, studies were extended to mine …

Mining transactional tree databases under homeomorphism

M Haghir Chehreghani… - The Journal of …, 2025 - Springer
A key task in mining tree-structured data is finding frequent embedded tree patterns, which
has two settings: the transactional setting and the per-occurrence setting. In the transactional …

Nearly exact mining of frequent trees in large networks

AM Kibriya, J Ramon - Data mining and knowledge discovery, 2013 - Springer
Mining frequent patterns in a single network (graph) poses a number of challenges. Already
only to match one path pattern to a network under subgraph isomorphism is NP-complete …

Non-uniform Sampling Methods for Large Itemset Mining

ZM Arani, MH Chehreghani… - … Conference on Big …, 2023 - ieeexplore.ieee.org
A well-studied problem in data mining is large itemset mining. To address this problem over
very large datasets, several approximate algorithms have been introduced, where an …

WaPUPS: Web access pattern extraction under user-defined pattern scoring

OK Alkan, P Karagoz - Journal of Information Science, 2016 - journals.sagepub.com
Extracting patterns from web usage data helps to facilitate better web personalization and
web structure readjustment. The classical frequency-based sequence mining techniques …

BOSTER: an efficient algorithm for mining frequent unordered induced subtrees

IJ Chowdhury, R Nayak - … , Thessaloniki, Greece, October 12-14, 2014 …, 2014 - Springer
Extracting frequent subtrees from the tree structured data has important applications in Web
mining. In this paper, we introduce a novel canonical form for rooted labelled unordered …

Frequent pattern mining in attributed trees

C Pasquier, J Sanhes, F Flouvat… - Advances in Knowledge …, 2013 - Springer
Frequent pattern mining is an important data mining task with a broad range of applications.
Initially focused on the discovery of frequent itemsets, studies were extended to mine …