%0 Journal Article %1 HasanAlRousanTalebMaaita14 %A Hassan, Osama A. %A Al-Rousan, Thamer %A Taleb, Anas A. %A Maaita, Adi %C London, UK, UK %D 2014 %I Academic Press Ltd. %J J. Netw. Comput. Appl. %K citas, citeulike referencias, rss %P 179--190 %R 10.1016/j.jnca.2013.06.004 %T An Efficient and Scalable Ranking Technique for Mashups Involving RSS Data Sources %U http://dx.doi.org/10.1016/j.jnca.2013.06.004 %V 39 %X Mashups are key category of Web 2.0 personalized applications. Due to personalization property of Web 2.0 applications, number of mashups hosted by a mashup platform is increasing. End-users are overwhelmed by the increasing number of mashups. Therefore, they cannot easily find mashups of their interest. In this paper, we propose a novel mashup ranking technique based on the popular Vector Space Model (VSM) for mashups that use RSS feeds as data sources. Mashups that are ranked higher would be more interesting to end-users. In order to evaluate our mashup ranking technique, we implement it in a prototype where end-users select mashups that they consider interesting. We implicitly collect the end-user mashup selections and record the outcome of our ranking technique, and then we analyze them. Recorded R-Precision value in our technique is on an average 30\% higher than R-Precision value in binary ranking technique which shows an improvement in capturing mashups that resemble end-user interest. In our design, we make sure our mashup ranking technique scales well to increasing number of mashups.

@article{HasanAlRousanTalebMaaita14, abstract = {{Mashups are key category of Web 2.0 personalized applications. Due to personalization property of Web 2.0 applications, number of mashups hosted by a mashup platform is increasing. End-users are overwhelmed by the increasing number of mashups. Therefore, they cannot easily find mashups of their interest. In this paper, we propose a novel mashup ranking technique based on the popular Vector Space Model (VSM) for mashups that use RSS feeds as data sources. Mashups that are ranked higher would be more interesting to end-users. In order to evaluate our mashup ranking technique, we implement it in a prototype where end-users select mashups that they consider interesting. We implicitly collect the end-user mashup selections and record the outcome of our ranking technique, and then we analyze them. Recorded R-Precision value in our technique is on an average 30\% higher than R-Precision value in binary ranking technique which shows an improvement in capturing mashups that resemble end-user interest. In our design, we make sure our mashup ranking technique scales well to increasing number of mashups.}}, added-at = {2017-09-08T10:52:59.000+0200}, address = {London, UK, UK}, author = {Hassan, Osama A. and Al-Rousan, Thamer and Taleb, Anas A. and Maaita, Adi}, biburl = {https://www.bibsonomy.org/bibtex/292c54b8cb16e2966f26ae097dbbf28e9/fernand0}, citeulike-article-id = {13098312}, citeulike-linkout-0 = {http://portal.acm.org/citation.cfm?id=2580596}, citeulike-linkout-1 = {http://dx.doi.org/10.1016/j.jnca.2013.06.004}, doi = {10.1016/j.jnca.2013.06.004}, interhash = {ed4b32a8c256f23129e3b6d987767aae}, intrahash = {92c54b8cb16e2966f26ae097dbbf28e9}, issn = {1084-8045}, journal = {J. Netw. Comput. Appl.}, keywords = {citas, citeulike referencias, rss}, month = mar, pages = {179--190}, posted-at = {2014-03-10 16:57:50}, priority = {2}, publisher = {Academic Press Ltd.}, timestamp = {2017-09-08T10:53:23.000+0200}, title = {{An Efficient and Scalable Ranking Technique for Mashups Involving RSS Data Sources}}, url = {http://dx.doi.org/10.1016/j.jnca.2013.06.004}, volume = 39, year = 2014 }