Prediction Techniques in Internet of Things (IoT) Environment: A Comparative Study

Socialization and Personalization in Internet of Things (IOT) environment are the current trends in computing research. Most of the research work stresses the importance of predicting the service & providing socialized and personalized services. This paper presents a survey report on different techniques used for predicting user intention in wide variety of IOT based applications like smart mobile, smart television, web mining, weather forecasting, health-care/medical, robotics, road-traffic, educational data mining, natural calamities, retail banking, e-commerce, wireless networks & social networking. As per the survey made the prediction techniques are used for: predicting the application that can be accessed by the mobile user, predicting the next page to be accessed by web user, predicting the users favorite TV program, predicting user navigational patterns and usage needs on websites & also to extract the users browsing behavior, predicting future climate conditions, predicting whether a patient is suffering from a disease, predicting user intention to make implicit and human-like interactions possible by accepting implicit commands, predicting the amount of traffic occurring at a particular location, predicting student performance in schools & colleges, predicting & estimating the frequency of natural calamities occurrences like floods, earthquakes over a long period of time & also to take precautionary measures, predicting & detecting false user trying to make transaction in the name of genuine user, predicting the actions performed by the user to improve the business, predicting & detecting the intruder acting in the network, predicting the mood transition information of the user by using context history, etc. This paper also discusses different techniques like Decision Tree algorithm, Artificial Intelligence and Data Mining based Machine learning techniques, Content and Collaborative based Recommender algorithms used for prediction

Clustering in Recommendation Systems Using Swarm Intelligence

Ένα σύστημα συστάσεων είναι μία εφαρμογή που εκμεταλλεύεται πληροφορίες για να βοηθήσει τους χρήστες στη λήψη αποφάσεων προτείνοντας αντικείμενα που μπορεί να τους αρέσουν. Ένα σύστημα συστάσεων που βασίζεται στην τεχνική του συνεργατικού φιλτραρίσματος (collaborative filtering) δημιουργεί συστάσεις στους χρήστες με βάση τις προτιμήσεις παρόμοιων χρηστών. Ωστόσο, αυτός ο τύπος συστήματος συστάσεων δεν είναι τόσο αποτελεσματικός όταν τα δεδομένα αυξάνονται σε μεγάλο βαθμό (scalability) ή όταν δεν υπάρχει αρκετή πληροφορία (sparsity), καθώς δεν ομαδοποιούνται σωστά οι παρόμοιοι χρήστες. Αυτή η διπλωματική εργασία προτείνει τρείς υβριδικούς αλγορίθμους που ο καθένας συνδυάζει τον αλγόριθμο k-means με έναν αλγόριθμο ευφυΐας σμήνους για να βελτιώσει την ομαδοποίηση των χρηστών, και κατ’ επέκταση την ποιότητα των συστάσεων. Οι αλγόριθμοι ευφυΐας σμήνους που χρησιμοποιούνται είναι o αλγόριθμος τεχνητής κοινωνίας μελισσών (artificial bee colony), ο αλγόριθμος βελτιστοποίησης αναζήτησης κούκων (cuckoo search optimization) και ο αλγόριθμος βελτιστοποίησης γκρίζων λύκων (grey-wolf optimization). Οι προτεινόμενες μέθοδοι αξιολογήθηκαν χρησιμοποιώντας ένα σύνολο δεδομένων του MovieLens. Η αξιολόγηση δείχνει πως τα προτεινόμενα συστήματα συστάσεων αποδίδουν καλύτερα σε σύγκριση με τις ήδη υπάρχουσες τεχνικές όσον αφορά τις μετρικές του μέσου απόλυτου σφάλματος (mean absolute error - MAE), της ακρίβειας (precision), του αθροίσματος των τετραγωνικών σφαλμάτων (sum of squared errors - SSE) και της ανάκλησης (recall). Επιπλέον, τα αποτελέσματα της αξιολόγησης δείχνουν πως ο υβριδικός αλγόριθμος που χρησιμοποιεί την μέθοδο της τεχνητής κοινωνίας μελισσών αποδίδει ελαφρώς καλύτερα από τους άλλους δύο προτεινόμενους αλγορίθμους.A recommender system (RS) is an application that exploits information to help users in decision making by suggesting items they might like. A collaborative recommender system generates recommendations to users based on their similar neighbor’s preferences. However, this type of recommender system faces the data sparsity and scalability problems making the neighborhood selection a challenging task. This thesis proposes three hybrid collaborative recommender systems that each one combines the k-means algorithm with a different bio-inspired technique to enhance the clustering task, and therefore to improve the recommendation quality. The used bio-inspired techniques are artificial bee colony (ABC), cuckoo search optimization (CSO), and grey-wolf optimizer (GWO). The proposed approaches were evaluated over a MovieLens dataset. The evaluation shows that the proposed recommender systems perform better compared to already existing techniques in terms of mean absolute error (MAE), precision, sum of squared errors (SSE), and recall. Moreover, the experimental results indicate that the hybrid recommender system that uses the ABC method performs slightly better than the other two proposed hybrid algorithms

