MOBI CONTEXT : A CONDITION-AWARE FOR CLOUD- BASED TRUST PREPOSITIONS STRUCTURE

69 | P a g e

MOBI CONTEXT : A CONDITION-AWARE FOR

CLOUD-BASED TRUST PREPOSITIONS STRUCTURE

1

V.Srinivasulu

,

2

A Geetha,

3

Dr. Bhaludra Raveendranadh Singh

1

Pursuing M.Tech (CSE),

2

Associate Professor,

3

Professor & Principal ,

Visvesvaraya College of Engineering and Technology,M.P Patelguda, Ibrahimpatnam

(M),Ranga Reddy (D) , Telangana, (India)

ABSTRACT

A Recommendation system has seen significant evolution in the field of knowledge engineering. Most of the present recommendation systems primarily based their models on co-operative filtering approaches that build them straight forward to implement. However, performance of most of the present cooperative filtering-based recommendation system suffers attributable to the challenges, such as: (a) cold begin, (b) knowledge sparseness, and (c) quantifiability. Moreover, recommendation drawback is usually characterized by the presence of the many conflicting objectives or call variables, like users’ preferences and venue closeness.

during this paper, we have a tendency to planned MobiContext, a hybrid cloud-based Bi-Objective Recommendation Framework (BORF) for mobile social networks. The MobiContext utilizes multi-objective improvement techniques to come up with personalized recommendations. To deal with the problems concerning cold begin and knowledge meagreness, the BORF performs knowledge pre-processing by mistreatment the Hub-Average (HA) abstract thought model. Moreover, the Weighted Sum Approach (WSA) is enforced for scalar improvement associate degreed an organic process algorithmic program (NSGA-II) is applied for vector improvement to supply optimum suggestions to the users a couple of venue. The output of comprehensive experiments on a large-scale real data-set make certain the accuracy of the planned recommendation framework.

Keywords:Multi-objective optimization, Collaborative Filtering (CF), Non-dominated Sorting

Genetic Algorithm (NSGA-II).

I. INTRODUCTION

Most of the present recommendation systems based mostly their models on cooperative filtering approaches that build them easy to implement the current fast growth of the net and straightforward convenience of diverse e -

commerce and social networks services, like Amazon, Face book, and Gowalla, have resulted within the sheer

volume of knowledge collected by the service suppliers on commonplace. the continual accumulation of huge

volumes info has shifted the main focus of analysis community from the fundamental data retrieval drawback to the filtering of relevancy information , thereby creating it additional relevant and customized to user’s question

70 | P a g e

autonomous data retrieval systems, referred to as Recommendation Systems Recommendation systems are

Associate in Nursing more rising as an integral part of e - business applications. For instance, the integrated recommendation system of Amazon provides customers with customized recommendations for varied things of interest. Recommendation systems utilize varied data discovery techniques on a user’s historical information and current context to advocate product and services that best match the user’s preferences. In recent years,

emergence of diverse mobile social networking services, such as, Face book and Google Latitude has

considerably gained the attraction of an oversized variety of subscribers. A mobile social networking service

permits a user to perform a check -in that's little feedback concerning the place visited by the user. Sizable

amount of check- INS on daily bases ends up in the buildup of huge volumes of knowledge. Supported the

information keep by such services, many Venue -based Recommendation Systems (VRS) were developed. Such systems are designed to perform recommendation of venues to users that the majority closely match with users’

preferences. Despite having terribly promising options, the VRS suffer with various limitations and challenges

A major analysis challenge for such systems is to method information at the important - time and extract most

well-liked venues from a massively large and numerous dataset of users’ historical check - ins. more quality to

the matter is side by conjointly taking into the account the real -time discourse data, such as: (a) venue choice. Supported user’s personal preferences and (b) venue closeness based mostly on geographic data.

Recommendation systems are increasingly emerging as an integral component of e - business applications. For

instance, the integrated recommendation system of Amazon provides customers with personalized recommendations for various items of interest. Recommendation systems u utilize various knowledge discovery techniques on a user’s historical data and current context to recommend products and services that best match the user’s preferences. In recent years, emergence of numerous mobile social networking services,

such as, Face book and GoogleLatitude has significantly gained the attraction of a large number of subscribers. A mobile social networking service allows a user to perform a “check - in” that is a small feedback about the

place visited by the user . Large number of checking on daily bases results in the accumulation of massive

volumes of data. Based on the data stored by such services, several Venues - based Recommendation Systems

(VRS) were developed. Such systems are designed to perform recommendation of venues to users that most closely match with users’ preferences. Despite having very promising features, the VRS suffer with numerous

