• Journal of Information Processing Systems
• /
• v.20 no.1
• /
• pp.13-23
• /
• 2024

Music brings pleasure and relaxation to people. Therefore, it is necessary to classify musical genres based on scenes. Identifying favorite musical genres from massive music data is a time-consuming and laborious task. Recent studies have suggested that machine learning algorithms are effective in distinguishing between various musical genres. However, meeting the actual requirements in terms of accuracy or timeliness is challenging. In this study, a hybrid machine learning model that combines a deep residual auto-encoder (DRAE) and support vector machine (SVM) for musical genre recognition was proposed. Eight manually extracted features from the Mel-frequency cepstral coefficients (MFCC) were employed in the preprocessing stage as the hybrid music data source. During the training stage, DRAE was employed to extract feature maps, which were then used as input for the SVM classifier. The experimental results indicated that this method achieved a 91.54% F1-score and 91.58% top-1 accuracy, outperforming existing approaches. This novel approach leverages deep architecture and conventional machine learning algorithms and provides a new horizon for musical genre classification tasks.

• Journal of Institute of Control, Robotics and Systems
• /
• v.22 no.9
• /
• pp.759-765
• /
• 2016

This paper presents the principle, dynamics modeling and control, hardware implementation, and flight test result of a hybrid-type unmanned aerial vehicle (UAV). The proposed UAV was designed to provide both hovering and fixed-wing type aerodynamic flight modes. The UAV's flight mode transition was achieved through the attitude transformation in pitch axis, which avoids a complex rotor tilt mechanism from a structural and control viewpoint. To achieve this, a different navigation coordinate was introduced that avoids the gimbal lock in pitch singularity point. Attitude and guidance control algorithms were developed for the flight control system. For flight test purposes, a quadrotor attached with a tailless fixed-wing structure was manufactured. An onboard flight control computer was designed to realize the navigation and control algorithms and the UAV's performance was verified through the outdoor flight tests.

• Journal of Intelligence and Information Systems
• /
• v.13 no.3
• /
• pp.63-82
• /
• 2007

In this paper, we propose an adaptive hybrid genetic algorithm (ahGA) approach for effectively solving multistage-based scheduling problems in flexible manufacturing system (FMS) environment. The proposed ahGA uses a neighborhood search technique for local search and an adaptive scheme for regulation of GA parameters in order to improve the solution of FMS scheduling problem and to enhance the performance of genetic search process, respectively. In numerical experiment, we present two types of multistage-based scheduling problems to compare the performances of the proposed ahGA with conventional competing algorithms. Experimental results show that the proposed ahGA outperforms the conventional algorithms.

• Industrial Engineering and Management Systems
• /
• v.6 no.1
• /
• pp.64-71
• /
• 2007

J. Kennedy and R. Eberhart first introduced the concept called as Particle Swarm Optimization (PSO). They applied it to optimize continuous nonlinear functions and demonstrated the effectiveness of the algorithm. Since then a considerable number of researchers have attempted to apply this concept to a variety of optimization problems and obtained reasonable results. In PSO, individuals communicate and exchange simple information with each other. The information among individuals is communicated in the swarm and the information between individuals and their swarm is also shared. Finally, the swarm approaches the optimal behavior. It is reported that reasonable approximate solutions of various types of test functions are obtained by employing PSO. However, if more precise solutions are required, additional algorithms and/or hybrid algorithms would be necessary. For example, the heading vector of the swarm can be slightly adjusted under some conditions. In this paper, we propose a hybrid algorithm to obtain more precise solutions. In the algorithm, when a better solution in the swarm is found, the neighborhood of a certain distance from the solution is searched. Then, the algorithm returns to the original PSO search. By this hybrid method, we can obtain considerably better solutions in less iterations than by the standard PSO method.

• Journal of KIISE:Computer Systems and Theory
• /
• v.27 no.3
• /
• pp.287-299
• /
• 2000

In this paper, we classify multicast methods into three categories, i.e., tree-based, path-based, and hybrid-based multicasts, for a multicomputer employing the bidirectional torus network and wormhole routing. We propose the dynamic partition multicast routing (DPMR) as a path-based algorithm. As a hybrid-based algorithm, we suggest the hybrid multicast routing (HMR), which employs the tree-based approach in the first phase of routing and the path-based approach in the second phase. Performance is measured in terms of the average latency for various message length to compare three multicast routing algorithms. We also compare the performance of wormhole routing having variable buffer size with virtual cut-through switching. The message latency for each switching method is compared using the DPMR algorithm to evaluate the buffer size trade-off on the performance.

• Journal of information and communication convergence engineering
• /
• v.13 no.2
• /
• pp.123-131
• /
• 2015

