Jurnal
SINTA 2
LEARNING WORD RELATEDNESS OVER TIME FOR TEMPORAL RANKING
Jurnal Ilmu Komputer dan Informasi (JIKI) · Vol. 12 No. 2 (2019) · hlm. 91–102
ISSN 2502-9274, 2088-7051
Terbit 2019-07-08
Penerbit Faculty of Computer Science - Universitas Indonesia
Bahasa eng
Abstrak
Queries and ranking with temporal aspects gain significant attention in field of Information Retrieval. While searching for articles published over time, the relevant documents usually occur in certain temporal patterns. Given a query that is implicitly time sensitive, we develop a temporal ranking using the important times of query by drawing from the distribution of query trend relatedness over time. We also combine the model with Dual Embedding Space Model (DESM) in the temporal model according to document timestamp. We apply our model using three temporal word embeddings algorithms to learn relatedness of words from news archive in Bahasa Indonesia: (1) QT-W2V-Rank using Word2Vec (2) QT-OW2V-Rank using OrthoTrans-Word2Vec (3) QT-DBE-Rank using Dynamic Bernoulli Embeddings. The highest score was achieved with static word embeddings learned separately over time, called QT-W2V-Rank, which is 66% in average precision and 68% in early precision. Furthermore, studies of different characteristics of temporal topics showed that QT-W2V-Rank is also more effective in capturing temporal patterns such as spikes, periodicity, and seasonality than the baselines.
Jaringan kolaborasi para penulis
4 penulis ·
4 tautan kepenulisan bersama
Arahkan kursor atau ketuk sebuah nama untuk menyorot rekan penulisnya. Klik dua kali untuk membuka halaman penulis.
Organisasi berbeda
Organisasi sama
Afiliasi tidak diketahui
Garis lebih tebal = lebih banyak artikel bersama · lingkaran lebih besar = lebih banyak artikel
Tampilkan sebagai tabel
Afiliasi berasal dari OpenAlex; metadata OAI-PMH jurnal tidak memuatnya. Penulis tanpa ID OpenAlex dicocokkan berdasarkan nama, sehingga dua orang bisa tergabung atau satu orang bisa terpisah.
Sumber metadata: OAI-PMH (metadata jurnal) https://jiki.cs.ui.ac.id/index.php/jiki/oai, pertama di-harvest 26 Okt 2026, terakhir terlihat 15 Nov 2026.
Metadata asli (oai_dc)
<oai_dc:dc xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
<dc:title xml:lang="en-US">LEARNING WORD RELATEDNESS OVER TIME FOR TEMPORAL RANKING</dc:title>
<dc:creator>Sigmawaty, Dinda</dc:creator>
<dc:creator>Adriani, Mirna</dc:creator>
<dc:subject xml:lang="en-US">Information Retrieval</dc:subject>
<dc:subject xml:lang="en-US">temporal ranking</dc:subject>
<dc:subject xml:lang="en-US">Dual Embedding Space Model</dc:subject>
<dc:subject xml:lang="en-US">temporal word embeddings</dc:subject>
<dc:description xml:lang="en-US">Queries and ranking with temporal aspects gain significant attention in field of Information Retrieval. While searching for articles published over time, the relevant documents usually occur in certain temporal patterns. Given a query that is implicitly time sensitive, we develop a temporal ranking using the important times of query by drawing from the distribution of query trend relatedness over time. We also combine the model with Dual Embedding Space Model (DESM) in the temporal model according to document timestamp. We apply our model using three temporal word embeddings algorithms to learn relatedness of words from news archive in Bahasa Indonesia: (1) QT-W2V-Rank using Word2Vec (2) QT-OW2V-Rank using OrthoTrans-Word2Vec (3) QT-DBE-Rank using Dynamic Bernoulli Embeddings. The highest score was achieved with static word embeddings learned separately over time, called QT-W2V-Rank, which is 66% in average precision and 68% in early precision. Furthermore, studies of different characteristics of temporal topics showed that QT-W2V-Rank is also more effective in capturing temporal patterns such as spikes, periodicity, and seasonality than the baselines.</dc:description>
<dc:publisher xml:lang="en-US">Faculty of Computer Science - Universitas Indonesia</dc:publisher>
<dc:date>2019-07-08</dc:date>
<dc:type>info:eu-repo/semantics/article</dc:type>
<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
<dc:format>application/pdf</dc:format>
<dc:identifier>https://jiki.cs.ui.ac.id/index.php/jiki/article/view/745</dc:identifier>
<dc:identifier>10.21609/jiki.v12i2.745</dc:identifier>
<dc:source xml:lang="en-US">Jurnal Ilmu Komputer dan Informasi; Vol. 12 No. 2 (2019): Jurnal Ilmu Komputer dan Informasi (Journal of Computer Science and Information); 91-102</dc:source>
<dc:source>2502-9274</dc:source>
<dc:source>2088-7051</dc:source>
<dc:source>10.21609/jiki.v12i2</dc:source>
<dc:language>eng</dc:language>
<dc:relation>https://jiki.cs.ui.ac.id/index.php/jiki/article/view/745/416</dc:relation>
<dc:rights xml:lang="en-US">Copyright (c) 2019 Jurnal Ilmu Komputer dan Informasi</dc:rights>
</oai_dc:dc>
Sitasi dan pengindeksan
Jumlah menurut tiap indeks pada 26 Okt 2026; setiap indeks menghitung sitasi dengan cara berbeda.
OpenAlex juga mencatat karya ini di: crossref, doaj.
Sitasi artikel ini
APA 7
Sigmawaty, D., & Adriani, M. (2019). LEARNING WORD RELATEDNESS OVER TIME FOR TEMPORAL RANKING. Jurnal Ilmu Komputer dan Informasi (JIKI), 12(2), 91–102. https://doi.org/10.21609/jiki.v12i2.745
Salin
IEEE
D. Sigmawaty and M. Adriani, “LEARNING WORD RELATEDNESS OVER TIME FOR TEMPORAL RANKING,” Jurnal Ilmu Komputer dan Informasi (JIKI), vol. 12, no. 2, pp. 91–102, 2019, doi: 10.21609/jiki.v12i2.745.
Salin
Dibuat dari metadata jurnal; periksa nama penulis sebelum dipakai.