Zobrazeno 1 - 10
of 15
pro vyhledávání: '"Woojeong Jin"'
Publikováno v:
PLoS ONE, Vol 14, Iss 3, p e0213857 (2019)
Given a real-world graph, how can we measure relevance scores for ranking and link prediction? Random walk with restart (RWR) provides an excellent measure for this and has been applied to various applications such as friend recommendation, community
Externí odkaz:
https://doaj.org/article/cbcb672b7da84bc0a8d4351f3ac787cb
Autor:
Daniel M. Benjamin, Fred Morstatter, Ali E. Abbas, Andres Abeliuk, Pavel Atanasov, Stephen Bennett, Andreas Beger, Saurabh Birari, David V. Budescu, Michele Catasta, Emilio Ferrara, Lucas Haravitch, Mark Himmelstein, KSM Tozammel Hossain, Yuzhong Huang, Woojeong Jin, Regina Joseph, Jure Leskovec, Akira Matsui, Mehrnoosh Mirtaheri, Xiang Ren, Gleb Satyukov, Rajiv Sethi, Amandeep Singh, Rok Sosic, Mark Steyvers, Pedro A Szekely, Michael D. Ward, Aram Galstyan
Publikováno v:
AI Magazine. 44:112-128
Publikováno v:
World Wide Web. 24:1369-1393
Given an edge-labeled graph and two nodes, how can we accurately infer the relation between the nodes? Reasoning how the nodes are related is a fundamental task in analyzing network data, and various relevance measures have been suggested to effectiv
Pre-trained language models are still far from human performance in tasks that need understanding of properties (e.g. appearance, measurable quantity) and affordances of everyday objects in the real world since the text lacks such information due to
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c0ba8331d34515dcc0c331e723ef63d6
Publikováno v:
Knowledge and Information Systems. 62:571-610
How can we rank nodes in signed social networks? Relationships between nodes in a signed network are represented as positive (trust) or negative (distrust) edges. Many social networks have adopted signed networks to express trust between users. Conse
To reduce a model size but retain performance, we often rely on knowledge distillation (KD) which transfers knowledge from a large "teacher" model to a smaller "student" model. However, KD on multimodal datasets such as vision-language tasks is relat
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::82515cdc012e632575fd59d6db928b0c
Publikováno v:
ACL/IJCNLP (1)
Event forecasting is a challenging, yet important task, as humans seek to constantly plan for the future. Existing automated forecasting studies rely mostly on structured data, such as time-series or event-based knowledge graphs, to help predict futu
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::93584a4e496f43d5f7fae43668a986ca
http://arxiv.org/abs/2005.00792
http://arxiv.org/abs/2005.00792
Publikováno v:
IJCAI
Time series prediction is an important problem in machine learning. Previous methods for time series prediction did not involve additional information. With a lot of dynamic knowledge graphs available, we can use this additional information to predic
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::801b8efe59830295bba72a305fd7cd86
Publikováno v:
EMNLP (1)
Knowledge graph reasoning is a critical task in natural language processing. The task becomes more challenging on temporal knowledge graphs, where each fact is associated with a timestamp. Most existing methods focus on reasoning at past timestamps a
Publikováno v:
Journal of KIISE. 45:564-571