{"title":"Dual collaborative topic modeling from implicit feedbacks","authors":"Gai Li, Lei Li","doi":"10.1109/SPAC.2014.6982723","DOIUrl":"https://doi.org/10.1109/SPAC.2014.6982723","url":null,"abstract":"","PeriodicalId":318775,"journal":{"name":"International Conference on Security, Pattern Analysis, and Cybernetics","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132249133","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":"Application of immune algorithm in molecular docking","authors":"Zhenyu Liu, Ming-hua Chen, L. Kang","doi":"10.1109/SPAC.2014.6982670","DOIUrl":"https://doi.org/10.1109/SPAC.2014.6982670","url":null,"abstract":"As a kind of intelligent algorithm, the immune algorithm is improved from genetic algorithm by adopting the density adjusting mechanism to avoid from prematurity, and by good gene resaving mechanism to speed up convergence. To test the effectiveness of the algorithm, numerical example is first adopted; and then, the algorithm is applied into molecular docking, and gain better result than DOCK6_1.","PeriodicalId":318775,"journal":{"name":"International Conference on Security, Pattern Analysis, and Cybernetics","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115140868","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":"Internet information source discovery based on multi-seeds cocitation","authors":"Hui Gao, Haibo Niu, Wei Luo","doi":"10.1109/SPAC.2014.6982717","DOIUrl":"https://doi.org/10.1109/SPAC.2014.6982717","url":null,"abstract":"The technology of Internet information source discovery on specific topic is the groundwork of information acquisition in current big data era. This paper presents a multi-seeds cocitation algorithm to find new Internet information sources. The proposed algorithm is based on cocitation, but what difference with the traditional algorithms is that we use multiple websites on specific topic as input seeds. Then we induce Combined Cocitation Degree(CCD) to measure the relevancy of newly found websites, which is that the new websites have higher combined cocitation degree and are more topic related. Finally a websites collection of the biggest CCD is referred to as the new Internet information sources on the specific topic. The experiments show that the proposed method outperforms traditional algorithms in the scenarios we tested.","PeriodicalId":318775,"journal":{"name":"International Conference on Security, Pattern Analysis, and Cybernetics","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122641014","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":"Improving on the restricted path consistency constraint propagation algorithms based on the bitwise","authors":"Zhuyuan Cheng, Yonggang Zhang","doi":"10.1109/SPAC.2017.8304329","DOIUrl":"https://doi.org/10.1109/SPAC.2017.8304329","url":null,"abstract":"The constraint satisfaction problem(CSP) is very important and meaningful in solving the NP-hard problems. The CSP mainly include two parts: the reasoning and searching. The filtering technology is very important in the searching and the consistency algorithm plays the crucial role in the filtering technology. Recently, Kostas Stergiou proposed easily implement algorithm the restricted path consistency3(RPC3) algorithm, which can efficiently work in the whole search. Then he implements the restricted restricted path consistency3(rRPC3) having the similar performance with RPC3, while the rRPC3 is better than RPC3 and most of other consistency algorithms. Then that experiments showed the better effectiveness than other consistency algorithms. In this paper, we proposed a new consistency algorithm rRPC3bit based on the rRPC3 and the arc consistency(AC)+bit ideas. And then the experiments clearly show the rRPC3bit has better results than the rRPC3 algorithms and the state-of-art max-restricted path consistency3(maxRPC3) algorithm light-max-restricted path consistency3-residues multiple(lmaxRPC3rm) in most of test cases. The new rRPC3bit is a very promising algorithm.","PeriodicalId":318775,"journal":{"name":"International Conference on Security, Pattern Analysis, and Cybernetics","volume":"76 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114863328","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 research on the improved light version max restricted path consistency algorithm with the learned value ordering heuristics","authors":"Yonggang Zhang, Zhuyuan Cheng","doi":"10.1109/SPAC.2017.8304327","DOIUrl":"https://doi.org/10.1109/SPAC.2017.8304327","url":null,"abstract":"In order to further improve the efficiency of the existing maxRPC algorithm, this paper proposes a simple maxRPC3 algorithm, maxRPC3+, which is more suitable for searching, and combines these algorithms with learning value ordering heuristics. On the basis of the current maxRPC (max restricted path consistency) algorithm, an improved light version named maxRPC3+ is proposed, which uses the idea of survivors-first. The proposed algorithm abandons two data structures named LastAC and LastPC which are in the current maxRPC algorithm. While looking for the AC (arc consistency) supports and PC (path consistency) supports, the proposed algorithm always performs the consistency checks from the first value in the domain of variables, which not only preserves the search frame of the current maxRPC3 version, but also avoids adding additional data structure. The algorithm is easy to implement and understand. Experiment results show that the improved algorithm with the learned value ordering heuristics overwhelms the current version maxRPC over the best-known benchmark instances such as qcp, qwh, bqwh and random constraint satisfaction problem instances.","PeriodicalId":318775,"journal":{"name":"International Conference on Security, Pattern Analysis, and Cybernetics","volume":"69 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130282889","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":"Multiple object tracking by incorporating a particle filter into the min-cost flow model","authors":"Yingyi Liang, Xin Li, Zhenyu He, Xinge You","doi":"10.1109/SPAC.2017.8304259","DOIUrl":"https://doi.org/10.1109/SPAC.2017.8304259","url":null,"abstract":"A novel network flow model is proposed for multiple object tracking. Based on tracklets, only a short and reliable detection sequence is needed for an effective tracking. Our model fuses the local and global data association strategies to compensate for their respective shortcomings, which can be divided into two stages: A local stage and a global stage. In the local stage, we follow the tracking-by-detection framework to generate confident tracklets by employing a boosted particle filter. In the global stage, the data association problem is formulated as a Maximum-a-Posteriori (MAP) problem and solved by a typical min-cost flow algorithm. A double-step optimization is designed to solve the long term occlusion. The experimental results show that our method outperforms several state-of-the-art methods for multiple object tracking.","PeriodicalId":318775,"journal":{"name":"International Conference on Security, Pattern Analysis, and Cybernetics","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126822573","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 novel approach to cloth classification through deep neural networks","authors":"Fengxin Li, Yueping Li, Xiaofeng Zhang","doi":"10.1109/SPAC.2017.8304306","DOIUrl":"https://doi.org/10.1109/SPAC.2017.8304306","url":null,"abstract":"The recent development of the field of artificial intelligence makes the traditional technical recognition more accurate. An important area is commodity identification which helps to classify commodity and provide information for data-ming and commercial decision. This paper considers cloth classification by means of deep neural networks. We summarize the existing methods: the effect improvement of network can be divided into two kinds, by modifying network structure according to their priorities, i.e., increase the depth of network and enhance the performance of convolution unit. In order to further improve the performance of network model, we redesign the network structure based on AlexNet, and put forward the deep convolution neural network model. Experiments are performed on the data sets including ImageNet-1000 and cloth data sets ACS and CAPB. The results show that the proposed deep convolutional neural network is superior to the original AlexNet on these three data sets in terms of accuracy.","PeriodicalId":318775,"journal":{"name":"International Conference on Security, Pattern Analysis, and Cybernetics","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129529349","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 personalized hybrid recommendation strategy based on user behaviors and its application","authors":"Qing-ji Tan, Hao Wu, Cong Wang, Qi Guo","doi":"10.1109/SPAC.2017.8304272","DOIUrl":"https://doi.org/10.1109/SPAC.2017.8304272","url":null,"abstract":"Based on user's implicit feedback information, this paper puts forward an effective personalized recommendation algorithm. At first, a series of features are extracted from user behavior sequence, which are the input parameters of logistic regression model. Then we obtain a probability matrix. We view the obtained probability matrix as the scores, and use collaborative filtering recommendation strategy to recommend products to customers. The traditional collaborative filtering methods tend to ignore the impact of consumption time. Comparatively, this paper pays attention to the temporal behavior, which makes the personalized recommendation more reasonable. Our experimental results show that behavior sequence combined with collaborative filtering recommendation strategy has the ideal effect in recommendation. Besides, it has solved the problem that the strategy of collaborative filtering couldn't take advantage of implicit feedback directly. What's more, our algorithm performs well with sparse data. At last, beginning from the business features and the angel of statistics, this paper take some measures to adjust algorithm. Therefore, the result of the recommendation is optimized and the accuracy of the algorithm is improved.","PeriodicalId":318775,"journal":{"name":"International Conference on Security, Pattern Analysis, and Cybernetics","volume":"69 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131235914","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":"New method for jiaguwen image segmentation based on MRF and fuzzy clustering","authors":"Xiaoju He, Zhiwu Liao","doi":"10.1109/SPAC.2017.8304276","DOIUrl":"https://doi.org/10.1109/SPAC.2017.8304276","url":null,"abstract":"JiaGuWen image segmentation is a challenge because of their illegible writing, serious noises and broken strokes. We propose a new segmentation method based on MRF and fuzzy clustering because of their good performance in image segmentation. The segmentation is based on a new random function considering both ambiguity and spatial relationship of image pieds simultaneously. The New adaptive balance coefficient is computed according to the gray level of the considering pixel and the mean, standard deviation of the neighbor. The final value of the new random function is searching by iteration. The experiments show that the new method has good performance for JiaGuWen image segmentation.","PeriodicalId":318775,"journal":{"name":"International Conference on Security, Pattern Analysis, and Cybernetics","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123699227","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 parking-line detection method based on Edge Direction","authors":"Peng Liu, Jianwei Zhang, K. Guo, Hu Zhang","doi":"10.1109/SPAC.2014.6982666","DOIUrl":"https://doi.org/10.1109/SPAC.2014.6982666","url":null,"abstract":"Parking-lines recognition is the precondition in vehicle automatic parking system. A Parking-line Detection Method Based on Edge Direction is proposed. Transform the gray images into edge images using median filter, edge detection. Pick out linear edges in the edge images using Hough transfer. Define the signs of linear edges and propose their determinant algorithm. Based on the algorithm, determinate the sign of each linear edge and recognize the parking-line according to the sign of each linear edge. The experimental results show that this algorithm is of the reliability and can satisfy real-time request.","PeriodicalId":318775,"journal":{"name":"International Conference on Security, Pattern Analysis, and Cybernetics","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116611405","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}