TY - GEN
T1 - TrustLOG
T2 - 33rd ACM Web Conference, WWW 2024
AU - He, Jingrui
AU - Kang, Jian
AU - Nargesian, Fatemeh
AU - Wang, Haohui
AU - Zhang, An
AU - Zhou, Dawei
N1 - Publisher Copyright:
© 2024 Copyright held by the owner/author(s).
PY - 2024/5/13
Y1 - 2024/5/13
N2 - Learning on graphs (LOG) has a profound impact on various high-impact domains, such as information retrieval, social network analysis, computational chemistry and transportation. Despite decades of theoretical development, algorithmic advancements, and open-source systems that answers what the optimal learning results are, concerns about the trustworthiness of state-of-the-art LOG techniques have emerged in practical applications. Consequently, crucial research questions arise: why are LOG techniques untrustworthy with respect to critical social aspects like fairness, transparency, privacy, and security? How can we ensure the trustworthiness of learning algorithms on graphs? To address the increasingly important safety and ethical challenges in learning on graphs, it is essential to achieve a paradigm shift from solely addressing what questions to understanding how and why questions. Building upon the success of the first TrustLOG workshop in 2022, the second TrustLOG workshop aims to bring together researchers and practitioners to present, discuss, and advance cutting-edge research in the realm of trustworthy learning on graphs. The workshop serves as a platform to stimulate the TrustLOG community, fostering the identification of new research challenges, and shedding light on potential future directions.
AB - Learning on graphs (LOG) has a profound impact on various high-impact domains, such as information retrieval, social network analysis, computational chemistry and transportation. Despite decades of theoretical development, algorithmic advancements, and open-source systems that answers what the optimal learning results are, concerns about the trustworthiness of state-of-the-art LOG techniques have emerged in practical applications. Consequently, crucial research questions arise: why are LOG techniques untrustworthy with respect to critical social aspects like fairness, transparency, privacy, and security? How can we ensure the trustworthiness of learning algorithms on graphs? To address the increasingly important safety and ethical challenges in learning on graphs, it is essential to achieve a paradigm shift from solely addressing what questions to understanding how and why questions. Building upon the success of the first TrustLOG workshop in 2022, the second TrustLOG workshop aims to bring together researchers and practitioners to present, discuss, and advance cutting-edge research in the realm of trustworthy learning on graphs. The workshop serves as a platform to stimulate the TrustLOG community, fostering the identification of new research challenges, and shedding light on potential future directions.
KW - graph learning
KW - graph mining
KW - Trustworthy machine learning
UR - http://www.scopus.com/inward/record.url?scp=85194459994&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85194459994&partnerID=8YFLogxK
U2 - 10.1145/3589335.3641305
DO - 10.1145/3589335.3641305
M3 - Conference contribution
AN - SCOPUS:85194459994
T3 - WWW 2024 Companion - Companion Proceedings of the ACM Web Conference
SP - 1785
EP - 1788
BT - WWW 2024 Companion - Companion Proceedings of the ACM Web Conference
PB - Association for Computing Machinery
Y2 - 13 May 2024 through 17 May 2024
ER -