NEIGHBORHOOD-BASED APPROACH OF COLLABORATIVE FILTERING TECHNIQUES FOR BOOK RECOMMENDATION SYSTEM

Recommendation System or Recommender System help the user to predict the "rating" or "preference" a user would give to an item. Recommender systems in general helps the users to find content, products, or services (such as digital products, books, music, movie, TV programs, and web sites) by combining and analyzing suggestions from other users, which mean rating from various people, and users. These recommendation systems use analytic technology to calculate the results that a user is willing to purchase, and the users will receive recommendations to a product of their interest. The aim of the System is to provide a recommendation based on users likes or reviews or ratings. Recommendation system comprises of content based and collaborative based filtering techniques. In this paper, collaborative based filtering has been used to get the expected outcome. The expected outcome has been achieved through collaborative filtering with the help of correlation techniques which in turn comprises of Pearson correlation, cosine similarity, Kendall’ s Tau correlation, Jaccard similarity, Spearman Rank Correlation, Mean-squared distance, etc. This paper tells about which similarity metrics such us Pearson correlation (PC), constrained Pearson correlation (CPC), spearman rank correlation (SRC) which is good in the context of book recommendation system and then applied with neighborhood algorithm

Genetic Algorithm based Cluster Head Selection for Optimimized Communication in Wireless Sensor Network

Wireless Sensor Network (WSNs) utilizes conveyed gadgets sensors for observing physical or natural conditions. It has been given to the steering conventions which may contrast contingent upon the application and system design. Vitality administration in WSN is of incomparable significance for the remotely sent vitality sensor hubs. The hubs can be obliged in the little gatherings called the Clusters. Clustering is done to accomplish the vitality effectiveness and the versatility of the system. Development of the group likewise includes the doling out the part to the hub based on their borders. In this paper, a novel strategy for cluster head selection based on Genetic Algorithm (GA) has been proposed. Every person in the GA populace speaks to a conceivable answer for the issue. Discovering people who are the best proposals to the enhancement issue and join these people into new people is a critical phase of the transformative procedure. The Cluster Head (CH) is picked using the proposed technique Genetic Algorithm based Cluster Head (GACH). The performance of the proposed system GACH has been compared with Particle Swarm Optimization Cluster Head (PSOCH). Simulations have been conducted with 14 wireless sensor nodes scattered around 8 kilometers. Results proves that GACH outperforms than PSOCH in terms of throughput, packet delivery ratio and energy efficiency

Swarm intelligence for clustering dynamic data sets for web usage mining and personalization.

Swarm Intelligence (SI) techniques were inspired by bee swarms, ant colonies, and most recently, bird flocks. Flock-based Swarm Intelligence (FSI) has several unique features, namely decentralized control, collaborative learning, high exploration ability, and inspiration from dynamic social behavior. Thus FSI offers a natural choice for modeling dynamic social data and solving problems in such domains. One particular case of dynamic social data is online/web usage data which is rich in information about user activities, interests and choices. This natural analogy between SI and social behavior is the main motivation for the topic of investigation in this dissertation, with a focus on Flock based systems which have not been well investigated for this purpose. More specifically, we investigate the use of flock-based SI to solve two related and challenging problems by developing algorithms that form critical building blocks of intelligent personalized websites, namely, (i) providing a better understanding of the online users and their activities or interests, for example using clustering techniques that can discover the groups that are hidden within the data; and (ii) reducing information overload by providing guidance to the users on websites and services, typically by using web personalization techniques, such as recommender systems. Recommender systems aim to recommend items that will be potentially liked by a user. To support a better understanding of the online user activities, we developed clustering algorithms that address two challenges of mining online usage data: the need for scalability to large data and the need to adapt cluster sing to dynamic data sets. To address the scalability challenge, we developed new clustering algorithms using a hybridization of traditional Flock-based clustering with faster K-Means based partitional clustering algorithms. We tested our algorithms on synthetic data, real VCI Machine Learning repository benchmark data, and a data set consisting of real Web user sessions. Having linear complexity with respect to the number of data records, the resulting algorithms are considerably faster than traditional Flock-based clustering (which has quadratic complexity). Moreover, our experiments demonstrate that scalability was gained without sacrificing quality. To address the challenge of adapting to dynamic data, we developed a dynamic clustering algorithm that can handle the following dynamic properties of online usage data: (1) New data records can be added at any time (example: a new user is added on the site); (2) Existing data records can be removed at any time. For example, an existing user of the site, who no longer subscribes to a service, or who is terminated because of violating policies; (3) New parts of existing records can arrive at any time or old parts of the existing data record can change. The user\u27s record can change as a result of additional activity such as purchasing new products, returning a product, rating new products, or modifying the existing rating of a product. We tested our dynamic clustering algorithm on synthetic dynamic data, and on a data set consisting of real online user ratings for movies. Our algorithm was shown to handle the dynamic nature of data without sacrificing quality compared to a traditional Flock-based clustering algorithm that is re-run from scratch with each change in the data. To support reducing online information overload, we developed a Flock-based recommender system to predict the interests of users, in particular focusing on collaborative filtering or social recommender systems. Our Flock-based recommender algorithm (FlockRecom) iteratively adjusts the position and speed of dynamic flocks of agents, such that each agent represents a user, on a visualization panel. Then it generates the top-n recommendations for a user based on the ratings of the users that are represented by its neighboring agents. Our recommendation system was tested on a real data set consisting of online user ratings for a set of jokes, and compared to traditional user-based Collaborative Filtering (CF). Our results demonstrated that our recommender system starts performing at the same level of quality as traditional CF, and then, with more iterations for exploration, surpasses CF\u27s recommendation quality, in terms of precision and recall. Another unique advantage of our recommendation system compared to traditional CF is its ability to generate more variety or diversity in the set of recommended items. Our contributions advance the state of the art in Flock-based 81 for clustering and making predictions in dynamic Web usage data, and therefore have an impact on improving the quality of online services

