Real-time automatic tag recommendation
By Yang Song, Ziming Zhuang, Huajing Li, Qiankun Zhao, Jia Li, Wang-Chien Lee, C. Lee Giles. Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, 2008
304 citations recorded by the source corpus.
Subfields: Artificial Intelligence, Computer Vision and Pattern Recognition
View Paper: https://www.semanticscholar.org/paper/a7421c8b1dec4401a12f86ee73b7dd105c152691
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Artificial Intelligence
- Lars Schmidt-Thieme
- Steffen Rendle
- Xiangnan He
- Ivor Wai-Hung Tsang
- Tat-seng Chua
- Ralf Krestel
- Wolfgang Nejdl
- Péter Fankhauser
In Computer Vision and Pattern Recognition
- Ivor Wai-Hung Tsang
- Lars Schmidt-Thieme
- Shenghua Gao
- Dacheng Tao
- Liang-Tien Chia
- Shulong Tan
- Jiajun Bu
- Alexandros Nanopoulos
Citations in the corpus
- Laplacian Sparse Coding, Hypergraph Laplacian Sparse Coding, and Applications (2013, methodology): “Another possible solution is the image tag recommendation method [32], [33].”
- Music recommendation by unified hypergraph: combining social media information and music content (2010, background): “For the tag recommendation problem [34, 15], we should set the target user and the target resource as queries and consider the ranking results of tags.”
- Latent dirichlet allocation for tag recommendation (2009, background): “A recent approach in this direction is presented in [29].”
- Recommender Systems (2016, unknown): “Among these works, the techniques in [556] are designed to perform the tag recommendation in real time.”
- Learning optimal ranking with tensor factorization for tag recommendation (2009, methodology): “But here we use ŷmax as the theoretical upper bound for non-personalized recommenders because it creates the best non-personalized top-n list for the test set Stest – every other method for non-personalized tag recommendation like [2, 13, 12] is guaranteed to have a lower (or in the best case the sa”