Signal and Data Processing

fa بهبود الگوریتم ماشین بردار پشتیبان با الگوریتم رقابت استعماری برای دسته‌بندی اسناد متنی An Improvement in Support Vector Machines Algorithm with Imperialism Competitive Algorithm for Text Documents Classification مقالات پردازش متن Paper پژوهشي Research <div style="text-align: justify;">با توجه به رشد نمایی متون الکترونیکی، سازماندهی و مدیریت متون، مستلزم ابزاری است که اطلاعات و داده&rlm;‌های مورد جستجوی کاربران را در کمترین زمان ارائه دهد؛ از‌این‌رو در سال‌های اخیر روش‌های دسته‌بندی اهمیت ویژه&lrm;ای پیدا کرده است. هدف دسته‌بندی متون دست‌یابی به اطلاعات و داده‌ها در کسری از ثانیه است. یکی از مشکلات اصلی در دسته&rlm;‌بندی متون، ابعاد بالای ویژگی&lrm;هاست. برای کاهش ویژگی&lrm;های متون، انتخاب ویژگی&lrm;ها یکی از مؤثرترین راه&lrm;حل&lrm;هاست. چراکه هزینه محاسباتی که تابعی از طول بردار ویژگی&lrm;هاست، بدون انتخاب ویژگی‌ها افزایش می&rlm;‌یابد. در این مقاله روشی براساس بهبود الگوریتم ماشین بردار پشتیبان با الگوریتم رقابت استعماری برای دسته‌بندی اسناد متنی ارائه شده است. در روش پیشنهادی، از الگوریتم رقابت استعماری برای انتخاب ویژگی&lrm;های و از الگوریتم ماشین بردار پشتیبان برای دسته&lrm;بندی متون استفاده شده است. آزمایش و ارزیابی روش پیشنهادی بر روی مجموعه داده‌های Reuters21578, WebKB و Cade 12 انجام شده است. نتایج شبیه&lrm;سازی حاکی از آن است که روش پیشنهادی در معیارهای دقت، بازخوانی و F Measure از روش‌ ماشین بردار پشتیبان بدون انتخاب ویژگی عملکرد بهینه&lrm;تری دارد. </div> <div style="text-align: justify;">Due to the exponential growth of electronic texts, their organization and management requires a tool to provide information and data in search of users in the shortest possible time. Thus, classification methods have become very important in recent years. In natural language processing and especially text processing, one of the most basic tasks is automatic text classification. Moreover, text classification is one of the most important parts in data mining and machine learning. Classification can be considered as the most important supervised technique which classifies the input space to k groups based on similarity and difference such that targets in the same group are similar and targets in different groups are different. Text classification system has been widely used in many fields, like spam filtering, news classification, web page detection, Bioinformatics, machine translation, automatic response systems, and applications regarding of automatic organization of documents. The important point in obtaining an efficient text classification method is extraction and selection of key features of texts. It is proved that only 33% of words and features of the texts are useful and they can be used to extract information and most words existing in texts are used to represent purpose of a text and they are sometimes repeated. Feature selection is known as a good solution to high dimensionality of the feature space. Excessive number of Features not only increase computation time but also degrade classification accuracy. In general, purpose of extracting and selecting features of texts is to reduce data volume, time required for training, computational time and increase performance speed of the methods proposed for text classification. Feature extraction refers to the process of generating a small set of new features by combining or transforming the original ones, while in feature selection dimension of the space is reduced by selecting the most prominent features. In this paper, a solution to improve support vector machine algorithm using Imperialism Competitive Algorithm, are provided. In this proposed method, the Imperialism Competitive Algorithm for selecting features and the support vector machine algorithm for Classification of texts are used. At the stage of extracting the features of the texts, using weighting schemes such as NORMTF, LOGTF, ITF, SPARCK, and TF, each extracted word is allocated a weight in order to determine the role of the words in terms of their effects as the keywords of the texts. The weight of each word indicates the extent of its effect on the main topic of the text compared to other words used in the same text. In the proposed method, the TF weighting scheme is used for attributing weights to the words. In this scheme, the features are a function of the distribution of different features in each of the documents <img alt="" chromakey="white" src="file:///C:/Users/user/AppData/Local/Temp/msohtmlclip1/01/clip_image001.png" > . Moreover, at this stage, using the process of pruning, low-frequency features and words that are used fewer than two times in the text are pruned. Pruning basically filters low-frequency features in a text [18]. In order to reduce the number of dimensions of the features and decrease computational complexity, the imperialist competitive algorithm (ICA) is utilized in the proposed method. The main goal of employing the imperialist competitive algorithm (ICA) in the proposed method is minimizing the loss of data in the texts, while also maximizing the reduction of the dimensions of the features. In the proposed method, since the imperialist competitive algorithm (ICA) has been used for selecting the features, there must be a mapping created between the parameters of the imperialist competitive algorithm (ICA) and the proposed method. Accordingly, when using the imperialist competitive algorithm (ICA) for selecting the key features, the search space includes the dimensions of the features, and among all the extracted features, <img alt="" chromakey="white" src="file:///C:/Users/user/AppData/Local/Temp/msohtmlclip1/01/clip_image002.png" > , <img alt="" chromakey="white" src="file:///C:/Users/user/AppData/Local/Temp/msohtmlclip1/01/clip_image003.png" > , or <img alt="" chromakey="white" src="file:///C:/Users/user/AppData/Local/Temp/msohtmlclip1/01/clip_image004.png" >  of all the features are attributed to each of the countries. Since the mapping is carried out randomly, there may be repetitive features in any of the countries as well. Next, based on the general trend of the imperialist competitive algorithm (ICA),some countries which are more powerful are considered as imperialists, while the other countries are considered as colonies. Once the countries are identified, the optimization process can begin. Each country is defined in the form of an <img alt="" chromakey="white" src="file:///C:/Users/user/AppData/Local/Temp/msohtmlclip1/01/clip_image005.png" >  array with different values for the variables as in Equations 2 and 3. </div> <table align="center" border="0" cellpadding="0" cellspacing="0" dir="rtl" style="width:293px;" width="293"> <tbody> <tr> <td style="width: 47px; height: 34px; text-align: justify;">(2)</td> <td style="width: 246px; height: 34px; text-align: justify;">Country = [ <img alt="" chromakey="white" src="file:///C:/Users/user/AppData/Local/Temp/msohtmlclip1/01/clip_image006.png" > , <img alt="" chromakey="white" src="file:///C:/Users/user/AppData/Local/Temp/msohtmlclip1/01/clip_image007.png" > , …, <img alt="" chromakey="white" src="file:///C:/Users/user/AppData/Local/Temp/msohtmlclip1/01/clip_image008.png" >  , <img alt="" chromakey="white" src="file:///C:/Users/user/AppData/Local/Temp/msohtmlclip1/01/clip_image009.png" > ]</td> </tr> <tr> <td style="width: 47px; height: 27px; text-align: justify;">(3)</td> <td style="width: 246px; height: 27px; text-align: justify;">Cost = f (Country)</td> </tr> </tbody> </table> <div style="text-align: justify;"><div style="clear:both;"></div>The variables attributed to each country can be structural features, lexical features, semantic features, or the weight of each word, and so on. Accordingly, the power of each country for identifying the class of each text is increased or decreased based on its variables. One of the most important phases of the imperialist competitive algorithm (ICA) is the colonial competition phase. In this phase, all the imperialists try to increase the number of colonies they own. Each of the more powerful empires tries to seize the colonies of the weakest empires to increase their own power. In the proposed method, colonies with the highest number of errors in classification and the highest number of features are considered as the weakest empires. Based on trial and error, and considering the target function in the proposed method, the number of key features relevant to the main topic of the texts is set to <img alt="" chromakey="white" src="file:///C:/Users/user/AppData/Local/Temp/msohtmlclip1/01/clip_image004.png" >  of the total extracted features, and only through using  <img alt="" chromakey="white" src="file:///C:/Users/user/AppData/Local/Temp/msohtmlclip1/01/clip_image004.png" >  of the key features of each text along with a classifier algorithm such as <img alt="" chromakey="white" src="file:///C:/Users/user/AppData/Local/Temp/msohtmlclip1/01/clip_image010.png" > , support vector machine (SVM), <img alt="" chromakey="white" src="file:///C:/Users/user/AppData/Local/Temp/msohtmlclip1/01/clip_image011.png" >  nearest neighbors, and so on, the class of that text can be determined in the proposed method. Since the classification of texts is a nonlinear problem, in order to classify texts, the problem must first be mapped into a linear problem. In this paper, the RBF kernel function along with <img alt="" chromakey="white" src="file:///C:/Users/user/AppData/Local/Temp/msohtmlclip1/01/clip_image012.png" >  is used for mapping the problem. The hybrid algorithm is implemented on the Reuters21578, WebKB, and Cade 12 data sets to evaluate the accuracy of the proposed method. The simulation results indicate that the proposed hybrid algorithm in precision, recall and F Measure criteria is more efficient than primary support machine carriers.  </div> انتخاب ویژگی, دسته‌بندی متون, الگوریتم رقابت استعماری, الگوریتم ماشین بردار پشتیبان, بهینه‌سازی Feature Selection, Text Classification, Imperialism Competitive Algorithm, Support Vector Machines Algorithm, Optimization 117 130 http://jsdp.rcisp.ac.ir/browse.php?a_code=A-10-1536-1&slc_lang=fa&sid=1 Zahra Asheghi Dizaji زهرا عاشقی دیزجی zahra_ashegi@yahoo.com 10031947532846008783 10031947532846008783 Yes Department of Computer Engineering, Urmia Branch, Islamic Azad University, Urmia, Iran. گروه مهندسی کامپیوتر، واحد ارومیه، دانشگاه آزاد اسلامی، ارومیه، ایران Sakineh Asghari Aghjehdizaj سکینه اصغری آقجه‎دیزج Sakineh154asghari@gmail.com 10031947532846008784 10031947532846008784 No Department of Computer Engineering, Bonab Branch, Islamic Azad University, Maragheh, Iran گروه مهندسی کامپیوتر، واحد بناب، دانشگاه آزاد اسلامی، بناب، ایران Farhad Soleimanian Gharehchopogh فرهاد سلیمانیان قره چپق farhad@iaurmia.ac.ir 10031947532846008785 10031947532846008785 No Department of Computer Engineering, Urmia Branch, Islamic Azad University, Urmia, Iran. گروه مهندسی کامپیوتر، واحد ارومیه، دانشگاه آزاد اسلامی، ارومیه، ایران