An Efficient Genetic Algorithm for Discovering Diverse-Frequent Patterns
원문 초록
Working with exhaustive search on large dataset is infeasible for several reasons. Recently, developed techniques that made pattern set mining feasible by a general solver with long execution time that supports heuristic search and are limited to small datasets only. In this paper, we investigate an approach which aims to find diverse set of patterns using genetic algorithm to mine diverse frequent patterns. We propose a fast heuristic search algorithm that outperforms state-of-the-art methods on a standard set of benchmarks and capable to produce satisfactory results within a short period of time. Our proposed algorithm uses a relative encoding scheme for the patterns and an effective twin removal technique to ensure diversity throughout the search.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Step-wise Policy for Rare-tool Knowledge (SPaRK): Offline RL that Drives Diverse Tool Use in LLMs
Exploring Design of Multi-Agent LLM Dialogues for Research Ideation
MS-DPPs: Multi-Source Determinantal Point Processes for Contextual Diversity Refinement of Composite Attributes in Text to Image Retrieval
Prompt-Free Conditional Diffusion for Multi-object Image Augmentation
Is Diversity All You Need for Scalable Robotic Manipulation?
Lost in Latent Space: An Empirical Study of Latent Diffusion Models for Physics Emulation
토론
이 논문과 연결된 포럼 글이 아직 없습니다.