Modelling and Feature Selection with Applications to Big Data Problems

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

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.