Internet of Things (IoT) has provided a promising opportunity to build powerful industrial systems and applications by leveraging the growing ubiquity of radio-frequency identification (RFID), and wireless, mobile, and sensor devices. A wide range of industrial IoT applications have been developed and deployed in recent years. In an effort to understand the development of IoT in industries, this paper reviews the current research of IoT, key enabling technologies, major IoT applications in industries, and identifies research trends and challenges. A main contribution of this review paper is that it summarizes the current state-of-the-art IoT in industries systematically.

Internet of Things in Industries: A Survey

Understandable Big Data

A hybrid solution for privacy preserving medical data sharing in the cloud environment

Emerging information technologies for enhanced healthcare

The Internet-based recruiting platforms become a primary recruitment channel in most companies. While such platforms decrease the recruitment time and advertisement cost, they suffer from an inappropriateness of traditional information retrieval techniques like the Boolean search methods. Consequently, a vast amount of candidates missed the opportunity of recruiting. The recommender system technology aims to help users in finding items that match their personnel interests; it has a successful usage in e-commerce applications to deal with problems related to information overload efficiently. In order to improve the e-recruiting functionality, many recommender system approaches have been proposed. This article will present a survey of e-recruiting process and existing recommendation approaches for building personalized recommender systems for candidates/job matching.
		
			 
		
			Key words: Recommender systems, collaborative filtering, content-based filtering, hybrid approach, machine learning, e-recruiting, similarity measure.

/pdf/a-survey-of-job-recommender-systems-d3ipmadqa8.pdf

A survey of job recommender systems

Collaborative filtering is now successfully applied to recommender systems. The availability of extensive personal data is necessary for generating high quality recommendations. However, traditional collaborative filtering methods suffer from sparse and sometimes cold-start problems, particularly for newly deployed recommenders. Currently, several recommender systems exist in good working order, and data collected from these existing systems should be valuable for newly deployed recommenders. This paper introduces a privacy preserving shared collaborative filtering problem in order to leverage the data from other parties (contributors) to improve its own (beneficiaries) collaborative filtering performance, with the privacy protected under a differential privacy framework. It proposes a two-step methodology to solve this problem. First, item-based neighborhood information is selected as the shared data from the contributor with guaranteed differential privacy, and a practical enforcement mechanism for differential privacy is proposed. Second, two novel algorithms are developed to enable the beneficiary to leverage the shared data to support improved collaborative filtering. The extensive experimental results show that the proposed methodology can increase the recommendation accuracy of the beneficiary significantly while preserving data privacy for the contributors.

Enforcing Differential Privacy for Shared Collaborative Filtering

The vision of the Semantic Web is to build a global Web of machine-readable data to be consumed by intelligent applications. As the first step to make this vision come true, the initiative of linked open data has fostered many novel applications aimed at improving data accessibility in the public Web. Comparably, the enterprise environment is so different from the public Web that most potentially usable business information originates in an unstructured form (typically in free text), which poses a challenge for the adoption of semantic technologies in the enterprise environment. Considering that the business information in a company is highly specific and centred around a set of commonly used concepts, this paper describes a pilot study to migrate the concept of linked data into the development of a domain-specific application, i.e. the vehicle repair support system. The set of commonly used concepts, including the part name of a car and the phenomenon term on the car repairing, are employed to build the ...

Exploiting semantic linkages among multiple sources for semantic information retrieval

This paper proposes a Fully Automatic Categorization approach for Text (FACT) by exploiting the semantic features from WordNet and document clustering. In FACT, the training data is constructed automatically by using the knowledge of the category name. With the support of WordNet, it first uses the category name to generate a set of features for the corresponding category. Then, a set of documents is labeled according to such features. To reduce the possible bias originating from the category name and generated features, document clustering is used to refine the quality of initial labeling. The training data are subsequently constructed to train the discriminative classifier. The empirical experiments show that the best performance of FACT can achieve more than 90% of the baseline SVM classifiers in F1 measure, which demonstrates the effectiveness of the proposed approach.

Fully Automatic Text Categorization by Exploiting WordNet

Data sharing in today's information society poses a threat to individual privacy and organisational confidentiality. k-anonymity is a widely adopted model to prevent the owner of a record being re-identified. By generalising and/or suppressing certain portions of the released dataset, it guarantees that no records can be uniquely distinguished from at least other k−1 records. A key requirement for the k-anonymity problem is to minimise the information loss resulting from data modifications. This article proposes a top-down approach to solve this problem. It first considers each record as a vertex and the similarity between two records as the edge weight to construct a complete weighted graph. Then, an edge cutting algorithm is designed to divide the complete graph into multiple trees/components. The Large Components with size bigger than 2k−1 are subsequently split to guarantee that each resulting component has the vertex number between k and 2k−1. Finally, the generalisation operation is applied on the vertices in each component i.e. equivalence class to make sure all the records inside have identical quasi-identifier values. We prove that the proposed approach has polynomial running time and theoretical performance guarantee Ok. The empirical experiments show that our approach results in substantial improvements over the baseline heuristic algorithms, as well as the bottom-up approach with the same approximate bound Ok. Comparing to the baseline bottom-up Ologk-approximation algorithm, when the required k is smaller than 50, the adopted top-down strategy makes our approach achieve similar performance in terms of information loss while spending much less computing time. It demonstrates that our approach would be a best choice for the k-anonymity problem when both the data utility and runtime need to be considered, especially when k is set to certain value smaller than 50 and the record set is big enough to make the runtime have to be taken into account.

Yu Zhao

Papers

Enforcing Differential Privacy for Shared Collaborative Filtering

Exploiting semantic linkages among multiple sources for semantic information retrieval

Fully Automatic Text Categorization by Exploiting WordNet

A top-down approach for approximate data anonymisation

Repairing and reasoning with inconsistent and uncertain ontologies