Redescription mining is a field of knowledge discovery that aims at finding different descriptions of similar subsets of instances in the data. These descriptions are represented as rules inferred from one or more disjoint sets of attributes, called views. As such, they support knowledge discovery process and help domain experts in formulating new hypotheses or constructing new knowledge bases and decision support systems. In contrast to previous approaches that typically create one smaller set of redescriptions satisfying a pre-defined set of constraints, we introduce a framework that creates large and heterogeneous redescription set from which user/expert can extract compact sets of differing properties, according to its own preferences. Construction of large and heterogeneous redescription set relies on CLUS-RM algorithm and a novel, conjunctive refinement procedure that facilitates generation of larger and more accurate redescription sets. The work also introduces the variability of redescription accuracy when missing values are present in the data, which significantly extends applicability of the method. Crucial part of the framework is the redescription set extraction based on heuristic multi-objective optimization procedure that allows user to define importance levels towards one or more redescription quality criteria. We provide both theoretical and empirical comparison of the novel framework against current state of the art redescription mining algorithms and show that it represents more efficient and versatile approach for mining redescriptions from data.
A redescription mining framework for post-hoc explaining and relating deep learning models
University of Zagreb(萨格勒布大学);Ruđer Bošković Institute(鲁杰尔·博什科维奇研究所);Faculty of Electrical Engineering and Computing, University of Zagreb(萨格勒布大学电气工程与计算机学院)
Mint: MDL-based approach for Mining INTeresting Numerical Pattern Sets
Université de Lorraine(洛林大学);CNRS(法国国家科学研究中心);Inria(法国国家信息与自动化研究所);LORIA(洛林信息学及其应用研究实验室);National Research University Higher School of Economics(高等经济大学)
Chit-Chat or Deep Talk: Prompt Engineering for Process Mining
Peoples' Friendship University of Russia (RUDN University)(俄罗斯人民友谊大学(RUDN大学));Joint Institute for Nuclear Research(联合核研究所);Vrije Universiteit Amsterdam(阿姆斯特丹自由大学);University of Skövde(舍夫德大学)
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(多伦多大学)
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)
Intelligent Cross-Organizational Process Mining: A Survey and New Perspectives
University of Oxford(牛津大学);Peng Cheng Laboratory(鹏城实验室);Institute for Infocomm Research, A*STAR(新加坡资讯通信研究院(新加坡科技研究局下属));Fudan University(复旦大学);Squirrel Ai Learning(松鼠AI智适应教育)
Peking University, Beijing, China(北京大学);University of Alberta, Canada(阿尔伯塔大学);Dalian University of Technology, China(大连理工大学);Guangzhou University, China(广州大学)
The role of semantics in mining frequent patterns from knowledge bases in description logics with rules
Poznan University of Technology(波兹南理工大学)
我们提出了一种新的方法来挖掘频繁模式的语言,结合语义Web本体和规则。特别是,我们考虑使用的语言相结合的描述逻辑与DL安全的规则的设置。此设置对于语义Web的数据采掘的实际应用非常重要。我们专注于频繁模式发现的任务的表示形式主义的语义的关系,并为我们的方法的核心,我们提出了一种算法,利用组合知识库的语义。我们已经开发了一个概念验证数据采掘实现这一点。使用这一点,我们已经经验表明,使用组合的知识库进行语义测试,可以使数据采掘更快的修剪无用的候选模式之前,他们的评价。我们还表明,所产生的模式集的质量可以得到改善:模式更紧凑,并且模式更少。我们的结论是,利用所选择的表示形式主义的语义(上)关系频繁模式发现方法的设计和应用的关键。逻辑程序设计理论与实践(Theory and Practice of Logic Programming,TPLP)
Mining Knowledge in Astrophysical Massive Data Sets
INAF – Osservatorio Astronomico di Capodimonte(意大利国家天体物理研究所卡波迪蒙特天文台);Università degli Studi Federico II(费德里科二世大学);INAF – Osservatorio Astronomico di Trieste(的里雅斯特天文台)