{"title":"Label propagation community detection algorithm based on density peak optimization","authors":"Yan Ma, Guoqiang Chen","doi":"10.21203/RS.3.RS-607969/V1","DOIUrl":"https://doi.org/10.21203/RS.3.RS-607969/V1","url":null,"abstract":"\u0000 Community structure detection in complex network structure and function to understand network relations, found its evolution rule, monitoring and forecasting its evolution behavior has important theoretical significance, in the epidemic monitoring, network public opinion analysis, recommendation, advertising push and combat terrorism and safeguard national security has wide application prospect. Label propagation algorithm is one of the popular algorithms for community detection in recent years, the community detection algorithm based on tags spread the biggest advantage is the simple algorithm logic, relative to the module of optimization algorithm convergence speed is very fast, the clustering process without any optimization function, and the initialization before do not need to specify the number of complex network community. However, the algorithm has some problems such as unstable partitioning results and strong randomness. To solve this problem, this paper proposes an unsupervised label propagation community detection algorithm based on density peak. The proposed algorithm first introduces the density peak to find the clustering center, first determines the prototype of the community, and then fixes the number of communities and the clustering center of the complex network, and then uses the label propagation algorithm to detect the community, which improves the accuracy and robustness of community discovery, reduces the number of iterations, and accelerates the formation of the community. Finally, experiments on synthetic network and real network data sets are carried out with the proposed algorithm, and the results show that the proposed method has better performance.","PeriodicalId":439359,"journal":{"name":"International Conference on Computational Intelligence and Security","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114980681","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 Recognition Algorithm for Similar Characters on License Plates Based on Improved CNN","authors":"Shanshan Li, Yimin Li","doi":"10.1109/CIS.2015.9","DOIUrl":"https://doi.org/10.1109/CIS.2015.9","url":null,"abstract":"A recognition algorithm for similar characters on license plates based on convolution neural networks (CNN) is proposed in this study to improve the recognition rate in a complex environment. The algorithm adopts the improved CNN to recognize similar letters and numbers in license plate images. Experimental results suggest that the improved CNN may improve the recognition rate and speed of similar characters on license plates.","PeriodicalId":439359,"journal":{"name":"International Conference on Computational Intelligence and Security","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125963869","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 Hybrid Algorithm for Global Optimization","authors":"Fei Qin, Jie Liu","doi":"10.1109/CIS.2015.71","DOIUrl":"https://doi.org/10.1109/CIS.2015.71","url":null,"abstract":"In this paper, a hybrid optimization algorithm, consisting of a central force optimization and a gradient-based method, is constructed. The central force optimization is used to locate decent points for previously converged local minima. The combined algorithm balance explores and exploits.","PeriodicalId":439359,"journal":{"name":"International Conference on Computational Intelligence and Security","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114468039","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 2-Approximation Algorithm for the Single Machine Due Date Assignment Scheduling Problem in Fuzzy Environment to Minimize the Total Costs","authors":"Jinquan Li, Jinhua Zhang","doi":"10.1109/CIS.2015.33","DOIUrl":"https://doi.org/10.1109/CIS.2015.33","url":null,"abstract":"In this paper, we consider the singe machine due date assignment problems with fuzzy processing time and precedence constraints. The objective is to minimize the crisp possibilistic mean value of the total earliness-tardiness penalties. The problems is NP-hard 201. We put forward an efficient 2-approximation algorithm for this problem based on solving a linear programming relaxation of the problem. The numerical example show the algorithm given in this paper is effective.","PeriodicalId":439359,"journal":{"name":"International Conference on Computational Intelligence and Security","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116467382","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 New Minimum Exposure Path Problem and Its Solving Algorithm","authors":"Miao Ye, Meiling Zhao, Xiao-hui Cheng","doi":"10.1109/CIS.2015.107","DOIUrl":"https://doi.org/10.1109/CIS.2015.107","url":null,"abstract":"The original minimum exposure path (MEP) problem in wireless sensor networks (WSN) does not take into account the actual constraint conditions of the path. This paper proposes a new MEP problem which requires the path must lie along some border of a protected area. As unable to set up the corresponding weight graph model, the original classic method (grid-based method) in solving the original MEP problem does not work for the proposed MEP problem anymore. We first convert it into a continuous optimization problem, and then design a genetic algorithm to solve this complex optimal problem. The simulation test shows that the design optimization model and algorithm can solve the new proposed MEP problem effectively.","PeriodicalId":439359,"journal":{"name":"International Conference on Computational Intelligence and Security","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123355802","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 Fast Image Stitching Algorithm Based on Improved SURF","authors":"Lin Zhu, Y. Wang, Bo Zhao, Xiaozheng Zhang","doi":"10.1109/CIS.2014.67","DOIUrl":"https://doi.org/10.1109/CIS.2014.67","url":null,"abstract":"A fast image stitching algorithm based on improved speeded up robust feature (SURF) is proposed to overcome the real-time performance and robustness of the original SURF based stitching algorithms. The machine learning method is adopted to build a binary classifier, which identify the key feature points extracted by SURF and remove the non-key feature points. In addition, the RELIEF-F algorithm is used for dimension reduction and simplification of the improved SURF descriptor to achieve image registration. The threshold-based weighted fusion algorithm is used to achieve seamless image stitching. Finally, several experiments are conducted to verify the real-time performance and robustness of the improved algorithm.","PeriodicalId":439359,"journal":{"name":"International Conference on Computational Intelligence and Security","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127909201","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":"Analysis of Hybrid Feature Research Based on Extraction LPCC and MFCC","authors":"Jianchen Zhu, Zengli Liu","doi":"10.1109/CIS.2014.19","DOIUrl":"https://doi.org/10.1109/CIS.2014.19","url":null,"abstract":"The MFCC and LPCC is the speaker recognition feature parameters to be used, the speech of analysis often use these feature, therefore, we need a parameter extraction algorithm and the principle of MFCC and LPCC. The reason is that w e need to understand the technological process. We are modeling to the speaker, the traditional vector quantization model increase the differential equation. The formation of a series of consecutive words distribution vector quantization model, at the same time, extracting the characteristic parameters of Mel frequency cepstrum coefficient and differential speaker that consists of linear prediction cepstrum coefficient combination, we conduct a text about dependent speaker recognition. The algorithm show mixing MFCC and LPCC extraction, based on keeping the response time of the system did not significantly increase the rate the model has been improved to be a certain extent.","PeriodicalId":439359,"journal":{"name":"International Conference on Computational Intelligence and Security","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117060143","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":"Services Selection of Transactional Property for Web Service Composition","authors":"Guojun Zhang","doi":"10.1109/CIS.2012.141","DOIUrl":"https://doi.org/10.1109/CIS.2012.141","url":null,"abstract":"Web service composition enables seamless and dynamic integration of business applications on the web. Due to the inherent autonomy and heterogeneity of component Web services it is difficult to predict the behavior of the overall composite service. Therefore, transactional properties are crucial for selecting the web services to take part in the composition. Transactional properties ensure reliability of composite Web service. In this paper we propose a novel selection approach based on transactional properties of ensuring reliability. We build a model to implement transactional-aware service selection, and use the model composite Web service to guarantee reliable execution. We evaluate our approach experimentally using both real and synthetically generated datasets.","PeriodicalId":439359,"journal":{"name":"International Conference on Computational Intelligence and Security","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128686220","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":"Range Image Based Classification System Using Support Vector Machines","authors":"S. E. Ghobadi, K. Hartmann, O. Loffeld, W. Weihs","doi":"10.1007/978-3-540-74377-4_30","DOIUrl":"https://doi.org/10.1007/978-3-540-74377-4_30","url":null,"abstract":"","PeriodicalId":439359,"journal":{"name":"International Conference on Computational Intelligence and Security","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125840566","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":"Subspace KDA Algorithm for Non-linear Feature Extraction in Face Identification","authors":"Wensheng Chen, P. Yuen, J. Lai","doi":"10.1007/978-3-540-74377-4_116","DOIUrl":"https://doi.org/10.1007/978-3-540-74377-4_116","url":null,"abstract":"","PeriodicalId":439359,"journal":{"name":"International Conference on Computational Intelligence and Security","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116519566","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}