Govind Jha

Internet contains huge information that is accessible worldwide. If we have any query we just go to some search engine like Google, yahoo etc; type our query and we get the links on the internet then we browse through them to find the content of our interest. That means after searching on the internet we again search (better say we do re-search) in the documents or web pages to get the required information.  So, this paper is based on removing/minimizing the latter part of searching i.e. you simply type a query and it will extract the information of your interest. This will be done by making a Search Engine in which the system will collect the results from the internet by searching in the web pages available online and then extract the information of user interest and recommend.

Trustworthy recommendation of a movie is a highly complex task for the entertainment industry wherein trust is s a crucial metric of recommendation systems. It depends upon various factors, such as preferences, reviews, emotions, promotions and sentiments. However, these factors are specific to individuals and may vary from person to person. Additionally, the data collected for movie recommendations suffer from data sparsity and cold start problems. Previous studies on movie recommendations have failed to be trustworthy because their performance is greatly affected by fake ratings, data sparsity, and cold start problems. Also, the existing models of Recommender Systems (RS) do not consider the trust score and the user’s rating criterion. Keeping this in view, in this paper, the rating and ranking criteria with a trust score of different users is incorporated into the proposed machine learning-based RS models to ensure the trustworthiness of the system. In particular, one can notice that the most relevant viewers have the same taste and preferences. So, the bipartite relationship between the movie and the viewer has been interpreted through the inversion similarity concept which is used to design an efficient and trustworthy movie recommendation model for a community of viewers. The proposed model uses a learning algorithm to measure the trust score of recommendations and also performs cluster analysis to identify the groups having similar behavior in their communities. The information extracted from the cluster analysis identifies the user’s pattern of movie watching and predicts their movie selection behavior. We have performed extensive experiments to find and compare the performance of the proposed models with other existing models. The results of the experiments demonstrated the better performance of proposed models and supported the claim.

Local Outlier Factor (LOF) is an important and well known density based outliers handling algorithm, which quantifies, how much an object is outlying, in a given database. In this paper first we discuss LOF then we introduce the concept of ARDV. In LOF there is a concept of lrd (local reachability density). If in place of lrd we calculate ard (average reachability distance) and in place of LOF we calculate variance in ard (ARDV) then experimental results show that percentage of detecting correct outliers increases without increasing time complexity. Definition 2 (k-distance neighborhood of an object p represented as Nk(p)):this is the total no of object whose distance from p is not greater than the kdistance.

... QoS-TORA: A TORA Based QoS Routing Algorithm Govind Kumar Jha, Neeraj Kumar, HimanshuSharma, and KG Sharma Assistant Professor, GLA University Mathura gvnd.jha@gmail.com, javaneeraj@gmail.com, himanshusharma19@gmail.com, hollyhoc@gmail.com ...

This paper deals with natural language interface which accepts a query in natural language and provide answers in the textual form. The paper presents an interface module that converts user's query given in natural language into a corresponding database command. ...

Visual Cryptography is an encryption technique used to hide visual information in such a way that it can be decrypted by the human visual system, without using any decryption algorithm. There exist various schemes like digital watermarking algorithm etc. ...