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]

This paper investigates the semantic modeling of smart cities and proposes two ontology matching frameworks, called Clustering for Ontology Matching‐based Instances (COMI) and Pattern mining for Ontology Matching‐based Instances (POMI). The goal is to discover the relevant knowledge by investigating the correlations among smart city data based on clustering and pattern mining approaches. The COMI method first groups the highly correlated ontologies of smart‐city data into similar clusters using the generic k‐means algorithm. The key idea of this method is that it clusters the instances of each ontology and then matches two ontologies by matching their clusters and the corresponding instances within the clusters. The POMI method studies the correlations among the data properties and selects the most relevant properties for the ontology matching process. To demonstrate the usefulness and accuracy of the COMI and POMI frameworks, several experiments on the DBpedia, Ontology Alignment Evaluation Initiative, and NOAA ontology databases were conducted. The results show that COMI and POMI outperform the state‐of‐the‐art ontology matching models regarding computational cost without losing the quality during the matching process. Furthermore, these results confirm the ability of COMI and POMI to deal with heterogeneous large‐scale data in smart‐city environments. [ABSTRACT FROM AUTHOR]