Mobile Application Search: A QoS-Aware and Tag-Based Approach
Journal Title: EAI Endorsed Transactions on Industrial Networks and Intelligent Systems - Year 2015, Vol 2, Issue 4
Abstract
The availability of enormous numbers of mobile applications (apps) is driving demand for the means to search for, recommend, and manage apps. Existing search engines provide basic search functionalities that enable users to find apps by issuing query keywords; however, the ranking of search results does not always satisfy the expectations of users. This study proposes a novel approach to address this issue, called Tag-based and QoS-aware Mobile Application Search and Management (TQMASM). The proposed system provides two functionalities: (1) QoS-aware app search and tag-based app recommendation; and (2) tag-based app management. QoS-aware app search is an objective means of sorting search results by considering QoS (Quality of Service) factors, popularity, and reputation. Tag-based recommendation is used to find apps according to tags annotated by all users. Tag-based management utilizes an hierarchical tree and tag annotation to facilitate the management and usage of apps. A prototype realization of TQMASM was developed to evaluate the feasibility of the proposed approach. Experiment results demonstrate the efficacy of the proposed system in providing a satisfactory ranking of retrieved apps.
Authors and Affiliations
Shang-Pin Ma, Shin-Jie Lee, Wen-Tin Lee, Jing-Hong Lin, Jui-Hsaing Lin
Keywords
Related Articles
- EP ID EP46032
- DOI http://dx.doi.org/10.4108/inis.2.4.e6
- Views 342
- Downloads 0
Linking Data According to Their Degree of Representativeness (DoR)
This contribution addresses the problem of extracting some representative data from complex datasets and connecting them in a directed graph. First we define a degree of representativeness (DoR) inspired of the Borda vot...
An Application of SMC to continuous validation of heterogeneous systems
This paper considers the rigorous design of Systems of Systems (SoS), i.e. systems composed of a set of heterogeneous components whose number evolves with time. Such components cooperate to accomplish functions that they...
Applying algorithm finding shortest path in the multiple- weighted graphs to find maximal flow in extended linear multicomodity multicost network
The shortest path finding algorithm is used in many problems on graphs and networks. This article will introduce the algorithm to find the shortest path between two vertices on the extended graph. Next, the algorithm fin...
Security Issues in ProtoGENI
Network security consists of primary concerns in future Internet development due to the ever increasing threats to current Internet. ProtoGENI is a federated testbed facility supporting slice-based experiments to manage,...
A Critical Review of the Routing Protocols in Opportunistic Networks
The goal of Opportunistic Networks (OppNets) is to enable message transmission in an infrastructure less environment where a reliable end-to-end connection between the hosts in not possible at all times. The role of OppN...