Living analytics methods for the social web

[no abstract

Genetic Algorithm based Cluster Head Selection for Optimimized Communication in Wireless Sensor Network

Wireless Sensor Network (WSNs) utilizes conveyed gadgets sensors for observing physical or natural conditions. It has been given to the steering conventions which may contrast contingent upon the application and system design. Vitality administration in WSN is of incomparable significance for the remotely sent vitality sensor hubs. The hubs can be obliged in the little gatherings called the Clusters. Clustering is done to accomplish the vitality effectiveness and the versatility of the system. Development of the group likewise includes the doling out the part to the hub based on their borders. In this paper, a novel strategy for cluster head selection based on Genetic Algorithm (GA) has been proposed. Every person in the GA populace speaks to a conceivable answer for the issue. Discovering people who are the best proposals to the enhancement issue and join these people into new people is a critical phase of the transformative procedure. The Cluster Head (CH) is picked using the proposed technique Genetic Algorithm based Cluster Head (GACH). The performance of the proposed system GACH has been compared with Particle Swarm Optimization Cluster Head (PSOCH). Simulations have been conducted with 14 wireless sensor nodes scattered around 8 kilometers. Results proves that GACH outperforms than PSOCH in terms of throughput, packet delivery ratio and energy efficiency

NEIGHBORHOOD-BASED APPROACH OF COLLABORATIVE FILTERING TECHNIQUES FOR BOOK RECOMMENDATION SYSTEM

Recommendation System or Recommender System help the user to predict the "rating" or "preference" a user would give to an item. Recommender systems in general helps the users to find content, products, or services (such as digital products, books, music, movie, TV programs, and web sites) by combining and analyzing suggestions from other users, which mean rating from various people, and users. These recommendation systems use analytic technology to calculate the results that a user is willing to purchase, and the users will receive recommendations to a product of their interest. The aim of the System is to provide a recommendation based on users likes or reviews or ratings. Recommendation system comprises of content based and collaborative based filtering techniques. In this paper, collaborative based filtering has been used to get the expected outcome. The expected outcome has been achieved through collaborative filtering with the help of correlation techniques which in turn comprises of Pearson correlation, cosine similarity, Kendall’ s Tau correlation, Jaccard similarity, Spearman Rank Correlation, Mean-squared distance, etc. This paper tells about which similarity metrics such us Pearson correlation (PC), constrained Pearson correlation (CPC), spearman rank correlation (SRC) which is good in the context of book recommendation system and then applied with neighborhood algorithm

A Hybrid Technique for Enhancing Data Security

The worldwide information and technology has an astounding dependency o n data s e c u r i t y . The r i s k fabricated by the interloper has been a maelstrom for forthcoming specialists. Security pl ay s an essential role in governing the data transfer. The primary objective of this paper is to propose a black box approach which generates a modified plain text from the original message. For this purpose, we have used techniques like Perturbation, Swapping and Shifting which will modify the original plain text. Before giving the plain text directly into encryption process, the m o d i f i e d plain text obtained f r o m above techniques will be given as an input. The complexity of breaking the plain text is increased by applying the above techniques. For experimental purpose, w e use AES algorithm for encryption and d e c r y p t i o n and Java is used for implementing t h e proposed a p p r o a c h . © 2018 Academic Press. All Rights Reserved