limitations and challenges . A major research challenge for such systems is to process data at the real - time and

72 | P a g e

III. CLOUD COMPUTING

Sure Cloud computing, additionally on-demand computing may be a quite Internet-based computing that has

shared process resources and information to computers and alternative devices on demand. it's a model for

ennobling present, on-demand access to a shared pool of configurable computing resources (e.g., networks,

servers, storage, applications and services), which may be chop-chop provisioned and free with minimal

management effort. Cloud computing and storage solutions give users and enterprises with varied capabilities to

store and method their information in third-party information centers. It depends on sharing of resources to

attain coherence and economy of scale, the same as a utility (like the electricity grid) over a network. Advocates claim that cloud computing permits corporations to avoid direct infrastructure prices, and concentrate on comes

that differentiate their businesses rather than on infrastructure. Proponents additionally claim that cloud

computing permits enterprises to urge their applications up and running quicker, with improved manageableness

and fewer maintenance, and allows IT to faster modify resources to satisfy unsteady and unpredictable business

demand. Cloud suppliers generally use a "pay as you go" model. This could cause unexpectedly high charges if

directors don't adapt to the cloud valuation model

Advantages of virtual machines:

1. Run operating systems where the physical hardware is unavailable,

2. Easier to create new machines, backup machines, etc.,

3. Software testing using “clean” installs of operating systems and software,

4. Emulate more machines than are physically available,

5. Timeshare lightly loaded systems on one host,

6. Debug problems (suspend and resume the problem machine),

7. Easy migration of virtual machines (shutdown needed or not).

The use of the cloud provides a number of opportunities:

 It permits services to be used with none understanding of their infrastructure.

Cloud computing works exploitation economies of scale:

a. It probably lowers the outlay expense for kick off firms, as they now ought not to obtain their own computer

code or servers.

B. price would be by on-demand valuation.

c. Vendors and repair suppliers claim prices by establishing associate degree current revenue stream. Data and services are keep remotely however accessible from “anywhere”

1. many of the activities loosely sorted along underneath cloud computing have already been happening and centralized computing activity isn't a brand new phenomenon

2. Grid Computing was the last research-led centralized approach

3. However there are issues that the thought adoption of cloud computing may cause several issues for users

4. Many new open supply systems showing that you simply will install and run on your native clustershould be

ready to run a spread of applications on these systems

73 | P a g e

In the past, most work focused on trajectory-based approaches for venue recommendation systemwe propose a

cloud-based framework consisting of bi-objective improvement strategies named as CF-BORF and

greedy-BORF. The Genetic algorithmic based BORF (GA-BORF) utilizes Non-dominated Sorting Genetic algorithmic program (NSGA-II) to optimize the venue recommendation drawback. We tend to introduce a pre-processing

section that performs knowledge refinement victimization angular distance. we tend to perform in depth

experiments on our internal Open Nebula cloud setup running on ninety six core Super small Super Server

SYS-7047GR-TRF systems. The experiments were conducted on real-world “Gowalla” dataset. The trajectory based approaches record information about a user’s visit pattern (in the form of GPS coordinates) to various locations,

the routes taken, and dwell times. The authors in applied data mining and machine learning on trajectory data to

recommend most popular places. Although, trajectory-based approaches recommend locations to users based on their past trajectories, a major drawback of such approaches is that they are unable to simultaneously consider

other influential factors apart from simple GPS trace that makes them produce less optimal recommendations.

To address such deficiency, we utilizedmulti-objective optimization in our proposed framework. Another issue

is that the trajectory-basedapproaches suffer from data sparseness problem as usually a person does not

frequently visits many places, which results in sparse user-venue matrix. Moreover, the trajectory based

approaches suffer from scalability issues as huge volumes of trajectory data needs to be processed causing

considerable overhead. Some of the approaches, such as are based on the online ratings provided by the users to the visited places. The authors in combine the available venue ratings with users’ social ties recommend venues that are high-ranked as well as most preferred by a user’s friends. However, the authors did not compare their

approach with any of the baseline approaches, and does not discuss complexity of their work. The aforementioned approaches perform different modeling to users’ preferences, but they are not considering

multiple objectives that we specifically considered in our study. Moreover, they also suffer from data sparseness

issues due to limited number of entries within the user-rating matrix. Apart from rating based approaches, few of

the techniques have their models built on check-in based .

Approaches where the users provide small feedbacks as check-ins about the places they visited For example, the

