Modelling and Feature Selection with Applications to Big Data Problems

建模和特征选择及其在大数据问题中的应用

• 批准号: RGPIN-2019-05963
• 负责人: Korenberg, Michael
• 金额: $ 1.68万
• 依托单位: Queen's University
• 依托单位国家: 加拿大
• 项目类别: Discovery Grants Program - Individual
• 财政年份: 2022
• 资助国家: 加拿大
• 起止时间: 2022-01-01 至 2023-12-31
• 项目状态: 已结题
• 来源: https://www.nserc-crsng.gc.ca/ase-oro/Details-Detailles_eng.asp?id=752156
• 关键词: Modelling; Feature; Selection; Applications; Big

Objectives of proposed research are to continue (1) to develop techniques for system modelling and feature selection, creating methods of extracting useful information applicable to both short noisy experimental records and big data problems, and (2) to apply such methods to important problems in physical and industrial systems. Proposed research will devise methods to detect key features/entities and identify causal relationships by applying Fast Orthogonal Search (FOS) and Modified FOS (MFOS) algorithms. In networks of interacting agents, FOS and MFOS will reverse engineer which key network entities control activities of the others. FOS and MFOS select one specific entity at a time and identify which others are interacting agents. The approach will include machine learning, deep learning, pattern recognition, and classification to determine both the most influential entities and cause-and-effect relationships. The approach will integrate FOS and MFOS into Deep Learning strategies and fuzzy interface systems. One unique aspect of the proposed methodology is deducing interactions of inhibition and activation between entities despite high encryption levels. FOS detects key words in encrypted messages, achieving highest accuracy of any method tested [McGaughey et al, A Systematic Approach of Feature Selection for Encrypted Network Traffic Classification, 2018 Annual IEEE SysCon]. Hence refinement to enable high-speed detection of encrypted words will be part of proposed methodology. Other real--world problems include understanding cardiac arrhythmia. Key to FOS, MFOS and parallel cascade identification (PCI) is ability to search very large candidate sets to rapidly find the best terms to predict the value of some output variable. In a network of suspected terrorists we can identify which entities (individuals or cells) best predict the time activities of other entities (e.g., use of communication devices, internet time, etc). If each time function assigned to a group member is the time that person is using a communication device, then candidate terms to predict one person's time function may involve not only the other group members' time functions but also cross--products thereof. This way other people's activities become apparent without ever demonstrating overt interaction. The proposed approach is unique in its ability to identify even the least obvious candidates - those entities never having apparent communication with others but yet best predicting the network activity of other entities. FOS and PCI have been used to successfully reverse engineer gene regulatory networks [Zhen Wang, MSc thesis, School of Computing, Queen's University, October 2010]. However, FOS, MFOS, and PCI have not been applied to detect and disrupt terrorist network activity. We will employ FOS and MFOS in parallel implementation which has proven to be up to 10 times faster than the Fast Fourier Transform, the gold standard in inline coherence imaging in physics.

拟议研究的目标是继续（1）开发系统建模和特征选择技术，创建提取适用于短噪声实验记录和大数据问题的有用信息的方法，以及（2）将这些方法应用于物理和工业系统中的重要问题。拟议的研究将设计方法来通过应用快速正交搜索（FOS）和改进的 FOS（MFOS）算法来检测关键特征/实体并识别因果关系。在交互代理网络中，FOS 和 MFOS 将逆向工程哪些关键网络实体控制其他实体的活动。 FOS 和 MFOS 一次选择一个特定实体，并确定哪些其他实体是交互代理。该方法将包括机器学习、深度学习、模式识别和分类，以确定最有影响力的实体和因果关系。该方法将把 FOS 和 MFOS 集成到深度学习策略和模糊接口系统中。所提出的方法的一个独特方面是尽管加密级别很高，但仍推导实体之间抑制和激活的相互作用。 FOS 检测加密消息中的关键字，达到任何测试方法的最高准确度 [McGaughey 等人，加密网络流量分类特征选择的系统方法，2018 年度 IEEE SysCon]。因此，改进以实现加密字的高速检测将成为所提出的方法的一部分。其他现实世界的问题包括了解心律失常。 FOS、MFOS 和并行级联识别 (PCI) 的关键是能够搜索非常大的候选集，以快速找到预测某些输出变量值的最佳项。在可疑恐怖分子的网络中，我们可以识别哪些实体（个人或组织）最能预测其他实体的时间活动（例如，通信设备的使用、互联网时间等）。如果分配给群组成员的每个时间函数是该人正在使用通信设备的时间，则用于预测一个人的时间函数的候选项可以不仅涉及其他群组成员的时间函数而且还涉及其叉积。这样，其他人的活动就变得显而易见，而无需表现出明显的互动。所提出的方法的独特之处在于它能够识别最不明显的候选者 - 这些实体从未与其他实体进行明显的通信，但仍能最好地预测其他实体的网络活动。 FOS 和 PCI 已成功用于对基因调控网络进行逆向工程 [Zhen Wang，硕士论文，女王大学计算机学院，2010 年 10 月]。然而，FOS、MFOS 和 PCI 尚未应用于检测和破坏恐怖分子网络活动。我们将并行实施 FOS 和 MFOS，事实证明，这比快速傅里叶变换快 10 倍，快速傅里叶变换是物理学中内联相干成像的黄金标准。