Quick search Find article
Quick search
Find article

Clustering of sparse data via network communities—a prototype study of a large online market

Jörg Reichardt1 and Stefan Bornholdt

Show affiliations


Market segmentation of an online auction site (www.ebay.de) is studied using a novel clustering technique via community detection. A network of bidders connected by common interest in individual articles is constructed, whose community structure corresponds to the main user groups according to common interest. A key feature of the analysis is its independence of any kind of measure of similarity between the bidders or articles offered, or any kind of dimensionality reduction possibly biasing the analysis. Further, the method works on the sparse raw data directly, is scalable to large systems and can be used to discover both hierarchical and overlapping cluster structures. Results are compared to null models based on random networks and clusters are validated and interpreted using the taxonomic classifications of eBay categories. We find clear-cut and coherent interest profiles for the bidders in each cluster. The interest profiles of bidder groups are compared to the classification of articles actually bought by these users during the time span 6–9 months after the initial grouping. Their temporal stability indicates typical interest profiles in society. Our results shed some light on typical characteristics of online markets and their segmentation. They show how network theory can be applied successfully to problems of cluster analysis in economic and sociological milieu studies with large, sparse and high dimensional data.


Keywords

random graphs, networks

new applications of statistical mechanics

socio-economic networks

online dynamics

PACS

89.65.Gh Economics; econophysics, financial markets, business and management

02.70.Rr General statistical methods

02.10.Ox Combinatorics; graph theory

05.40.-a Fluctuation phenomena, random processes, noise, and Brownian motion

05.50.+q Lattice theory and statistics (Ising, Potts, etc.)

02.50.Cw Probability theory

MSC

62H30 Classification and discrimination; cluster analysis (See also 68T10)

91C20 Clustering (See also 62D05)

05C80 Random graphs

91B26 Market models (auctions, bargaining, bidding, selling, etc.)

Subjects

Mathematical physics

Computational physics

Statistical physics and nonlinear systems

Dates

Issue 06 (June 2007)

Received 22 September 2006, accepted for publication 31 May 2007

Published 25 June 2007



  1. Clustering of sparse data via network communities—a prototype study of a large online market

    Jörg Reichardt and Stefan Bornholdt J. Stat. Mech. (2007) P06016

  2. Growth and applications of Group III-nitrides

    O Ambacher 1998 J. Phys. D: Appl. Phys. 31 2653

  3. Direct observation of Hardy's paradox by joint weak measurement with an entangled photon pair

    Kazuhiro Yokota et al 2009 New J. Phys. 11 033011

  4. The Littlest Higgs

    Nima Arkani-Hamed et al JHEP07(2002)034

  5. The Minimal Moose for a Little Higgs

    Nima Arkani-Hamed et al JHEP08(2002)021

  6. Equation of state in a small system: Violation of an assumption of Maxwell's demon

    T. Hondou 2007 EPL 80 50001

  7. Large enhancement of the thermoelectric figure of merit in a ridged quantum well

    Avto Tavkhelidze 2009 Nanotechnology 20 405401

  8. Feedback characteristics of nonlinear dynamical systems

    A. Lahellec et al 2008 EPL 81 60001

  9. Characterization of a 2D ion chamber array for the verification of radiotherapy treatments

    E Spezi et al 2005 Phys. Med. Biol. 50 3361

  10. Gamma-ray scattering for fat fraction measurement

    J Shakeshaft et al 1997 Phys. Med. Biol. 42 1403

Users also read

What's this?
This innovative new feature generates a list of articles 'also read' by other users based on them reading the original article. Article abstracts citations and references are all considered and weighted accordingly. We hope that this will help you find relevant papers for your research.

  1. Detecting overlapping community structure of networks based on vertex–vertex correlations
  2. Comparing community structure identification

View by subject




Export








Please login to access our web services, or create an account if you don't yet have one.

You must have cookies enabled in your web browser to be able to login.

Username
Password

Forgotten your password? Get a new one here.