{"title":"Remaining Time Prediction of Business Processes based on Multilayer Machine Learning","authors":"Xiaoxiao Sun, Wenjie Hou, Yuke Ying, Dongjin Yu","doi":"10.1109/ICWS49710.2020.00080","DOIUrl":"https://doi.org/10.1109/ICWS49710.2020.00080","url":null,"abstract":"Remaining time predictive monitoring of business processes (BPs) is a key research issue in business process mining, which provides timely predictive information for stakeholders to take proactive corrective actions to reduce process execution risk such as exceeding time limit or to adjust the priority of activities. However, current researches on remaining time prediction only consider the impact of internal attributes of single process instance, but ignore the resource competition among multiple instances executed together. Therefore, this paper takes resource competition into consideration and characterizes several inter-instance attributes as the input of prediction. We also prioritize and select some key activities that strongly impact the execution time of BPs according to historical event logs and include them as input of the prediction. Meanwhile, in order to solve the instability of one single prediction model in complex scenarios, a multilayer hybrid model constructed from XGBoost and LightGBM models using stacking technique is proposed. Experiments on four real-life datasets show that our approach of considering attributes among instances and including key activities into a hybrid model outperforms other prediction methods.","PeriodicalId":338833,"journal":{"name":"2020 IEEE International Conference on Web Services (ICWS)","volume":"75 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133454668","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Security-Aware QoS Forecasting in Mobile Edge Computing based on Federated Learning","authors":"Huiying Jin, Pengcheng Zhang, Hai Dong","doi":"10.1109/ICWS49710.2020.00046","DOIUrl":"https://doi.org/10.1109/ICWS49710.2020.00046","url":null,"abstract":"This paper proposes a novel security-aware QoS (Quality of Service) forecasting approach - Edge QoS Per-PM (Edge QoS forecasting with Personalized training based on Public Models in mobile edge computing) by migrating the principle of integrating cooperative learning and independent learning from federated learning. Edge QoS Per-PM can make fast and accurate forecasting on the premise of ensuring enhanced security. We train private model based on public model for personalized forecasting. The private models are invisible to other users to ensure the absolute security. At regular intervals, a Long Short-Term Memory (LSTM) model is trained based on the latest private data to meet the realtime requirements of the dynamic edge environment and ensure the accuracy of prediction results. A series of experiments is conducted based on public network data sets. The results demonstrate that Edge QoS Per-PM can train appropriate models and achieve faster convergence and higher accuracy.","PeriodicalId":338833,"journal":{"name":"2020 IEEE International Conference on Web Services (ICWS)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126191513","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A Practical Defense against Attribute Inference Attacks in Session-based Recommendations","authors":"Yifei Zhang, Neng Gao, Junsha Chen","doi":"10.1109/ICWS49710.2020.00053","DOIUrl":"https://doi.org/10.1109/ICWS49710.2020.00053","url":null,"abstract":"When users in various web and mobile applications enjoy the convenience of recommendation systems, they are vulnerable to attribute inference attacks. The accumulating online behaviors of users (e.g., clicks, searches, ratings) naturally brings out user preferences, and poses an inevitable threat of privacy that adversaries can infer one's private profiles (e.g., gender, sexual orientation, political view) with AI-based algorithms. Existing defense methods assume the existence of a trusted third party, rely on computationally intractable algorithms, or have impact on recommendation utility. These imperfections make them impractical for privacy preservation in real-life scenarios. In this work, we introduce BiasBooster, a practical proactive defense method based on behavior segmentation, to protect user privacy against attribute inference attacks from user behaviors, while retaining recommendation utility with a heuristic recommendation aggregation module. BiasBooster is a user-centric approach from client side, which proactively divides a user's behaviors into weakly related segments and perform them with several dummy identities, then aggregates real-time recommendations for user from different dummy identities. We estimate its effectiveness of preservation on both privacy and recommendation utility through extensive evaluations on two real-world datasets. A Chrome extension is conducted to demonstrate the feasibility of applying BiasBooster in real world. Experimental results show that compared to existing defenses, BiasBooster substantially reduces the averaged accuracy of attribute inference attacks, with minor utility loss of recommendations.","PeriodicalId":338833,"journal":{"name":"2020 IEEE International Conference on Web Services (ICWS)","volume":"197 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124399451","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Guosheng Kang, Jianxun Liu, Buqing Cao, Manliang Cao
{"title":"NAFM: Neural and Attentional Factorization Machine for Web API Recommendation","authors":"Guosheng Kang, Jianxun Liu, Buqing Cao, Manliang Cao","doi":"10.1109/ICWS49710.2020.00050","DOIUrl":"https://doi.org/10.1109/ICWS49710.2020.00050","url":null,"abstract":"With the wide adoption of SOA (Service Oriented Architecture), a massive amount of innovative applications emerge on the Internet. One of the popular representations is Mashup composed of multiple Web APIs. Recommending desirable Web APIs to develop Mashup applications has attracted much attention. A dozen of service recommendation approaches are proposed by incorporating multi-dimensional features extracted from service repository into recommendation models. Among the existing works, factorization machine based models show better performance than traditional collaborative filtering techniques in accuracy. However, they either model factorized interactions with the same weight or neglect the non-linear and complex inherent structure of real-world data. In real-world applications, different predictor variables usually have different predictive power, and not all features contain useful signal for estimating the target. Moreover, higher-order feature interactions are usually underlain in real-world data. To address these drawbacks, this paper proposes a hybrid factorization machine model with a novel neural network architecture named NAFM by integrating deep neural network to capture the non-linear feature interactions and attention mechanism to capture the different importance of feature interactions. Comprehensive experiments on a real-world dataset show that the proposed approach outperforms the other state-of-the-art models for service recommendation.","PeriodicalId":338833,"journal":{"name":"2020 IEEE International Conference on Web Services (ICWS)","volume":"115 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117273450","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Time-aware Service Recommendation Based on Dynamic Preference and QoS","authors":"Yanmei Zhang, Zhuo Li, Xiaoyi Tang, Fu Chen","doi":"10.1109/ICWS49710.2020.00052","DOIUrl":"https://doi.org/10.1109/ICWS49710.2020.00052","url":null,"abstract":"The historical data of services usage shows us that both user preference and service quality are dynamic, and service quality has a certain influence on user preference. Due to the dynamic characteristics of both user preference and quality of service (QoS), how to recommend the best suitable services to users has become an urgent problem to be solved. But the most service recommendation approaches neglect the cyclical feature in dynamic preference model, and also neglect the impact of QoS on the user preference. We propose a time-aware recommendation method which considers the dynamic preference, the dynamic QoS and the impact of QoS on user preference comprehensively. Our experiments conducted on the real-world dataset WS-Dream, and the results show that our proposed approach outperforms several classical approaches and state-of-the-art approaches in terms of accuracy, recall, F1-value and Hamming distance.","PeriodicalId":338833,"journal":{"name":"2020 IEEE International Conference on Web Services (ICWS)","volume":"113 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132338499","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Efficient and Privacy-Preserving Federated QoS Prediction for Cloud Services","authors":"Yilei Zhang, Peiyun Zhang, Yonglong Luo, Jun Luo","doi":"10.1109/ICWS49710.2020.00079","DOIUrl":"https://doi.org/10.1109/ICWS49710.2020.00079","url":null,"abstract":"With the widespread adoption of cloud computing, large-scale online applications composed of services have been deployed in many critical areas. In order to ensure the performance of cloud applications, Quality of Service (QoS) is a key indicator commonly used for service selection and adaptation. Previous studies have proposed collaborative QoS prediction approaches to estimate personalized QoS values. However, collaborative QoS prediction encounters privacy problems in practice. As a result, privacy threat has become a key challenge to make QoS prediction approaches practical. In this paper, we proposed a privacy-preserving QoS prediction approach employing federated learning techniques to tackle this grand challenge. We further improve the prediction efficiency by reducing system overhead and make the federated privacy-preserving QoS prediction approach feasible. The proposed approach is evaluated on a large-scale real-world QoS dataset, and the experimental results confirm its effectiveness and efficiency.","PeriodicalId":338833,"journal":{"name":"2020 IEEE International Conference on Web Services (ICWS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131197156","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Efficient Search for Moving Object Devices in Internet of Things Networks","authors":"Jine Tang, Xiao Xue, Sami Yangui, Zhangbing Zhou","doi":"10.1109/ICWS49710.2020.00067","DOIUrl":"https://doi.org/10.1109/ICWS49710.2020.00067","url":null,"abstract":"IoT search engines have attracted increasing attention from both academia and industry, since they are capable of crawling heterogeneous data sources in highly dynamic environment. To process tens of thousands of spatial-temporal-keyword queries per second, query efficiency and communication cost in IoT search engines become critical issues. To address these challenges, caching mechanisms in collaborative edge-cloud computing architecture, which can implement the caching paradigm in cloud for frequent n-hop neighboring activity regions, is proposed in this paper. Thereafter, frequent query results can be achieved quickly leveraging the spatial-temporal-keyword filtering index of n-hop neighbor regions through modeling keywords relevance and uncertain traveling time. Besides, we adopt STK-tree proposed previously to directly answer non-frequent queries. Extensive experiments on real-life dataset demonstrate that our method outperforms the state-of-the-art's techniques in terms of the reduction of the query time and the number of transmitted messages.","PeriodicalId":338833,"journal":{"name":"2020 IEEE International Conference on Web Services (ICWS)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126752554","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Computation Offloading and Content Caching with Traffic Flow Prediction for Internet of Vehicles in Edge Computing","authors":"Zijie Fang, Xiaolong Xu, Fei Dai, Lianyong Qi, Xuyun Zhang, Wanchun Dou","doi":"10.1109/ICWS49710.2020.00056","DOIUrl":"https://doi.org/10.1109/ICWS49710.2020.00056","url":null,"abstract":"The development of the Internet of Vehicles (IoV) enables numerous emerging in-vehicle applications to accommodate users with various contents, thus enhancing their traveling experiences. In IoV, content decoding tasks are typically offloaded to edge servers for implementation, as edge computing is an admirable paradigm to provide low-latency services. However, as different vehicular users may request the same contents, processing these contents repeatedly leads to the waste of storage, computation and bandwidth resources. Therefore, fine-grained computation offloading and content caching are demanded in IoV. In this paper, a joint optimization method for computation offloading and content caching based on traffic flow prediction, named COC, is proposed. Firstly, traffic flow covered by each edge server is predicted by a modified deep spatiotemporal residual network (ST-ResNet). Secondly, the non-dominated sorting genetic algorithm III (NSGA-III) is leveraged to realize the many-objective optimization to shorten the execution time and reduce the energy consumption of computation and transmission in IoV. Finally, evaluated by real-world big data from Nanjing China, COC shows a great reduction in execution time and energy consumption of transmission and computation compared to other methods.","PeriodicalId":338833,"journal":{"name":"2020 IEEE International Conference on Web Services (ICWS)","volume":"299 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116882447","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Location-Aware and Budget-Constrained Application Replication and Deployment in Multi-Cloud Environment","authors":"Tao Shi, Hui Ma, Gang Chen, Sven Hartmann","doi":"10.1109/ICWS49710.2020.00022","DOIUrl":"https://doi.org/10.1109/ICWS49710.2020.00022","url":null,"abstract":"To gain technical and economic benefits, enterprise application providers are increasingly moving their workloads to the cloud. With the increasing number of cloud resources from multiple cloud providers at different locations with differentiated prices, application providers face the challenge to select proper cloud resources to replicate and deploy applications to maintain low response time and high quality of user experience without running into the risk of over-spending. In this paper, we study the global-wide cloud application replication and deployment problem considering the application average response time, including particularly application execution time and network latency, subject to the budgetary control. To address the problem, we propose a GA-based approach with domain-tailored solution representation, fitness measurement, and population initialization. Extensive experiments using the real-world datasets demonstrate that our proposed GA-based approach significantly outperforms common application placement strategies, i.e., NearData and NearUsers, and our recently proposed hybrid GA approach.","PeriodicalId":338833,"journal":{"name":"2020 IEEE International Conference on Web Services (ICWS)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114418862","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Investigating the Evolution of Web API Cooperative Communities in the Mashup Ecosystem","authors":"Qing Qi, Jian Cao","doi":"10.1109/ICWS49710.2020.00060","DOIUrl":"https://doi.org/10.1109/ICWS49710.2020.00060","url":null,"abstract":"In the mashup ecosystem, Web APIs often form cooperative communities which evolve with time. Understanding how these communities form and evolve with time is very important to help develop strategies for improving ecosystems of Web APIs. This paper empirically studies the evolution of Web API cooperative communities based on the data of Web APIs and mashups from Programmable Web. It is found that 20% of Web APIs account for half of the connections in their communities. The Web API communities identified in terms of mashups seem to be stable. Every two years, there is a 27% growth in the number of new communities, 10% dissolve, 30% tend to expand, while 5% become smaller. It is a key stage when a Web API community becomes medium sized because in this stage, there is a high probability that a Web API community reduces its size or even dissolves.","PeriodicalId":338833,"journal":{"name":"2020 IEEE International Conference on Web Services (ICWS)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115354752","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}