Search

Sensor data that is often collected in the Internet of Things (IoT) or any smart city environment should be protected against security and privacy concerns. Often, sensor data that is shared by devices in smart cities contains sensitive or private information that can often be shared over different networks and by different smart applications. In the last decade, the area of Privacy-Preserving Data Mining (PPDM) has received a lot of attention as the amount of data received and collected daily is huge. Unfortunately, PPDM mostly applies to binary data. To improve the usefulness of PPDM, we present a more usable version for smart cities called Privacy-Preserving Utility Mining (PPUM), in the form of a Maximal Sensitive Utility-Maximal Sensitive ConflIct (MSU-MSI) algorithm. MSU-MSI finds any conflicting items that may contain sensitive itemsets with high-utility and sanitizes them, stripping them of sensitive and private information while maintaining utility. Any transactions encountered that contain sensitive itemsets are first fed through sanitization processes. This is followed by calculating the total number of items that conflict, and then removing them so sanitization processes can operate more efficiently so as to not redo known sanitization processes. We conduct an in-depth experimental analysis, where our detailed methodology is compared directly with state-of-the-art frameworks such as MSU-MIU, MSU-MAU, HHUIF and MSCIF. Our proposed MSU-MSI shows a higher performance in missing cost, in particular when dealing with highly dense or highly sparse datasets. Moreover, our novel framework is shown to achieve an excellent performance with regards to similarity in database structure and database utility. [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]

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]

Periodic pattern mining models analyze patterns which occur periodically in a time-series database, such as sensor readings of smartphones and/or Internet of Things devices. The extracted patterns can be utilized for risk prediction, system management, and decision-making. In this article, we propose an efficient periodicity-oriented data analytics approach. It ignores intermediate events deliberately by adopting the concept of flexible periodic patterns, so it can be applied to more diverse real-life scenarios and systems. Moreover, the proposed approach adopts a novel symbol-centered data structure instead of existing data structures for state-of-the-art approaches of periodic pattern mining. Performance evaluations on real-life datasets, Diabetes, Oil Prices, and Bike Sharing, and requirements show that our approach has better runtime, memory usage, number of visited patterns, and sensitivity than efficient periodic pattern mining (EPPM) and flexible periodic pattern mining (FPPM), which are the state-of-the-art approaches in the same field. The experimental results show that the proposed algorithm will require less runtime and smaller memory than the existing algorithms on most data and requirements in real life. [ABSTRACT FROM AUTHOR]

Modern Internet of Things (IoT) applications generate massive amounts of data, much of them in the form of objects/items of readings, events, and log entries. Specifically, most of the objects in these IoT data contain rich embedded information (e.g., frequency and uncertainty) and different levels of importance (e.g., unit risk/utility of items, interestingness, cost, or weight). Many existing approaches in data mining and analytics have limitations, such as only the binary attribute is considered within a transaction, as well as all the objects/items having equal weights or importance. To solve these drawbacks, a novel utility-driven data analytics algorithm named HUPNU is presented in this article. As a general utility-driven uncertain data mining model, HUPNU can extract High-Utility patterns by considering both Positive and Negative unit utilities from Uncertain data. The qualified high-utility patterns can be effectively discovered for intrusion detection, risk prediction, manufacturing management, and decision-making, among others. By using the developed vertical Probability-Utility list with the positive and negative utilities structure, as well as several effective pruning strategies, experiments showed that the developed HUPNU approach with the pruning strategies performed great in mining the qualified patterns efficiently and effectively. [ABSTRACT FROM AUTHOR]

The emergence and proliferation of the internet of things (IoT) devices have resulted in the generation of big and uncertain data due to the varied accuracy and decay of sensors and their different sensitivity ranges. Since data uncertainty plays an important role in IoT data, mining the useful information from uncertain dataset has become an important issue in recent decades. Past works focus on mining the high sequential patterns from the uncertain database. However, the utility of a derived sequence increases along with the size of the sequence, which is an unfair measure to evaluate the utility of a sequence since any combination of a high-utility sequence will also be the high-utility sequence, even though the utility of a sequence is merely low. In this paper, we address the limitation of the previous potential high-utility sequential pattern mining and present a potentially high average-utility sequential pattern mining framework for discovering the set of potentially high average-utility sequential patterns (PHAUSPs) from the uncertain dataset by considering the size of a sequence, which can provide a fair measure of the patterns than the previous works. First, a baseline potentially high average-utility sequential pattern algorithm and three pruning strategies are introduced to completely mine the set of the desired PHAUSPs. To reduce the computational cost and accelerate the mining process, a projection algorithm called PHAUP is then designed, which leads to a reduction in the size of candidates of the desired patterns. Several experiments in terms of runtime, number of candidates, memory overhead, number of discovered pattern, and scalability are then evaluated on both real-life and artificial datasets, and the results showed that the proposed algorithm achieves promising performance, especially the PHAUP approach. [ABSTRACT FROM AUTHOR]