Pith. sign in

REVIEW

Knowledge Transferring via Model Aggregation for Online Social Care

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1905.07665 v2 pith:M3MXOCIZ submitted 2019-05-19 cs.CR cs.HC

Knowledge Transferring via Model Aggregation for Online Social Care

classification cs.CR cs.HC
keywords knowledgesocialaggregationclientscaremodeltransferringalgorithm
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

The Internet and the Web are being increasingly used in proactive social care to provide people, especially the vulnerable, with a better life and services, and their derived social services generate enormous data. However, the strict protection of privacy makes user's data become an isolated island and limits the predictive performance of standalone clients. To enable effective proactive social care and knowledge sharing within intelligent agents, this paper develops a knowledge transferring framework via model aggregation. Under this framework, distributed clients perform on-device training, and a third-party server integrates multiple clients' models and redistributes to clients for knowledge transferring among users. To improve the generalizability of the knowledge sharing, we further propose a novel model aggregation algorithm, namely the average difference descent aggregation (AvgDiffAgg for short). In particular, to evaluate the effectiveness of the learning algorithm, we use a case study on the early detection and prevention of suicidal ideation, and the experiment results on four datasets derived from social communities demonstrate the effectiveness of the proposed learning method.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.