How to Calculate a People Review and Its Importance

Size: px
Start display at page:

Download "How to Calculate a People Review and Its Importance"

Transcription

1 Subjective Review-based Reputation Gianpiero Costantino, Charles Morisset, and Marinella Petrocchi IIT-CNR, Via Moruzzi 1, Pisa, Italy ABSTRACT The choice of a product or a service is often influenced by its reputation, which is usually calculated from existing reviews of this product or service. A review can be either objective, for instance when referring to concrete features of a product, or subjective, for instance when referring to the feeling of the reviewer about one aspect. Subjective reviews are potentially biased by the characteristics of the reviewers, and therefore two subjective reviews should not be treated equally. We propose in this paper a model of reputation compensating the subjective bias of different categories of reviewers. We firstly calculate this bias by analyzing the ratio between reviews coming from different categories, and then we project a subjective reputation for a given category of reviewer. We demonstrate the accuracy of our bias calculation with an experimentation on public reviews for hotels, and two specific categories of users. Keywords Reputation, Compensation, Review 1. INTRODUCTION The choice of a service (or product) is often guided by the reputation associated with this service, which can be provided by different sources from the Internet. These sources usually offer a mechanism for previous users to submit a review concerning this service, and aggregate these reviews in order to calculate a reputation score, which in turn provides a classification allowing a user to select the best service. A review could consist of multiple parameters. Popular websites giving traveler advice, such as Booking.com, offer the possibility to review hotels based, for instance, on cleanness, staff, or location. The target of the reviews will obtain The research leading to these results has received funding from the European Union Seventh Framework Programme (FP7/ ) under grant no (Aniketos) and under grant no (NESSoS). Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. To copy otherwise, to republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. SAC 12 March 25-29, 2012, Riva del Garda, Italy. Copyright 2011 ACM /12/03...$ an overall score due to the elaboration of the reviews on the single parameters. Depending on the parameters involved, a review can either be objective or subjective. An objective review usually concerns facts or features of the service, that are observed by the reviewer, and that are not subject to interpretation. For instance, a review concerning an airline can include the number of flight delays the reviewer had to go through. Whether the reviewer is a businessman or a backpack traveler, the number of delays this reviewer has suffered is the same. A user consulting the reviews for this airline can then calculate, statistically speaking, the probability she will experience a flight delay if she flies with this airline. On the other hand, a subjective review contains the appreciation of the reviewer on some features of the service. The major difference with an objective review is that the subjective review can vary according to the typology of the reviewer. For instance, on a scale of five stars, a businessman used to travel with high-standards airlines, with as few delays as possible, might rate the punctuality of an airline with one flight delayed over ten as two stars. However, a backpack traveler used to travel with budget airlines might give four stars for the punctuality of the same airline. In other words, for the same observation, two different reviewers might give two different reviews. When a user consults the global score for this airline, she is given the average of the two previous subjective reviews, and so a punctuality score of three stars. However, this value is not necessarily meaningful: if the user is a backpack traveler, she will rather be interested in the review given by the backpack traveler, and similarly if she is a businesswoman. Most reputation providers permit to browse reputation scores by categories of reviewers, however, in some cases, there is no review provided by a given category. For instance, consider another airline for which there are only reviews from businessman: if a backpack traveler consults the reputation for such an airline, then she knows there might be a bias. Two questions arise from this simple example: the first one is whether it is possible or not to calculate automatically this bias, using previous reviews for similar services. In other words, given on the one hand the reviews of businessman travelers and backpack travelers on one airline, and on the other hand only the reviews of businessman travelers for another airline, whether it is possible to automatically calculate what would be the review of a backpack traveler for this airline. The second question is whether we can extend this calculation to define a notion of subjective reputation, that is, for a given category of users, compensating all the

