No abstract

Big data is an idea of informational collections that depicts huge measure of information and complex that conventional information preparing application program is lacking to manage them. Presently, big data is a widely known domain used in research, academic, and industries. It is utilized to store substantial measure of information in a solitary brought together one. Challenges integrate capture, allocation, analysis, information precise, visualization, distribution, interchange, delegation, inquiring, updating and information protection. In this digital world, to put away the information and recovering the data is enormous errand for the huge organizations and some time information ought to be misfortune due to circulated information putting away. For this issue the organization individuals are chosen to actualize the huge information to put away every one of the information identified with the organization they are put away in one enormous database that is known as large information. Remote sensor is a science getting data used to distinguish the items or break down the range from a separation. It is anything but difficult to discover the question effortlessly with the sensor. It makes geographic data from satellite and sensor information so in this paper dissect what are the structures are utilized for remote sensor in huge information and how the engineering is vary from each other and how they are identify with our investigations. This paper depicts how the calamity happens and figuring consequence of informational collection. And applied a seismic informational collection to compute the tremor calamity in view of classification and clustering strategy. The classical data mining algorithms for classification used are k-nearest, naive bayes and decision table and clustering used are hierarchical, make density based and simple k_means using XLMINER and WEKA tool. This paper also helps to predicts the spatial dataset by applying the XLMINER AND WEKA tool and thus the big spatial data can be well suited to this paper.

Purpose In today’s world, the recommender systems are very valuable systems for the online users, as the World Wide Web is loaded with plenty of available information causing the online users to spend more time and money. The recommender systems suggest some possible and relevant recommendation to the online users by applying the recommendation filtering techniques to the available source of information. The recommendation filtering techniques take the input data denoted as the matrix representation which is generally very sparse and high dimensional data in nature. Hence, the sparse data matrix is completed by filling the unknown or missing entries by using many matrix completion techniques. One of the most popular techniques used is the matrix factorization (MF) which aims to decompose the sparse data matrix into two new and small dimensional data matrix and whose dot product completes the matrix by filling the logical values. However, the MF technique failed to retain the loss of original information when it tried to decompose the matrix, and the error rate is relatively high which clearly shows the loss of such valuable information. Design/methodology/approach To alleviate the problem of data loss and data sparsity, the new algorithm from formal concept analysis (FCA), a mathematical model, is proposed for matrix completion which aims at filling the unknown or missing entries without loss of valuable information to a greater extent. The proposed matrix completion algorithm uses the clustering technique where the users who have commonly rated the items and have not commonly rated the items are captured into two classes. The matrix completion algorithm fills the mean cluster value of the unknown entries which well completes the matrix without actually decomposing the matrix. Findings The experiment was conducted on the available public data set, MovieLens, whose result shows the prediction error rate is minimal, and the comparison with the existing algorithms is also studied. Thus, the application of FCA in recommender systems proves minimum or no data loss and improvement in the prediction accuracy of rating score. Social implications The proposed matrix completion algorithm using FCA performs good recommendation which will be more useful for today’s online users in making decision with regard to the online purchasing of products. Originality/value This paper presents the new technique of matrix completion adopting the vital properties from FCA which is applied in the recommender systems. Hence, the proposed algorithm performs well when compared to other existing algorithms in terms of prediction accuracy.

No abstract

No abstract