Sinking Ambiguity of Top-K Ranking by Pairwise Crowdsourcing


Authors : M.S.Vijaykumar, B.Suganya.

Volume/Issue : Volume 3 - 2018, Issue 4 - April

Google Scholar : https://goo.gl/DF9R4u

Scribd : https://goo.gl/kTLjCy

Thomson Reuters ResearcherID : https://goo.gl/3bkzwv

Probabilistic position of best kis akeyoperative queryinambiguitydatabases. Best k result value might be greatlyinflatedby ambiguityof underlying data. The future reduction techniques of ambiguityis used to develop the excellence of best k results by cleaning the exceptional data. Unluckily,most data cleaning models are planned to discover exactvalue of objects separatelyand therefore do not work well for biased datatype, such asclient ratings, which are probabilisticfundamentally. The ambiguity of best k positionis used to decreasepair wisecrowd sourcing model using a mass of province experts. It proposesproficient algorithms for highest quality improvement by selecting the topentity pairs for crowd sourcing. Broad trials demonstrate that the proposed arrangements out play out a hit and miss choice technique as far as quality change of probabilistic best k positioning questions. In terms of capability, the future solution scan shrink the beyond time of a brute-force algorithm from a number of days to one minute.

CALL FOR PAPERS


Paper Submission Last Date
31 - May - 2022

Paper Review Notification
In 1-2 Days

Paper Publishing
In 2-3 Days

Never miss an update from Papermashup

Get notified about the latest tutorials and downloads.

Subscribe by Email

Get alerts directly into your inbox after each post and stay updated.
Subscribe
OR

Subscribe by RSS

Add our RSS to your feedreader to get regular updates from us.
Subscribe