Search

Previous algorithms designed for efficient mining of sequence patterns have primarily focused on processing static databases. However, in the context of dynamic database mining, where new data are constantly added, rescanning the entire database to update the information becomes necessary. This maintenance and update process consumes significant time and resources, leading to delayed responses. To address this issue, this paper proposes an incremental mining algorithm called Pre-HUSPM, which leverages the concept of pre-large to insert new sequences into the dynamic database while preserving the discovered efficient sequence patterns. Furthermore, a novel threshold, denoted as S W U max , is introduced to minimize the frequency of database rescans and enhance the algorithm’s speed. The experimental results show that the algorithm greatly reduces computation time and resource consumption, enabling the algorithm to respond faster to data changes and generate new mining results. This algorithm aids manufacturers in designing and producing products that align with customer preferences based on previous products, thereby improving operational efficiency and guiding customers toward wise purchasing decisions, ultimately resulting in higher profits for the company. [ABSTRACT FROM AUTHOR]

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]

Simultaneously, the application of resilient distributed datasets (RDD) in cloud computing provides a good environment for data analysis of big data. In addition, the combination of Machine Learning (ML) algorithms of the edge computing paradigm and the SFUP-SP algorithm may be able to also be used to improve local computing capabilities and speed up data analysis and user decision-making. [ABSTRACT FROM AUTHOR]

In today's society, investment wealth management has become a mainstream of the contemporary era. Investment wealth management refers to the use of funds by investors to arrange funds reasonably, for example, savings, bank financial products, bonds, stocks, commodity spots, real estate, gold, art, and many others. Wealth management tools manage and assign families, individuals, enterprises, and institutions to achieve the purpose of increasing and maintaining value to accelerate asset growth. Among them, in investment and financial management, people's favorite product of investment often stocks, because the stock market has great advantages and charm, especially compared with other investment methods. More and more scholars have developed methods of prediction from multiple angles for the stock market. According to the feature of financial time series and the task of price prediction, this article proposes a new framework structure to achieve a more accurate prediction of the stock price, which combines Convolution Neural Network (CNN) and Long–Short-Term Memory Neural Network (LSTM). This new method is aptly named stock sequence array convolutional LSTM (SACLSTM). It constructs a sequence array of historical data and its leading indicators (options and futures), and uses the array as the input image of the CNN framework, and extracts certain feature vectors through the convolutional layer and the layer of pooling, and as the input vector of LSTM, and takes ten stocks in U.S.A and Taiwan as the experimental data. Compared with previous methods, the prediction performance of the proposed algorithm in this article leads to better results when compared directly. [ABSTRACT FROM AUTHOR]

In an era where people in the world are concerned about environmental issues, companies must reduce distribution costs while minimizing the pollution generated during the distribution process. For today's multi-depot problem, a mixed-integer programming model is proposed in this paper to minimize all costs incurred in the entire transportation process, considering the impact of time-varying speed, loading, and waiting time on costs. Time is directional; hence, the problems considered in this study are modeled based on asymmetry, making the problem-solving more complex. This paper proposes a genetic algorithm combined with simulated annealing to solve this issue, with the inner and outer layers solving for the optimal waiting time and path planning problem, respectively. The mutation operator is replaced in the outer layer by a neighbor search approach using a solution acceptance mechanism similar to simulated annealing to avoid a local optimum solution. This study extends the path distribution problem (vehicle-routing problem) and provides an alternative approach for solving time-varying networks. [ABSTRACT FROM AUTHOR]

The high average-utility itemset mining (HAUIM) was established to provide a fair measure instead of genetic high-utility itemset mining (HUIM) for revealing the satisfied and interesting patterns. In practical applications, the database is dynamically changed when insertion/deletion operations are performed on databases. Several works were designed to handle the insertion process but fewer studies focused on processing the deletion process for knowledge maintenance. In this paper, we then develop a PRE-HAUI-DEL algorithm that utilizes the pre-large concept on HAUIM for handling transaction deletion in the dynamic databases. The pre-large concept is served as the buffer on HAUIM that reduces the number of database scans while the database is updated particularly in transaction deletion. Two upper-bound values are also established here to reduce the unpromising candidates early which can speed up the computational cost. From the experimental results, the designed PRE-HAUI-DEL algorithm is well performed compared to the Apriori-like model in terms of runtime, memory, and scalability in dynamic databases. [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]

