Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
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 …
gained popularity due to their ability to solve problems across various domains with high …
Sampling informative patterns from large single networks
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 …
technique recently proposed for obtaining a compact, informative and useful set of patterns …
Mining rooted ordered trees under subtree homeomorphism
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 …
bioinformatics and World Wide Web. The crucial step in frequent pattern mining is frequency …
Frequent pattern mining in attributed trees: algorithms and applications
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 …
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 …
has two settings: the transactional setting and the per-occurrence setting. In the transactional …
Nearly exact mining of frequent trees in large networks
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 …
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 …
very large datasets, several approximate algorithms have been introduced, where an …
WaPUPS: Web access pattern extraction under user-defined pattern scoring
Extracting patterns from web usage data helps to facilitate better web personalization and
web structure readjustment. The classical frequency-based sequence mining techniques …
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 …
mining. In this paper, we introduce a novel canonical form for rooted labelled unordered …
Frequent pattern mining in attributed trees
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 …
Initially focused on the discovery of frequent itemsets, studies were extended to mine …