New algorithms for mining the reputation of participants of online auctions (Q943870): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00453-007-9106-6 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1837348938 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4250236 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Web-based reputation management systems: Problems and suggested solutions / rank
 
Normal rank

Latest revision as of 17:07, 28 June 2024

scientific article
Language Label Description Also known as
English
New algorithms for mining the reputation of participants of online auctions
scientific article

    Statements

    New algorithms for mining the reputation of participants of online auctions (English)
    0 references
    0 references
    0 references
    12 September 2008
    0 references
    Two novel measures are proposed for reputation rating in the online auction environment: credibility and density. The credibility measure is defined for buyers and sellers iteratively: a buyer is more credible if he participates successfully in many auctions involving credible sellers and vice versa. The density measure evaluates the number of neighbors for a given seller, i.e. the number of other sellers who are linked to the given one by a sufficient number of common buyers. The author discusses how these measures can be used to safeguard against such popular schemes of reputation rating deception as ballot stuffing and clique creating. Application to data on www.allegro.pl, the leading Polish online auctions provider in presented.
    0 references
    Data mining
    0 references
    Online auctions
    0 references
    Reputation systems
    0 references

    Identifiers