Pork accounts for a high proportion of the Chinese population's meat consumption, and imported pork is heavily traded, reducing supply of domestic pork in the face of continued demand. Global pork markets are becoming more competitive, riding the wind of the bilateral free trade agreement. The World Food and Agriculture Organization (FAO) compiles prices for other major food categories but does not track changes in the imported pork prices in China. This study has filled this gap by designing the Imported Pork Producer Declaration Price Index (PPI_IPD). Using the well-known Producer Price Index (PPI) model, PPI_IPD is based on the data from Chinese customs import declarations, which has high reliability and reasonableness. For this reason, the index can help governments, enterprises, analysts, and others to conduct analysis for imported pork prices in China and avoid international trade risks. The findings show that proposed PPI_IPD is highly correlated with the Chinese domestic pork market and the pork price industry stock market. The index helps monitor changes in international pork prices and is an effective tool for analyzing and controlling trade risks. [ABSTRACT FROM AUTHOR]

Estimating similarity using multiple similarity measures or machine learning prediction models is a popular solution to the link prediction problem. The Relation Pattern Deep Learning Classification (RPDLC) technique is proposed in this study, and it is based on multiple neighbor-based similarity metrics and convolution neural networks. The RPDLC first calculates the characteristics for a pair of nodes using neighbor-based metrics and impact nodes. Second, the RPDLC creates a heat map using node characteristics to assess the similarity of the nodes' connection patterns. Third, the RPDLC uses convolution neural network architecture to build a prediction model for missing relationship prediction. On three separate social network datasets, this method is compared to other state-of-the-art algorithms. On all three datasets, the suggested method achieves the greatest AUC, hovering around 99 percent. The use of convolution neural networks and features via relational patterns to create a prediction model are the paper's primary contributions. [ABSTRACT FROM AUTHOR]

With the rise in popularity of personal computers and decreasing cost, even a personal computer can execute complex and large calculations. So more researchers can invest in AI and machine learning. Humans can't handle massive data sets or data that requires a long time to read and evaluate, whereas big data frameworks can read and analyze in a reasonable time. So relevant research has increased recently. In the social sciences, machine learning is used to forecast future trends and the index trend. Keeping up with current events is crucial nowadays to debate countermeasures in time. This study combines economic indicators from 1988 to 2017 with leading indicators and other types of indicators. The recurrent neural network model predicts economic index trends and tests multiple variables. The proposed methods measure the error in predicting future trends in different models to learn which indicators work well together. [ABSTRACT FROM AUTHOR]

The Internet of things (IoT) has had an enormous impact on the financial industry. With IoT, people can obtain real-time financial information; moreover, investment and financial management have become more flexible and diverse. Because of their high returns and strong liquidity, stocks have become essential commodities through which people invest and manage money. However, high returns are often associated with high risks. Therefore, it is important for investors to forecast the trends of future stock prices. This study uses a new stock trend prediction framework to predict changes in the stock price direction on the next trading day using data from the past 30 trading days. This framework uses two-dimensional convolutional neural networks to classify stock prices into three categories: up, down, and flat. In addition, to analyze the influence of different types of input on the prediction model, historical data, futures, options, technical indicators, and mixed data are taken as the model's input. Experiments on US and Taiwan stocks proved the validity of the prediction model. The method proposed in this study is compared with buy-and-hold and random choice trading strategies. Results show that the model's profitability is better than the two baseline strategies. [ABSTRACT FROM AUTHOR]

The Internet of Things (IoT) has revolutionized practically every industry, including agriculture, due to its fast expansion and integration into other industries. The application of IoT in agriculture motivates farmers to use their resources wisely and allows for better field monitoring and decision-making, resulting in increased agricultural productivity. Because IoT-enabled agriculture systems need the use of various types of sensors that collect data (such as soil moisture and humidity) and then transmit it over the network. IoT-based agriculture systems, on the other hand, are always vulnerable to security threats. Authentication is one of the assured options for addressing the security concern, since it only enables an authorized party to access the data. Existing authentication schemes typically use the Rivest-Shamir-Adleman (RSA) algorithm and elliptic curve cryptography (ECC), which has a greater computational and communication cost. Furthermore, the security of the majority of existing authentication schemes is not verified using any security tool. As a result, we propose an identity-based authentication scheme for IoT-enabled agriculture in this article. To ensure that our scheme is cost-effective, we employ hyperelliptic curve cryptography (HECC). Our scheme surpasses existing authentication schemes in terms of computational cost and communication overhead while providing better security, according to a thorough investigation of performance and security. [ABSTRACT FROM AUTHOR]

