Mining frequent patterns by pattern-growth: methodology and implications
ACM SIGKDD Explorations Newsletter - Special issue on “Scalable data mining algorithms”
Flickr tag recommendation based on collective knowledge
Proceedings of the 17th international conference on World Wide Web
Tag-based social interest discovery
Proceedings of the 17th international conference on World Wide Web
Real-time automatic tag recommendation
Proceedings of the 31st annual international ACM SIGIR conference on Research and development in information retrieval
Proceedings of the 31st annual international ACM SIGIR conference on Research and development in information retrieval
Tag Recommendations in Folksonomies
PKDD 2007 Proceedings of the 11th European conference on Principles and Practice of Knowledge Discovery in Databases
Compressing tags to find interesting media groups
Proceedings of the 18th ACM conference on Information and knowledge management
Learning in efficient tag recommendation
Proceedings of the fourth ACM conference on Recommender systems
Learning to tag from open vocabulary labels
ECML PKDD'10 Proceedings of the 2010 European conference on Machine learning and knowledge discovery in databases: Part II
Demand-driven tag recommendation
ECML PKDD'10 Proceedings of the 2010 European conference on Machine learning and knowledge discovery in databases: Part II
Improving tag recommendation using social networks
RIAO '10 Adaptivity, Personalization and Fusion of Heterogeneous Information
Information retrieval in folksonomies: search and ranking
ESWC'06 Proceedings of the 3rd European conference on The Semantic Web: research and applications
Recommender Systems for Social Tagging Systems
Recommender Systems for Social Tagging Systems
| Hi-index | 0.00 |
Collaborative tagging services allow users to freely assign tags to resources. As the large majority of users enters only very few tags, good tag recommendation can vastly improve the usability of tags for techniques such as searching, indexing, and clustering. Previous research has shown that accurate recommendation can be achieved by using conditional probabilities computed from tag associations. The main problem, however, is that enormous amounts of associations are needed for optimal recommendation. We argue and demonstrate that pattern selection techniques can improve tag recommendation by giving a very favourable balance between accuracy and computational demand. That is, few associations are chosen to act as information source for recommendation, providing high-quality recommendation and good scalability at the same time. We provide a proof-of-concept using an off-the-shelf pattern selection method based on the Minimum Description Length principle. Experiments on data from Delicious, LastFM and YouTube show that our proposed methodology works well: applying pattern selection gives a very favourable trade-off between runtime and recommendation quality.