• 제목/요약/키워드: Particle classification

검색결과 197건 처리시간 0.029초

An Improved PSO Algorithm for the Classification of Multiple Power Quality Disturbances

  • Zhao, Liquan;Long, Yan
    • Journal of Information Processing Systems
    • /
    • 제15권1호
    • /
    • pp.116-126
    • /
    • 2019
  • In this paper, an improved one-against-one support vector machine algorithm is used to classify multiple power quality disturbances. To solve the problem of parameter selection, an improved particle swarm optimization algorithm is proposed to optimize the parameters of the support vector machine. By proposing a new inertia weight expression, the particle swarm optimization algorithm can effectively conduct a global search at the outset and effectively search locally later in a study, which improves the overall classification accuracy. The experimental results show that the improved particle swarm optimization method is more accurate than a grid search algorithm optimization and other improved particle swarm optimizations with regard to its classification of multiple power quality disturbances. Furthermore, the number of support vectors is reduced.

Classification of Induction Machine Faults using Time Frequency Representation and Particle Swarm Optimization

  • Medoued, A.;Lebaroud, A.;Laifa, A.;Sayad, D.
    • Journal of Electrical Engineering and Technology
    • /
    • 제9권1호
    • /
    • pp.170-177
    • /
    • 2014
  • This paper presents a new method of classification of the induction machine faults using Time Frequency Representation, Particle Swarm Optimization and artificial neural network. The essence of the feature extraction is to project from faulty machine to a low size signal time-frequency representation (TFR), which is deliberately designed for maximizing the separability between classes, a distinct TFR is designed for each class. The feature vectors size is optimized using Particle Swarm Optimization method (PSO). The classifier is designed using an artificial neural network. This method allows an accurate classification independently of load level. The introduction of the PSO in the classification procedure has given good results using the reduced size of the feature vectors obtained by the optimization process. These results are validated on a 5.5-kW induction motor test bench.

Fundamental study on volume reduction of cesium contaminated soil by using magnetic force-assisted selection pipe

  • Nishimura, Ryosei;Akiyama, Yoko;Manabe, Yuichiro;Sato, Fuminobu
    • 한국초전도ㆍ저온공학회논문지
    • /
    • 제23권3호
    • /
    • pp.26-31
    • /
    • 2021
  • Advanced classification of Cs contaminated soil by using a magnetic force-assisted selection pipe was investigated. A selection pipe is a device that sort particles depending on their particle size, based on the relationship between buoyancy, drag, and gravity force acting on the particles. Radioactive cesium is concentrated in small-particle size soil components with a large specific surface area. Hence, the volume of the Cs contaminated soil can be reduced by recycling the large-particle size soil components with low radioactive concentration. One of the problems of the selection pipe was that the radioactive concentration of the stayed soil in the selection pipe exceeds 8000 Bq/kg, which is the standard value of recycling of Cs contaminated soil, due to low classification accuracy. In this study, magnetic fields were applied to the lab-scale selection pipe from upper side to improve the classification accuracy and to reduce the radioactive concentration of the stayed soil.

고성능 터보분급기의 분급 특성 (Classification Characteristics of High Efficient Turbo Classifier)

  • 송동근;홍원석;한방우;김학준;허병수;김용진
    • 대한기계학회:학술대회논문집
    • /
    • 대한기계학회 2008년도 추계학술대회B
    • /
    • pp.2423-2428
    • /
    • 2008
  • A turbo classifier having a rotating rotor of two stage classification region has been developed to have a cut size of 1 micro meter. Particle number concentrations were counted using Aerosol Particle Sizer (APS, TSI co., USA) at inlet and outlet of the classifier. Partial classification efficiency was obtained at various rotation speeds, total flow rates, and feed rates of powders, and classification characteristic depending on design parameters was discussed. Classification performance was enhanced as rotation speed of rotor increased and total flow rate decreased.

  • PDF

Soft Computing Optimized Models for Plant Leaf Classification Using Small Datasets

  • Priya;Jasmeen Gill
    • International Journal of Computer Science & Network Security
    • /
    • 제24권8호
    • /
    • pp.72-84
    • /
    • 2024
  • Plant leaf classification is an imperative task when their use in real world is considered either for medicinal purposes or in agricultural sector. Accurate identification of plants is, therefore, quite important, since there are numerous poisonous plants which if by mistake consumed or used by humans can prove fatal to their lives. Furthermore, in agriculture, detection of certain kinds of weeds can prove to be quite significant for saving crops against such unwanted plants. In general, Artificial Neural Networks (ANN) are a suitable candidate for classification of images when small datasets are available. However, these suffer from local minima problems which can be effectively resolved using some global optimization techniques. Considering this issue, the present research paper presents an automated plant leaf classification system using optimized soft computing models in which ANNs are optimized using Grasshopper Optimization algorithm (GOA). In addition, the proposed model outperformed the state-of-the-art techniques when compared with simple ANN and particle swarm optimization based ANN. Results show that proposed GOA-ANN based plant leaf classification system is a promising technique for small image datasets.

