Python Library for Consumer Decision Support System with Automatic Identification of Preferences

The development of information systems (IS) has increased in the e-commerce field. The need for continuous improvement of decision support systems implies the integration of multiple methodologies such as expert knowledge, data mining, big data, artificial intelligence, and multicriteria decision analysis (MCDA) methods. Artificial intelligence algorithms have proven their effectiveness as an engine for data-driven information systems. MCDA methods demonstrated usefulness in domains dealing with multiple dimensions. One of the most critical points of any MCDA procedure is criteria weighting using subjective or objective methods. However, both approaches have several limitations when there is a need to map the preferences of unavailable experts. EVO-SPOTIS library integrating a stochastic evolutionary algorithm with the MCDA method, introduced in this paper, attempts to address this problem. In this approach, the Differential Evolution (DE) algorithm is used to identify decision-makers’ preferences based on datasets evaluated by experts in the past. The Stable Preference Ordering Towards Ideal Solution (SPOTIS) method is used to compute the DE objective function’s values and perform the final evaluation of alternatives using the identified weights. Results confirm the high potential of the library for identification preferences and modeling customer behavior

Porting Decision Tree Algorithms to Multicore using FastFlow

The whole computer hardware industry embraced multicores. For these machines, the extreme optimisation of sequential algorithms is no longer sufficient to squeeze the real machine power, which can be only exploited via thread-level parallelism. Decision tree algorithms exhibit natural concurrency that makes them suitable to be parallelised. This paper presents an approach for easy-yet-efficient porting of an implementation of the C4.5 algorithm on multicores. The parallel porting requires minimal changes to the original sequential code, and it is able to exploit up to 7X speedup on an Intel dual-quad core machine.Comment: 18 pages + cove

A Process to Implement an Artificial Neural Network and Association Rules Techniques to Improve Asset Performance and Energy Efficiency

In this paper, we address the problem of asset performance monitoring, with the intention of both detecting any potential reliability problem and predicting any loss of energy consumption e ciency. This is an important concern for many industries and utilities with very intensive capitalization in very long-lasting assets. To overcome this problem, in this paper we propose an approach to combine an Artificial Neural Network (ANN) with Data Mining (DM) tools, specifically with Association Rule (AR) Mining. The combination of these two techniques can now be done using software which can handle large volumes of data (big data), but the process still needs to ensure that the required amount of data will be available during the assets’ life cycle and that its quality is acceptable. The combination of these two techniques in the proposed sequence di ers from previous works found in the literature, giving researchers new options to face the problem. Practical implementation of the proposed approach may lead to novel predictive maintenance models (emerging predictive analytics) that may detect with unprecedented precision any asset’s lack of performance and help manage assets’ O&M accordingly. The approach is illustrated using specific examples where asset performance monitoring is rather complex under normal operational conditions.Ministerio de Economía y Competitividad DPI2015-70842-

Customer profile classification using transactional data

Customer profiles are by definition made up of factual and transactional data. It is often the case that due to reasons such as high cost of data acquisition and/or protection, only the transactional data are available for data mining operations. Transactional data, however, tend to be highly sparse and skewed due to a large proportion of customers engaging in very few transactions. This can result in a bias in the prediction accuracy of classifiers built using them towards the larger proportion of customers with fewer transactions. This paper investigates an approach for accurately and confidently grouping and classifying customers in bins on the basis of the number of their transactions. The experiments we conducted on a highly sparse and skewed real-world transactional data show that our proposed approach can be used to identify a critical point at which customer profiles can be more confidently distinguished