Hui Wang, Tie Cai, Dongsheng Cheng, Kangshun Li, Ying Zhou
According to the spectral characteristics of different Chinese medicinal materials, the types of Chinese medicinal materials and the origin of Chinese medicinal materials are identified. Construct a fragmented clustering model. Firstly, the mid-infrared sample data is preprocessed, the Laida criterion model is established, and the abnormal data is eliminated; then the slicing model is used to divide the spectral wave into different regions according to the spectral characteristics. The data of each slice is clustered through the k-means clustering model. The origin of Chinese medicinal materials is identified by the support vector machine model. The data of Chinese medicinal materials with a known origin of a certain type of Chinese medicinal materials is used as the training sample set, and the data of Chinese medicinal materials with unknown origin is used as the test set.
{"title":"AN Identification and Prediction Model Based on PSO","authors":"Hui Wang, Tie Cai, Dongsheng Cheng, Kangshun Li, Ying Zhou","doi":"10.4018/ijcini.344023","DOIUrl":"https://doi.org/10.4018/ijcini.344023","url":null,"abstract":"According to the spectral characteristics of different Chinese medicinal materials, the types of Chinese medicinal materials and the origin of Chinese medicinal materials are identified. Construct a fragmented clustering model. Firstly, the mid-infrared sample data is preprocessed, the Laida criterion model is established, and the abnormal data is eliminated; then the slicing model is used to divide the spectral wave into different regions according to the spectral characteristics. The data of each slice is clustered through the k-means clustering model. The origin of Chinese medicinal materials is identified by the support vector machine model. The data of Chinese medicinal materials with a known origin of a certain type of Chinese medicinal materials is used as the training sample set, and the data of Chinese medicinal materials with unknown origin is used as the test set.","PeriodicalId":43637,"journal":{"name":"International Journal of Cognitive Informatics and Natural Intelligence","volume":null,"pages":null},"PeriodicalIF":0.9,"publicationDate":"2024-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141112634","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}
Hui Wang, Tie Cai, Dongsheng Cheng, Kangshun Li, Ying Zhou
The current classification is difficult to overcome the high-dimension classification problems. So, we will design the decreasing dimension method. Locally linear embedding is that the local optimum gradually approaches the global optimum, especially the complicated manifold learning problem used in big data dimensionality reduction needs to find an optimization method to adjust k-nearest neighbors and extract dimensionality. Therefore, we intend to use orthogonal mapping to find the optimization closest neighbors k, and the design is based on the Lebesgue measure constraint processing technology particle swarm locally linear embedding to improve the calculation accuracy of popular learning algorithms. So, we propose classification algorithm based on improved locally linear embedding. The experiment results show that the performance of proposed classification algorithm is best compared with the other algorithm.
{"title":"A Classification Algorithm Based on Improved Locally Linear Embedding","authors":"Hui Wang, Tie Cai, Dongsheng Cheng, Kangshun Li, Ying Zhou","doi":"10.4018/ijcini.344020","DOIUrl":"https://doi.org/10.4018/ijcini.344020","url":null,"abstract":"The current classification is difficult to overcome the high-dimension classification problems. So, we will design the decreasing dimension method. Locally linear embedding is that the local optimum gradually approaches the global optimum, especially the complicated manifold learning problem used in big data dimensionality reduction needs to find an optimization method to adjust k-nearest neighbors and extract dimensionality. Therefore, we intend to use orthogonal mapping to find the optimization closest neighbors k, and the design is based on the Lebesgue measure constraint processing technology particle swarm locally linear embedding to improve the calculation accuracy of popular learning algorithms. So, we propose classification algorithm based on improved locally linear embedding. The experiment results show that the performance of proposed classification algorithm is best compared with the other algorithm.","PeriodicalId":43637,"journal":{"name":"International Journal of Cognitive Informatics and Natural Intelligence","volume":null,"pages":null},"PeriodicalIF":0.9,"publicationDate":"2024-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141112417","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}
Due to the complex distribution of web data and frequent updates under the cloud service architecture, the existing methods for global consistency of data ignore the global consistency of distance measurement and the inability to obtain neighborhood information of data. To overcome these problems, we transform the multi-information goal and multi-user demand (constraint conditions) in web data mining into a constrained multi-objective optimization model and solve it by a constrained particle swarm multi-objective optimization algorithm. While we measure the distance between data by manifold distance. In order to make it easier for the constrained multi-objective particle swarm algorithm to solve different types of problems to find an effective solution set closer to the real Pareto front, a new manifold learning algorithm based on the constrained multi-objective particle swarm algorithm is built and used to solve this problem. Experiments results demonstrate that this can improve the service efficiency of cloud computing.
{"title":"A Web Data Mining Algorithm Based on Manifold Distance for Mixed Data in Cloud Service Architecture","authors":"Hui Wang, Tie Cai, Dongsheng Cheng, Kangshun Li, Guangming Lin, Zhijian Wu","doi":"10.4018/ijcini.344021","DOIUrl":"https://doi.org/10.4018/ijcini.344021","url":null,"abstract":"Due to the complex distribution of web data and frequent updates under the cloud service architecture, the existing methods for global consistency of data ignore the global consistency of distance measurement and the inability to obtain neighborhood information of data. To overcome these problems, we transform the multi-information goal and multi-user demand (constraint conditions) in web data mining into a constrained multi-objective optimization model and solve it by a constrained particle swarm multi-objective optimization algorithm. While we measure the distance between data by manifold distance. In order to make it easier for the constrained multi-objective particle swarm algorithm to solve different types of problems to find an effective solution set closer to the real Pareto front, a new manifold learning algorithm based on the constrained multi-objective particle swarm algorithm is built and used to solve this problem. Experiments results demonstrate that this can improve the service efficiency of cloud computing.","PeriodicalId":43637,"journal":{"name":"International Journal of Cognitive Informatics and Natural Intelligence","volume":null,"pages":null},"PeriodicalIF":0.9,"publicationDate":"2024-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141111546","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}
It is necessary for English teachers to grasp the causes of students' language anxiety and explore ways to avoid, reduce, and eliminate students' anxiety. This paper discusses the foreign language anxiety of college English teachers in classroom teaching, its possible causes, teachers' awareness of anxiety, and countermeasures. This paper introduces the composition of student affairs analysis system from data layer, analysis layer, application layer, and display layer and combines data warehouse and data mining technology to improve the functions of student information, teacher information, achievement information, course selection information, and course evaluation. On the premise of data mining and data information management, it realizes the construction and application of teaching management data analysis system, using classification model. Apriori algorithm improves the algorithm, uses big data technology to analyze data and design courses, and analyzes the inherent relationship between mental health problems and attributes.
{"title":"Foreign Language Anxiety of College English Teachers and Their Countermeasures","authors":"Qianqian Xie","doi":"10.4018/ijcini.335078","DOIUrl":"https://doi.org/10.4018/ijcini.335078","url":null,"abstract":"It is necessary for English teachers to grasp the causes of students' language anxiety and explore ways to avoid, reduce, and eliminate students' anxiety. This paper discusses the foreign language anxiety of college English teachers in classroom teaching, its possible causes, teachers' awareness of anxiety, and countermeasures. This paper introduces the composition of student affairs analysis system from data layer, analysis layer, application layer, and display layer and combines data warehouse and data mining technology to improve the functions of student information, teacher information, achievement information, course selection information, and course evaluation. On the premise of data mining and data information management, it realizes the construction and application of teaching management data analysis system, using classification model. Apriori algorithm improves the algorithm, uses big data technology to analyze data and design courses, and analyzes the inherent relationship between mental health problems and attributes.","PeriodicalId":43637,"journal":{"name":"International Journal of Cognitive Informatics and Natural Intelligence","volume":null,"pages":null},"PeriodicalIF":0.9,"publicationDate":"2023-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138994729","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}
Heuristic algorithms are effective methods for solving complex optimization problems. The optimal algorithm selection for a specific optimization problem is a challenging task. Fitness landscape analysis (FLA) is used to understand the optimization problem's characteristics and help select the optimal algorithm. A random walk algorithm is an essential technique for FLA in continuous search space. However, most currently proposed random walk algorithms suffer from unbalanced sampling points. This article proposes a Lévy flight-based random walk (LRW) algorithm to address this problem. The Lévy flight is used to generate the proposed random walk algorithm's variable step size and direction. Some tests show that the proposed LRW algorithm performs better in the uniformity of sampling points. Besides, the authors analyze the fitness landscape of the CEC2017 benchmark functions using the proposed LRW algorithm. The experimental results indicate that the proposed LRW algorithm can better obtain the structural features of the landscape and has better stability than several other RW algorithms.
{"title":"A Lévy Flight-Inspired Random Walk Algorithm for Continuous Fitness Landscape Analysis","authors":"Yi Wang, Kangshun Li","doi":"10.4018/ijcini.330535","DOIUrl":"https://doi.org/10.4018/ijcini.330535","url":null,"abstract":"Heuristic algorithms are effective methods for solving complex optimization problems. The optimal algorithm selection for a specific optimization problem is a challenging task. Fitness landscape analysis (FLA) is used to understand the optimization problem's characteristics and help select the optimal algorithm. A random walk algorithm is an essential technique for FLA in continuous search space. However, most currently proposed random walk algorithms suffer from unbalanced sampling points. This article proposes a Lévy flight-based random walk (LRW) algorithm to address this problem. The Lévy flight is used to generate the proposed random walk algorithm's variable step size and direction. Some tests show that the proposed LRW algorithm performs better in the uniformity of sampling points. Besides, the authors analyze the fitness landscape of the CEC2017 benchmark functions using the proposed LRW algorithm. The experimental results indicate that the proposed LRW algorithm can better obtain the structural features of the landscape and has better stability than several other RW algorithms.","PeriodicalId":43637,"journal":{"name":"International Journal of Cognitive Informatics and Natural Intelligence","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"136130136","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}
With the rapid development of social economy, people's demand for diversified and precise goals is increasingly prominent. In the face of a specific engineering application practice, how to find a satisfactory equilibrium solution among multiple objectives has been the focus of researchers at home and abroad. Aiming at the convergence and diversity imbalance in the current high-dimensional multi-objective evolutionary algorithm based on reference points, this article suggests a constrained evolutionary algorithm based on spatial division, angle culling, and hybrid matching selection strategy. Experimental practices show that the proposed algorithm has better performance compared with other related variants on DTLZ/WFG benchmark functions and in solving the problem of electricity market price.
{"title":"A Coevolution Algorithm Based on Spatial Division and Hybrid Matching Strategy","authors":"Hongbo Wang, Wei Huang","doi":"10.4018/ijcini.326752","DOIUrl":"https://doi.org/10.4018/ijcini.326752","url":null,"abstract":"With the rapid development of social economy, people's demand for diversified and precise goals is increasingly prominent. In the face of a specific engineering application practice, how to find a satisfactory equilibrium solution among multiple objectives has been the focus of researchers at home and abroad. Aiming at the convergence and diversity imbalance in the current high-dimensional multi-objective evolutionary algorithm based on reference points, this article suggests a constrained evolutionary algorithm based on spatial division, angle culling, and hybrid matching selection strategy. Experimental practices show that the proposed algorithm has better performance compared with other related variants on DTLZ/WFG benchmark functions and in solving the problem of electricity market price.","PeriodicalId":43637,"journal":{"name":"International Journal of Cognitive Informatics and Natural Intelligence","volume":null,"pages":null},"PeriodicalIF":0.9,"publicationDate":"2023-07-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"43060250","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}
Smoking in public places not only causes potential harm to the health of oneself and others, but also causes hidden dangers such as fires. Therefore, for health and safety considerations, a detection model is designed based on deep learning for places where smoking is prohibited, such as airports, gas stations, and chemical warehouses, that can quickly detect and warn smoking behavior. In the model, a convolutional neural network is used to process the input frames of the video stream which are captured by the camera. After image feature extraction, feature fusion, target classification and target positioning, the position of the cigarette butt is located, and smoking behavior is determined. Common target detection algorithms are not ideal for small target objects, and the detection speed needs to be improved. A series of designed convolutional neural network modules not only reduce the amount of model calculations, speed up the deduction, and meet real-time requirements, but also improve the detection accuracy of small target objects (cigarette butts).
{"title":"An Intelligent Detection Approach for Smoking Behavior","authors":"J. Chong","doi":"10.4018/ijcini.324115","DOIUrl":"https://doi.org/10.4018/ijcini.324115","url":null,"abstract":"Smoking in public places not only causes potential harm to the health of oneself and others, but also causes hidden dangers such as fires. Therefore, for health and safety considerations, a detection model is designed based on deep learning for places where smoking is prohibited, such as airports, gas stations, and chemical warehouses, that can quickly detect and warn smoking behavior. In the model, a convolutional neural network is used to process the input frames of the video stream which are captured by the camera. After image feature extraction, feature fusion, target classification and target positioning, the position of the cigarette butt is located, and smoking behavior is determined. Common target detection algorithms are not ideal for small target objects, and the detection speed needs to be improved. A series of designed convolutional neural network modules not only reduce the amount of model calculations, speed up the deduction, and meet real-time requirements, but also improve the detection accuracy of small target objects (cigarette butts).","PeriodicalId":43637,"journal":{"name":"International Journal of Cognitive Informatics and Natural Intelligence","volume":null,"pages":null},"PeriodicalIF":0.9,"publicationDate":"2023-06-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"43860613","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}
Semantic similarity is used extensively for understanding the context and meaning of the text data. In this paper, use of the semantic similarity in an automatic essay evaluation system is proposed. Different text embedding methods are used to compute the semantic similarity. Recent neural embedding methods including Google sentence encoder (GSE), embeddings for language models (ELMo), and global vectors (GloVe) are employed for computing the semantic similarity. Traditional methods of textual data representation such as TF-IDF and Jaccard index are also used in finding the semantic similarity. Experimental analysis of an intra-class and inter-class semantic similarity score distributions shows that the GSE outperforms other methods by accurately distinguishing essays from the same or different set/topic. Semantic similarity calculated using the GSE method is further used for finding the correlation with human rated essay scores, which shows high correlation with the human-rated scores on various essay traits.
{"title":"Efficacy of Deep Neural Embeddings-Based Semantic Similarity in Automatic Essay Evaluation","authors":"Manik Hendre, Prasenjit Mukherjee, Raman Preet, Manish Godse","doi":"10.4018/ijcini.323190","DOIUrl":"https://doi.org/10.4018/ijcini.323190","url":null,"abstract":"Semantic similarity is used extensively for understanding the context and meaning of the text data. In this paper, use of the semantic similarity in an automatic essay evaluation system is proposed. Different text embedding methods are used to compute the semantic similarity. Recent neural embedding methods including Google sentence encoder (GSE), embeddings for language models (ELMo), and global vectors (GloVe) are employed for computing the semantic similarity. Traditional methods of textual data representation such as TF-IDF and Jaccard index are also used in finding the semantic similarity. Experimental analysis of an intra-class and inter-class semantic similarity score distributions shows that the GSE outperforms other methods by accurately distinguishing essays from the same or different set/topic. Semantic similarity calculated using the GSE method is further used for finding the correlation with human rated essay scores, which shows high correlation with the human-rated scores on various essay traits.","PeriodicalId":43637,"journal":{"name":"International Journal of Cognitive Informatics and Natural Intelligence","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-05-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135767980","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}
Resources scheduling is a major challenge in cloud computing because of its ability to provide many on-demand information technology services according to needs of customers. In order to acquire the best balance between speed of operation, average response time, and integrated system utilization in the resource allocation process in cloud computing, an improved bat algorithm with time-varying wavelet perturbations was proposed. The algorithm provided a perturbation strategy of time-varying Morlet wavelet with the waving property to prevent from local optimum greatly and improve the converging speed and accuracy through the guide of individual distribution to control diversity and time-varying coefficient of wavelets. The experiments showed the proposed could significantly upgrade the overall performance and the capability of resource scheduling in cloud service compared to similar algorithms.
{"title":"An Improved Bat Algorithm With Time-Varying Wavelet Perturbations for Cloud Computing Resources Scheduling","authors":"F. Yu, Meijia Chen, Bolin Yu","doi":"10.4018/ijcini.318651","DOIUrl":"https://doi.org/10.4018/ijcini.318651","url":null,"abstract":"Resources scheduling is a major challenge in cloud computing because of its ability to provide many on-demand information technology services according to needs of customers. In order to acquire the best balance between speed of operation, average response time, and integrated system utilization in the resource allocation process in cloud computing, an improved bat algorithm with time-varying wavelet perturbations was proposed. The algorithm provided a perturbation strategy of time-varying Morlet wavelet with the waving property to prevent from local optimum greatly and improve the converging speed and accuracy through the guide of individual distribution to control diversity and time-varying coefficient of wavelets. The experiments showed the proposed could significantly upgrade the overall performance and the capability of resource scheduling in cloud service compared to similar algorithms.","PeriodicalId":43637,"journal":{"name":"International Journal of Cognitive Informatics and Natural Intelligence","volume":null,"pages":null},"PeriodicalIF":0.9,"publicationDate":"2023-03-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"44608755","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}
Kangshun Li, Leqing Lin, Jiaming Li, Siwei Chen, H. Jalil
In order to accurately predict the concentration detection data of ion sensors for animal and plant, this paper proposes a gene expression programming (GEP) based concentration detection method. The method includes collecting ion concentration data as well as voltage timing data; preprocessing all the collected data to obtain an initial sample set; constructing a prediction model of ion concentration, which is an explicit functional relationship between voltage and the concentration of a specific ion. The Gene Expression Programming is used to train and evaluate the prediction model, and obtain a trained model. By comparing gene expression programming with other two modeling methods, it is found that the accuracy of the model established by gene expression programming has greater advantages than that established by polynomial fitting and neural network in processing animal and plant ion concentration data.
{"title":"A New Algorithm for Detection of Animal and Plant Ion Concentration Based on Gene Expression Programming","authors":"Kangshun Li, Leqing Lin, Jiaming Li, Siwei Chen, H. Jalil","doi":"10.4018/ijcini.318144","DOIUrl":"https://doi.org/10.4018/ijcini.318144","url":null,"abstract":"In order to accurately predict the concentration detection data of ion sensors for animal and plant, this paper proposes a gene expression programming (GEP) based concentration detection method. The method includes collecting ion concentration data as well as voltage timing data; preprocessing all the collected data to obtain an initial sample set; constructing a prediction model of ion concentration, which is an explicit functional relationship between voltage and the concentration of a specific ion. The Gene Expression Programming is used to train and evaluate the prediction model, and obtain a trained model. By comparing gene expression programming with other two modeling methods, it is found that the accuracy of the model established by gene expression programming has greater advantages than that established by polynomial fitting and neural network in processing animal and plant ion concentration data.","PeriodicalId":43637,"journal":{"name":"International Journal of Cognitive Informatics and Natural Intelligence","volume":null,"pages":null},"PeriodicalIF":0.9,"publicationDate":"2023-02-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"45629871","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
扫码关注我们
求助内容：
应助结果提醒方式：