Training neural networks is a complex task with great importance in the field of supervised learning. In the training process, a set of input-output patterns is repeated to an artificial neural network (ANN). From those patterns weights of all the interconnections between neurons are adjusted until the specified input yields the desired output. In this paper, a new hybrid algorithm is proposed for global optimization of connection weights in an ANN. Dynamic swarms are shown to converge rapidly during the initial stages of a global search, but around the global optimum, the search process becomes very slow. In contrast, the gradient descent method can achieve faster convergence speed around the global optimum, and at the same time, the convergence accuracy can be relatively high. Therefore, the proposed hybrid algorithm combines the dynamic particle swarm optimization (DPSO) algorithm with the backpropagation (BP) algorithm, also referred to as the DPSO-BP algorithm, to train the weights of an ANN. In this paper, we intend to show the superiority (time performance and quality of solution) of the proposed hybrid algorithm (DPSO-BP) over other more standard algorithms in neural network training. The algorithms are compared using two different datasets, and the results are simulated.

• International Journal of Computer Science & Network Security
• /
• v.21 no.8
• /
• pp.238-246
• /
• 2021

The rapid rise of the Internet and social media has resulted in a large number of text-based reviews being placed on sites such as social media. In the age of social media, utilizing machine learning technologies to analyze the emotional context of comments aids in the understanding of QoS for any product or service. The classification and analysis of user reviews aids in the improvement of QoS. (Quality of Services). Machine Learning algorithms have evolved into a powerful tool for analyzing user sentiment. Unlike traditional categorization models, which are based on a set of rules. In sentiment categorization, Bidirectional Long Short-Term Memory (BiLSTM) has shown significant results, and Convolution Neural Network (CNN) has shown promising results. Using convolutions and pooling layers, CNN can successfully extract local information. BiLSTM uses dual LSTM orientations to increase the amount of background knowledge available to deep learning models. The suggested hybrid model combines the benefits of these two deep learning-based algorithms. The data source for analysis and classification was user reviews of Indian Railway Services on Twitter. The suggested hybrid model uses the Keras Embedding technique as an input source. The suggested model takes in data and generates lower-dimensional characteristics that result in a categorization result. The suggested hybrid model's performance was compared using Keras and Word2Vec, and the proposed model showed a significant improvement in response with an accuracy of 95.19 percent.

• Smart Structures and Systems
• /
• v.29 no.3
• /
• pp.433-444
• /
• 2022

Concrete is a most utilized material in the construction industry that have main components. The strength of concrete can be improved by adding some admixtures. Evaluating the impact of fly ash (FA) and silica fume (SF) on the long-term compressive strength (CS) of concrete provokes to find the significant parameters in predicting the CS, which could be useful in the practical works and would be extensible in the future analysis. In this study, to evaluate the effective parameters in predicting the CS of concrete containing admixtures in the long-term and present a fitted equation, the multivariate adaptive regression splines (MARS) method has been used, which could find a relationship between independent and dependent variables. Next, for optimizing the output equation, biogeography-based optimization (BBO), particle swarm optimization (PSO), and hybrid PSOBBO methods have been utilized to find the most optimal conclusions. It could be concluded that for CS predictions in the long-term, all proposed models have the coefficient of determination (R²) larger than 0.9243. Furthermore, MARS-PSOBBO could be offered as the best model to predict CS between three hybrid algorithms accurately.

• International Journal of Computer Science & Network Security
• /
• v.23 no.6
• /
• pp.193-201
• /
• 2023

In this paper, we consider the maximum scatter traveling salesman problem (MSTSP), a travelling salesman problem (TSP) variant. The problem aims to maximize the minimum length edge in a salesman's tour that travels each city only once in a network. It is a very complicated NP-hard problem, and hence, exact solutions can be found for small sized problems only. For large-sized problems, heuristic algorithms must be applied, and genetic algorithms (GAs) are found to be very successfully to deal with such problems. So, this paper develops a hybrid GA (HGA) for solving the problem. Our proposed HGA uses sequential sampling algorithm along with 2-opt search for initial population generation, sequential constructive crossover, adaptive mutation, randomly selected one of three local search approaches, and the partially mapped crossover along with swap mutation for perturbation procedure to find better quality solution to the MSTSP. Finally, the suggested HGA is compared with a state-of-art algorithm by solving some TSPLIB symmetric instances of many sizes. Our computational experience reveals that the suggested HGA is better. Further, we provide solutions to some asymmetric TSPLIB instances of many sizes.

• 제어로봇시스템학회:학술대회논문집
• /
• 2004.08a
• /
• pp.1786-1790
• /
• 2004

The main objective of this paper is to analyze the performance of various force control algorithms in improving and adjusting the compliance of industrial robots in contact with their environment. Some of fundamental force control algorithms such as sensorless control, impedance control and hybrid position/force control are theoretically analyzed and simulated for various situations of an environment, and then a series of experiments using them were performed. In this paper, a control scheme to use position control in implementing the impedance control was investigated in order to nullify the effect of joint friction. The new reference trajectory is generated using contact force feedback and original desired trajectory. And an inner position control loop is designed to provide accurate position tracking for the new reference trajectory and good disturbance rejection. Experiments to insert a peg in a hole (so-called the peg-in-a-hole task) were performed with HILS (hardware-in-theloop simulation) system based on the results of the analyses and simulations on the characteristics of each control algorithm. The experiments showed that various force control methods improved the performance of robots in close contact with the environment by adjusting their compliance with respect to an arbitrary set of coordinates.