authors in [applied random-walk-with- restart on a user-venue check-in matrix to generate personalized recommendations. Most of the above mentioned approaches have their designs built on memory-based CF that

enables such approaches to provide recommendations to users on the basis of their pastentries. However, such

approaches suffer from common drawbacks of memory-based CF (e.g. cold start and data sparsity) which

reduce their performance. Moreover, large number of similarity computations on user-to-venue matrix makes

such approaches less scalable. There has been some limited work performed on applying multi-objective

optimization on recommendation systems. One such contribution is by Ribeiroetal.where authors performed a weighted combination of numerous recommendation algorithms and applied optimization to find appropriate

weights for the constituent algorithms. However, their approach is computation intensive and no time complexity was discussed. To address the issues cited above, we proposed a hybrid approach over a cloud

architecture that combines the benefits of memory-based and model-based collaborative filtering along with

multi-objective optimization to obtain an optimal list of venues to be recommended. Moreover, our proposed

74 | P a g e

functionality of the proposedMobiContext framework. The frequently used acronyms in this paper are listed Table 1. In terms of functionality, MobiContext framework has two main phases: (a) a pre-processing phase and (b) a recommendation phase. The detailed description of theabovementioned phases is presented in the

following subsequent sections.

Existing System:

In recent years, recommendation systems have seen important evolution within the field of data engineering.

Most of the prevailing recommendation systems based mostly their models on cooperative filtering approaches

that create them easy to implement. However, performance of most of the prevailing cooperative filtering-based

recommendation system suffers owing to the challenges, such as: (a) cold begin, (b) information scantiness, and

(c) quantifiability. Moreover, recommendation downside is usually characterised by the presence of the many conflicting objectives or call variables, like users’ preferences and venue closeness.

Existing Method disadvantages:

The cold start problem occurs when a recommendation system has to suggest venues to the user that is newer to

the system. Insufficient check-ins for the new userresultsin zero similarity value that degrades the performance

of the recommendation system. The only way for the system to provide recommendation in such scenario is to

wait for sufficient check-ins by the user at different venues.

Many existing recommendation systems suffer from data sparseness problem that occurs when users have

visited only a limited number of venues. This results into as parsley filled user-to-venue check-in matrix. The

sparseness of such matrix creates difficulty in finding sufficient reliable similar users to generate good quality recommendation.

Proposed System:

We propose a cloud-based framework consisting of bi-objective improvement strategies named as CF-BORF

and greedy-BORF. The Genetic algorithmic program primarily based BORF (GA-BORF) utilizes

Non-dominated Sorting Genetic algorithmic program (NSGA-II) to optimize the venue recommendation drawback.

we tend to introduce a pre-processing section that performs knowledge refinement victimization angular

distance. we tend to perform in depth experiments on our internal Open Nebula cloud setup running on ninety

six core Super small Super Server SYS-7047GR-TRF systems. The experiments were conducted on real-world “Gowalla” dataset.

Advantages of Proposed Methods:

Most of the existing recommendation systems utilize centralized architectures that are not scalable enough to

process large volume of geographically distributed data. The centralized architecture for venue recommendations must simultaneously consider users’ preferences, check-in history, and social context to

generate optimal venue recommendations. Therefore, to address the scalability issue, we introduce the

decentralized cloud-based MobiContext BORF approach.Memory Efficiency.

75 | P a g e

We projected a cloud-based framework MobiContext hat produces optimized recommendations by at the same

time considering the trade-offs among real-world physical factors, like person’s geographical location and placement closeness. the importance and novelty of the projected framework is that the adaptation of

cooperative filtering and bi-objective improvement approaches, like scalar and vector. In our projected

approach, information meagreness issue is self-addressed by desegregation the user-to-user similarity

computation confidently live that quantifies the number of comparable interest indicated by the 2 users within

the venues ordinarily visited by each of them. Moreover, an answer to cold begin issue is mentioned by

introducing the hour angle reasoning model that assigns ranking to the users and incorporates a precompiled set

of fashionable unvisited venues that may be counselled to the new user.

V FEATURE ENHANCEMENT

In the future, we prefer to extend our work by incorporating a lot of discourse data within the type of objective

functions, such as the check-in time, users’ profiles, and interests, in our proposed framework. Moreover, we

intend to integrate other approaches, such as machine learning, text mining, and artificial neural networks to

refine our existing framework.

REFERENCES

[1] A. Majid, L. Chen, G. Chen, H. Turab, I. Hussain, and J. Woodward, “A Context-aware Personalized Travel

Recommendation System based on Geo-tagged Social Media Data Mining,” International Journal of Geographical Information Science, pp. 662-684, 2013.

[2] M. Ye, P. Yin, and W. Lee, “Location recommendation for location - based social networks,” In

Proceedings of the 18th SIGSPATIAL International Conference on Advances in Geographic Information Systems , ACM, pp. 458 -461, 2010.

[3] Y. Zheng, L. Zhang,X. Xie, and W.Y. Ma, “Mining interesting locations and travel sequences from gps trajectories,” In Proceedings of the 18thinternational conference on World wide web, ACM, pp. 791-800,

2009.

[4] C. Chow, J. Bao, and M. Mokbel, “Towards Location-Based Social Networking Services,” In Proceedings

of the 2nd ACM SIGSPATIAL International Workshop on Location Based Social Networks , ACM, pp. 31 - 38, 2010.

[5] P. G. Campos, F. Díez, I. Cantador, “Time-aware Recommender Systems: A Comprehensive Survey and Analysis of Existing Evaluation Protocols,” User Modeling and User-Adapted Interaction, vol. 24,

no.1-2, pp. 67-119, 2014.

[6] A. Noulas, S. Scellato, N. Lathia, and C. Mascolo, “A Random Walk around the City: New Venue

76 | P a g e

[7] Y. Doytsher, B. Galon, and Y. Kanza, “Storing Routes in Sociospatial Networks and Supporting

Social-based Route Recommendation,” In Proceedings of 3rd ACM SIGSPATIAL International Workshop on

Location-Based Social Networks, ACM, pp. 49-56, 2011.

[8] S. Seema, and S. Alex, “Dynamic Bus Arrival Time Prediction, using GPS Data,” In Proceedings of the Nat.

Conference Technological Trends (NCTT), pp. 193-197, 2010.

[9] B. Chandra, S. Bhaskar, “Patterned Growth Algorithm using Hub-Averaging without Pre-assigned Weights,”

In Proceeding of IEEE International Conference on Systems, man, and Cybernetics (SMC), pp.3518-3523, 2010.

[10] B. Hidasi, and D. Tikk, “Initializing Matrix Factorization Methods on Implicit Feedback Database,”

Journal of Universal Computer Science, vol. 19, no. 12, pp. 1835-1853, 2013.

[11] C. Chitra and P. Subbaraj, “A Non-dominated Sorting Genetic Algorithm for Shortest Path Routing Problem in Computer Networks,” Expert Systems with Applications, vol. 39, no. 1, pp. 1518-1525, 2012

[12] Y. Wang, S. Wang, N. Stash, L. Aroyo, and G. Schreiber, “Enhancing Content-Based Recommendation with the Task Model of Classification,” In Proceedings of the Knowledge and Management, pp.

431-440, 2010.

[13] J. Bobadilla, F. Ortega, A. Hernando, A. Gutiérrez, “Recommender Systems Survey,” Knowledge-Based Systems, vol. 46, pp. 109-, 2013.

[14] J. Bao, Y. Zheng, M.F. Mokbel, “Location -based and Preference Aware Recommendation using Sparse

Geo-Social NetworkingData,” In Proceeding of 20th International Conference on Advances in

Geographic Information Systems, ACM New York, pp.199208, 2012.

[15] M. Ribeiro, A. Lacerda, A. Veloso, and N. Ziviani, “Pareto- Efficient Hybridization for Multi-objective

Recommender Systems,”InProceeding of 6th ACM Conference on Recommender Systems, pp. 19-26,

2012.

[16] K. Deb, A. Pratap, S. Agarwal, and T. Meyarivan, “A Fast and Elitist Multi-objective Genetic Algorithm:

NSGA-II,” IEEE Transaction on Evolutionary Computations, vol. 6, no. 2, pp. 182- 197, 2002.

[17] H. Nasiri, M. Maghfoori, “Multiobjective Weighted Sum Approach Model reduction by Routh-Pade

approximation using Harmony Search,” Turkish Journal of Electrical Engineering and Computer

Science, vol. 21, no. 2,pp. 2283-2293, 2013.

[18] J. Abimbola, “A Non-linear Weights Selection in Weighted Sum Information, vol. 27, no. 3, 2012.

[19] Paired t test. Wiley Encyclopedia of Clinical Trials, 2008.

AUTHOR DETAILS

V.SRINIVASULU

77 | P a g e

MRS.A.GEETHA

Mrs. A.Geetha completed Bachelor of Technology from Bhojreddy college of engineering and Post Graduation from Sreedatta institute of science and technology and is having 11 years of teaching experience.Working as Assoct. Professor (CSE)in Visvesvaraya College of Engineering and Technology, M.P Patelguda, Ibrahimpatnam (M), Ranga Reddy (D), and India.

Sri. Dr. Bhaludra Raveendranadh Singh

M.Tech,Ph.D.(CSE),MISTE,MIEEE(USA),MCSI