2 reviews submitted by reviewers from another category in order to obtain a more accurate reputation. The main contribution of this paper is to introduce a model for subjective review-based reputation, which automatically calculates the bias between reviews from different categories, based on the analysis of existing reviews. This model is illustrated and validated on the example of hotel reviews, by considering two different categories of users, and we show how to project a review from one category based on a review from the other. We demonstrate that our projections brings more accuracy than relying only on the existing reviews. This paper is structured as follows. Section 2 recalls existing reputation models. In Section 3, we formalise the proposed prediction model. Section 4 presents our experimental approach, consisting of a first phase for computing the compensation parameters, and a second phase aiming at validating them. Section 5 discusses the validity of our proposal. Finally, Section 6 concludes the paper. 2. EXISTING REPUTATION MODELS Online reputation systems have been adopted in the past few years as a mean for decision making on the Web. Parties in a community may decide to choose a specific object (e.g., a product or a service) based on their reputation scores. Usually, a reputation system computes and makes public such scores, based on a collection of reviews that the community gives about that object. The reputation can be dynamically updated according to various kind of algorithms, that are generally built on the principle that the updated reputation is a function of the old reputation and the most recent feedback. Indeed, Jøsang et al. note that, from the relying party point of view, reputation scores can be computed based on a combination of personal experience (represented by the last new feedback) and second hand referrals (represented by past feedback) [12]. Simple reputation models, as the one adopted by Ebay prior to May, 2008, exploit a plain combination of past and new feedback. In particular, ebay ( recorded the feedback obtained after that a business transaction has been carried out between a seller and a buyer. The reputation of a user was thus computed by summing the number of positive and negative ratings separately, and keeping a total score as the positive score minus the negative score. From May 2008, Ebay started considering only the percentage of positive ratings of the last twelve months. The authors in [19] consider a simple scheme, whose principle has been adopted by popular websites for e-commerce, such as Amazon ( and Epinions ( In such a scheme, the reputation score is the average of all the ratings. Thus, past and new feedback contribute in an equal manner to the calculation of the user s reputation. More complex reputation models combine the old value of reputation and the new feedback to form a new value computed as a weighted mean. Some proposals exist in the literature on how to determine the weights. For example, work in [3, 5, 23] consider the trustworthiness of the reviewer, while authors of [11] evaluate the different degrees of the user s satisfaction for a set of parameters characterizing the object. Work in [24] prioritises reviews by their origin, such that reviews posted by users with an established attendance in the system are weighted more than the reviews given by beginners. Similarly, different priorities may be put on reviews posted by different categories of users, in order for instance to weigh more the reviews given by professionals and give less weight to reviews given by regular users [21, 4]. Work in [1] considers the evolution of sellers reputation in electronic marketplaces as an aggregation of past and recent transactions, and proposes an optimisation of the Window Aggregation Mechanism, in which the seller s score is the average of the last n most recent ratings. Also, work in [2] considers the Weighted Aggregation Mechanism, where the seller s score is a weighted average of past ratings, optimal with respect to incentivise the seller to be truthful. Fan et al. [8] propose to achieve a similar goal by adopting exponential smoothing to aggregate ratings, and evaluate it through simulations. While this is not the focus of our paper, we acknowledge research work in the area of immunising reviewing systems against unfair (or incomplete) ratings [6, 22, 25, 7, 10]. Our work is closely related to the paradigm of Collaborative Filtering systems, see, e.g., [18, 13, 20, 15, 9]. As reputation systems, they collect feedback from users about products or services. The intuition behind such systems is that tastes vary from person to person, and people review objects according to their subjective attitude and preferences. Collaborative Filtering aims at creating categories of users, also called neighborhood, grouped by similarities of tastes and ways in which they rate and choose objects, in such a way that it would be possible to recommend objects, which one user likes, to members of her neighborhood [17]. This idea finds its implementation in the so called Recommender Systems, see, e.g., [16, 26, 14]. To some extent, we propose here an inter-neighborhood collaborative filtering technique. Indeed, we present a formalization and an experimental approach to predict a review from one neighbourhood of users based on a review from another neighbourhood. 3. GENERAL MODEL We present in this section our subjective review-based reputation model. Intuitively, we first calculate the distance between the reviews from two categories of users, using a set of objects as references. This distance is then used to define a compensation function, which, given a review from one category of users, predicts the score for another category. The subjective reputation score for one category is finally obtained by compensating all the reviews from the other categories. 3.1 Compensation function Roughly speaking, a review is given by a user over an object. Hence, we consider a set of users U, a set of objects O and a set of atomic scores S, and we write R u = U O S for the set of all possible user reviews. Users can often be associated with categories, and therefore we introduced a set C of categories. We assume here that atomic scores belong to a domain providing usual arithmetic operations, and that it is therefore possible to calculate the average of a set of scores. Given a function f : U C associating each user with a category, and an object o O, we introduce the function γ f : O C S, which gives the score of an object o for a certain category of users, and is defined as: o O c C γ f (o, c) = avg({s (u, o, s) R u f(u) = c}) where avg denotes the function returning the average of a

3 set of atomic scores. In practice, it can be observed that users from different categories can give different reviews for a same object. For instance, some tourists from a given country might have higher standards than tourists from other countries, and thus giving lower scores. Similarly, people traveling alone for business purposes might not attach the same importance to the different features of a hotel compared to, for instance, the more senior travelers. Following this intuition, we claim that the ratio between the scores of two different categories can be analysed and predicted. More formally, given two categories c 1 and c 2 and a set of objects X, we define the function, which computes the average ratio between the scores of the two categories for the objects in X: (c 1, c 2, X) = avg({ γ f (o, c 2) γ f (o, c 1) o X}) Assuming a fixed set X to calculate the function, we can now estimate the score of an object for a given category, based on the score of another category and the average ratio. Such an estimation is done with the function π : O C C S, which is defined by: o O \ X c 1, c 2 C π(o, c 1, c 2) = γ f (o, c 2) (c 2, c 1, X) In order to make a clear difference between the objects that are used to define the function and the objects on which we want to predict the score, the function π is not defined on the set X. With this definition, π(o, c 1, c 2) can be read as the score that could have given the category c 1, using the score of the category c 2 and the average ratio between the score from c 2 to c 1. Consider a user of the category c 1, who wants to read a review for an object o. She potentially has the choice between three different scores: the one given by the users of the same category, γ f (o, c 1), the one given by the users of another category c 2, γ f (o, c 2), or the projection of the score of the users of the category c 2 adjusted for the category c 1, π(o, c 1, c 2). Clearly, if it exists, the score γ f (o, c 1) is probably the most adapted, however, in some situations, such a score might not exist, or might not be accurate enough due to a small number of reviews for the category c 1. We claim, and demonstrate in Section 4 for a specific example, that the score given by π(o, c 1, c 2) is more accurate than γ f (o, c 2), that is, it is usually interesting for a user of the category c 1 to use the projection rather than the score of another category. 3.2 Subjective Reputation In its simplest form, the reputation score of an object is calculated by averaging all the reviews from the different categories, that is, the reputation is given by a function R : O S defined as: R(o) = avg({s (u, o, s) R u}) We propose here to use the compensation function introduced in the previous Section to define a reputation subjectively defined for a given category of users, where all reviews are compensated to this category. Hence, given a category c and an object o, we can calculate the overall subjective reputation R s c of o for the category c as: R s c(o) = avg({π(o, c, c ) c C \ {c}} {γ f (o, c)}) Clean Comf. Serv. Staff Q/P (mc, st, X) 0,972 0, Variance Table 1: Ratio and Variance This subjective reputation allows a user from a category to obtain the review on the object o as if all reviews were submitted by reviewers from the same category, even if there is no review from this category, i.e., {γ f (o, c)} =. Since the calculation of each π is directly based on the original scores of the other categories, it is possible to weigh these scores, and therefore other reputation models can be straight-forwardly included, such as different weights for different reviewers attributes. 4. EXPERIMENTAL APPROACH We carry out an analysis of existing reviews of categories of users. Reviews are taken from the Booking.com website, a popular website specialised in publishing travelers advice. For this particular experiment, we focus on four stars hotels, and we collect reviews given by two categories of users: the solo travelers (st) and the mature couples (mc), and we show how to compensate the review from a mature couple in order to obtain the review from a solo traveler. Each hotel review consists of an individual review for five different parameters: Clean, Comfort, Services, Staff, and Quality/Price, such that each individual review is a numerical value comprised between 1 and 10, and expresses the degree of satisfaction of the user who has experienced that hotel. In order to show to the website visitors a comprehensive score for a hotel, Booking.com presents an overall reputation score that consists of the mean of the five reviews. We consider here a reviewed object to be a pair (hotel, subservice), and we directly extract for each hotel and each subservice the review for each category of users. For instance, γ f ((h, Clean), st) stands for the review given by the solo travelers for the cleanliness of the hotel h. By extension, we also consider the implicit review for a hotel, which is given by the average of the reviews for each subservice, and we write directly γ f (h, c) for such a review. Our experimentation consists of two phases: the calculation phase, where we analyse the reviews in order to define the ratio function (and thus the projection function π), and the validation phase, where we check if this function is accurate enough. 4.1 Calculation Phase In this phase, we pick a set X of fifty hotels in New York City, and we calculate for each subservice sub the ratio (mc, st, (X, sub)), as presented in Table 1, in order to define the projection function π. We also show for each ratio the corresponding variance obtained (i.e. the mean of the squared deviation). We can observe that the ratio is always below 1, meaning that solo travelers give, in general, a lower review compared to mature couples. Moreover, the variance is quite small, which indicates a narrow range for the ratio. Note that we do not calculate directly the ratio for the overall score, as it is calculated from the scores of the subservices. The interest here of using the subservices instead of directly calculating the ratio for the overall score is to allow a user to ignore

4 Clean Comf. Serv. Staff Q/P Score γ f (h, mc) γ f (h, st) π(h, st, mc) 8 7, ,57 some subservices. Table 2: Scores and projection 4.2 Validation Phase The second phase aims at validating the compensation ratio that we calculated in the first phase. To do this, we collect three sets of data from Booking.com, related to hotels in Paris, Madrid, and New York City (this last set is different from the one used for the calculation phase). Each set considers fifty hotels in the four stars category. The validation phase consists in, for each hotel in the validation set: (i) Calculating the compensated score for each subservice of the review of mature couples to obtain the compensated review for solo travelers; (ii) Calculating the distance between the overall score of the compensated review and overall score of the real review for solo travelers, in order to obtain our error margin; (iii) Checking that the distance between the compensated review and the real solo traveler review is smaller than the distance between the mature couples review and the real solo travel review, in order to see if the compensated review is more accurate than the mature couples one Validation Case: New York City In our first survey, we focus on fifty hotels in NYC belonging to the four stars category (this set is different from the one considered in Section 4.1). We collect all reviews from mature couples, and then we apply our compensation function to them. To estimate how much the prediction is accurate, we calculate the distance between the compensated reviews and the real reviews by solo travelers. For instance, consider a hotel h, such that the reviews given by mature couples and solo travelers are given in Table 2 by γ f (h, mc) and γ f (h, st), respectively. The last row of Table 2 gives the compensated score π(h, st, mc), calculated using (mc, st, X) from Section 4.1. We can observe two points on this example. The first one is that the accuracy of the compensation is not the same for each subservice: for instance, the comfort has been correctly projected, while there is a significant difference between the projected score for Staff (8.1) and the actual score (7.6). The second point is that each projected score is lower than the corresponding score given by mature couples (which is consistent with the fact that each ratio in Table 1 is below 1), and above the actual score given by solo travelers. Hence, we can see that in this example, our projection is closer to the actual review than the review from mature couples is. The distance between the compensated overall score and the real score changes from a hotel to another. For instance, for the hotel h, we can observe that the distance between γ f (h, st) and π(h, st, mc) is equal to Figure 1 shows the repartition of the minimal distance between the compensated overall score and the real score for the NYC validation set. This graph can be read as follows: in a bit more than 80% of the cases, the error margin is greater or equal to 0.1 (leftmost bar), while in only 10% of the cases the error Error (%) ,1 0,2 0,3 0,4 0,5 0,6 0,7 0,8 0,9 1 1,5 2 Distance Figure 1: NYC 4 star hotels: Validation results Error (%) ,1 0,2 0,3 0,4 0,5 0,6 0,7 0,8 0,9 1 1,5 2 Distance Figure 2: Paris 4 star hotels: Validation results margin is greater or equal to 1. It is interesting to observe that in only 30% of the case, the distance will be greater or equal to 0.4, which is quite small, considering that the overall score is a numerical value between 1 and 10. The distances shown in Figure 1 are absolute distances, as they only consider distances between the compensated review and the real one. We focus in Section on the relative distances, that are distances between the compensated reviews and the real reviews on the one hand, and on the compensated reviews and the mature couples reviews on the other hand Validation Case: Paris In the second survey, we collect reviews of mature couples for 50 hotels in Paris. Figure 2 shows the trend of the distance between the real and the compensated review. We obtain better results for the Paris dataset than for the NYC dataset. Indeed, we are able to predict a compensated review with a distance to the real review smaller than 0.1 in 40% of the cases (while for the NYC the same distance was predictable in only 20% of the cases). The probability of making an error in the prediction further decreases by considering bigger, but still acceptable, distances. Indeed, in only 10% of the cases, the distance is greater or equal to Validation Case: Madrid For the last survey, we consider 50 hotels located in Madrid. Figure 3 shows that in 80% of our predictions, the distance between the compensated review and the real one is greater or equal to 0.1. However, in only about 15% of the cases, the distance is greater or equal to 0.3. We notice that, also in this scenario, the compensation function provides reviews that are close to those from solo

5 Error (%) ,1 0,2 0,3 0,4 0,5 0,6 0,7 0,8 0,9 1 1,5 2 Distance Figure 3: Madrid 4 star hotels: Validation results travelers, even if the best result of our validation has been obtained in the dataset of the hotels located in Paris Compensated Vs Mature Couples The previous Sections show the absolute distance between our compensated values and the actual values. Another important measure of accuracy for our approach is the comparison of, on the one hand, the distance between the original mature couple review and the actual solo traveler review, and on the other hand the distance between the compensated review and the actual solo traveler review. For instance, with the values of Table 2, we can see that for the distance of the hotel h between γ f (h, mc) and γ f (h, st) is equal to 0.46, while the distance between γ f (h, st) and π(h, st, mc) is equal to In other words, our prediction is closer to the actual review than the review from mature couples is. It is therefore better for a solo traveler to consult our prediction compared to the mature couple review. In Table 3, we summarize the results obtained using our compensation function. For each dataset, we compare the compensated review with the review given by mature couples. Then, we count how many compensated values are closer to the real solo travelers reviews. This case is labelled Better in the table, since it means that it is better for a solo traveler to consider the compensated review than the mature couple one, and that therefore our method is better than doing nothing. Similarly, with Worse we indicate the situation in which a mature couple score is closer to a solo traveler one than our compensated value, that is, when it would be better for a solo traveler to consider the mature couple review instead of the compensated one. For instance, for 72% of the hotels in the NYC validation set the compensated review is closer to the one of solo travelers than to the one of mature couples. Similar findings have been obtained in the dataset of hotels located in Paris. However, in the last test carried out with the hotels in Madrid, the prediction is better in only 56% of the cases, even though the we obtain the smallest distances for this dataset, as shown in Figure 3. It is interesting to observe that for this particular dataset, the reviews given by mature couples and solo travelers were quite similar, which shows how our compensation function provides less accuracy. From the analysis of all the validation tests that we have carried out, we can conclude that, in absence of reviews posted by solo travelers, people belonging to that category can derive a more accurate review by compensating the reviews of mature couples, rather than relying on the last ones. NYC Paris Madrid Better Worse Better Worse Better Worse 72% 28% 74% 26% 56% 44% Table 3: Prediction statistics 5. DISCUSSION In the previous Section, we have shown that the difference between reviews from solo travelers and mature couples concerning four stars hotels could be calculated with a good accuracy, since for each validation sets, our compensated mature couple review was in average closer to the solo travel review than the original mature couple review. Since we chose the categories and the hotel sets randomly, we can reasonably expect that such a behaviour can be reproduced for other categories and other hotel sets. An implicit assumption of our model is that all users from one category behave similarly, and that the difference between the reviews from two different categories is significant enough. Indeed, as the Madrid example demonstrated, our approach is less accurate when the reviews from one category are not very different from the reviews from another category. Note that the subjective reputation score itself is in practice hard to evaluate. Indeed, we would need a way to verify that the global score corresponds to what a user expects. Our experimentation was done in order to validate our model, rather than to define concrete distance values between mature couples and solo travelers. Clearly, a realworld implementation of this model requires to consider more hotels, and more categories. In particular, an interesting point to consider is the conjunction of compensated reviews. For instance, consider three categories of users A, B, and C, such that we have the compensation functions from A to C and from B to C. Based on the validation phase, the accuracy of these functions can be established, and when computing the subjective reputation for the category C, this accuracy can be used to weight the compensated reviews. In order to further validate our model, we would need to consider other reviewing systems, in order to make sure that the results we have found are not only valid in the context of hotel reviewing system. A particularly interesting use-case would be the reviewing system for scientific conferences. Indeed, informally, some reviewers might be in general more strict than the average, and tend to reject more papers, while other reviewers accept more papers than the average. In this case, for each reviewer, we consider two categories: the category containing only the reviewer, and the category containing all the other reviewers. By calculating the distance between these two categories, we could find out the compensation function for each reviewer. It follows that the review for each paper can be compensated, leading to a normalised review for each paper. 6. CONCLUSION - FUTURE WORKS We have presented in this paper a subjective review-based reputation model, which calculates the distance between reviews coming from two different categories of reviewers in order to compensate the differences and integrate the subjectivity of each review. This model is formally introduced in Section 3, and we demonstrate its applicability in Section 4 by calculating the distance between two categories of

6 users for hotel reviews, and showing that our compensated reviews are more accurate than non compensated reviews. One of the strengths of this model resides in its user transparency: the compensation functions are calculated automatically from existing reviews, and therefore do not require any extra input from the user (apart from her category). Note that the validation can also be done automatically, in order to establish the accuracy of the compensation functions. Moreover, this approach is compatible with most existing reputation models, as the subjective reputation score is simply a reputation score. The main limitation of our approach is the lack of uniformity between the different reviews from one service to another. Indeed, we do not analyse why there exists a difference between the reviews of two different categories, we simple observe it and reproduce it for new inputs. In other words, as it is often the case with empirical approaches, we cannot guarantee that for a specific hotel, our compensated review will be more accurate than the non compensated one. We can only limit this absence of guarantee by specifying the accuracy of our compensation function over previous datasets. There are three different paths to extend this work. As mentioned in Section 5, it would be interesting to study the behaviour of our model in another context, for instance the reviewing process of a scientific conference. Another extension is to study more refined strategies for the definition of the compensation function, in order to increase its accuracy. For instance, instead of using a simple ratio, we could use a probability distribution function, that would give the probability of the ratio to belong to a particular interval. Finally, this model could allow to detect fake reviews by reversing the approach. Indeed, it might be hard to detect a fake review if it is the only review for a given category. However, we could compensate it into another category with more reviews, and analyze the difference of the compensated review with the other reviews. 7. REFERENCES [1] C. Aperjis and R. Johari. Designing aggregation mechanisms for reputation systems in online marketplaces. SIGecom Exch., 9:3:1 3:4, [2] C. Aperjis and R. Johari. Optimal windows for aggregating ratings in electronic marketplaces. Management Science, 56(5): , [3] S. Buchegger and J. Le Boudec. A robust reputation system for mobile ad-hoc networks. Technical report, IC/2003/50 EPFL-IC-LCA, [4] W. Chen, Q. Zeng, and L. Wenyin. A User Reputation Model for a User-Interactive Question Answering System. In SKG 06, page 40. IEEE, [5] F. Cornelli, E. Damiani, S. D. C. di Vimercati, S. Paraboschi, and P. Samarati. Choosing reputable servents in a p2p network. In WWW 02, pages ACM, [6] C. Dellarocas. Immunizing online reputation reporting systems against unfair ratings and discriminatory behavior. In ACM Conf. on Electronic Commerce, pages , [7] C. Dellarocas and C. A. Wood. The sound of silence in online feedback: Estimating trading risks in the presence of reporting bias. Management Science, 54(3): , [8] M. Fan, Y. Tan, and A. B. Whinston. Evaluation and design of online cooperative feedback mechanisms for reputation management. IEEE Trans. Knowl. Data Eng., 17(2): , [9] S. Gong. A Collaborative Filtering Recommendation Algorithm Based on User Clustering and Item Clustering. Journal of Software, 5(7), [10] J. Gorner, J. Zhang, and R. Cohen. Improving the use of advisor networks for multi-agent trust modelling. In Privacy, Security and Trust, pages 71 78, [11] N. Griffiths. Task delegation using experience-based multi-dimensional trust. In AAMAS 05, pages ACM, [12] A. Jøsang, R. Ismail, and C. Boyd. A survey of trust and reputation systems for online service provision. Decis. Support Syst., 43: , [13] Y. Koren. Factor in the neighbors: Scalable and accurate collaborative filtering. ACM Trans. Knowl. Discov. Data, 4:1:1 1:24, [14] P. Massa and P. Avesani. Trust-aware recommender systems. In Recommender systems, pages ACM, [15] M. C. Pham, Y. Cao, R. Klamma, and M. Jarke. A clustering approach for collaborative filtering recommendation using social network analysis. J. UCS, 17(4): , [16] F. Ricci, L. Rokach, B. Shapira, and P. B. Kantor, editors. Recommender Systems Handbook. Springer, [17] A. Saric, M. Hadzikadic, and D. Wilson. Alternative formulas for rating prediction using collaborative filtering. In ISMIS 09, pages Springer, [18] B. Sarwar, G. Karypis, J. Konstan, and J. Reidl. Item-based collaborative filtering recommendation algorithms. In WWW 01, pages ACM, [19] J. Schneider, G. Kortuem, J. Jager, S. Fickas, and Z. Segall. Disseminating trust information in wearable communities. Personal Ubiquitous Comput., 4: , [20] X. Su and T. M. Khoshgoftaar. A survey of collaborative filtering techniques. Advances in Artificial Intelligence, [21] T. van Deursen, P. Koster, and M. Petkovic. Hedaquin: A reputation-based health data quality indicator. Electr. Notes Theor. Comput. Sci., 197(2): , [22] A. Whitby, A. Jøsang, and J. Indulska. Filtering out unfair ratings in bayesian reputation systems. In Workshop on Trust in Agent Societies, [23] B. Yu and M. P. Singh. Detecting deception in reputation management. In AAMAS 03, pages ACM, [24] G. Zacharia, A. Moukas, and P. Maes. Collaborative reputation mechanisms in electronic marketplaces. In HICSS, [25] J. Zhang and R. Cohen. Trusting advice from other buyers in e-marketplaces: the problem of unfair ratings. In ICEC, pages , [26] C.-N. Ziegler and G. Lausen. Making product recommendations more diverse. IEEE Data Eng. Bull., 32(4):23 32, 2009.

Priorities-Based Review Computation

Priorities-Based Review Computation AAAI Technical Report SS-2-0 Intelligent Web Services Meet Social Computing Priorities-Based Review Computation Gianpiero Costantino and Fabio Martinelli and Marinella Petrocchi Istituto di Informatica

More information

A model of indirect reputation assessment for adaptive buying agents in electronic markets

A model of indirect reputation assessment for adaptive buying agents in electronic markets A model of indirect reputation assessment for adaptive buying agents in electronic markets Kevin Regan and Robin Cohen School of Computer Science University of Waterloo Abstract. In this paper, we present

More information

Trust, Reputation and Fairness in Online Auctions

Trust, Reputation and Fairness in Online Auctions Trust, Reputation and Fairness in Online Auctions Adam Wierzbicki 21/11/2006 Polish-Japanese Institute of Information Technology Plan of the talk Background Online auctions Trust management Reputation

More information

Super-Agent Based Reputation Management with a Practical Reward Mechanism in Decentralized Systems

Super-Agent Based Reputation Management with a Practical Reward Mechanism in Decentralized Systems Super-Agent Based Reputation Management with a Practical Reward Mechanism in Decentralized Systems Yao Wang, Jie Zhang, and Julita Vassileva Department of Computer Science, University of Saskatchewan,

More information

Permanent Link: http://espace.library.curtin.edu.au/r?func=dbin-jump-full&local_base=gen01-era02&object_id=19474

Permanent Link: http://espace.library.curtin.edu.au/r?func=dbin-jump-full&local_base=gen01-era02&object_id=19474 Citation: Chang, Elizabeth and Hussain, Farookh and Dillon, Tharam. 2005. : Reputation ontology for reputation systems, in Herrero, P. and Meersman, R. and Tari, Z. (ed), First IFIP/WG2.12 and WG12.4 International

More information

arxiv:1506.04135v1 [cs.ir] 12 Jun 2015

arxiv:1506.04135v1 [cs.ir] 12 Jun 2015 Reducing offline evaluation bias of collaborative filtering algorithms Arnaud de Myttenaere 1,2, Boris Golden 1, Bénédicte Le Grand 3 & Fabrice Rossi 2 arxiv:1506.04135v1 [cs.ir] 12 Jun 2015 1 - Viadeo

More information

Reputation Rating Mode and Aggregating Method of Online Reputation Management System *

Reputation Rating Mode and Aggregating Method of Online Reputation Management System * Reputation Rating Mode and Aggregating Method of Online Reputation Management System * Yang Deli ** Song Guangxing *** (School of Management, Dalian University of Technology, P.R.China 116024) Abstract

More information

Detection of Collusion Behaviors in Online Reputation Systems

Detection of Collusion Behaviors in Online Reputation Systems Detection of Collusion Behaviors in Online Reputation Systems Yuhong Liu, Yafei Yang, and Yan Lindsay Sun University of Rhode Island, Kingston, RI Email: {yuhong, yansun}@ele.uri.edu Qualcomm Incorporated,

More information

A Comparative Study of the Pickup Method and its Variations Using a Simulated Hotel Reservation Data

A Comparative Study of the Pickup Method and its Variations Using a Simulated Hotel Reservation Data A Comparative Study of the Pickup Method and its Variations Using a Simulated Hotel Reservation Data Athanasius Zakhary, Neamat El Gayar Faculty of Computers and Information Cairo University, Giza, Egypt

More information

A Reputation Management and Selection Advisor Schemes for Peer-to-Peer Systems

A Reputation Management and Selection Advisor Schemes for Peer-to-Peer Systems A Reputation Management and Selection Advisor Schemes for Peer-to-Peer Systems Loubna Mekouar, Youssef Iraqi, and Raouf Boutaba University of Waterloo, Waterloo, Canada {lmekouar, iraqi, rboutaba}@bbcr.uwaterloo.ca

More information

Reputation Management: Experiments on the Robustness of ROCQ

Reputation Management: Experiments on the Robustness of ROCQ Reputation Management: Experiments on the Robustness of ROCQ Anurag Garg Roberto Battiti Roberto Cascella Dipartimento di Informatica e Telecomunicazioni, Università di Trento, Via Sommarive 4, 385 Povo

More information

A Review on Trust and Reputation for Web Service Selection

A Review on Trust and Reputation for Web Service Selection A Review on Trust and Reputation for Web Service Selection Yao Wang, Julita Vassileva Department of Computer Science University of Saskatchewan {yaw181, jiv}@cs.usask.ca Abstract A trust and reputation

More information

Utility of Distrust in Online Recommender Systems

Utility of Distrust in Online Recommender Systems Utility of in Online Recommender Systems Capstone Project Report Uma Nalluri Computing & Software Systems Institute of Technology Univ. of Washington, Tacoma unalluri@u.washington.edu Committee: nkur Teredesai

More information

Credit Card Fraud Detection and Concept-Drift Adaptation with Delayed Supervised Information

Credit Card Fraud Detection and Concept-Drift Adaptation with Delayed Supervised Information Credit Card Fraud Detection and Concept-Drift Adaptation with Delayed Supervised Information Andrea Dal Pozzolo, Giacomo Boracchi, Olivier Caelen, Cesare Alippi, and Gianluca Bontempi 15/07/2015 IEEE IJCNN

More information

A Blueprint for Universal Trust Management Services

A Blueprint for Universal Trust Management Services A Blueprint for Universal Trust Management Services Tomasz Kaszuba Krzysztof Rzadca Adam Wierzbicki Grzegorz Wierzowiecki Polish-Japanese Institute of Information Technology Warsaw, Poland adamw@pjwstk.edu.pl

More information

Multiagent Reputation Management to Achieve Robust Software Using Redundancy

Multiagent Reputation Management to Achieve Robust Software Using Redundancy Multiagent Reputation Management to Achieve Robust Software Using Redundancy Rajesh Turlapati and Michael N. Huhns Center for Information Technology, University of South Carolina Columbia, SC 29208 {turlapat,huhns}@engr.sc.edu

More information

Attacks and vulnerabilities of trust and reputation models *

Attacks and vulnerabilities of trust and reputation models * Attacks and vulnerabilities of trust and reputation models * Jose M. Such 1 Introduction Agents usually need to assess either the trustworthiness or the reputation of other agents in a given system. Trust

More information

Immunizing Online Reputation Reporting Systems Against Unfair Ratings and Discriminatory Behavior

Immunizing Online Reputation Reporting Systems Against Unfair Ratings and Discriminatory Behavior Immunizing Online Reputation Reporting Systems Against Unfair Ratings and Discriminatory Behavior Chrysanthos Dellarocas Sloan School of Management Massachusetts Institute of Technology Room E3-3, Cambridge,

More information

Introducing diversity among the models of multi-label classification ensemble

Introducing diversity among the models of multi-label classification ensemble Introducing diversity among the models of multi-label classification ensemble Lena Chekina, Lior Rokach and Bracha Shapira Ben-Gurion University of the Negev Dept. of Information Systems Engineering and

More information

Hedaquin: A reputation-based health data quality indicator

Hedaquin: A reputation-based health data quality indicator STM 2007 Hedaquin: A reputation-based health data quality indicator Ton van Deursen a,b, Paul Koster a, Milan Petković a a Philips Research Eindhoven, The Netherlands b Université du Luxembourg, Luxembourg

More information

Decoupling Service and Feedback Trust in a Peer-to-Peer Reputation System

Decoupling Service and Feedback Trust in a Peer-to-Peer Reputation System Decoupling Service and Feedback Trust in a Peer-to-Peer Reputation System Gayatri Swamynathan, Ben Y. Zhao and Kevin C. Almeroth Department of Computer Science, UC Santa Barbara {gayatri, ravenben, almeroth}@cs.ucsb.edu

More information

How To Perform An Ensemble Analysis

How To Perform An Ensemble Analysis Charu C. Aggarwal IBM T J Watson Research Center Yorktown, NY 10598 Outlier Ensembles Keynote, Outlier Detection and Description Workshop, 2013 Based on the ACM SIGKDD Explorations Position Paper: Outlier

More information

SIP Service Providers and The Spam Problem

SIP Service Providers and The Spam Problem SIP Service Providers and The Spam Problem Y. Rebahi, D. Sisalem Fraunhofer Institut Fokus Kaiserin-Augusta-Allee 1 10589 Berlin, Germany {rebahi, sisalem}@fokus.fraunhofer.de Abstract The Session Initiation

More information

Reputation and Endorsement for Web Services

Reputation and Endorsement for Web Services Reputation and Endorsement for Web Services E. Michael Maximilien North Carolina State University and IBM maxim@us.ibm.com and Munindar P. Singh North Carolina State University singh@ncsu.edu The web services

More information

A Sarsa based Autonomous Stock Trading Agent

A Sarsa based Autonomous Stock Trading Agent A Sarsa based Autonomous Stock Trading Agent Achal Augustine The University of Texas at Austin Department of Computer Science Austin, TX 78712 USA achal@cs.utexas.edu Abstract This paper describes an autonomous

More information

A Super-Agent Based Framework for Reputation Management and Community Formation in Decentralized Systems

A Super-Agent Based Framework for Reputation Management and Community Formation in Decentralized Systems Computational Intelligence, Volume 000, Number 000, 0000 A Super-Agent Based Framework for Reputation Management and Community Formation in Decentralized Systems Yao Wang, Jie Zhang and Julita Vassileva

More information

Using News Articles to Predict Stock Price Movements

Using News Articles to Predict Stock Price Movements Using News Articles to Predict Stock Price Movements Győző Gidófalvi Department of Computer Science and Engineering University of California, San Diego La Jolla, CA 9237 gyozo@cs.ucsd.edu 21, June 15,

More information

BUILDING A PREDICTIVE MODEL AN EXAMPLE OF A PRODUCT RECOMMENDATION ENGINE

BUILDING A PREDICTIVE MODEL AN EXAMPLE OF A PRODUCT RECOMMENDATION ENGINE BUILDING A PREDICTIVE MODEL AN EXAMPLE OF A PRODUCT RECOMMENDATION ENGINE Alex Lin Senior Architect Intelligent Mining alin@intelligentmining.com Outline Predictive modeling methodology k-nearest Neighbor

More information

A Trust-Evaluation Metric for Cloud applications

A Trust-Evaluation Metric for Cloud applications A Trust-Evaluation Metric for Cloud applications Mohammed Alhamad, Tharam Dillon, and Elizabeth Chang Abstract Cloud services are becoming popular in terms of distributed technology because they allow

More information

IDENTIFYING HONEST RECOMMENDERS IN REPUTATION SYSTEMS

IDENTIFYING HONEST RECOMMENDERS IN REPUTATION SYSTEMS IDENTIFYING HONEST RECOMMENDERS IN REPUTATION SYSTEMS Farag Azzedin King Fahd University of Petroleum and Minerals, Information and Computer Science Department, Dhahran, 31261, Saudi Arabia. ABSTRACT Reputation

More information

How To Manage Your Information On A Network With A User Account On A Computer Or Cell Phone (For A Free)

How To Manage Your Information On A Network With A User Account On A Computer Or Cell Phone (For A Free) On the Application of Trust and Reputation Management and User-centric Techniques for Identity Management Systems Ginés Dólera Tormo Security Group NEC Laboratories Europe Email: gines.dolera@neclab.eu

More information

Accurate is not always good: How Accuracy Metrics have hurt Recommender Systems

Accurate is not always good: How Accuracy Metrics have hurt Recommender Systems Accurate is not always good: How Accuracy Metrics have hurt Recommender Systems Sean M. McNee mcnee@cs.umn.edu John Riedl riedl@cs.umn.edu Joseph A. Konstan konstan@cs.umn.edu Copyright is held by the

More information

A Reputation Management System in Structured Peer-to-Peer Networks

A Reputation Management System in Structured Peer-to-Peer Networks A Reputation Management System in Structured Peer-to-Peer Networks So Young Lee, O-Hoon Kwon, Jong Kim and Sung Je Hong Dept. of Computer Science & Engineering, Pohang University of Science and Technology

More information

Content Delivery Network (CDN) and P2P Model

Content Delivery Network (CDN) and P2P Model A multi-agent algorithm to improve content management in CDN networks Agostino Forestiero, forestiero@icar.cnr.it Carlo Mastroianni, mastroianni@icar.cnr.it ICAR-CNR Institute for High Performance Computing

More information

Reputation-Oriented Trustworthy Computing in E-Commerce Environments

Reputation-Oriented Trustworthy Computing in E-Commerce Environments Reputation-Oriented Trustworthy Computing in E-Commerce Environments Yan Wang Macquarie University Kwei-Jay Lin University of California, Irvine The reputation-oriented trust issue is critical to e-commerce

More information

An Overview of Knowledge Discovery Database and Data mining Techniques

An Overview of Knowledge Discovery Database and Data mining Techniques An Overview of Knowledge Discovery Database and Data mining Techniques Priyadharsini.C 1, Dr. Antony Selvadoss Thanamani 2 M.Phil, Department of Computer Science, NGM College, Pollachi, Coimbatore, Tamilnadu,

More information

Characterizing Task Usage Shapes in Google s Compute Clusters

Characterizing Task Usage Shapes in Google s Compute Clusters Characterizing Task Usage Shapes in Google s Compute Clusters Qi Zhang University of Waterloo qzhang@uwaterloo.ca Joseph L. Hellerstein Google Inc. jlh@google.com Raouf Boutaba University of Waterloo rboutaba@uwaterloo.ca

More information

Towards Incentive-Compatible Reputation Management

Towards Incentive-Compatible Reputation Management Towards Incentive-Compatible Reputation Management Radu Jurca and Boi Faltings Artificial Intelligence Laboratory (LIA), Computer Science Department, Swiss Federal Institute of Technology (EPFL) CH-115

More information

IMPROVING BUSINESS PROCESS MODELING USING RECOMMENDATION METHOD

IMPROVING BUSINESS PROCESS MODELING USING RECOMMENDATION METHOD Journal homepage: www.mjret.in ISSN:2348-6953 IMPROVING BUSINESS PROCESS MODELING USING RECOMMENDATION METHOD Deepak Ramchandara Lad 1, Soumitra S. Das 2 Computer Dept. 12 Dr. D. Y. Patil School of Engineering,(Affiliated

More information

http://hdl.handle.net/10536/dro/du:30070778

http://hdl.handle.net/10536/dro/du:30070778 This is the published version Chong,S-K, Abawajy,J, Ahmad,M and Hamid,IRA 2014, Enhancing Trust Management in Cloud Environment, Procedia - Social and Behavioral Sciences, vol. 129, pp. 314-321. Available

More information

Journal of Industrial Engineering Research. Adaptive sequence of Key Pose Detection for Human Action Recognition

Journal of Industrial Engineering Research. Adaptive sequence of Key Pose Detection for Human Action Recognition IWNEST PUBLISHER Journal of Industrial Engineering Research (ISSN: 2077-4559) Journal home page: http://www.iwnest.com/aace/ Adaptive sequence of Key Pose Detection for Human Action Recognition 1 T. Sindhu

More information

EADRM: A Framework for Explanation-Aware Distributed Reputation Management of Web Services

EADRM: A Framework for Explanation-Aware Distributed Reputation Management of Web Services 2008 IEEE Asia-Pacific Services Computing Conference EADRM: A Framework for Explanation-Aware Distributed Reputation Management of Web Services Wanita Sherchan, Shonali Krishnaswamy Faculty of Information

More information

A Model For Revelation Of Data Leakage In Data Distribution

A Model For Revelation Of Data Leakage In Data Distribution A Model For Revelation Of Data Leakage In Data Distribution Saranya.R Assistant Professor, Department Of Computer Science and Engineering Lord Jegannath college of Engineering and Technology Nagercoil,

More information

A QoS-Aware Web Service Selection Based on Clustering

A QoS-Aware Web Service Selection Based on Clustering International Journal of Scientific and Research Publications, Volume 4, Issue 2, February 2014 1 A QoS-Aware Web Service Selection Based on Clustering R.Karthiban PG scholar, Computer Science and Engineering,

More information

Data Mining - Evaluation of Classifiers

Data Mining - Evaluation of Classifiers Data Mining - Evaluation of Classifiers Lecturer: JERZY STEFANOWSKI Institute of Computing Sciences Poznan University of Technology Poznan, Poland Lecture 4 SE Master Course 2008/2009 revised for 2010

More information

arxiv:1308.3876v1 [cs.si] 18 Aug 2013

arxiv:1308.3876v1 [cs.si] 18 Aug 2013 arxiv:1308.3876v1 [cs.si] 18 Aug 2013 Detection and Filtering of Collaborative Malicious Users in Reputation System using Quality Repository Approach Jnanamurthy HK and Sanjay Singh August 20, 2013 Abstract

More information

Mimicking human fake review detection on Trustpilot

Mimicking human fake review detection on Trustpilot Mimicking human fake review detection on Trustpilot [DTU Compute, special course, 2015] Ulf Aslak Jensen Master student, DTU Copenhagen, Denmark Ole Winther Associate professor, DTU Copenhagen, Denmark

More information

Data Mining and Knowledge Discovery in Databases (KDD) State of the Art. Prof. Dr. T. Nouri Computer Science Department FHNW Switzerland

Data Mining and Knowledge Discovery in Databases (KDD) State of the Art. Prof. Dr. T. Nouri Computer Science Department FHNW Switzerland Data Mining and Knowledge Discovery in Databases (KDD) State of the Art Prof. Dr. T. Nouri Computer Science Department FHNW Switzerland 1 Conference overview 1. Overview of KDD and data mining 2. Data

More information

A Secure Online Reputation Defense System from Unfair Ratings using Anomaly Detections

A Secure Online Reputation Defense System from Unfair Ratings using Anomaly Detections A Secure Online Reputation Defense System from Unfair Ratings using Anomaly Detections Asha baby PG Scholar,Department of CSE A. Kumaresan Professor, Department of CSE K. Vijayakumar Professor, Department

More information

Machine Learning Final Project Spam Email Filtering

Machine Learning Final Project Spam Email Filtering Machine Learning Final Project Spam Email Filtering March 2013 Shahar Yifrah Guy Lev Table of Content 1. OVERVIEW... 3 2. DATASET... 3 2.1 SOURCE... 3 2.2 CREATION OF TRAINING AND TEST SETS... 4 2.3 FEATURE

More information

On the Application of Trust and Reputation Management and User-centric Techniques for Identity Management Systems

On the Application of Trust and Reputation Management and User-centric Techniques for Identity Management Systems On the Application of Trust and Reputation Management and User-centric Techniques for Identity Management Systems Ginés Dólera Tormo Security Group NEC Laboratories Europe Email: gines.dolera@neclab.eu

More information

Fraud Detection in Electronic Auction

Fraud Detection in Electronic Auction Fraud Detection in Electronic Auction Duen Horng Chau 1, Christos Faloutsos 2 1 Human-Computer Interaction Institute, School of Computer Science, Carnegie Mellon University, 5000 Forbes Avenue, Pittsburgh

More information

Online Reputation Analysis For Sellers

Online Reputation Analysis For Sellers Reputation Premiums in Electronic Peer-to-Peer Markets: Analyzing Textual Feedback and Network Structure Anindya Ghose aghose@stern.nyu.edu Panagiotis G. Ipeirotis panos@stern.nyu.edu Arun Sundararajan

More information

IBM SPSS Direct Marketing 23

IBM SPSS Direct Marketing 23 IBM SPSS Direct Marketing 23 Note Before using this information and the product it supports, read the information in Notices on page 25. Product Information This edition applies to version 23, release

More information

Introduction to. Hypothesis Testing CHAPTER LEARNING OBJECTIVES. 1 Identify the four steps of hypothesis testing.

Introduction to. Hypothesis Testing CHAPTER LEARNING OBJECTIVES. 1 Identify the four steps of hypothesis testing. Introduction to Hypothesis Testing CHAPTER 8 LEARNING OBJECTIVES After reading this chapter, you should be able to: 1 Identify the four steps of hypothesis testing. 2 Define null hypothesis, alternative

More information

Achieve Better Ranking Accuracy Using CloudRank Framework for Cloud Services

Achieve Better Ranking Accuracy Using CloudRank Framework for Cloud Services Achieve Better Ranking Accuracy Using CloudRank Framework for Cloud Services Ms. M. Subha #1, Mr. K. Saravanan *2 # Student, * Assistant Professor Department of Computer Science and Engineering Regional

More information

Evaluation Model of Buyers Dynamic Reputation in E-commerce

Evaluation Model of Buyers Dynamic Reputation in E-commerce Vol.0, No.5 (05), pp.53-64 http://dx.doi.org/0.457/ijmue.05.0.5.07 Evaluation Model of Buyers Dynamic Reputation in E-commerce Yang Zhang ), Tieying Liu ), Ru Li 3) and Zhenhai Wan 4) School of Computer

More information

Conceptual Model of Web Service Reputation

Conceptual Model of Web Service Reputation Conceptual Model of Web Service Reputation E. Michael Maximilien IBM and NCSU maxim@us.ibm.com Munindar P. Singh North Carolina State University singh@ncsu.edu ABSTRACT Current Web services standards enable

More information

PathTrust: A Trust-Based Reputation Service for Virtual Organization Formation

PathTrust: A Trust-Based Reputation Service for Virtual Organization Formation PathTrust: A Trust-Based Reputation Service for Virtual Organization Formation Florian Kerschbaum, Jochen Haller, Yücel Karabulut, and Philip Robinson SAP Research, CEC Karlsruhe, Germany {florian.kerschbaum,

More information

Key Factors for Developing a Successful E-commerce Website

Key Factors for Developing a Successful E-commerce Website IBIMA Publishing Communications of the IBIMA http://www.ibimapublishing.com/journals/cibima/cibima.html Vol. 2010 (2010), Article ID 763461, 9 pages Key Factors for Developing a Successful E-commerce Website

More information

IBM SPSS Direct Marketing 22

IBM SPSS Direct Marketing 22 IBM SPSS Direct Marketing 22 Note Before using this information and the product it supports, read the information in Notices on page 25. Product Information This edition applies to version 22, release

More information

Performance Metrics for Graph Mining Tasks

Performance Metrics for Graph Mining Tasks Performance Metrics for Graph Mining Tasks 1 Outline Introduction to Performance Metrics Supervised Learning Performance Metrics Unsupervised Learning Performance Metrics Optimizing Metrics Statistical

More information

CLASSIFYING SERVICES USING A BINARY VECTOR CLUSTERING ALGORITHM: PRELIMINARY RESULTS

CLASSIFYING SERVICES USING A BINARY VECTOR CLUSTERING ALGORITHM: PRELIMINARY RESULTS CLASSIFYING SERVICES USING A BINARY VECTOR CLUSTERING ALGORITHM: PRELIMINARY RESULTS Venkat Venkateswaran Department of Engineering and Science Rensselaer Polytechnic Institute 275 Windsor Street Hartford,

More information

Adaptation of the ACO heuristic for sequencing learning activities

Adaptation of the ACO heuristic for sequencing learning activities Adaptation of the ACO heuristic for sequencing learning activities Sergio Gutiérrez 1, Grégory Valigiani 2, Pierre Collet 2 and Carlos Delgado Kloos 1 1 University Carlos III of Madrid (Spain) 2 Université

More information

A Simulation Analysis of Formations for Flying Multirobot Systems

A Simulation Analysis of Formations for Flying Multirobot Systems A Simulation Analysis of Formations for Flying Multirobot Systems Francesco AMIGONI, Mauro Stefano GIANI, Sergio NAPOLITANO Dipartimento di Elettronica e Informazione, Politecnico di Milano Piazza Leonardo

More information

Analyzing the Procurement Process in a Simplified Version of the TAC SCM Game

Analyzing the Procurement Process in a Simplified Version of the TAC SCM Game Analyzing the Procurement Process in a Simplified Version of the TAC SCM Game Hosna Jabbari December 9, 2005 Abstract The TAC supply chain management game presents a simulated market environment with automated

More information

Performance Evaluation of Reusable Software Components

Performance Evaluation of Reusable Software Components Performance Evaluation of Reusable Software Components Anupama Kaur 1, Himanshu Monga 2, Mnupreet Kaur 3 1 M.Tech Scholar, CSE Dept., Swami Vivekanand Institute of Engineering and Technology, Punjab, India

More information

International Journal of Engineering Research ISSN: 2348-4039 & Management Technology November-2015 Volume 2, Issue-6

International Journal of Engineering Research ISSN: 2348-4039 & Management Technology November-2015 Volume 2, Issue-6 International Journal of Engineering Research ISSN: 2348-4039 & Management Technology Email: editor@ijermt.org November-2015 Volume 2, Issue-6 www.ijermt.org Modeling Big Data Characteristics for Discovering

More information

The Optimistic Total Order Protocol

The Optimistic Total Order Protocol From Spontaneous Total Order to Uniform Total Order: different degrees of optimistic delivery Luís Rodrigues Universidade de Lisboa ler@di.fc.ul.pt José Mocito Universidade de Lisboa jmocito@lasige.di.fc.ul.pt

More information

USING SPECTRAL RADIUS RATIO FOR NODE DEGREE TO ANALYZE THE EVOLUTION OF SCALE- FREE NETWORKS AND SMALL-WORLD NETWORKS

USING SPECTRAL RADIUS RATIO FOR NODE DEGREE TO ANALYZE THE EVOLUTION OF SCALE- FREE NETWORKS AND SMALL-WORLD NETWORKS USING SPECTRAL RADIUS RATIO FOR NODE DEGREE TO ANALYZE THE EVOLUTION OF SCALE- FREE NETWORKS AND SMALL-WORLD NETWORKS Natarajan Meghanathan Jackson State University, 1400 Lynch St, Jackson, MS, USA natarajan.meghanathan@jsums.edu

More information

Optimization of Search Results with Duplicate Page Elimination using Usage Data A. K. Sharma 1, Neelam Duhan 2 1, 2

Optimization of Search Results with Duplicate Page Elimination using Usage Data A. K. Sharma 1, Neelam Duhan 2 1, 2 Optimization of Search Results with Duplicate Page Elimination using Usage Data A. K. Sharma 1, Neelam Duhan 2 1, 2 Department of Computer Engineering, YMCA University of Science & Technology, Faridabad,

More information

Design of a Multiagent-based E-Marketplace to Secure Service Trading on the Internet

Design of a Multiagent-based E-Marketplace to Secure Service Trading on the Internet Design of a Multiagent-based E-Marketplace to Secure Service Trading on the Internet Qin Li Information Security Group Royal Holloway University of London qin.li.2008@live.rhul.ac.uk Keith M. Martin Information

More information

Term extraction for user profiling: evaluation by the user

Term extraction for user profiling: evaluation by the user Term extraction for user profiling: evaluation by the user Suzan Verberne 1, Maya Sappelli 1,2, Wessel Kraaij 1,2 1 Institute for Computing and Information Sciences, Radboud University Nijmegen 2 TNO,

More information

Supplement to Call Centers with Delay Information: Models and Insights

Supplement to Call Centers with Delay Information: Models and Insights Supplement to Call Centers with Delay Information: Models and Insights Oualid Jouini 1 Zeynep Akşin 2 Yves Dallery 1 1 Laboratoire Genie Industriel, Ecole Centrale Paris, Grande Voie des Vignes, 92290

More information

A Web Recommender System for Recommending, Predicting and Personalizing Music Playlists

A Web Recommender System for Recommending, Predicting and Personalizing Music Playlists A Web Recommender System for Recommending, Predicting and Personalizing Music Playlists Zeina Chedrawy 1, Syed Sibte Raza Abidi 1 1 Faculty of Computer Science, Dalhousie University, Halifax, Canada {chedrawy,

More information

Component Ordering in Independent Component Analysis Based on Data Power

Component Ordering in Independent Component Analysis Based on Data Power Component Ordering in Independent Component Analysis Based on Data Power Anne Hendrikse Raymond Veldhuis University of Twente University of Twente Fac. EEMCS, Signals and Systems Group Fac. EEMCS, Signals

More information

Big Data with Rough Set Using Map- Reduce

Big Data with Rough Set Using Map- Reduce Big Data with Rough Set Using Map- Reduce Mr.G.Lenin 1, Mr. A. Raj Ganesh 2, Mr. S. Vanarasan 3 Assistant Professor, Department of CSE, Podhigai College of Engineering & Technology, Tirupattur, Tamilnadu,

More information

A Better Statistical Method for A/B Testing in Marketing Campaigns

A Better Statistical Method for A/B Testing in Marketing Campaigns A Better Statistical Method for A/B Testing in Marketing Campaigns Scott Burk Marketers are always looking for an advantage, a way to win customers, improve market share, profitability and demonstrate

More information

Dishonest Behaviors in Online Rating Systems: Cyber. Competition, Attack Models, and Attack Generator

Dishonest Behaviors in Online Rating Systems: Cyber. Competition, Attack Models, and Attack Generator Dishonest Behaviors in Online Rating Systems: Cyber 1 Competition, Attack Models, and Attack Generator Yafei Yang, Qinyuan Feng, Yan Lindsay Sun and Yafei Dai University of Rhode Island, Kingston, RI,

More information

SocioPath: In Whom You Trust?

SocioPath: In Whom You Trust? SocioPath: In Whom You Trust? Nagham Alhadad Philippe Lamarre Patricia Serrano-Alvarado Yann Busnel Marco Biazzini {Name.Lastname}@univ-nantes.fr LINA / Université de Nantes 2, rue de la Houssiniére BP

More information

The Role of Visualization in Effective Data Cleaning

The Role of Visualization in Effective Data Cleaning The Role of Visualization in Effective Data Cleaning Yu Qian Dept. of Computer Science The University of Texas at Dallas Richardson, TX 75083-0688, USA qianyu@student.utdallas.edu Kang Zhang Dept. of Computer

More information

Keywords: Dynamic Load Balancing, Process Migration, Load Indices, Threshold Level, Response Time, Process Age.

Keywords: Dynamic Load Balancing, Process Migration, Load Indices, Threshold Level, Response Time, Process Age. Volume 3, Issue 10, October 2013 ISSN: 2277 128X International Journal of Advanced Research in Computer Science and Software Engineering Research Paper Available online at: www.ijarcsse.com Load Measurement

More information

Bootstrapping Big Data

Bootstrapping Big Data Bootstrapping Big Data Ariel Kleiner Ameet Talwalkar Purnamrita Sarkar Michael I. Jordan Computer Science Division University of California, Berkeley {akleiner, ameet, psarkar, jordan}@eecs.berkeley.edu

More information

Establishing How Many VoIP Calls a Wireless LAN Can Support Without Performance Degradation

Establishing How Many VoIP Calls a Wireless LAN Can Support Without Performance Degradation Establishing How Many VoIP Calls a Wireless LAN Can Support Without Performance Degradation ABSTRACT Ángel Cuevas Rumín Universidad Carlos III de Madrid Department of Telematic Engineering Ph.D Student

More information

Trust and Reputation Management

Trust and Reputation Management Trust and Reputation Management Omer Rana School of Computer Science and Welsh escience Centre, Cardiff University, UK Omer Rana (CS, Cardiff, UK) CM0356/CMT606 1 / 28 Outline 1 Context Defining Trust

More information

Intelligent Agents Serving Based On The Society Information

Intelligent Agents Serving Based On The Society Information Intelligent Agents Serving Based On The Society Information Sanem SARIEL Istanbul Technical University, Computer Engineering Department, Istanbul, TURKEY sariel@cs.itu.edu.tr B. Tevfik AKGUN Yildiz Technical

More information

Recommending News Articles using Cosine Similarity Function Rajendra LVN 1, Qing Wang 2 and John Dilip Raj 1

Recommending News Articles using Cosine Similarity Function Rajendra LVN 1, Qing Wang 2 and John Dilip Raj 1 Paper 1886-2014 Recommending News s using Cosine Similarity Function Rajendra LVN 1, Qing Wang 2 and John Dilip Raj 1 1 GE Capital Retail Finance, 2 Warwick Business School ABSTRACT Predicting news articles

More information

Understanding Web personalization with Web Usage Mining and its Application: Recommender System

Understanding Web personalization with Web Usage Mining and its Application: Recommender System Understanding Web personalization with Web Usage Mining and its Application: Recommender System Manoj Swami 1, Prof. Manasi Kulkarni 2 1 M.Tech (Computer-NIMS), VJTI, Mumbai. 2 Department of Computer Technology,

More information

A reputation-based trust management in peer-to-peer network systems

A reputation-based trust management in peer-to-peer network systems A reputation-based trust management in peer-to-peer network systems Natalia Stakhanova, Sergio Ferrero, Johnny Wong, Ying Cai Department of Computer Science Iowa State University Ames, Iowa 50011 USA {

More information

A Multi-agent System for Knowledge Management based on the Implicit Culture Framework

A Multi-agent System for Knowledge Management based on the Implicit Culture Framework A Multi-agent System for Knowledge Management based on the Implicit Culture Framework Enrico Blanzieri Paolo Giorgini Fausto Giunchiglia Claudio Zanoni Department of Information and Communication Technology

More information

Personal and Behavioural Model of Reputation

Personal and Behavioural Model of Reputation REGRET: A reputation model for gregarious societies Jordi Sabater IIIA - Artificial Intelligence Research Institute CSIC - Spanish Scientific Research Council Bellaterra, Catalonia, Spain jsabater@iiia.csic.es

More information

A Reference Model for Reputation Systems

A Reference Model for Reputation Systems A Reference Model for Reputation Systems Sokratis Vavilis a,, Milan Petković a,b, Nicola Zannone a a Eindhoven University of Technology, Den Dolech 2, Eindhoven 5612AZ, Netherlands b Philips Research Eindhoven,

More information

Abstract. Governance TRADERS CITIZENS

Abstract. Governance TRADERS CITIZENS Abstract Towards Regulating Electronic Communities with s Michal Morciniec, Mathias Salle, Brian Monahan Trusted E-Service Laboratory, Hewlett-Packard Laboratories Bristol We present work-in-progress towards

More information

Towards Inferring Web Page Relevance An Eye-Tracking Study

Towards Inferring Web Page Relevance An Eye-Tracking Study Towards Inferring Web Page Relevance An Eye-Tracking Study 1, iconf2015@gwizdka.com Yinglong Zhang 1, ylzhang@utexas.edu 1 The University of Texas at Austin Abstract We present initial results from a project,

More information

Weighted Graph Approach for Trust Reputation Management

Weighted Graph Approach for Trust Reputation Management Weighted Graph Approach for Reputation Management K.Thiagarajan, A.Raghunathan, Ponnammal Natarajan, G.Poonkuzhali and Prashant Ranjan Abstract In this paper, a two way approach of developing trust between

More information

Implementation of P2P Reputation Management Using Distributed Identities and Decentralized Recommendation Chains

Implementation of P2P Reputation Management Using Distributed Identities and Decentralized Recommendation Chains Implementation of P2P Reputation Management Using Distributed Identities and Decentralized Recommendation Chains P.Satheesh Associate professor Dept of Computer Science and Engineering MVGR college of

More information

A Survey on Product Aspect Ranking

A Survey on Product Aspect Ranking A Survey on Product Aspect Ranking Charushila Patil 1, Prof. P. M. Chawan 2, Priyamvada Chauhan 3, Sonali Wankhede 4 M. Tech Student, Department of Computer Engineering and IT, VJTI College, Mumbai, Maharashtra,

More information

International Journal of Computer Trends and Technology (IJCTT) volume 4 Issue 8 August 2013

International Journal of Computer Trends and Technology (IJCTT) volume 4 Issue 8 August 2013 A Short-Term Traffic Prediction On A Distributed Network Using Multiple Regression Equation Ms.Sharmi.S 1 Research Scholar, MS University,Thirunelvelli Dr.M.Punithavalli Director, SREC,Coimbatore. Abstract:

More information

Big Data Analytics of Multi-Relationship Online Social Network Based on Multi-Subnet Composited Complex Network

Big Data Analytics of Multi-Relationship Online Social Network Based on Multi-Subnet Composited Complex Network , pp.273-284 http://dx.doi.org/10.14257/ijdta.2015.8.5.24 Big Data Analytics of Multi-Relationship Online Social Network Based on Multi-Subnet Composited Complex Network Gengxin Sun 1, Sheng Bin 2 and

More information

The Method of Personalized Recommendation with Ensemble Combination

The Method of Personalized Recommendation with Ensemble Combination The Method of Personalized Recommendation with Ensemble Combination Jiwan Seo, Seungjin Choi, Mucheol Kim, and Sangyong Han Chung-Ang University, Seoul, Republic of Korea {jwseo, bethemoney}@ec.cse.cau.ac.kr,

More information