A Complex Fuzzy LSTM Network for Temporal-Related Forecasting Problems

Time-stamped data is fast and constantly growing and it contains significant information thanks to the quick development ofmanagement platforms and systems based on the Internet and cutting-edge information communication technologies.Mining the time series data including time series prediction has many practical applications.Many new techniques were developed for use with various types of time series data in the prediction problem.Among those,this work suggests a unique strategy to enhance predicting quality on time-series datasets that the timecycle matters by fusing deep learning methods with fuzzy theory.In order to increase forecasting accuracy on such type of time-series data,this study proposes integrating deep learning approaches with fuzzy logic.Particularly,it combines the long short-termmemory network with the complex fuzzy set theory to create an innovative complex fuzzy long short-term memory model(CFLSTM).The proposed model adds a meaningful representation of the time cycle element thanks to a complex fuzzy set to advance the deep learning long short-term memory(LSTM)technique to have greater power for processing time series data.Experiments on standard common data sets and real-world data sets published in the UCI Machine Learning Repository demonstrated the proposedmodel’s utility compared to other well-known forecasting models.The results of the comparisons supported the applicability of our proposed strategy for forecasting time series data.

Attribute Reduction on Decision Tables Based on Hausdorff Topology

Attribute reduction through the combined approach of Rough Sets(RS)and algebraic topology is an open research topic with significant potential for applications.Several research works have introduced a strong relationship between RS and topology spaces for the attribute reduction problem.However,the mentioned recent methods followed a strategy to construct a new measure for attribute selection.Meanwhile,the strategy for searching for the reduct is still to select each attribute and gradually add it to the reduct.Consequently,those methods tended to be inefficient for high-dimensional datasets.To overcome these challenges,we use the separability property of Hausdorff topology to quickly identify distinguishable attributes,this approach significantly reduces the time for the attribute filtering stage of the algorithm.In addition,we propose the concept of Hausdorff topological homomorphism to construct candidate reducts,this method significantly reduces the number of candidate reducts for the wrapper stage of the algorithm.These are the two main stages that have the most effect on reducing computing time for the attribute reduction of the proposed algorithm,which we call the Cluster Filter Wrapper algorithm based on Hausdorff Topology.Experimental validation on the UCI Machine Learning Repository Data shows that the proposed method achieves efficiency in both the execution time and the size of the reduct.