Recently, revealing more valuable information except for quantity value for a database is an essential research field. High utility itemset mining (HAUIM) was suggested to reveal useful patterns by average-utility measure for pattern analytics and evaluations. HAUIM provides a more fair assessment than generic high utility itemset mining and ignores the influence of the length of itemsets. There are several high-performance HAUIM algorithms proposed to gain knowledge from a disorganized database. However, most existing works do not concern the uncertainty factor, which is one of the characteristics of data gathered from IoT equipment. In this work, an efficient algorithm for HAUIM to handle the uncertainty databases in IoTs is presented. Two upper-bound values are estimated to early diminish the search space for discovering meaningful patterns that greatly solve the limitations of pattern mining in IoTs. Experimental results showed several evaluations of the proposed approach compared to the existing algorithms, and the results are acceptable to state that the designed approach efficiently reveals high average utility itemsets from an uncertain situation. [ABSTRACT FROM AUTHOR]

The smart grid-enabled industrial Internet of Things (SG-IIoT) is a hybrid data communication network connected with the power grid that collects and analyzes data from transmission lines, distribution substations, and consumers. In the IIoT setting, SG provides predictive information to its supplier and customers on how to effectively manage the power based on this aggregated data. To achieve this goal, every virtual or physical entity in the SG-IIoT must be linked and accessible over the Internet, which can be susceptible to numerous cyberattacks. In this paper, we propose a multidocument blind signcryption scheme to simultaneously resolve the security and efficiency issues. The proposed scheme performs the blind signature and encryption operation on multiple digital documents in one step because SG-IIoT outputs a large amount of data that needs to be blind signed and encrypted in a batch. The proposed scheme employs the concept of hyperelliptic curve cryptography (HECC), which is lightweight owing to the smaller key size. The comparative analysis in both security and efficiency with the relevant existing scheme authenticates the viability of the proposed scheme. [ABSTRACT FROM AUTHOR]

Top-k dominating (TKD) query is one of the methods to find the interesting objects by returning the k objects that dominate other objects in a given dataset. Incomplete datasets have missing values in uncertain dimensions, so it is difficult to obtain useful information with traditional data mining methods on complete data. BitMap Index Guided Algorithm (BIG) is a good choice for solving this problem. However, it is even harder to find top-k dominance objects on incomplete big data. When the dataset is too large, the requirements for the feasibility and performance of the algorithm will become very high. In this paper, we proposed an algorithm to apply MapReduce on the whole process with a pruning strategy, called Efficient Hadoop BitMap Index Guided Algorithm (EHBIG). This algorithm can realize TKD query on incomplete datasets through BitMap Index and use MapReduce architecture to make TKD query possible on large datasets. By using the pruning strategy, the runtime and memory usage are greatly reduced. What's more, we also proposed an improved version of EHBIG (denoted as IEHBIG) which optimizes the whole algorithm flow. Our in-depth work in this article culminates with some experimental results that clearly show that our proposed algorithm can perform well on TKD query in an incomplete large dataset and shows great performance in a Hadoop computing cluster. [ABSTRACT FROM AUTHOR]

The evolution of the Internet of Things (IoT) has promoted the prevalence of the financial industry as a variety of stock prediction models have been able to accurately predict various IoT-based financial services. In practice, it is crucial to obtain relatively accurate stock trading signals. Considering various factors, finding profitable stock trading signals is very attractive to investors, but it is also not easy. In the past, researchers have been devoted to the study of trading signals. A genetic algorithm (GA) is often used to find the optimal solution. In this study, a long short-term (LSTM) memory neural network is used to study stock price fluctuations, and then, genetic algorithms are used to obtain appropriate trading signals. A genetic algorithm is a search algorithm that solves optimization. In this paper, the optimal threshold is found to determine the trading signal. In addition to trading signals, a suitable trading strategy is also crucial. In addition, this research uses the Kelly criterion for fund management; that is, the Kelly criterion is used to calculate the optimal investment score. Effective capital management can not only help investors increase their returns but also help investors reduce their losses. [ABSTRACT FROM AUTHOR]

