Sketch-Based Streaming Anomaly Detection in Dynamic Graphs

Given a stream of graph edges from a dynamic graph, how can we assign anomaly scores to edges and subgraphs in an online manner, for the purpose of detecting unusual behavior, using constant time and memory? For example, in intrusion detection, existing work seeks to detect either anomalous edges or anomalous subgraphs, but not both. In this paper, we first extend the count-min sketch data structure to a higher-order sketch. This higher-order sketch has the useful property of preserving the dense subgraph structure (dense subgraphs in the input turn into dense submatrices in the data structure). We then propose four online algorithms that utilize this enhanced data structure, which (a) detect both edge and graph anomalies; (b) process each edge and graph in constant memory and constant update time per newly arriving edge, and; (c) outperform state-of-the-art baselines on four real-world datasets. Our method is the first streaming approach that incorporates dense subgraph search to detect graph anomalies in constant memory and time

Big data reduction framework for value creation in sustainable enterprises

Value creation is a major sustainability factor for enterprises, in addition to profit maximization and revenue generation. Modern enterprises collect big data from various inbound and outbound data sources. The inbound data sources handle data generated from the results of business operations, such as manufacturing, supply chain management, marketing, and human resource management, among others. Outbound data sources handle customer-generated data which are acquired directly or indirectly from customers, market analysis, surveys, product reviews, and transactional histories. However, cloud service utilization costs increase because of big data analytics and value creation activities for enterprises and customers. This article presents a novel concept of big data reduction at the customer end in which early data reduction operations are performed to achieve multiple objectives, such as a) lowering the service utilization cost, b) enhancing the trust between customers and enterprises, c) preserving privacy of customers, d) enabling secure data sharing, and e) delegating data sharing control to customers. We also propose a framework for early data reduction at customer end and present a business model for end-to-end data reduction in enterprise applications. The article further presents a business model canvas and maps the future application areas with its nine components. Finally, the article discusses the technology adoption challenges for value creation through big data reduction in enterprise applications

AUTOMOTIVE APPLICATIONS OF EVOLVING TAKAGI-SUGENO-KANG FUZZY MODELS

This paper presents theoretical and application results concerning the development of evolving Takagi-Sugeno-Kang fuzzy models for two dynamic systems, which will be viewed as controlled processes, in the field of automotive applications. The two dynamic systems models are nonlinear dynamics of the longitudinal slip in the Anti-lock Braking Systems (ABS) and the vehicle speed in vehicles with the Continuously Variable Transmission (CVT) systems. The evolving Takagi-Sugeno-Kang fuzzy models are obtained as discrete-time fuzzy models by incremental online identification algorithms. The fuzzy models are validated against experimental results in the case of the ABS and the first principles simulation results in the case of the vehicle with the CVT

AUTOMOTIVE APPLICATIONS OF EVOLVING TAKAGI-SUGENO-KANG FUZZY MODELS

This paper presents theoretical and application results concerning the development of evolving Takagi-Sugeno-Kang fuzzy models for two dynamic systems, which will be viewed as controlled processes, in the field of automotive applications. The two dynamic systems models are nonlinear dynamics of the longitudinal slip in the Anti-lock Braking Systems (ABS) and the vehicle speed in vehicles with the Continuously Variable Transmission (CVT) systems. The evolving Takagi-Sugeno-Kang fuzzy models are obtained as discrete-time fuzzy models by incremental online identification algorithms. The fuzzy models are validated against experimental results in the case of the ABS and the first principles simulation results in the case of the vehicle with the CVT

Evolving Clustering Algorithms And Their Application For Condition Monitoring, Diagnostics, & Prognostics

Applications of Condition-Based Maintenance (CBM) technology requires effective yet generic data driven methods capable of carrying out diagnostics and prognostics tasks without detailed domain knowledge and human intervention. Improved system availability, operational safety, and enhanced logistics and supply chain performance could be achieved, with the widespread deployment of CBM, at a lower cost level. This dissertation focuses on the development of a Mutual Information based Recursive Gustafson-Kessel-Like (MIRGKL) clustering algorithm which operates recursively to identify underlying model structure and parameters from stream type data. Inspired by the Evolving Gustafson-Kessel-like Clustering (eGKL) algorithm, we applied the notion of mutual information to the well-known Mahalanobis distance as the governing similarity measure throughout. This is also a special case of the Kullback-Leibler (KL) Divergence where between-cluster shape information (governed by the determinant and trace of the covariance matrix) is omitted and is only applicable in the case of normally distributed data. In the cluster assignment and consolidation process, we proposed the use of the Chi-square statistic with the provision of having different probability thresholds. Due to the symmetry and boundedness property brought in by the mutual information formulation, we have shown with real-world data that the algorithm’s performance becomes less sensitive to the same range of probability thresholds which makes system tuning a simpler task in practice. As a result, improvement demonstrated by the proposed algorithm has implications in improving generic data driven methods for diagnostics, prognostics, generic function approximations and knowledge extractions for stream type of data. The work in this dissertation demonstrates MIRGKL’s effectiveness in clustering and knowledge representation and shows promising results in diagnostics and prognostics applications