Predicting individual socioeconomic status from mobile phone data: a semi-supervised hypergraph-based factor graph approach

被引:0
|
作者
Tao Zhao
Hong Huang
Xiaoming Yao
Jar-der Luo
Xiaoming Fu
机构
[1] University of Goettingen,Institute of Computer Science
[2] Huazhong University of Science and Technology,School of Computer Science
[3] China TelecomCo.,Department of Sociology
[4] Ltd.,undefined
[5] Tsinghua University,undefined
关键词
Socioeconomic status; Mobile phone data; Hypergraph; Factor graph;
D O I
暂无
中图分类号
学科分类号
摘要
Socioeconomic status (SES) is an important economic and social aspect widely concerned. Assessing individual SES can assist related organizations in making a variety of policy decisions. Traditional approach suffers from the extremely high cost in collecting large-scale SES-related survey data. With the ubiquity of smart phones, mobile phone data has become a novel data source for predicting individual SES with low cost. However, the task of predicting individual SES on mobile phone data also proposes some new challenges, including sparse individual records, scarce explicit relationships and limited labeled samples, unconcerned in prior work restricted to regional or household-oriented SES prediction. To address these issues, we propose a semi-supervised hypergraph-based factor graph model (HyperFGM) for individual SES prediction. HyperFGM is able to efficiently capture the associations between SES and individual mobile phone records to handle the individual record sparsity. For the scarce explicit relationships, HyperFGM models implicit high-order relationships among users on the hypergraph structure. Besides, HyperFGM explores the limited labeled data and unlabeled data in a semi-supervised way. Experimental results show that HyperFGM greatly outperforms the baseline methods on a set of anonymized real mobile phone data for individual SES prediction.
引用
收藏
页码:361 / 372
页数:11
相关论文
共 50 条
  • [1] Predicting individual socioeconomic status from mobile phone data: a semi-supervised hypergraph-based factor graph approach
    Zhao, Tao
    Huang, Hong
    Yao, Xiaoming
    Luo, Jar-der
    Fu, Xiaoming
    INTERNATIONAL JOURNAL OF DATA SCIENCE AND ANALYTICS, 2020, 9 (03) : 361 - 372
  • [2] Autoencoder and Hypergraph-Based Semi-Supervised Broad Learning System
    Wang X.-S.
    Zhang H.-L.
    Cheng Y.-H.
    Tien Tzu Hsueh Pao/Acta Electronica Sinica, 2022, 50 (03): : 533 - 539
  • [3] Exploring hypergraph-based semi-supervised ranking for query-oriented summarization
    Wang, Wei
    Li, Sujian
    Li, Jiwei
    Li, Wenjie
    Wei, Furu
    INFORMATION SCIENCES, 2013, 237 : 271 - 286
  • [4] Semi-supervised Learning with Graph Convolutional Networks Based on Hypergraph
    Yangding Li
    Yingying Wan
    Xingyi Liu
    Neural Processing Letters, 2022, 54 : 2629 - 2644
  • [5] Semi-supervised Learning with Graph Convolutional Networks Based on Hypergraph
    Li, Yangding
    Wan, Yingying
    Liu, Xingyi
    NEURAL PROCESSING LETTERS, 2022, 54 (04) : 2629 - 2644
  • [6] Hypergraph-based convex semi-supervised unconstraint symmetric matrix factorization for image clustering
    Luo, Wenjun
    Wu, Zezhong
    Zhou, Nan
    INFORMATION SCIENCES, 2024, 680
  • [7] A semi-supervised social relationships inferred model based on mobile phone data
    Yu, Chen
    Wang, Namin
    Yang, Laurence T.
    Yao, Dezhong
    Hsu, Ching-Hsien
    Jin, Hai
    FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE, 2017, 76 : 458 - 467
  • [8] Mobile phone name extraction from internet forums: a semi-supervised approach
    Yangjie Yao
    Aixin Sun
    World Wide Web, 2016, 19 : 783 - 805
  • [9] Mobile phone name extraction from internet forums: a semi-supervised approach
    Yao, Yangjie
    Sun, Aixin
    WORLD WIDE WEB-INTERNET AND WEB INFORMATION SYSTEMS, 2016, 19 (05): : 783 - 805
  • [10] Graph-Based Semi-supervised Learning for Phone and Segment Classification
    Liu, Yuzong
    Kirchhoff, Katrin
    14TH ANNUAL CONFERENCE OF THE INTERNATIONAL SPEECH COMMUNICATION ASSOCIATION (INTERSPEECH 2013), VOLS 1-5, 2013, : 1839 - 1842