The Internet of Things (IoT) play an important role in the financial sector in recent decades since several stock prediction models can be performed accurately according to IoT-based services. In real-time applications, the accuracy of the stock price fluctuation forecast is very important to investors, and it helps investors better manage their funds when formulating trading strategies. It has always been a goal and difficult problem for financial researchers to use predictive tools to obtain predicted values closer to actual values from a given financial data set. Leading indicators such as futures and options can reflect changes in many markets, such as the industry's prosperity. Adding the data set of leading indicators can predict the trend of stock prices well. In this research, a trading strategy for finding stock trading signals is proposed that combines long short-term memory neural networks with genetic algorithms. This new framework is called long short-term memory neural network with leading index, or LSTMLI for short. We thus take the stock markets of the United States and Taiwan as the research objects and use historical data, futures, and options as data sets to predict the stock prices of these two markets. After that, we use genetic algorithms to find trading signals for the designed stock trading system. The experimental results show that the stock trading system proposed in this research can help investors obtain certain returns. [ABSTRACT FROM AUTHOR]

Traditional association-rule mining (ARM) considers only the frequency of items in a binary database, which provides insufficient knowledge for making efficient decisions and strategies. The mining of useful information from quantitative databases is not a trivial task compared to conventional algorithms in ARM. Fuzzy-set theory was invented to represent a more valuable form of knowledge for human reasoning, which can also be applied and utilized for quantitative databases. Many approaches have adopted fuzzy-set theory to transform the quantitative value into linguistic terms with its corresponding degree based on defined membership functions for the discovery of FFIs, also known as fuzzy frequent itemsets. Only linguistic terms with maximal scalar cardinality are considered in traditional fuzzy frequent itemset mining, but the uncertainty factor is not involved in past approaches. In this paper, an efficient fuzzy mining (EFM) algorithm is presented to quickly discover multiple FFIs from quantitative databases under type-2 fuzzy-set theory. A compressed fuzzy-list (CFL)-structure is developed to maintain complete information for rule generation. Two pruning techniques are developed for reducing the search space and speeding up the mining process. Several experiments are carried out to verify the efficiency and effectiveness of the designed approach in terms of runtime, the number of examined nodes, memory usage, and scalability under different minimum support thresholds and different linguistic terms used in the membership functions. [ABSTRACT FROM AUTHOR]

A smart grid (SG) is an advanced power grid system deployed in a cloud center and smart meters (at the consumer end) that provides higher reliability, better data protection, improved power efficiency, automatic monitoring, and effective management of power consumption. However, an SG also poses certain challenges that need to be addressed. For example, data provided by a smart meter are time-sensitive and cannot handle high latency in an SG. Moreover, a smart meter depends on memory, energy, and other factors. Besides, the security between a cloud center and a smart meter is a critical issue that needs to be resolved. Edge computing, an extension of cloud computing deployed in an edge network between a cloud center and the end devices, is an efficient solution to the aforementioned issues. Therefore, in this study, we propose a secure mutual authentication protocol based on edge computing for use in an SG. [ABSTRACT FROM AUTHOR]

Privacy‐preserving data mining (PPDM) is a popular research topic in the data mining field. For individual information protection, it is vital to protect sensitive information during data mining procedures. Furthermore, it is also a serious offense to spill sensitive private knowledge. Recently, many PPDM data mining algorithms have been proposed to conceal sensitive items in a given database to disclose high‐frequency items. These recent methods have already proven to be excellent in protecting confidential information and maintaining the integrity of the input database. All prior techniques, however, ignored a crucial problem in setting minimum support thresholds. If a sensitive itemset includes more items, it will cause it the become more likely to be found. Before performing mining processes, a fixed value of the minimum support threshold will be set. In this paper, a new concept of minimal support for solving this issue is proposed. In compliance with a given threshold function, the proposed approach would set a tighter threshold for an object containing several items. The results of the experiments show the performance of the traditional Greedy PPDM approach, Genetic algorithm (GA)‐based PPDM approaches, and the proposed particle swarm optimization‐based algorithm with the new minimal support function. The results show that the proposed method performs similarly to conventional algorithms and offers higher protection than previous methods. [ABSTRACT FROM AUTHOR]

The stock market is a capitalistic haven where the issued shares are transferred, traded, and circulated. It bases stock prices on the issue market, however, the structure and trading activities of the stock market are much more complicated than the issue market itself. Therefore, making an accurate prediction becomes an intricate as well as highly difficult task. On the other hand, because of the potential benefits of stock prediction, it attracts generation after generation of scholars as well as investors to continuously develop various prediction methods from different perspectives, a myriad of theories, a multitude of investment strategies, and different practical experiences. In this article, aiming at the task of time series (financial) feature extraction and prediction of price movements, a new convolutional novel neural network that can be called a framework to improve the prediction accuracy of stock trading is proposed. The method that is proposed is called SSACNN, a short form of stock sequence array convolutional neural network. SSACNN collects data including historical data of prices and its leading indicators (options/futures) for a stock to take an array as the input graph of the convolutional neural network framework. In our experimental results, five Taiwanese and American stocks were used as a benchmark to compare with the previous algorithms and proposed algorithm, the motion prediction performance of SSACNN has been improved significantly and proved that it has the potential to be applied in the real financial market. [ABSTRACT FROM AUTHOR]

