{"title":"Research Fronts of Robust Social Recommendation","authors":"Feng Jiang, M. Gao, Wentao Li","doi":"10.1109/ICSS.2016.24","DOIUrl":"https://doi.org/10.1109/ICSS.2016.24","url":null,"abstract":"Social recommendation plays an important role in solving the cold start problem in traditional recommender systems and improving the accuracy of recommendation results. However, it still faces serious challenges and problems due to bogus ratings or relationships injected by fake users. This practice seriously affects the authenticity of recommendation results as well as normal users' trustiness on recommender systems. Moreover, simply treating social relationships as a single type affects the recommendation accuracy. To solve these problems, in this paper, after summarizing the research of current social recommendation algorithms and detecting technologies of multiple relationships, we propose a framework for the research fronts of the robust social recommendation. This framework first models and extracts multidimensional relationships, then summarizes social recommendation shilling attack models based on the analysis of the relationships in social networks as well as the roles of relationships on recommendation. Finally, it forms robust social recommendation approaches that takes multidimensional relationships into consideration.","PeriodicalId":250036,"journal":{"name":"2016 9th International Conference on Service Science (ICSS)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127090755","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}
Y. Yao, Yan Li, Ke Wang, Zhichao Huang, Yunming Ye
{"title":"A Semi-supervised Clustering Method through Bottleneck Distance Exploration","authors":"Y. Yao, Yan Li, Ke Wang, Zhichao Huang, Yunming Ye","doi":"10.1109/ICSS.2016.22","DOIUrl":"https://doi.org/10.1109/ICSS.2016.22","url":null,"abstract":"Semi-supervised clustering is one of the most active research area in machine learning and pattern recognition, which can improve the performance of unsupervised clustering efficiently. This paper focuses on exploiting both the label information of a few labeled samples and the spatial distribution information of large amount of unlabeled samples. We proposed a new semi-supervised clustering method, named Bottleneck Distance based Semi-supervised Clustering (BDSC), which is based on the idea of label propagation and can perform clustering with no parameters. BDSC works by firstly obtaining small amount of labeled samples for each class. Then, a minimum spanning tree is constructed from both labeled and unlabeled samples, where the distances between an unlabeled sample and labeled samples are computed to get the bottleneck distance for each unlabeled sample. Finally, labels are propagated by comparing the bottleneck distances. Experimental results demonstrate that the proposed technique outperforms classical clustering algorithms with respect to the precision and the capability of recognizing nonspherical-shaped clusters.","PeriodicalId":250036,"journal":{"name":"2016 9th International Conference on Service Science (ICSS)","volume":"76 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127191078","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 Context Model for Mechanical Ventilation in Grain Storage","authors":"Caiyuan Chen, Xin Shu, Tong Mo, Weiping Li, Chuanzhen Zang, Zhaoan Chen, Yihong Wang","doi":"10.1109/ICSS.2016.19","DOIUrl":"https://doi.org/10.1109/ICSS.2016.19","url":null,"abstract":"In order to improve the effect and the efficiency of the mechanical ventilation in grain storage, a context aware method is proposed. The context meta-model is defined which builds the basis for context modeling. The context model for mechanical ventilation in grain storage is built, which had full consideration of the ventilation purpose and the lifecycle of grain storage. The feasibility and the correctness of the model is verified with the context aware service system, which can receive the context information of the granary to figure out the real situation and make the ventilation plan accordingly.","PeriodicalId":250036,"journal":{"name":"2016 9th International Conference on Service Science (ICSS)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133750333","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}
Shuang Wang, Haijun Zhang, Yusong An, Yunming Ye, Yanfeng Zhang, Yan Li
{"title":"Clothes Advertising by Targeting Principal Actors in Video","authors":"Shuang Wang, Haijun Zhang, Yusong An, Yunming Ye, Yanfeng Zhang, Yan Li","doi":"10.1109/ICSS.2016.10","DOIUrl":"https://doi.org/10.1109/ICSS.2016.10","url":null,"abstract":"In this paper, we present a new framework for online video advertising by targeting clothes of principal actors. This framework aims to embed both character-relevant and content-relevant advertisements within a video stream. We identify the main actors automatically in a given video by using face clustering techniques. Specifically, we propose a new clustering algorithm based on face verification. Then we can find the main characters by counting the number of faces of each class. The video frames that include main characters are the best options to advertising. We segment the image patches of main characters from these video frames by object detection, and carry out different strategies for different sizes of images to match clothes ads. Experimental results demonstrate the effectiveness of our proposed method.","PeriodicalId":250036,"journal":{"name":"2016 9th International Conference on Service Science (ICSS)","volume":"109 11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115687585","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":"The Comparison of Decision Tree Based Insurance Churn Prediction between Spark ML and SPSS","authors":"Wei Zhang, Tong Mo, Weiping Li, Hanyu Huang, X. Tian","doi":"10.1109/ICSS.2016.25","DOIUrl":"https://doi.org/10.1109/ICSS.2016.25","url":null,"abstract":"We have deployed a big data platform for the insurance company. One can select the data they need from database, do data analysis job and save the final model to the model pool using the platform. We completed churn prediction task on both SPSS [1] and Spark [7] using the data providing by X insurance company and carefully compared the execution flow, runtime, model evaluation, and model precision of each. Experimental results confirm that Spark ML [6] is easy to use and can cope with big data problems.","PeriodicalId":250036,"journal":{"name":"2016 9th International Conference on Service Science (ICSS)","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123987230","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":"Collaborative Sparse Preserving Projections for Feature Extraction","authors":"Yunsong Wu, Qianying Huang, Xiaohong Zhang, Chenqiu Zhao","doi":"10.1109/ICSS.2016.41","DOIUrl":"https://doi.org/10.1109/ICSS.2016.41","url":null,"abstract":"Sparsity Preserving Projections (SPP) is a well known approach for feature extraction and dimensionality reduction. Its success is mainly attributed to its high quality graph which is constructed by sparse representation. As an instance of graph embedding, SPP can be formulated as regression model. Thus we apply the idea of collaborative graph embedding, which reformulates SPP as a collaborative representation model via imposing a L2-norm constraint to projections from the perspective of linear regression, to further enhance SPP. We call this novel SPP method Collaborative Sparsity Preserving Projections (CSPP). Experiment results on four popular face datasets, namely Yale, ORL, FERET and AR, show the effectiveness in feature extraction and the improvement of CSPP over SPP.","PeriodicalId":250036,"journal":{"name":"2016 9th International Conference on Service Science (ICSS)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121996242","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":"Preference-Implicated Personal Data Model for Personalization Service Collaboration","authors":"Jiaqiu Wang, Zhongjie Wang","doi":"10.1109/ICSS.2016.15","DOIUrl":"https://doi.org/10.1109/ICSS.2016.15","url":null,"abstract":"Nowadays Personalized Service Collaboration (PSC) becomes more feasible due to the increasing availability of mobile application and web service. The semantic user model comprised of Resource Description Framework (RDF) plays a significant role in PSC. In practice, preferences within (personal data/model) often change with different time, context and dimension, which are dynamic information and contribute to PSC. Therefore, personal data model which represents time, context and dimension is increasingly required to provide a more complete user model view and more value-added user information to all relevant applications and services for PSC. In this paper, a novel personal data model based on RDF is proposed, which takes into account how to represent implicated and varied preference that corresponding to different time, context and dimension. The presented model aims to solve the issues that store, organize and represent unified personal data formally in service collaboration environment which harbors different kinds of personal date from various mobile applications and web services. Finally, the comparison and analysis between proposed personal data model and conventional user model are presented. The experiment result on real data set demonstrate the feasibility and effectiveness of proposed personal data model.","PeriodicalId":250036,"journal":{"name":"2016 9th International Conference on Service Science (ICSS)","volume":"151 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132266383","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":"Effective Approach to Extract Road Map from Unmanned Aerial Vehicle Videos","authors":"Chuan Xiao, Xiaofeng Zhang, Yunming Ye, X. Han","doi":"10.1109/ICSS.2016.34","DOIUrl":"https://doi.org/10.1109/ICSS.2016.34","url":null,"abstract":"Country disaster rescue is becoming more and more important and it requires a rapid response for disaster rescue. The key component for disaster rescue is to plan the optimal rescue path. Traditionally, the optimal rescue path seriously relies on the recognition on images of the damaged areas and the corresponding recognition algorithms are proposed for analyzing satellite images. However, due to its low updating frequency satellite images are not suitable for disaster rescue. Therefore, unmanned aerial vehicle is a good alternative approach to acquire real time images on damaged areas. Techniques are then needed to recognize the UAV images. To cope with this situation, we first extract UAV videos to images, segments these images into fixed size pieces, and manually labeled these data. We then study whether the conventional methods such as mathematical morphology, Hough transform and P-value segmentation approaches can be used to extract roads from UAV images. At last, we propose to adopt SVM and combine it with GA to improve the performance of this approach. Empirical studies are performed on data sets both collected by us and collected from the Internet. Experimental results demonstrate that our approach works well on these data sets when compared with conventional approaches. This indicates that UAV could be able to facilitate the country disaster rescue.","PeriodicalId":250036,"journal":{"name":"2016 9th International Conference on Service Science (ICSS)","volume":"167 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122621186","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":"Service Recommendation in Smart Grid: Vision, Technologies, and Applications","authors":"F. Luo, G. Ranzi, Xibin Wang, Z. Dong","doi":"10.1109/ICSS.2016.12","DOIUrl":"https://doi.org/10.1109/ICSS.2016.12","url":null,"abstract":"Driven by the energy crisis and global warming problem, smart grid was proposed in the early 21th century as a solution for the sustainable development of human society. With the two-way communication infrastructure available in smart grids, a current challenge is to interpret and gain knowledge from the collected grid big data to optimize grid operations. Service recommendation techniques provide promising tools to discover knowledge from the grid data, and recommend energy-aware products/services/suggestions to the smart grid participators. This paper is among the first to investigate the prospective of introducing service recommendation techniques into the smart grid demand side management (DSM). In the first part of the paper, the backgrounds of smart grid DSM and service recommendation techniques are reviewed, followed by the presentation and discussion of key technologies that can facilitate the development of smart grid recommender systems. An outline on potential application scenarios of smart grid recommender systems as well as future challenges are also provided.","PeriodicalId":250036,"journal":{"name":"2016 9th International Conference on Service Science (ICSS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127007318","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":"An Algorithm for Resource Positioning Service in IoT Cloud Systems","authors":"Y. Gao, Haibo Li, T. He","doi":"10.1109/ICSS.2016.35","DOIUrl":"https://doi.org/10.1109/ICSS.2016.35","url":null,"abstract":"Resource positioning in cloud computing system under the support of the Internet of things (IoT) is very important, especially for distributed collaborative task. Position-based services is used to collect, process, store and distribute position information. Taking a typical collaborative task - cloud manufacturing as the background, in view of resource positioning service, an algorithm supported by Wireless Sensor Networks (WSN) is proposed, called WOCA (Weighted Optimized Combination Algorithm). Firstly, n signals received from base station are divided into C(n,3) groups, and the positioning result obtained by trilateral positioning algorithm respectively. Next, considering the plurality of weighting factors, the proper ratio coefficient is assigned to each of them by the degree of influence on the accuracy, and then the weights of each group were calculated accordingly. Finally, obtaining weighted positioning result by computing each group with the corresponding weights. The experimental results show the validity of the proposed algorithm.","PeriodicalId":250036,"journal":{"name":"2016 9th International Conference on Service Science (ICSS)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116948551","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}