A Recommendation System for Trigger–Action Programming Rules via Graph Contrastive Learning

Trigger-action programming (TAP) enables users to automate Internet of Things (IoT) devices by creating rules such as "IF Device1.TriggerState is triggered, THEN Device2.ActionState is executed". As the number of IoT devices grows, the combination space between the functions provided by devices expands, making manual rule creation time-consuming for end-users. Existing TAP recommendation systems enhance the efficiency of rule discovery but face two primary issues: they ignore the association of rules between users and fail to model collaborative information among users. To address these issues, this article proposes a graph contrastive learning-based recommendation system for TAP rules, named GCL4TAP. In GCL4TAP, we first devise a data partitioning method called DATA2DIV, which establishes cross-user rule relationships and is represented by a user-rule bipartite graph. Then, we design a user-user graph to model the similarities among users based on the categories and quantities of devices that they own. Finally, these graphs are converted into low-dimensional vector representations of users and rules using graph contrastive learning techniques. Extensive experiments conducted on a real-world smart home dataset demonstrate the superior performance of GCL4TAP compared to other state-of-the-art methods.

Authors

Institutions

Publication Details

Journal
Sensors
Published
2024-09-23
DOI
https://doi.org/10.3390/s24186151
Citations
4
Primary Topic
Recommender Systems and Techniques
Type
article
Field-Weighted Citation Impact
3.12
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A Recommendation System for Trigger–Action Programming Rules via Graph Contrastive Learning

Jian Zhao, Gang Wu, Zhejun Kuang, Da‐Wen Sun et al.
4 citations
Sensors
Recommender Systems and Techniques
3.12
article

A Recommendation System for Trigger–Action Programming Rules via Graph Contrastive Learning

Jian Zhao, Gang Wu, Zhejun Kuang, Da‐Wen Sun, Xingbo Xiong, Feng Wang
article en
4 citations

Abstract

Trigger-action programming (TAP) enables users to automate Internet of Things (IoT) devices by creating rules such as "IF Device1.TriggerState is triggered, THEN Device2.ActionState is executed". As the number of IoT devices grows, the combination space between the functions provided by devices expands, making manual rule creation time-consuming for end-users. Existing TAP recommendation systems enhance the efficiency of rule discovery but face two primary issues: they ignore the association of rules between users and fail to model collaborative information among users. To address these issues, this article proposes a graph contrastive learning-based recommendation system for TAP rules, named GCL4TAP. In GCL4TAP, we first devise a data partitioning method called DATA2DIV, which establishes cross-user rule relationships and is represented by a user-rule bipartite graph. Then, we design a user-user graph to model the similarities among users based on the categories and quantities of devices that they own. Finally, these graphs are converted into low-dimensional vector representations of users and rules using graph contrastive learning techniques. Extensive experiments conducted on a real-world smart home dataset demonstrate the superior performance of GCL4TAP compared to other state-of-the-art methods.

SensorsVol. 24(18)
Changchun University of Science and Technology (CN), Jilin University (CN), Health Commission of Jilin Province (CN), Changchun University (CN)
Openalex Percentile: Top 7%
Recommender Systems and Techniques
3.12
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.