Pub Date : 2016-07-06DOI: 10.1109/CITS.2016.7546421
Xuguang Bao, Lizhen Wang, Jiasong Zhao
Spatial co-location patterns represent the subsets of features whose instances are frequently located together in geographic space. It is difficult to discover co-location patterns because of the huge amount of space data. A common framework for mining spatial co-location patterns employs a level-wised search method to discover co-location patterns, and generates numerous redundant patterns which need huge cost of space storage and time consumption. Longer size patterns may have more interesting information for users, which causes the requirement for mining longer size patterns preferentially. In this paper, a novel algorithm is proposed to discover compact co-location patterns called top-k-size maximal co-location patterns by introducing a new data structure - MCP-tree, where k is a desired number of distinct sizes of mined co-location patterns. Our algorithm doesn't need to generate all candidate co-locations and it only checks partial candidates to mine top-k-size maximal co-location patterns, so it needs less space and costs less time. The experiment result shows that the proposed algorithm is efficient.
{"title":"Mining top-k-size maximal co-location patterns","authors":"Xuguang Bao, Lizhen Wang, Jiasong Zhao","doi":"10.1109/CITS.2016.7546421","DOIUrl":"https://doi.org/10.1109/CITS.2016.7546421","url":null,"abstract":"Spatial co-location patterns represent the subsets of features whose instances are frequently located together in geographic space. It is difficult to discover co-location patterns because of the huge amount of space data. A common framework for mining spatial co-location patterns employs a level-wised search method to discover co-location patterns, and generates numerous redundant patterns which need huge cost of space storage and time consumption. Longer size patterns may have more interesting information for users, which causes the requirement for mining longer size patterns preferentially. In this paper, a novel algorithm is proposed to discover compact co-location patterns called top-k-size maximal co-location patterns by introducing a new data structure - MCP-tree, where k is a desired number of distinct sizes of mined co-location patterns. Our algorithm doesn't need to generate all candidate co-locations and it only checks partial candidates to mine top-k-size maximal co-location patterns, so it needs less space and costs less time. The experiment result shows that the proposed algorithm is efficient.","PeriodicalId":340958,"journal":{"name":"2016 International Conference on Computer, Information and Telecommunication Systems (CITS)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122002593","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}
Binary Exponential Backoff (BEB) algorithm is utilized to resolve the channel contention for IEEE 802.11 wireless networks. However, BEB algorithm does not meet the user expectation due to the large collision probability and the poor network fairness when the number of stations is large. To overcome the problems, a novel synchronized contention windows-based backoff algorithm is proposed, i.e., SCW. In SCW algorithm, each station (STA) actively tracks the transmission cases of the network and when the channel state is changed, the contention window (CW) of each station which participates in the competition is synchronized by resetting the CW, which makes each station get the medium access grant with the same probability in next channel contention. The experimental results show that with the increase of the number of the stations, the fairness index of the SCW algorithm is nearly equal to 1 and always keeps stable, and when the number of stations is large (nearly 36 STAs), the throughput and delay of the network are respectively increased and reduced by nearly 11% and 6% than the conventional BEB algorithm. The proposed algorithm can effectively improve the performance of throughput and delay, and it has an excellent fairness of network. Therefore, it is especially suitable the wireless networks with the dense stations.
{"title":"Synchronized contention windows-based backoff algorithm in IEEE 802.11 wireless networks","authors":"Yangchao Huang, Yujun Wang, Rui Zhu, Xihao Chen, Qingwei Meng","doi":"10.1109/CITS.2016.7546398","DOIUrl":"https://doi.org/10.1109/CITS.2016.7546398","url":null,"abstract":"Binary Exponential Backoff (BEB) algorithm is utilized to resolve the channel contention for IEEE 802.11 wireless networks. However, BEB algorithm does not meet the user expectation due to the large collision probability and the poor network fairness when the number of stations is large. To overcome the problems, a novel synchronized contention windows-based backoff algorithm is proposed, i.e., SCW. In SCW algorithm, each station (STA) actively tracks the transmission cases of the network and when the channel state is changed, the contention window (CW) of each station which participates in the competition is synchronized by resetting the CW, which makes each station get the medium access grant with the same probability in next channel contention. The experimental results show that with the increase of the number of the stations, the fairness index of the SCW algorithm is nearly equal to 1 and always keeps stable, and when the number of stations is large (nearly 36 STAs), the throughput and delay of the network are respectively increased and reduced by nearly 11% and 6% than the conventional BEB algorithm. The proposed algorithm can effectively improve the performance of throughput and delay, and it has an excellent fairness of network. Therefore, it is especially suitable the wireless networks with the dense stations.","PeriodicalId":340958,"journal":{"name":"2016 International Conference on Computer, Information and Telecommunication Systems (CITS)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123426916","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}
Pub Date : 2016-07-06DOI: 10.1109/CITS.2016.7546425
Yiming Liu, Xi Li, Hong Ji, Ke Wang, Heli Zhang
Self-healing is expected as one of the fundamental functionalities to alleviate the impact of unforeseen network failure and maintain normal operation autonomously in future wireless network. However, the dynamic topology and complex communications environment bring significant challenges for enabling self-healing functionality in ultra dense network(UDN). Thus, to provide a reliable and seamless service for users in the case of access point(AP) failed in UDN, we propose a self-healing scheme. In this scheme, we associate impacted users (served originally by failed AP) with the rest of normal APs to improve the efficiency of resource utilization and avoid load congestions. Then each normal AP performs resource allocation for supporting its own users as well as impacted users autonomously. Eventually, we model the self-healing problem into a multi-dimensional optimization problem and propose a joint optimization algorithm to solve the problem. Numerical results show that the proposed scheme achieves a better performance compared with exiting schemes in terms of the system energy efficiency(EE).
{"title":"Joint APs selection and resource allocation for self-healing in ultra dense network","authors":"Yiming Liu, Xi Li, Hong Ji, Ke Wang, Heli Zhang","doi":"10.1109/CITS.2016.7546425","DOIUrl":"https://doi.org/10.1109/CITS.2016.7546425","url":null,"abstract":"Self-healing is expected as one of the fundamental functionalities to alleviate the impact of unforeseen network failure and maintain normal operation autonomously in future wireless network. However, the dynamic topology and complex communications environment bring significant challenges for enabling self-healing functionality in ultra dense network(UDN). Thus, to provide a reliable and seamless service for users in the case of access point(AP) failed in UDN, we propose a self-healing scheme. In this scheme, we associate impacted users (served originally by failed AP) with the rest of normal APs to improve the efficiency of resource utilization and avoid load congestions. Then each normal AP performs resource allocation for supporting its own users as well as impacted users autonomously. Eventually, we model the self-healing problem into a multi-dimensional optimization problem and propose a joint optimization algorithm to solve the problem. Numerical results show that the proposed scheme achieves a better performance compared with exiting schemes in terms of the system energy efficiency(EE).","PeriodicalId":340958,"journal":{"name":"2016 International Conference on Computer, Information and Telecommunication Systems (CITS)","volume":"67 3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128026810","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}
Pub Date : 2016-07-06DOI: 10.1109/CITS.2016.7546404
M. J. D. Silva, C. Pereira, M. Götz
This paper presents a context-aware ontological approach applied to an alarm management system. The goal is to easier the work of the plant's operators using supervisory systems and process control. Being part of a Supervisory Control and Data Acquisition (SCADA), alarm management systems produces and stores a big data set. Using proper analysis techniques in order to produce information and knowledge from this data set, operators can make better decisions in a maintenance process. The occurrence of certain events determines a situation allowing operators to react appropriately to these events. To recognize a situation with an ontological context, the objective of this work is to create an ontology focused on representation of context data to represent a conceptual model. To validate this model, a case study for steam turbine alarm system is presented.
{"title":"A dynamic approach for industrial alarm systems","authors":"M. J. D. Silva, C. Pereira, M. Götz","doi":"10.1109/CITS.2016.7546404","DOIUrl":"https://doi.org/10.1109/CITS.2016.7546404","url":null,"abstract":"This paper presents a context-aware ontological approach applied to an alarm management system. The goal is to easier the work of the plant's operators using supervisory systems and process control. Being part of a Supervisory Control and Data Acquisition (SCADA), alarm management systems produces and stores a big data set. Using proper analysis techniques in order to produce information and knowledge from this data set, operators can make better decisions in a maintenance process. The occurrence of certain events determines a situation allowing operators to react appropriately to these events. To recognize a situation with an ontological context, the objective of this work is to create an ontology focused on representation of context data to represent a conceptual model. To validate this model, a case study for steam turbine alarm system is presented.","PeriodicalId":340958,"journal":{"name":"2016 International Conference on Computer, Information and Telecommunication Systems (CITS)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128135755","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}
Pub Date : 2016-07-06DOI: 10.1109/CITS.2016.7546445
Boyu Li, F. Gao, Xiaoyu Liu, Xia Wang
The technology of the distributed compressed sensing is thought as an extension of compressed sensing and it makes applying multiple signals into compressed sensing possible. A vital issue in distributed compressed sensing is to minimize the difference between the original signal and the recovery signal. In this paper, we improve the distributed compressed sensing for smooth signals in wireless sensor networks. Firstly, we put forward a new weighted method to obtain the common component of all signals, and then one method of lossy coding for shortening the length of common component is proposed. Most importantly, we improve the calculation formula of the distributed compressed sensing to ensure that the common component can be received losslessly. The numerical results show that, comparing with the distributed compressed sensing, the improved distributed compressed sensing not only can use much fewer measurements to recover the original signal, but also enable the effect of signal recovery to be better than that of traditional distributed compressed sensing.
{"title":"Improved distributed compressed sensing for smooth signals in wireless sensor networks","authors":"Boyu Li, F. Gao, Xiaoyu Liu, Xia Wang","doi":"10.1109/CITS.2016.7546445","DOIUrl":"https://doi.org/10.1109/CITS.2016.7546445","url":null,"abstract":"The technology of the distributed compressed sensing is thought as an extension of compressed sensing and it makes applying multiple signals into compressed sensing possible. A vital issue in distributed compressed sensing is to minimize the difference between the original signal and the recovery signal. In this paper, we improve the distributed compressed sensing for smooth signals in wireless sensor networks. Firstly, we put forward a new weighted method to obtain the common component of all signals, and then one method of lossy coding for shortening the length of common component is proposed. Most importantly, we improve the calculation formula of the distributed compressed sensing to ensure that the common component can be received losslessly. The numerical results show that, comparing with the distributed compressed sensing, the improved distributed compressed sensing not only can use much fewer measurements to recover the original signal, but also enable the effect of signal recovery to be better than that of traditional distributed compressed sensing.","PeriodicalId":340958,"journal":{"name":"2016 International Conference on Computer, Information and Telecommunication Systems (CITS)","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125598853","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}
Pub Date : 2016-07-06DOI: 10.1109/CITS.2016.7546396
Qi Zhang, Yuan Yuan, Xiaoqiang Lu
The main idea of image de-fencing refers to removing fence-like obstacles in the image and recovering the image. In this paper, rather than using a common RGB camera, we propose a novel image de-fencing algorithm with the help of a hyperspectral camera. Our algorithm consists of two phases: (1) automatically finding the location of the fence in the image, (2) image inpainting to reveal a fence-free image. With a hyperspectral camera, hundreds of images of the same scene under different wavelengths can be obtained instantly. By exploiting the spectral information of different positions in the scene with these hyperspectral images, the location of the fence can be distinguished from other objects. Then the fence can be removed and the image can be recovered with a novel image inpainting algorithm based on an approximate near-neighbor search method. Experiments demonstrate that our algorithm achieves considerable performance for the image de-fencing problem.
{"title":"Image de-fencing with hyperspectral camera","authors":"Qi Zhang, Yuan Yuan, Xiaoqiang Lu","doi":"10.1109/CITS.2016.7546396","DOIUrl":"https://doi.org/10.1109/CITS.2016.7546396","url":null,"abstract":"The main idea of image de-fencing refers to removing fence-like obstacles in the image and recovering the image. In this paper, rather than using a common RGB camera, we propose a novel image de-fencing algorithm with the help of a hyperspectral camera. Our algorithm consists of two phases: (1) automatically finding the location of the fence in the image, (2) image inpainting to reveal a fence-free image. With a hyperspectral camera, hundreds of images of the same scene under different wavelengths can be obtained instantly. By exploiting the spectral information of different positions in the scene with these hyperspectral images, the location of the fence can be distinguished from other objects. Then the fence can be removed and the image can be recovered with a novel image inpainting algorithm based on an approximate near-neighbor search method. Experiments demonstrate that our algorithm achieves considerable performance for the image de-fencing problem.","PeriodicalId":340958,"journal":{"name":"2016 International Conference on Computer, Information and Telecommunication Systems (CITS)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132124681","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}
Pub Date : 2016-07-06DOI: 10.1109/CITS.2016.7546430
Jun Yan, Bingcheng Zhu
In this paper, a visible light communication (VLC) based localization algorithm is proposed for mobile device localization in indoor environments. The polar angle and azimuth angle measurements are first to estimate the projection position of light emitting diodes (LEDs) and then obtain the angle deviation estimation using the least square (LS) approach. The projection points in the reference coordination system are calculated in turn by taking advantage of the rotation transformation equation. The final position of mobile device can be estimated by the axes translation equation. Since an angle deviation preprocessing is proposed to solve the imprecise mobile device orientation without any additional hardware, it is more suitable for the practical application. Extensive simulation results demonstrate that the proposed approach can perform well under different scenarios.
{"title":"A visible light communication indoor localization algorithm in rotated environments","authors":"Jun Yan, Bingcheng Zhu","doi":"10.1109/CITS.2016.7546430","DOIUrl":"https://doi.org/10.1109/CITS.2016.7546430","url":null,"abstract":"In this paper, a visible light communication (VLC) based localization algorithm is proposed for mobile device localization in indoor environments. The polar angle and azimuth angle measurements are first to estimate the projection position of light emitting diodes (LEDs) and then obtain the angle deviation estimation using the least square (LS) approach. The projection points in the reference coordination system are calculated in turn by taking advantage of the rotation transformation equation. The final position of mobile device can be estimated by the axes translation equation. Since an angle deviation preprocessing is proposed to solve the imprecise mobile device orientation without any additional hardware, it is more suitable for the practical application. Extensive simulation results demonstrate that the proposed approach can perform well under different scenarios.","PeriodicalId":340958,"journal":{"name":"2016 International Conference on Computer, Information and Telecommunication Systems (CITS)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131042802","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}
Pub Date : 2016-07-06DOI: 10.1109/CITS.2016.7546394
Siyuan Wu, Xuelong Li, Xiaoqiang Lu
Robust object tracking is a challenging task in computer vision. Since the appearance of the target changes frequently, how to build and update the appearance model is crucial. In this paper, to better represent the object dynamically, we propose a robust object tracker based on diverse templates. First, we construct diverse multiple templates using the determinantal point process algorithm adaptively, which efficiently detects the most diverse subset of a set. Second, a patch-matching method is employed to propagate every template density to the next frame, and a voting map for each template is constructed by all matching patches. Third, a weighted Bayesian filter framework aggregates all voting maps to optimize target state. Finally, in order to maintain the diversity of multiple templates, we dynamically add, remove and replace the target from templates. Experimental results prove that the proposed method outperforms state-of-the-art tracking algorithms significantly in terms of center position errors and success rates.
{"title":"Robust object tracking via diverse templates","authors":"Siyuan Wu, Xuelong Li, Xiaoqiang Lu","doi":"10.1109/CITS.2016.7546394","DOIUrl":"https://doi.org/10.1109/CITS.2016.7546394","url":null,"abstract":"Robust object tracking is a challenging task in computer vision. Since the appearance of the target changes frequently, how to build and update the appearance model is crucial. In this paper, to better represent the object dynamically, we propose a robust object tracker based on diverse templates. First, we construct diverse multiple templates using the determinantal point process algorithm adaptively, which efficiently detects the most diverse subset of a set. Second, a patch-matching method is employed to propagate every template density to the next frame, and a voting map for each template is constructed by all matching patches. Third, a weighted Bayesian filter framework aggregates all voting maps to optimize target state. Finally, in order to maintain the diversity of multiple templates, we dynamically add, remove and replace the target from templates. Experimental results prove that the proposed method outperforms state-of-the-art tracking algorithms significantly in terms of center position errors and success rates.","PeriodicalId":340958,"journal":{"name":"2016 International Conference on Computer, Information and Telecommunication Systems (CITS)","volume":"241 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122700715","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}
Pub Date : 2016-07-06DOI: 10.1109/CITS.2016.7546448
Weiwei Dong, Changle Li, Zhifang Miao
Vehicular ad hoc network (VANET) is suffering from the frequent link breakage and low packet delivery rate, which challenges routing protocols. To address this issue, we propose a Geographic Opportunistic Routing protocol based on Link state and Forwarding quality inside nodes (LF-GOR). We first put forward a hybrid approach of filtering and prioritizing to determine a candidate nodes set of the sending node in LF-GOR, which considers not only position information but also link state and node's forwarding quality comprehensively. Based on the candidate nodes set, we design a flexible opportunistic forwarding strategy to involve multiple neighbors of the sending node into the local forwarding. Consequently, LF-GOR improves the reliability of transmission, and reduces the end-to-end delay brought by the timer-based scheduling mode of many normal opportunistic routing protocols. Finally, a comparison between LF-GOR and existing protocols is presented in the simulation. Corresponding results show that LF-GOR has the higher packet delivery rate and throughput, and also the acceptable delay.
{"title":"Joint link state and forwarding quality: A novel geographic opportunistic routing in VANETs","authors":"Weiwei Dong, Changle Li, Zhifang Miao","doi":"10.1109/CITS.2016.7546448","DOIUrl":"https://doi.org/10.1109/CITS.2016.7546448","url":null,"abstract":"Vehicular ad hoc network (VANET) is suffering from the frequent link breakage and low packet delivery rate, which challenges routing protocols. To address this issue, we propose a Geographic Opportunistic Routing protocol based on Link state and Forwarding quality inside nodes (LF-GOR). We first put forward a hybrid approach of filtering and prioritizing to determine a candidate nodes set of the sending node in LF-GOR, which considers not only position information but also link state and node's forwarding quality comprehensively. Based on the candidate nodes set, we design a flexible opportunistic forwarding strategy to involve multiple neighbors of the sending node into the local forwarding. Consequently, LF-GOR improves the reliability of transmission, and reduces the end-to-end delay brought by the timer-based scheduling mode of many normal opportunistic routing protocols. Finally, a comparison between LF-GOR and existing protocols is presented in the simulation. Corresponding results show that LF-GOR has the higher packet delivery rate and throughput, and also the acceptable delay.","PeriodicalId":340958,"journal":{"name":"2016 International Conference on Computer, Information and Telecommunication Systems (CITS)","volume":"67 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115951479","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}
Pub Date : 2016-07-06DOI: 10.1109/CITS.2016.7546412
Xinxin Chen, Yu Guo, Yang Yang, Zhenqiang Mi
In order to improve the accuracy of recommendation algorithm in social network applications, a new recommendation method based on traditional collaborative filtering recommendation algorithm, which called Trust-based Collaborative Filtering, is proposed and verified in this paper. Firstly, we analyze users' behaviors and relationships in social network, and propose a trust calculation method based on Dijkstra's algorithm. Secondly, we integrate users' trust information into the collaborative filtering algorithm to recommend in social network. Finally, we choose Flixster dataset to validate the proposed model and use the Mean Absolute Error (MAE) as the evaluation metric. Experiment results show that Trust-based CF significantly improves the recommendation quality in social network.
{"title":"Trust-based collaborative filtering algorithm in social network","authors":"Xinxin Chen, Yu Guo, Yang Yang, Zhenqiang Mi","doi":"10.1109/CITS.2016.7546412","DOIUrl":"https://doi.org/10.1109/CITS.2016.7546412","url":null,"abstract":"In order to improve the accuracy of recommendation algorithm in social network applications, a new recommendation method based on traditional collaborative filtering recommendation algorithm, which called Trust-based Collaborative Filtering, is proposed and verified in this paper. Firstly, we analyze users' behaviors and relationships in social network, and propose a trust calculation method based on Dijkstra's algorithm. Secondly, we integrate users' trust information into the collaborative filtering algorithm to recommend in social network. Finally, we choose Flixster dataset to validate the proposed model and use the Mean Absolute Error (MAE) as the evaluation metric. Experiment results show that Trust-based CF significantly improves the recommendation quality in social network.","PeriodicalId":340958,"journal":{"name":"2016 International Conference on Computer, Information and Telecommunication Systems (CITS)","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132267314","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：