Detecting small sets of relevant patterns from a given dataset is a central challenge in data mining. The relevance of a pattern is based on user-provided criteria; typically, all patterns that satisfy certain criteria are considered relevant. Rule-based languages like Answer Set Programming (ASP) seem well-suited for specifying such criteria in a form of constraints. Although progress has been made, on the one hand, on solving individual mining problems and, on the other hand, developing generic mining systems, the existing methods either focus on scalability or on generality. In this paper we make steps towards combining local (frequency, size, cost) and global (various condensed representations like maximal, closed, skyline) constraints in a generic and efficient way. We present a hybrid approach for itemset, sequence and graph mining which exploits dedicated highly optimized mining systems to detect frequent patterns and then filters the results using declarative ASP. To further demonstrate the generic nature of our hybrid framework we apply it to a problem of approximately tiling a database. Experiments on real-world datasets show the effectiveness of the proposed method and computational gains for itemset, sequence and graph mining, as well as approximate tiling.
Under consideration in Theory and Practice of Logic Programming (TPLP).
Extended High Utility Pattern Mining: An Answer Set Programming Based Framework and Applications
Polytechnic University of Marche(马尔凯理工大学);University of Calabria(卡拉布里亚大学)
从给定数据集中检测相关模式集是数据采掘中的一个重要挑战。模式的相关性,在文献中也称为效用,是一种主观的衡量标准,实际上可以从非常不同的角度进行评估。基于规则的语言,如答案集编程(ASP)似乎非常适合指定用户提供的标准,以评估模式效用的约束形式;此外,ASP的声明性允许在几个标准之间进行非常容易的切换,以便从不同的角度分析数据集。在本文中,我们采取步骤扩展的概念高效用模式挖掘(HUPM),特别是我们引入了一个新的框架,允许新的类的效用标准没有考虑在以前的文献。我们还展示了如何最近扩展的ASP与外部功能可以支持一个快速有效的编码和测试的新框架。为了证明所提出的框架的潜力,我们将其作为构建模块,用于定义预测COVID-19患者入住ICU的创新方法。最后,一个广泛的实验活动从定量和定性的角度证明了所提出的方法的有效性。逻辑程序设计理论与实践(Theory and Practice of Logic Programming,TPLP)
HANDY: A Hybrid Association Rules Mining Approach for Network Layer Discovery of Services for Mobile Ad hoc Network
National University of Computer and Emerging Sciences(国立计算机与新兴科学大学);Hamdard University(哈姆达德大学)
移动自组织网络是由一组移动节点组成的无基础设施的网络。由于移动自组网的特殊性,移动自组网中的服务发现是一项具有挑战性的工作。提出了一种基于混合关联规则的网络层服务发现框架HANDY(Hybrid Association Rules Based Network Layer Discovery of Services for Ad Hoc Networks)。HANDY提供了三个主要的研究贡献。首先,它采用了一种跨层的优化设计的服务发现,基于服务和相应的路由同时发现。其次,提出了一种基于本体的多层次服务描述方法。这以可伸缩的方式解决了服务消费者之间的语义互操作性问题。最后,为了进一步优化发现过程的性能,HANDY建议利用服务之间存在的固有关联。这些关联以两种方式使用。首先,基于这些关联来执行周期性服务广告。此外,当生成服务发现请求的响应时,相关服务也被附加到响应。提出的服务发现方案已在JIST/SWANS仿真器中实现。实验结果表明,改进后的服务消费者的命中率和发现过程的延迟得到了改善。
Train Scheduling with Hybrid Answer Set Programming
SBB Switzerland(瑞士联邦铁路);Potassco Solutions Germany(德国Potassco解决方案公司);Simon Fraser University(西蒙弗雷泽大学);Griffith University(格里菲斯大学);University of Potsdam(波茨坦大学)
提出了一种基于回答集编程(ASP)的训练调度问题的解决方案。为此,我们追求一种混合的方法,扩展ASP与不同的约束,以考虑细粒度的时间。更确切地说,我们举例说明如何混合ASP系统clingo[DL]可以用来解决苛刻的计划和调度问题。特别是,我们研究了如何提高性能相结合的不同ASP解决技术,如近似和算法,预处理和编码技术,以解决大规模的,现实世界的训练调度实例。逻辑程序设计理论与实践(Theory and Practice of Logic Programming,TPLP)
A Hybrid Supervised-LLM Pipeline for Actionable Suggestion Mining in Unstructured Customer Reviews
Department of Computer Science & Information Systems, Birla Institute of Technology and Science, Pilani, India(印度比拉理工学院计算机科学与信息系统系);Birdeye Inc.(Birdeye公司)
Memory-Efficient Sequential Pattern Mining with Hybrid Tries
Warrington College of Business(沃顿商学院);University of Florida(佛罗里达大学);Tepper School of Business(泰珀商学院);Carnegie Mellon University(卡内基梅隆大学);Rotman School of Management(罗特曼管理学院);University of Toronto(多伦多大学)
Leiden Institute for Advanced Computer Science (LIACS)(莱顿高级计算机科学研究所);Leiden University(莱顿大学);Interactive Intelligence (II)(交互智能研究所);Delft University of Technology(代尔夫特理工大学);Computational Linguistics & Text Mining Lab (CLTL)(计算语言学与文本挖掘实验室);Vrije Universiteit Amsterdam(阿姆斯特丹自由大学)