When focusing on the general area of data mining, high-utility itemset mining (HUIM) can be defined as an offset of frequent itemset mining (FIM). It is known to emphasize more factors critically, which gives HUIM its intrinsic edge. Due to the flourishing development of the IoT technique, the uncertainty patterns mining is also attractive. Potential high-utility itemset mining (PHUIM) is introduced to reveal valuable patterns in an uncertainty database. Unfortunately, even though the previous methods are all very effective and powerful to mine, the potential high-utility itemsets quickly. These algorithms are not specifically designed for a database with an enormous number of records. In the previous methods, uncertainty transaction datasets would be load in the memory ultimately. Usually, several pre-defined operators would be applied to modify the original dataset to reduce the seeking time for scanning the data. However, it is impracticable to apply the same way in a big-data dataset. In this work, a dataset is assumed to be too big to be loaded directly into memory and be duplicated or modified; then, a MapReduce framework is proposed that can be used to handle these types of situations. One of our main objectives is to attempt to reduce the frequency of dataset scans while still maximizing the parallelization of all processes. Through in-depth experimental results, the proposed Hadoop algorithm is shown to perform strongly to mine all of the potential high-utility itemsets in a big-data dataset and shows excellent performance in a Hadoop computing cluster. [ABSTRACT FROM AUTHOR]

As vehicle speed is fast and on board units' (OBUs) computing power, storage space, bandwidth and other resources are very limited, the efficiency of message transmission in vehicular ad hoc network is of great concern. Certificate‐based aggregate signature scheme provides a way to combine numerous signatures into one short signature. The authors propose a certificate‐based aggregate signature scheme for vehicular ad hoc networks. In this study, the authors prove that the proposed scheme is secure against forgery attack in the random oracle model and under the computational Diffie–Hellman problem. It is efficient and suitable for vehicular ad hoc networks. [ABSTRACT FROM AUTHOR]

HAUIM (High Average-Utility Itemset Mining) is a variation of HUIM (High-Utility Itemset Mining) that provides a reliable measure to reveal utility patterns in light of the length of the mined pattern. Several works have been studied to improve mining efficiency by designing multiple pruning strategies and efficient frameworks, but fewer studies have centered on the sophisticated database maintenance algorithm. Existing works still have to rescan the databases multiple times when it is necessary. We first use the pre-large principle in this paper to efficiently update the newly discovered HAUIs. For further updates and maintenance on the basis of the two thresholds, the Pre-large Average Utility Itemset (PAUI) can be maintained to increase the mining performance. Experiments will then be performed to compare the batch model, the Fast-Updated (FUP)-based model, and the Apriori-like HAUIM (APHAUIM) model designed in respect of the number of maintenance patterns, scalability, runtime, and memory usage. [ABSTRACT FROM AUTHOR]

High utility itemset mining has become an important and critical operation in the Data Mining field. High utility itemset mining generates more profitable itemsets and the association among these itemsets, to make business decisions and strategies. Although, high utility is important, it is not the sole measure to decide efficient business strategies such as discount offers. It is very important to consider the pattern of itemsets based on the frequency as well as utility to predict more profitable itemsets. For example, in a supermarket or restaurant, beverages like champagne or wine might generate high utility (profit), but also sell less frequently compared to other beverages like soda or beer. In previous studies, it is observed that people who buy milk, bread, or diapers from a supermarket, also tend to buy beer or soda. But the items like milk, diapers, beer, or soda generate less utility (profit value) compared to beverages like champagne or wine. If we combine items like champagne or wine having high utility but less frequency, with the frequently sold items like milk, diaper, or beer, we can increase the utility of the transaction by providing some discount offers on champagne or wine. In this paper, we are integrating low-frequency itemsets with high-frequency itemsets, both having low or high utility, and provide different association rules for this combination of itemsets. In this way, we can generate a more accurate measure of pattern mining for various business strategies. [ABSTRACT FROM AUTHOR]