Início
Conheça mais
Enviar pesquisa
Carregar
Entrar
Cadastre-se
Anúncio
IRJET- Reputation Systems - Fair Allocation of Points to the Editors in the Collaborative Community
Denunciar
IRJET Journal
Seguir
Fast Track Publications
2 de Dec de 2019
•
0 gostou
0 gostaram
×
Seja o primeiro a gostar disto
mostrar mais
•
6 visualizações
visualizações
×
Vistos totais
0
No Slideshare
0
De incorporações
0
Número de incorporações
0
Anúncio
Próximos SlideShares
EffectiveCrowdSourcingForProductFeatureIdeation v18
Carregando em ... 3
1
de
5
Top clipped slide
IRJET- Reputation Systems - Fair Allocation of Points to the Editors in the Collaborative Community
2 de Dec de 2019
•
0 gostou
0 gostaram
×
Seja o primeiro a gostar disto
mostrar mais
•
6 visualizações
visualizações
×
Vistos totais
0
No Slideshare
0
De incorporações
0
Número de incorporações
0
Baixar agora
Baixar para ler offline
Denunciar
Engenharia
https://www.irjet.net/archives/V6/i6/IRJET-V6I6482.pdf
IRJET Journal
Seguir
Fast Track Publications
Anúncio
Anúncio
Anúncio
Recomendados
EffectiveCrowdSourcingForProductFeatureIdeation v18
Karthikeyan Rajasekharan
195 visualizações
•
6 slides
The eigen rumor algorithm
amooool2000
379 visualizações
•
16 slides
Anahita Social Engine
Rastin Mehr
3K visualizações
•
19 slides
7239edefaf061ba9818666362c0e6aaa
Anas Metasploit
226 visualizações
•
4 slides
Crowdsourcing Systems on world wide web
Sanjeev Kumar Jaiswal
488 visualizações
•
33 slides
A Survey on Multi-party Privacy Disputes in Social Networks
IRJET Journal
44 visualizações
•
5 slides
Mais conteúdo relacionado
Similar a IRJET- Reputation Systems - Fair Allocation of Points to the Editors in the Collaborative Community
(20)
Book Recommendation System
IRJET Journal
•
2 visualizações
IRJET- Analysis on Existing Methodologies of User Service Rating Prediction S...
IRJET Journal
•
24 visualizações
IRJET- An Intuitive Sky-High View of Recommendation Systems
IRJET Journal
•
18 visualizações
IRJET- Socially Smart an Aggregation System for Social Media using Web Sc...
IRJET Journal
•
19 visualizações
SDJ
Ireneusz Tarnowski
•
137 visualizações
Hybrid Personalized Recommender System Using Modified Fuzzy C-Means Clusterin...
Waqas Tariq
•
329 visualizações
Testing Vitality Ranking and Prediction in Social Networking Services With Dy...
reshma reshu
•
267 visualizações
Efficient and effective video sharing in online Social network using revocati...
IRJET Journal
•
32 visualizações
Socialfeed Roadmap Suggestion
Yuki Ishikawa
•
903 visualizações
Looppa Platform
Looppa
•
575 visualizações
IRJET- Hybrid Book Recommendation System
IRJET Journal
•
29 visualizações
IRJET- Development of College Enquiry Chatbot using Snatchbot
IRJET Journal
•
158 visualizações
SXC-JMS: A WEB -BASED JOURNAL MANAGEMENT SYSTEM
cscpconf
•
78 visualizações
GetPoll (A Polling Website)
IRJET Journal
•
3 visualizações
WYRED Platform. New features
Grial - University of Salamanca
•
109 visualizações
IRJET- Hybrid Recommendation System for Movies
IRJET Journal
•
53 visualizações
IRJET- Online Sequential Behaviour Analysis using Apriori Algorithm
IRJET Journal
•
12 visualizações
Detecting Malicious Social Bots Based-3.pptx
Roshini5096
•
33 visualizações
IRJET- A Survey on Recommender Systems used for User Service Rating in Social...
IRJET Journal
•
18 visualizações
IRJET- Book Recommendation System using Item Based Collaborative Filtering
IRJET Journal
•
23 visualizações
Mais de IRJET Journal
(20)
AN INVESTIGATION ON THE EFFICACY OF MARBLE DUST POWDER FOR STRENGTHENING THE ...
IRJET Journal
•
26 visualizações
A Survey on Person Detection for Social Distancing and Safety Violation Alert...
IRJET Journal
•
8 visualizações
Thermal Analysis and Design Optimization of Solar Chimney using CFD
IRJET Journal
•
7 visualizações
Common Skin Disease Diagnosis and Prediction: A Review
IRJET Journal
•
41 visualizações
A STUDY ON TWITTER SENTIMENT ANALYSIS USING DEEP LEARNING
IRJET Journal
•
22 visualizações
Band structure of metallic single-walled carbon nanotubes
IRJET Journal
•
5 visualizações
IoT Based Assistive Glove for Visually Impaired People
IRJET Journal
•
9 visualizações
A SUPERVISED MACHINE LEARNING APPROACH USING K-NEAREST NEIGHBOR ALGORITHM TO ...
IRJET Journal
•
3 visualizações
An Overview of Traffic Accident Detection System using IoT
IRJET Journal
•
5 visualizações
Artificial Neural Network: A brief study
IRJET Journal
•
4 visualizações
Review Paper on Performance Analysis of LPG Refrigerator
IRJET Journal
•
5 visualizações
WOLBACHIA PIPIENTIS AND VARROA DESTRUCTOR MITE INFESTATION RATES OF NATIVE VE...
IRJET Journal
•
5 visualizações
Survey on Automatic Kidney Lesion Detection using Deep Learning
IRJET Journal
•
3 visualizações
A Review on Safety Management System in School Bus
IRJET Journal
•
10 visualizações
Design and Validation of a Light Vehicle Tubular Space Frame Chassis
IRJET Journal
•
6 visualizações
SMART BLIND STICK USING VOICE MODULE
IRJET Journal
•
10 visualizações
AUTOMATIC HYPODERMIC INFUSION REGULATOR
IRJET Journal
•
7 visualizações
Mobile Application of Pet Adoption System
IRJET Journal
•
11 visualizações
Literature Survey on “Crowdfunding Using Blockchain”
IRJET Journal
•
8 visualizações
Pricing Optimization using Machine Learning
IRJET Journal
•
7 visualizações
Anúncio
Último
(20)
MSEC EEE-NAAC-APRIL 29.3.23.pptx
DRVaibhavmeshram1
•
0 visão
INTERNAL COMBUSTION ENGINE 2.pdf
AmitkrGupta7
•
0 visão
Lecture 4. LCC.pptx
piyushkowe
•
0 visão
DSS_Unit-4.pdf
Gate20241
•
0 visão
Power The Microsoft.pptx
ppcp1
•
0 visão
unit3.0.pptx
MDmanishDeshmukh
•
0 visão
Dare to be Different!.pptx
Abolaji2
•
0 visão
Nano group 9.pdf
MUHAMMADUSAMA16272
•
0 visão
SUP_EDE_0140_1712_DAY1_Q123.pdf
Franklin Sojo
•
0 visão
magneto-hydro-dynamic-power-generation.pptx
AravindAG7
•
0 visão
My Experiments In Agile Testing in Yahoo.pptx
Baiju Joseph
•
0 visão
Retrieval-Augmented Generation for Knowledge-Intensive NLP Tasks.pdf.pdf
Po-Chuan Chen
•
0 visão
WIRELESS_SECURITY.pptx
AdityaKulkarni571462
•
0 visão
Acuators in MEMS.pptx
AmjadAttabet
•
0 visão
Mutual-Exclusion Algorithm.ppt
ShikhaManrai1
•
0 visão
6.couplings.ppt
ssusera6a60c1
•
0 visão
Analytical Mathematics lec 2.pptx
saradaspbro
•
0 visão
Refrigeration Cycle CO2.pptx
im1zen
•
0 visão
Advanced Computational Intelligence: An International Journal (ACII)
aciijournal
•
0 visão
safety final.pptx
saradaspbro
•
0 visão
IRJET- Reputation Systems - Fair Allocation of Points to the Editors in the Collaborative Community
International Research Journal
of Engineering and Technology (IRJET) e-ISSN: 2395-0056 Volume: 06 Issue: 06 | June 2019 www.irjet.net p-ISSN: 2395-0072 © 2019, IRJET | Impact Factor value: 7.211 | ISO 9001:2008 Certified Journal | Page 2259 Reputation Systems - Fair Allocation of Points to the Editors in the Collaborative Community Shubhendra Pal Singhal1 1National Institute of Technology, Tiruchirappalli ---------------------------------------------------------------------------***--------------------------------------------------------------------------- Abstract - In this paper, we are trying to determine a scheme for the fair allocation of points to the contributors of the collaborative community. The major problem of fair allocation of points among the contributors is that we have to analyze the improvement in the versions of an article. Let’s say there is a contribution of major change in content which is relevant vs the contribution of adding a single comma. Every contributor cannot be given the same points in such a case. There are many ways which can be used like number of changes in a new version. That might seem relevant but it becomes irrelevant interms ofcorrect content contribution and other significant changes. There is no AI system toowhichcandetectsuchachangeandawardthepoints accordingly. So, this problem of allocation of points to the contributors is presented by an algorithm with a theoretical proof. It relies on the interactive interaction of the users in the system which is trivial in case of big system design economies. Key Words: Reputation System, Collaborative Community, Publishing, Article, Grading System. 1. INTRODUCTION 1.1 System of Collaborative Community Collaborative community is an article publishing platform where contributors can publish, improveorsuggestanyarticlein their own space. The contentof an article can be plain text or text with videos, images, and links. Users can creategroups within the community, join group, add their content: mainly articles or collated articles. One user can join many different groups depending on his interest. Each group has a different role fora user - author, publisher. Author is the onewhocontributestothe community and publisher, in addition reviews the articles written by the user. A user is allocated a role of publisher or author depending on his level and hours of contribution. The content submitted by the user forthe review will be "visible" tothe users of that community only. There can be versions of the same content indicating the improvement by any user or the implementation of the publisher's suggestion. If the publisher approves of the content, then the article is made public for any user of any community. Groups and communities might need a private space for preparing an article. So the system for collaborative communities also provides a feature for a community to be a private where the article can be viewed by any user only after its publication is approved as shown in Fig1. The system hasa grading system but this grading varies depending upon the roles (author, publisher) and popularity of the article quantified by number of votes and views. Statistics involved in the fair allocation of the points to the community like views and votes is collected by the reputation system micro-service. It allows to present the actual statistics about the active participation of users in the community. 1.2 Role Allocation and Dependency in Collaborative Community As shown in Fig2, collaborative community has many different rolesto engagetheuserswithinthesystem.Thesuper-admin is the creator for whole platform of collaborative system. Role of the super-admin is to approve a request of creation of community by a user and he can approve this request if and only if there is no other community existing with that same concept. The community created will be tagged with all those names which can belong to the same community, thus avoiding the confusion of how community creation can be wisely judged by just a search. The authenticated users who will be interested in a community (by seeing their profiles)canjoinanddraft/editthecontent. One user can always be in multiple groups and then improve existing articles or content. The communities, thus formed, will have the roles of author, publisher and community-admin. Those who draft the article or any content have the option ofeither privatizing their groups or they can make it public so that everyone can collaborate. If the group is made public then group- admin has the power to just remove them. But if it is private then the group-admin will be the first person in thegroupandhas the control of granting permissions of entering and removing the group. The people who feel that they can contribute can join the group. Group in turn has just two roles open. First is the group-admin, then users whocontributetomakethearticlereach, publishable state and last is the author.
International Research Journal
of Engineering and Technology (IRJET) e-ISSN: 2395-0056 Volume: 06 Issue: 06 | June 2019 www.irjet.net p-ISSN: 2395-0072 © 2019, IRJET | Impact Factor value: 7.211 | ISO 9001:2008 Certified Journal | Page 2260 As a user can be in more than one community, two types of reputations are maintained: 1.) Community Reputation : The reputation of user in a particular community whichhasbeenobtainedbasedonthe grading system given under section 2.1 for community. 2.) System Reputation : Article in Stack overflow corresponds to one community in our system and userparticipationmight differ for different communities,so the allocation of points should be different. The reputation that is the cumulative of all the community reputation that user is a part of. Figure1: System of Collaborative Community 2. Research Model 2.1 Grading System The upvote in an article is a measure of how good is the version of the article and downvote is a measure of how can a version improved or negatively rated[1]. The point allocationsystem has been developed considering various factors includingthechancesofmalpracticesandcertainty of cracking the system. The point system is as follows: Creating community (approved by the superadmin):+25. Article published : +5 to the user of last edit and to others(explained in section 2.4), +5 to publisher. Article Reportedwrong(Approved) : -5 to the user of that version and publisher gets -5. Article Reportedwrong(Rejected) : -5 for the user who reported. Article/comment upvote/downvote: +/-2 3. Glimpse of Implementation of the System The system has been implemented in a very straightforward manner. The implementation of upvote, downvotebuttonandflag for reporting the article is merged with the existing template. Usage of these buttons will change the number of upvotes and downvotes in the version of the article and then according to the condition specified in grading system, user reputation will change accordingly as that moment only. There are several case studies which will be based on different scenarios[8]: 1. Person Joining the community: The user gets +25 reputation on his dashboard andhis system reputation also increasesby +25 at this moment. If the user is new to the system, then he gets +25 as the starting reputation.
International Research Journal
of Engineering and Technology (IRJET) e-ISSN: 2395-0056 Volume: 06 Issue: 06 | June 2019 www.irjet.net p-ISSN: 2395-0072 © 2019, IRJET | Impact Factor value: 7.211 | ISO 9001:2008 Certified Journal | Page 2261 2. Person editing the article : The person reputation increases as soon as he hits "save" button which in turn increases his reputation by +2 for initial implementation. 3. Person reporting the article : The person who reported the article has to give the reason ofreportingthearticle.Thisarticle goes in the tab of "Articles Reported" where users of thatcommunity can view that reportedarticles.Thecommunityadminwill have an additional option of approving or rejecting the flag. 3.1 If he approves the request, the reputation of publisher goes down by 5 and user of that last edited version by 5.The reputation of person who reported increases by 5. 3.2 If he rejects the request, the reputation of person who reported will be decreased by 5. 4. Person changing to publishable state : The publisher gets the notification to review the article. If publisher accepts the article and publishes the article, then the publisher would get +5 points, author +5. 5. Why all contributors who helped in editing should get equal points? The system consists of various versions of article. Ourbasicaimtoselectthoseversionswhichactuallyimprovisedthearticlein a better fashion. We assume that the votes that a version receive is independent of the votes in any of the previous version. So, if a user voted for a version once doesn’t mean that this vote will be counted in every other successive version too. Let us consider x1, x2,…..xn as the number of versions after the version of first draft as x0. Consider uk : upvote of the kth version and dk : downvote of the kth version. Let the selected versions be denoted by si, U() is upvote and D() is the downvote. If the factor of U(xi) – U(si-1)/*abs(D(si-1) -D(xi)) is greater than 1 then this means that there is a substantial increaseinupvotes as compared to increase or decrease in downvotes. So we select only those versions which have the positivevalueof thisterm. Figure 2 : Roles and their respective responsibilities in the system
International Research Journal
of Engineering and Technology (IRJET) e-ISSN: 2395-0056 Volume: 06 Issue: 06 | June 2019 www.irjet.net p-ISSN: 2395-0072 © 2019, IRJET | Impact Factor value: 7.211 | ISO 9001:2008 Certified Journal | Page 2262 5.1 (Selection Algorithm) Algorithm for selecting the versions whichledtotheimprovement ofthearticle onthebasis of votes Let S be the set denoting the selected version of article for point allocation including x0. The last element of the S set is represented by S(sk). Algorithm: i = j = k = 0 S = S U x0 while(i <= n-1){ If ( U(xi) > U(S(sk)) and U(xi) – U(S(sk)) / *abs( D(S(sk)) - D(xi) )} >= 1 ) { S = S U xi k = k+1 } i = i+1 } *abs() means absolute value. 5.2 Point Allocation for versions of article in S Now the ratio of (ui + di) : (number of views) is compared and if the ratio is close to one then it is a good articleelsethearticleis not good as the previous one because number of views are way higher than ui + di suggesting that it was less relevant. Obviously ui + di can never be less than number of views. If this is true then something is wrong in code which is trivial to understand. So according to the tested statistics the allocation is : We maintain a bank where the number of versions selected as si will each have +5 point so bank has 5n points if n are selected. Case 1: So those articles which have ratio close to one will have 70% of 5n. Case 2: Publisher will have 20 % of 5n. Case 3: And rest goes to remaining versions of article. Now further if there are two or more articles in every case then equal distribution will be followed. The proximity of close to 1 can be decided by the creator of the system but the above tested results are forproximity -0.5to0.5 precision. 5.3 Proof of the above allocation system The proof describes that the factor of U(xi) – U(si-1)/*abs(D(si-1) -D(xi)) is the improvementfactorwhich will alwaysensurethe selection of those articles which have higher peaks leading it to grow to the publishable state. If the x0 has U(x0), D(x0) ,then the next selection on the basis of the algorithm ensures that if the factor is greater than 1 then there is an increase in upvotes more than that of downvotes. So this ensures the improvement in the article and hence it gets selected. The proof will be done by using the principle of mathematical induction. 1. Base: If the draft is x0, the selection of next version is basically U(xi) – U(xo)/*abs(D(x0) -D(xi)) is greater than equal to 1, which implies that the users of the community have liked the version more than thatof thedraftitselfimplying*abs(downvote rate) to be less than upvote rate. This ensures that if there is an increase in upvote is more than decrease or increase in downvote, then we should select that version i. This selection proves the improvement factor selection algorithm.
International Research Journal
of Engineering and Technology (IRJET) e-ISSN: 2395-0056 Volume: 06 Issue: 06 | June 2019 www.irjet.net p-ISSN: 2395-0072 © 2019, IRJET | Impact Factor value: 7.211 | ISO 9001:2008 Certified Journal | Page 2263 2. Induction : If the previous selected version is sk then, the selection of next versionisbasicallyU(xi)– U(sk)/*abs(D(sk) -D(xi)) >= 1. This ensures that more increase in upvote than change in downvote is there which indicates thatweshouldselecttheversioni if the above condition is satisfied thus making it close to the publishable model. This selection proves the improvement factor selection algorithm. 6. Way to help Publisher reviewing the publishable state The detection of the versionswhich helped the article to improve has one more application. Every time, when the userchanges the state to publishable, then the publisher just needs to keep a track of only those versions which are selected using the algorithm of selection which in turn also suggests that if there is any request at which the user requestedversionisnotselected, then publisher should directly reject that request. 7. Conclusions Thus, this paper addresses the solution to two problems: Fair Allocation of points to contributors and Reducing publisher effort to check all the articles. *abs() means absolute value. The major problem of fair allocation of points among the contributors was that we have to analyze the improvement in the versions ofan article. So, thisproblem of allocation of points to the contributors is presented by an algorithm with a theoretical proof above. The publisher has to approvewhether the content is readyto be published or not.Authenticityofsuchapubliccontentbecomes easy due to the selection algorithm which can handle the requests that user might havedonebyclickingittopublishablestate.If the algorithm includes this version, it becomes to the publishable state else the request is rejected. 8. References [1] Dana Movshovitz-Attias, YairMovshovitz-Attias,PeterSteenkiste,ChristosFaloutsos,"AnalysisoftheReputationSystemand User ContributionsonaQuestionAnsweringWebsite:StackOverflow",2013IEEE/ACMInternationalConferenceonAdvancesin Social Networks Analysis and Mining. [2] Ashton Anderson, Daniel Huttenlocher, Jon Kleinberg, Jure Leskovec, "Discovering Value from Community Activity on Focused Question Answering Sites: A Case Study of Stack Overflow", Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining, 2012 [3] Andrew Marder,"Stack Overflow Badges and User Behavior: An Econometric Approach", Proceedings of the 12th Working Conference on Mining Software, 2015 [4] Bo Adler, Luca deAlfaro, Ashutosh Kulshreshtha, Ian Pye, "Reputation Systems forOpenCollaboration", Communicationsof the ACM 2010, Copyright 200 [5] Page Ranking Algorithm, text is available under the Creative Commons Attribution-ShareAlike License, https://en.wikipedia.org/wiki/PageRank [6] Josang, A., Ismail, R. (2002, June). The beta reputation system. In Proceedings of the 15th bled electronic commerce conference (Vol. 5, pp. 2502-2511). [7] A Josang, R Ismail - Proceedings of the 15th bled electronic "The beta reputation system", 2002 - domino.fov.uni-mb.si [8] M Gupta, P Judge, M Ammar - of the 13th international workshop, "A reputation system for peer-to-peer networks", 2003- dl.acm.org [9] C. Boyd A. Jøsang, R. Ismail. A survey of trust and reputation systems foronline service provision. DecisionSupportSystems, 43:618–644, 2007 [10] B.T. Adler, K. Chatterjee, L. de Alfaro, M. Faella, I. Pye, and V. Raman. Assigning trust to Wikipedia content. InProc. of WikiSym 08: International Symposium on Wikis. ACM Press, 2008.
Anúncio