This paper looks inside FolkRank, one of the well-known folksonomy-based algorithms, to present its fundamental properties and promising possibilities for improving performance in tag recommendations. Moreover, we introduce a new way to compute a differential approach in FolkRank by representing it as a linear combination of the personalized PageRank vectors. By the linear combination, we present FolkRank's probabilistic interpretation that grasps how FolkRank works on a folksonomy graph in terms of the random surfer model. We also propose new FolkRank-like methods for tag recommendations to efficiently compute tags' rankings and thus reduce expensive computational cost of FolkRank. We show that the FolkRank approaches are feasible to recommend tags in real-time scenarios as well. The experimental evaluations show that the proposed methods provide fast tag recommendations with reasonable quality, as compared to FolkRank. Additionally, we discuss the diversity of the top n tags recommended by FolkRank and its variants.

@inproceedings{kim2011personalized, author = {Kim, Heung-Nam and El Saddik, Abdulmotaleb}, title = {Personalized PageRank vectors for tag recommendations: inside FolkRank}, booktitle = {Proceedings of the fifth ACM conference on Recommender systems}, series = {RecSys '11}, publisher = {ACM}, address = {New York, NY, USA}, year = {2011}, pages = {45--52}, url = {http://doi.acm.org/10.1145/2043932.2043945}, doi = {10.1145/2043932.2043945}, isbn = {978-1-4503-0683-6}, keywords = {inside, recommender, folkrank, recommendation}, abstract = {This paper looks inside FolkRank, one of the well-known folksonomy-based algorithms, to present its fundamental properties and promising possibilities for improving performance in tag recommendations. Moreover, we introduce a new way to compute a differential approach in FolkRank by representing it as a linear combination of the personalized PageRank vectors. By the linear combination, we present FolkRank's probabilistic interpretation that grasps how FolkRank works on a folksonomy graph in terms of the random surfer model. We also propose new FolkRank-like methods for tag recommendations to efficiently compute tags' rankings and thus reduce expensive computational cost of FolkRank. We show that the FolkRank approaches are feasible to recommend tags in real-time scenarios as well. The experimental evaluations show that the proposed methods provide fast tag recommendations with reasonable quality, as compared to FolkRank. Additionally, we discuss the diversity of the top n tags recommended by FolkRank and its variants.} }

%0 = inproceedings %A = Kim, Heung-Nam and El Saddik, Abdulmotaleb %B = Proceedings of the fifth ACM conference on Recommender systems %C = New York, NY, USA %D = 2011 %I = ACM %T = Personalized PageRank vectors for tag recommendations: inside FolkRank %U = http://doi.acm.org/10.1145/2043932.2043945

This paper looks inside FolkRank, one of the well-known folksonomy-based algorithms, to present its fundamental properties and promising possibilities for improving performance in tag recommendations. Moreover, we introduce a new way to compute a differential approach in FolkRank by representing it as a linear combination of the personalized PageRank vectors. By the linear combination, we present FolkRank's probabilistic interpretation that grasps how FolkRank works on a folksonomy graph in terms of the random surfer model. We also propose new FolkRank-like methods for tag recommendations to efficiently compute tags' rankings and thus reduce expensive computational cost of FolkRank. We show that the FolkRank approaches are feasible to recommend tags in real-time scenarios as well. The experimental evaluations show that the proposed methods provide fast tag recommendations with reasonable quality, as compared to FolkRank. Additionally, we discuss the diversity of the top n tags recommended by FolkRank and its variants.

@inproceedings{kim2011personalized, author = {Kim, Heung-Nam and El Saddik, Abdulmotaleb}, title = {Personalized PageRank vectors for tag recommendations: inside FolkRank}, booktitle = {Proceedings of the fifth ACM conference on Recommender systems}, publisher = {ACM}, address = {New York, NY, USA}, year = {2011}, pages = {45--52}, url = {http://doi.acm.org/10.1145/2043932.2043945}, doi = {10.1145/2043932.2043945}, isbn = {978-1-4503-0683-6}, keywords = {collaborative, bookmarking, folkrank, toread}, abstract = {This paper looks inside FolkRank, one of the well-known folksonomy-based algorithms, to present its fundamental properties and promising possibilities for improving performance in tag recommendations. Moreover, we introduce a new way to compute a differential approach in FolkRank by representing it as a linear combination of the personalized PageRank vectors. By the linear combination, we present FolkRank's probabilistic interpretation that grasps how FolkRank works on a folksonomy graph in terms of the random surfer model. We also propose new FolkRank-like methods for tag recommendations to efficiently compute tags' rankings and thus reduce expensive computational cost of FolkRank. We show that the FolkRank approaches are feasible to recommend tags in real-time scenarios as well. The experimental evaluations show that the proposed methods provide fast tag recommendations with reasonable quality, as compared to FolkRank. Additionally, we discuss the diversity of the top n tags recommended by FolkRank and its variants.} }

%0 = inproceedings %A = Kim, Heung-Nam and El Saddik, Abdulmotaleb %B = Proceedings of the fifth ACM conference on Recommender systems %C = New York, NY, USA %D = 2011 %I = ACM %T = Personalized PageRank vectors for tag recommendations: inside FolkRank %U = http://doi.acm.org/10.1145/2043932.2043945

This paper looks inside FolkRank, one of the well-known folksonomy-based algorithms, to present its fundamental properties and promising possibilities for improving performance in tag recommendations. Moreover, we introduce a new way to compute a differential approach in FolkRank by representing it as a linear combination of the personalized PageRank vectors. By the linear combination, we present FolkRank's probabilistic interpretation that grasps how FolkRank works on a folksonomy graph in terms of the random surfer model. We also propose new FolkRank-like methods for tag recommendations to efficiently compute tags' rankings and thus reduce expensive computational cost of FolkRank. We show that the FolkRank approaches are feasible to recommend tags in real-time scenarios as well. The experimental evaluations show that the proposed methods provide fast tag recommendations with reasonable quality, as compared to FolkRank. Additionally, we discuss the diversity of the top n tags recommended by FolkRank and its variants.

@inproceedings{kim2011personalized, author = {Kim, Heung-Nam and El Saddik, Abdulmotaleb}, title = {Personalized PageRank vectors for tag recommendations: inside FolkRank}, booktitle = {Proceedings of the fifth ACM conference on Recommender systems}, publisher = {ACM}, address = {New York, NY, USA}, year = {2011}, pages = {45--52}, url = {http://doi.acm.org/10.1145/2043932.2043945}, doi = {10.1145/2043932.2043945}, isbn = {978-1-4503-0683-6}, keywords = {tagging, pagerank, collaborative, ranking, folksonomy, bookmarking, search, folkrank, web}, abstract = {This paper looks inside FolkRank, one of the well-known folksonomy-based algorithms, to present its fundamental properties and promising possibilities for improving performance in tag recommendations. Moreover, we introduce a new way to compute a differential approach in FolkRank by representing it as a linear combination of the personalized PageRank vectors. By the linear combination, we present FolkRank's probabilistic interpretation that grasps how FolkRank works on a folksonomy graph in terms of the random surfer model. We also propose new FolkRank-like methods for tag recommendations to efficiently compute tags' rankings and thus reduce expensive computational cost of FolkRank. We show that the FolkRank approaches are feasible to recommend tags in real-time scenarios as well. The experimental evaluations show that the proposed methods provide fast tag recommendations with reasonable quality, as compared to FolkRank. Additionally, we discuss the diversity of the top n tags recommended by FolkRank and its variants.} }

%0 = inproceedings %A = Kim, Heung-Nam and El Saddik, Abdulmotaleb %B = Proceedings of the fifth ACM conference on Recommender systems %C = New York, NY, USA %D = 2011 %I = ACM %T = Personalized PageRank vectors for tag recommendations: inside FolkRank %U = http://doi.acm.org/10.1145/2043932.2043945