الگوریتم ژنتیک کارآمد
ترجمه نشده

الگوریتم ژنتیک کارآمد

عنوان فارسی مقاله: الگوریتم ژنتیک کارآمد برای انتخاب ویژگی برای طبقه بندی سری های زمانی اولیه
عنوان انگلیسی مقاله: Efficient Genetic Algorithm for Feature Selection for Early Time Series Classification
مجله/کنفرانس: کامپیوتر و مهندسی صنایع – Computers & Industrial Engineering
رشته های تحصیلی مرتبط: مهندسی کامپیوتر
گرایش های تحصیلی مرتبط: مهندسی الگوریتم و محاسبات
کلمات کلیدی فارسی: طبقه بندی سری زمانی، زودرسی، انتخاب ویژگی، الگوریتم ژنتیک
کلمات کلیدی انگلیسی: Time Series Classification; Earliness; Feature Selection; Genetic Algorithm
نوع نگارش مقاله: مقاله پژوهشی (Research Article)
شناسه دیجیتال (DOI): https://doi.org/10.1016/j.cie.2020.106345
دانشگاه: Department of Industrial and Management Engineering, Hanyang University, Ansan 15588, Republic of Korea
صفحات مقاله انگلیسی: 16
ناشر: الزویر - Elsevier
نوع ارائه مقاله: ژورنال
نوع مقاله: ISI
سال انتشار مقاله: 2020
ایمپکت فاکتور: 4.485 در سال 2019
شاخص H_index: 111 در سال 2020
شاخص SJR: 1.334 در سال 2019
شناسه ISSN: ۰۳۶۰-۸۳۵۲
شاخص Quartile (چارک): Q1 در سال 2019
فرمت مقاله انگلیسی: PDF
وضعیت ترجمه: ترجمه نشده است
قیمت مقاله انگلیسی: رایگان
آیا این مقاله بیس است: خیر
آیا این مقاله مدل مفهومی دارد: ندارد
آیا این مقاله پرسشنامه دارد: ندارد
آیا این مقاله متغیر دارد: ندارد
کد محصول: E14659
رفرنس: دارای رفرنس در داخل متن و انتهای مقاله
فهرست مطالب (انگلیسی)

Abstract

۱٫ Introduction

۲٫ Problem description and mathematical model

۳٫ The proposed genetic algorithm

۴٫ Experiment and results

۵٫ Conclusion

Acknowledgement

References

بخشی از مقاله (انگلیسی)

Abstract

This paper addresses a multi-objective feature selection problem for early time series classification. Previous research has focused on how many features to consider for a classifier, but has not considered the starting time of classification, which is also important for early classification. Motivated by this, we developed a mathematical model for which the objectives are to maximize classification performance and minimize the starting time and execution time of classification. We designed an efficient genetic algorithm to generate solutions with high probability. In experiment, we compared the proposed algorithm and general genetic algorithm under various experimental settings. From the experiment, we verified that the proposed algorithm can find a better feature set in terms of classification performance, starting time and execution time of classification than feature set found by general genetic algorithm.

Introduction

Time series classification is used to predict the class label of a time series instance by a welltrained classifier (Deng et al., 2013). That is, if a time series instance , ? ? (?) = (? , is given, its label, , is predicted by the classifier as (?) ۱ , ? (?) ۲ , ⋯, ? (?) ? ) ? (?) ?( ∙ ) ? (?) = ? (? . Time series classification is used to accomplish tasks in many fields, including fault (?) ) detection in the manufacturing field (Lee et al., 2017), disease diagnosis in the medical field (Lacy et al., 2018), and stock trend analysis in the financial field (Moews et al., 2019). Various classifiers such as neural networks (NNs) and support vector machines (SVMs) are employed and modified to classify time series. Ignatov (2018) employed a convolutional neural network (CNN) to recognize human activity from accelerometer data. Kim and Cho (2018) developed a C-LSTM (CNN- Long Short-Term Memory model) NN to detect anomalies in web traffic data. CNNs and LSTMs in the developed model extracted spatial features and temporal characteristics, respectively. Emoto et al. (2018) used NNs to detect low-intensity snoring episodes from a sleeping sound dataset. Cheng and Dong (2019) employed SVM technology to monitor the nanomachining process with respect to the machining performance. Kalantarian et al. (2016) used SVMs to segment streaming timeseries audio signals probabilistically.