Output space pattern sampling is a powerful alternative to exhaustive pattern mining for exploring large pattern spaces, as it enables users to focus on representative patterns drawn according to a chosen interestingness measure. In this paper, we address the problem of sampling interval patterns under user-defined syntactic constraints. We introduce CFips, a sampling approach that incorporates constraints directly into the sampling procedure. The approach relies on a multi-step sampling framework and supports several syntactic constraints by decomposing them into elementary predicates on interval bounds while preserving exact sampling guarantees. We formally prove that CFips samples interval patterns proportionally to their frequency within the constrained pattern space. The experimental results show that integrating constraints into the sampling procedure enables to complete mining tasks that would otherwise fail within a given time out.
An application of Pixel Interval Down-sampling (PID) for dense tiny microorganism counting on environmental microorganism images
Northeastern University(东北大学);Chengdu University of Information Technology(成都信息工程大学);Stevens Institute of Technology(史蒂文斯理工学院);National Chung Hsing University(中兴大学);Huazhong University of Science and Technology(华中科技大学);University of Luebeck(吕贝克大学)
Constrained Sampling and Counting: Universal Hashing Meets SAT Solving
Rice University(莱斯大学);Indian Institute of Technology, Bombay(印度理工学院孟买分校);University of California, Berkeley(加州大学伯克利分校);IBM Research(IBM研究院);Princeton University(普林斯顿大学)
Cactus: Accelerating Auto-Regressive Decoding with Constrained Acceptance Speculative Sampling
Dept. Computing Science & Alberta Machine Intelligence Institute (Amii), University of Alberta(阿尔伯塔大学计算机科学系与阿尔伯塔机器智能研究所);Canada CIFAR AI Chair(加拿大CIFAR人工智能讲席)