Mining Heterogeneous Multivariate Time-Series for Learning Meaningful Patterns: Application to Home Health Telecare

For the last years, time-series mining has become a challenging issue for researchers. An important application lies in most monitoring purposes, which require analyzing large sets of time-series for learning usual patterns. Any deviation from this learned profile is then considered as an unexpected situation. Moreover, complex applications may involve the temporal study of several heterogeneous parameters. In that paper, we propose a method for mining heterogeneous multivariate time-series for learning meaningful patterns. The proposed approach allows for mixed time-series -- containing both pattern and non-pattern data -- such as for imprecise matches, outliers, stretching and global translating of patterns instances in time. We present the early results of our approach in the context of monitoring the health status of a person at home. The purpose is to build a behavioral profile of a person by analyzing the time variations of several quantitative or qualitative parameters recorded through a provision of sensors installed in the home

An Expert System to Improve the Energy Efficiency of the Reaction Zone of a Petrochemical Plant

Energy is the most important cost factor in the petrochemical industry. Thus, energy efficiency improvement is an important way to reduce these costs and to increase predictable earnings, especially in times of high energy price volatility. This work describes the development of an expert system for the improvement of this efficiency of the reaction zone of a petrochemical plant. This system has been developed after a data mining process of the variables registered in the plant. Besides, a kernel of neural networks has been embedded in the expert system. A graphical environment integrating the proposed system was developed in order to test the system. With the application of the expert system, the energy saving on the applied zone would have been about 20%.Junta de Andalucía TIC-570

Efficient chaining of seeds in ordered trees

We consider here the problem of chaining seeds in ordered trees. Seeds are mappings between two trees Q and T and a chain is a subset of non overlapping seeds that is consistent with respect to postfix order and ancestrality. This problem is a natural extension of a similar problem for sequences, and has applications in computational biology, such as mining a database of RNA secondary structures. For the chaining problem with a set of m constant size seeds, we describe an algorithm with complexity O(m2 log(m)) in time and O(m2) in space

Decision system based on neural networks to optimize the energy efficiency of a petrochemical plant

The energy efficiency of industrial plants is an important issue in any type of business but particularly in the chemical industry. Not only is it important in order to reduce costs, but also it is necessary even more as a means of reducing the amount of fuel that gets wasted, thereby improving productivity, ensuring better product quality, and generally increasing profits. This article describes a decision system developed for optimizing the energy efficiency of a petrochemical plant. The system has been developed after a data mining process of the parameters registered in the past. The designed system carries out an optimization process of the energy efficiency of the plant based on a combined algorithm that uses the following for obtaining a solution: On the one hand, the energy efficiency of the operation points occurred in the past and, on the other hand, a module of two neural networks to obtain new interpolated operation points. Besides, the work includes a previous discriminant analysis of the variables of the plant in order to select the parameters most important in the plant and to study the behavior of the energy efficiency index. This study also helped ensure an optimal training of the neural networks. The robustness of the system as well as its satisfactory results in the testing process (an average rise in the energy efficiency of around 7%, reaching, in some cases, up to 45%) have encouraged a consulting company (ALIATIS) to implement and to integrate the decision system as a pilot software in an SCADA

When Hashing Met Matching: Efficient Spatio-Temporal Search for Ridesharing

Carpooling, or sharing a ride with other passengers, holds immense potential for urban transportation. Ridesharing platforms enable such sharing of rides using real-time data. Finding ride matches in real-time at urban scale is a difficult combinatorial optimization task and mostly heuristic approaches are applied. In this work, we mathematically model the problem as that of finding near-neighbors and devise a novel efficient spatio-temporal search algorithm based on the theory of locality sensitive hashing for Maximum Inner Product Search (MIPS). The proposed algorithm can find $k$ near-optimal potential matches for every ride from a pool of $n$ rides in time $O(n^{1 + \rho} (k + \log n) \log k)$ and space $O(n^{1 + \rho} \log k)$ for a small $\rho < 1$. Our algorithm can be extended in several useful and interesting ways increasing its practical appeal. Experiments with large NY yellow taxi trip datasets show that our algorithm consistently outperforms state-of-the-art heuristic methods thereby proving its practical applicability

Rough Sets Clustering and Markov model for Web Access Prediction

Discovering user access patterns from web access log is increasing the importance of information to build up adaptive web server according to the individual user’s behavior. The variety of user behaviors on accessing information also grows, which has a great impact on the network utilization. In this paper, we present a rough set clustering to cluster web transactions from web access logs and using Markov model for next access prediction. Using this approach, users can effectively mine web log records to discover and predict access patterns. We perform experiments using real web trace logs collected from www.dusit.ac.th servers. In order to improve its prediction ration, the model includes a rough sets scheme in which search similarity measure to compute the similarity between two sequences using upper approximation