Implementation of a Particle Swarm Optimization-based Classification Algorithm for Analyzing DNA Chip Data

  • Han, Xiaoyue;Lee, Min-Soo
    • Genomics & Informatics
    • /
    • 제9권3호
    • /
    • pp.134-135
    • /
    • 2011
  • DNA chips are used for experiments on genes and provide useful information that could be further analyzed. Using the data extracted from the DNA chips to find useful patterns or information has become a very important issue. In this paper, we explain the application developed for classifying DNA chip data using a classification method based on the Particle Swarm Optimization (PSO) algorithm. Considering that DNA chip data is extremely large and has a fuzzy characteristic, an algorithm that imitates the ecosystem such as the PSO algorithm is suitable to be used for analyzing such data. The application enables researchers to customize the PSO algorithm parameters and see detail results of the classification rules.

Classification of Imbalanced Data Based on MTS-CBPSO Method: A Case Study of Financial Distress Prediction

  • Gu, Yuping;Cheng, Longsheng;Chang, Zhipeng
    • Journal of Information Processing Systems
    • /
    • 제15권3호
    • /
    • pp.682-693
    • /
    • 2019
  • The traditional classification methods mostly assume that the data for class distribution is balanced, while imbalanced data is widely found in the real world. So it is important to solve the problem of classification with imbalanced data. In Mahalanobis-Taguchi system (MTS) algorithm, data classification model is constructed with the reference space and measurement reference scale which is come from a single normal group, and thus it is suitable to handle the imbalanced data problem. In this paper, an improved method of MTS-CBPSO is constructed by introducing the chaotic mapping and binary particle swarm optimization algorithm instead of orthogonal array and signal-to-noise ratio (SNR) to select the valid variables, in which G-means, F-measure, dimensionality reduction are regarded as the classification optimization target. This proposed method is also applied to the financial distress prediction of Chinese listed companies. Compared with the traditional MTS and the common classification methods such as SVM, C4.5, k-NN, it is showed that the MTS-CBPSO method has better result of prediction accuracy and dimensionality reduction.

폐배터리 블랙 매스(black mass) 회수를 위한 파쇄/분급 공정 분석 및 2종 혼합물의 수학적 분쇄 모델링 (Analysis of Crushing/Classification Process for Recovery of Black Mass from Li-ion Battery and Mathematical Modeling of Mixed Materials)

  • 김관호;이훈
    • 자원리싸이클링
    • /
    • 제31권6호
    • /
    • pp.81-91
    • /
    • 2022
  • 리튬이온 배터리의 사용은 전자기기 및 전기차 등의 생산량 증가로 인해 사용량이 크게 증가하고 있으며, 이와 맞물려 향후 폐배터리의 발생량 증가도 예상된다. 따라서 폐배터리를 구성하고 있는 여러 유가 자원 중 Ni, Co, Mn, Li 등이 함유되어 있는 양극 활물질이 매우 중요한 유가 자원으로, 이를 재활용하기 위한 많은 연구가 진행되고 있다. 양극 활물질 회수를 위해서 일반적으로 폐배터리로부터 블랙 매스(Black mass)를 회수하고, 이를 처리하여 주요 금속 자원을 회수한다. 블랙 매스를 회수하는 공정은 폐배터리를 수거-방전-해체-파쇄-분급의 순서로 이루어지며, 본 연구에서는 블랙 매스 회수를 위한 파쇄/분급 공정을 분석하였다. 파쇄/분급 공정을 통해 다양한 공정 산물의 입도 특성을 분석하고, 이 과정에서 생산된 산물의 입도별 형상을 현미경 및 SEM(Scanning Electron Microscopy)-EDS(Energy Dispersive Spectrometer)로 분석하였다. 분석 결과 블랙 매스로 회수되는 입자 중 74 ㎛의 미세한 입자들은 양극/음극 활물질이 전극으로부터 단체분리되어 존재하였지만, 100 ㎛ 이상의 입자들은 전극과 활물질이 붙어있는 상태에서 파쇄에 의해 입도가 감소되어 존재함을 확인하였다. 또한 배터리의 특징인 2종 혼합물(전극과 활물질)이 결합되어 있는 시료에 대해 파분쇄 특성을 모사할 수 있는 PBM(Population Balance Model) 을 개발하였으며, 2종 혼합물의 분쇄 상수를 도출하고 입도 분포 예측 성능을 검증하였다.

Optimization of Decision Tree for Classification Using a Particle Swarm

  • Cho, Yun-Ju;Lee, Hye-Seon;Jun, Chi-Hyuck
    • Industrial Engineering and Management Systems
    • /
    • 제10권4호
    • /
    • pp.272-278
    • /
    • 2011
  • Decision tree as a classification tool is being used successfully in many areas such as medical diagnosis, customer churn prediction, signal detection and so on. The main advantage of decision tree classifiers is their capability to break down a complex structure into a collection of simpler structures, thus providing a solution that is easy to interpret. Since decision tree is a top-down algorithm using a divide and conquer induction process, there is a risk of reaching a local optimal solution. This paper proposes a procedure of optimally determining thresholds of the chosen variables for a decision tree using an adaptive particle swarm optimization (APSO). The proposed algorithm consists of two phases. First, we construct a decision tree and choose the relevant variables. Second, we find the optimum thresholds simultaneously using an APSO for those selected variables. To validate the proposed algorithm, several artificial and real datasets are used. We compare our results with the original CART results and show that the proposed algorithm is promising for improving prediction accuracy.