Search

When the concentration focuses on data mining, frequent itemset mining (FIM) and high-utility itemset mining (HUIM) are commonly addressed and researched. Many related algorithms are proposed to reveal the general relationship between utility, frequency, and items in transaction databases. Although these algorithms can mine FIMs or HUIMs quickly, these algorithms merely take into account frequency or utility as a unilateral criterion for itemsets but the other factors (e.g., distance, price) could be also valuable for decision-making. A new skyline framework has been presented to mine frequent high utility patterns (SFUPs) to better support user decision-making. Several new algorithms have been proposed one after another. However, the Internet of Things (IoT), mobile Internet, and traditional Internet are generating massive amounts of data every day, and these cutting-edge standalone algorithms can not satisfy the new challenge of finding interesting patterns from this data. Big Data uses a distributed architecture in the form of cloud computing to filter and process this data to extract useful information. This paper proposes a novel parallel algorithm on Hadoop as a three-stage iterative algorithm based on MapReduce. MapReduce is used to divide the mining tasks of the whole large data set into multiple independent sub-tasks to find frequent and high utility patterns in parallel. Numerous experiments were done in this paper, and from the results, the algorithm can handle large datasets and show good performance on Hadoop clusters. [ABSTRACT FROM AUTHOR]

In recent years, intensive research has been conducted to enable people to live more comfortably. Developments in the Internet of Things (IoT), big data, and artificial intelligence have taken this type of research to a new level and led to the emergence of the Internet of Behaviors (IoB), which analyzes behavioral patterns. However, current IoB technologies are not capable of handling heterogeneous data. While it is quite common to have different formats of sensor data for the same behavioral observation, the use of these different data formats can significantly help to obtain a more accurate classification of the observation. Another limitation is that existing IoB deep learning models rely on inefficient hyperparameter tuning strategies. In this paper, we present an Advanced Deep Learning framework for IoB (ADLIoB) applied to connected vehicles. Several deep learning architectures are employed in this framework: CNN, Graph CNN (GCNN), and LSTM are used to train sensor data of different formats. In addition, a branch-and-bound technique is used to intelligently select hyperparameters. To validate ADLIoB, experiments were conducted on four databases for connected vehicles. The results clearly show that ADLIoB is superior to the baseline solutions in terms of both accuracy and runtime. [ABSTRACT FROM AUTHOR]

In the Internet of Things (IoT) era, information is collected by sensor devices, resulting in data loss or uncertain data and other consequences. We need to represent the uncertain data collected using probabilities to extract the useful information for production and application from a huge indeterminate data warehouse. The data in the database has a particular order in time or space, so the High-Utility Probability Sequential Pattern Mining (HUPSPM) has become a new investigation and analysis topic in data processing. After the progress of timestamp, many efficient algorithms for sequential mining have been developed. However, these algorithms have a limitation: they can only be executed in a stand-alone environment and are only suitable for small datasets. Therefore, introducing an advanced graph framework for processing large datasets addresses the shortcomings of the existing methods. The proposed algorithm can avoid repeated database searching, splitting the database, and improve the parallel computing capability. The initial database is pruned according to the existing pruning strategy to effectively reduce the number of candidate sets effectively. Experiments show that the algorithm presented in this paper has excellent advantages in mining high-utility probability sequences in large datasets. [ABSTRACT FROM AUTHOR]