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

DOI10.1088/1742-5468/2007/06/P06016MaRDI QIDQ5239369zbMATH OpenFDO

Authors Jörg Reichardt, Stefan Bornholdt

Publication date 22 October 2019

Published in Journal of Statistical Mechanics: Theory and Experiment (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/physics/0503138

zbMATH Keywords

networksnew applications of statistical mechanicsonline dynamicsrandom graphssocio-economic networks

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Auctions, bargaining, bidding and selling, and other market models (91B26) Applications of statistical and quantum mechanics to economics (econophysics) (91B80) Social networks; opinion dynamics (91D30)

Abstract: Market segmentation of an online auction site is studied by analyzing the users' bidding behavior. The distribution of user activity is investigated and a network of bidders connected by common interest in individual articles is constructed. The network's cluster structure corresponds to the main user groups according to common interest, exhibiting hierarchy and overlap. Key feature of the analysis is its independence of any similarity measure between the articles offered on eBay, as such a measure would only introduce bias in the analysis. 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. The interest profiles discovered remain stable, indicating typical interest profiles in society. Our results show how network theory can be applied successfully to problems of market segmentation and sociological milieu studies with sparse, high dimensional data.

Recommendations

• E-loyalty networks in online auctions
• Distance-based clustering of sparsely observed stochastic processes, with applications to online auctions
• Clustering Social Networks
• Algorithms and Models for the Web-Graph
• Community structure in social and biological networks

Cites work

• Community structure in social and biological networks
• Exploring complex networks
• scientific article; zbMATH DE number 3168214 (Why is no real title available?)
• Random graph models of social networks
• Study of the phase transition in the 3D Ising spin glass from out-of-equilibrium numerical simulations

Cited in

(20)

• Convex relaxation methods for community detection
• A random effects stochastic block model for joint community detection in multiple networks with applications to neuroimaging
• Clustering via the modified Petford-Welsh algorithm
• Community detection in temporal multilayer networks, with an application to correlation networks
• scientific article; zbMATH DE number 6982944 (Why is no real title available?)
• Fast multi-scale detection of overlapping communities using local criteria
• A classification for community discovery methods in complex networks
• Relating modularity maximization and stochastic block models in multilayer networks
• Moments of uniform random multigraphs with fixed degree sequences
• Multilayer modularity belief propagation to assess detectability of community structure
• Detecting Hierarchical Communities in Networks: A New Approach
• Flow-Based Community Detection in Hypergraphs
• Characterizing brain connectivity from human electrocorticography recordings with unobserved inputs during epileptic seizures
• Interpretation of the precision matrix and its application in estimating sparse brain connectivity during sleep spindles from human electrocorticography recordings
• Identifying vortical network connectors for turbulent flow modification
• Community detection in attributed networks for global transfer market
• BI-COMMUNITY DETECTION METHOD BASED ON BOTH INTRA- AND INTER-CORRELATION: AN APPLIED RESEARCH OF INTERNATIONAL RELATIONS
• A maximal-clique-based set-covering approach to overlapping community detection
• Distance-based clustering of sparsely observed stochastic processes, with applications to online auctions
• E-loyalty networks in online auctions

This page was built for publication: Clustering of sparse data via network communities -- a prototype study of a large online market

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5239369)