<abstract xmlns="http://www.w3.org/1999/xhtml"> Feature selection is the main step in classification systems, a procedure that selects a subset from original features. Feature selection is one of major challenges in text categorization. The high dimensionality of feature space increases the complexity of text categorization process, because it plays a key role in this process. This paper presents a novel feature selection method based on particle swarm optimization to improve the performance of text categorization. Particle swarm optimization inspired by social behavior of fish schooling or bird flocking. The complexity of the proposed method is very low due to application of a simple classifier. The performance of the proposed method is compared with performance of other methods on the Reuters-21578 data set. Experimental results display the superiority of the proposed method.</abstract>

Department of Computer Engineering and Information Technology, Payame Noor University (PNU)P.O.BOX 193953697, Tehran, IRAN

School of Computer Engineering Iran University of Science and Technology Tehran, IRAN

Feature Selection Using Particle Swarm Optimization in Text Categorization

<abstract xmlns="http://www.w3.org/1999/xhtml"> Combinatorial optimization problems, such as travel salesman problem, are usually NP-hard and the solution space of this problem is very large. Therefore the set of feasible solutions cannot be evaluated one by one. The simple genetic algorithm is one of the most used evolutionary computation algorithms, that give a good solution for TSP, however, it takes much computational time. In this paper, Affinity Propagation Clustering Technique (AP) is used to optimize the performance of the Genetic Algorithm (GA) for solving TSP. The core idea, which is clustering cities into smaller clusters and solving each cluster using GA separately, thus the access to the optimal solution will be in less computational time. Numerical experiments show that the proposed algorithm can give a good results for TSP problem more than the simple GA.</abstract>

Optimization of Traveling Salesman Problem Using Affinity Propagation Clustering and Genetic Algorithm

<abstract xmlns="http://www.w3.org/1999/xhtml"> In this paper, we propose a method to estimate the order of paragraphs by supervised machine learning. We use a support vector machine (SVM) for supervised machine learning. The estimation of paragraph order is useful for sentence generation and sentence correction. The proposed method obtained a high accuracy (0.84) in the order estimation experiments of the first two paragraphs of an article. In addition, it obtained a higher accuracy than the baseline method in the experiments using two paragraphs of an article. We performed feature analysis and we found that adnominals, conjunctions, and dates were effective for the order estimation of the first two paragraphs, and the ratio of new words and the similarity between the preceding paragraphs and an estimated paragraph were effective for the order estimation of all pairs of paragraphs.</abstract>

Department of Information and Electronics, Tottori University, 4-101 Koyama-Minami, Tottori 680-8552, Japan

Department of Applied Mathematics and Informatics, Ryukoku University Seta, Otsu, Shiga 520-2194, Japan

Order Estimation of Japanese Paragraphs by Supervised Machine Learning and Various Textual Features

<abstract xmlns="http://www.w3.org/1999/xhtml"> One of the most important advantage of ABM (Agent-Based Modeling) used in social and economic calculation simulation is that the critical behavioral characteristics of the micro agents can be deeply depicted by the approach. Why, what and how real behavior(s) should be incorporated into ABM and is it appropriate and effective to use ABM with HSCA collaboration and micro-macro link features for complex economy/finance analysis? Through deepening behavioral analysis and using computational experimental methods incorporating HS (Human Subject) into CA (Computational Agent), which is extended ABM, based on the theory of behavioral finance and complexity science as well, we constructed a micro-macro integrated model with the key behavioral characteristics of investors as an experimental platform to cognize the conduction mechanism of complex capital market and typical phenomena in this paper, and illustrated briefly applied cases including the internal relations between impulsive behavior and the fluctuation of stock’s, the asymmetric cognitive bias and volatility cluster, deflective peak and fat-tail of China stock market.</abstract>

Institute of Quantitative & Technical Economics Chinese Academy of Social Sciences Beijing 100732 China

Graduate School of Chinese Academy of Social Sciences Beijing Fangshan 102488 China

ABM with Behavioral Bias and Applications in Simulating China Stock Market

<abstract xmlns="http://www.w3.org/1999/xhtml"> Electromagnetism-like Mechanism (EM) method is known as one of metaheuristics. The basic idea is one that a set of parameters is regarded as charged particles and the strength of particles is corresponding to the value of the objective function for the optimization problem. Starting from any set of initial assignment of parameters, the parameters converge to a value including the optimal or semi-optimal parameter based on EM method. One of its drawbacks is that it takes too much time to the convergence of the parameters like other meta-heuristics. In this paper, we introduce hybrid methods combining EM and the descent method such as BP, k-means and FIS and show the performance comparison among some hybrid methods. As a result, it is shown that the hybrid EM method is superior in learning speed and accuracy to the conventional methods.</abstract>

Performance Comparison of Hybrid Electromagnetism-Like Mechanism Algorithms with Descent Method

AHEAD OF PRINT

Volume 14 (2024): Issue 2 (March 2024)

Volume 14 (2024): Issue 1 (January 2024)

Volume 13 (2023): Issue 4 (October 2023)

Volume 13 (2023): Issue 3 (June 2023)

Volume 13 (2023): Issue 2 (March 2023)

Volume 13 (2023): Issue 1 (January 2023)

Volume 12 (2022): Issue 4 (October 2022)

Volume 12 (2022): Issue 3 (July 2022)

Volume 12 (2022): Issue 2 (April 2022)

Volume 12 (2022): Issue 1 (January 2022)

Volume 11 (2021): Issue 4 (October 2021)

Volume 11 (2021): Issue 3 (July 2021)

Volume 11 (2021): Issue 2 (April 2021)

Volume 11 (2021): Issue 1 (January 2021)

Volume 10 (2020): Issue 4 (October 2020)

Volume 10 (2020): Issue 3 (July 2020)

Volume 10 (2020): Issue 2 (April 2020)

Volume 10 (2020): Issue 1 (January 2020)

Volume 9 (2019): Issue 4 (October 2019)

Volume 9 (2019): Issue 3 (July 2019)

Volume 9 (2019): Issue 2 (April 2019)

Volume 9 (2019): Issue 1 (January 2019)

Volume 8 (2018): Issue 4 (October 2018)

Volume 8 (2018): Issue 3 (July 2018)

Volume 8 (2018): Issue 2 (April 2018)

Volume 8 (2018): Issue 1 (January 2018)

Volume 7 (2017): Issue 4 (October 2017)

Volume 7 (2017): Issue 3 (July 2017)

Volume 7 (2017): Issue 2 (April 2017)

Volume 7 (2017): Issue 1 (January 2017)

Volume 6 (2016): Issue 4 (October 2016)

Volume 6 (2016): Issue 3 (July 2016)

Volume 6 (2016): Issue 2 (April 2016)

Volume 6 (2016): Issue 1 (January 2016)

Volume 5 (2015): Issue 4 (October 2015)

Volume 5 (2015): Issue 3 (July 2015)

Volume 5 (2015): Issue 2 (April 2015)

Volume 5 (2015): Issue 1 (January 2015)

Volume 4 (2014): Issue 4 (October 2014)

Volume 4 (2014): Issue 3 (July 2014)

Volume 4 (2014): Issue 2 (April 2014)

Volume 4 (2014): Issue 1 (January 2014)

Volume 3 (2013): Issue 4 (October 2013)

Volume 3 (2013): Issue 3 (July 2013)

Volume 3 (2013): Issue 2 (April 2013)

Volume 3 (2013): Issue 1 (January 2013)

Journal of Artificial Intelligence and Soft Computing Research

 Print version published by: The Journal of the Polish Neural Network Society and the University of Social Sciences in Lodz  Editor-in-Chief: Prof. Leszek Rutkowski, IEEE FellowFrequency of publishing: quarterlyMonths of publication: January, April, July, October  ISSN (print): 2083-2567ISSN (on-line): 2449-6499  Journal of Artificial Intelligence and Soft Computing Research is a dynamically developing international journal focused on the latest scientific results and methods constituting traditional artificial intelligence methods and soft computing techniques. Our goal is to bring together scientists representing both approaches and various research communities.  Why JAISCR?   Premier source of high quality research,  We have practice in publishing innovative articles dealing with various aspects of artificial intelligence methods and soft computing,  Extensive scope,  We are focused on permanent development of our journal.   JAISCR research areas  JAISCR publishes high quality, innovative research results in various areas of artificial intelligence and soft computing. These areas include, but are not limited to:   AI in Modelling and Simulation,  AI in Scheduling and Optimization,  Automated Reasoning and Inference,  Bioinformatics,  Cognitive Aspects of AI,  Computer Vision and Speech Understanding,  Data Mining,  Distributed Intelligent Processing,  Evolutionary Design,  Expert Systems,  Fuzzy Modelling and Control,  Hardware Implementations,  Heuristic Search,  Hybrid Models,  Information Retrieval,  Intelligent Database Systems,  Knowledge Engineering,  Mechatronics,  Multi-agent Systems,  Natural Language Processing,  Neural Network Theory and Architectures,  Neuro-informatics and Bio-inspired Models,  Pattern Recognition,  Robotics and Related Fields,  Rough Sets Theory: Foundations and Applications,  Supervised and Unsupervised Learning,  Swarm Intelligence and Systems,  Web Intelligence Applications &amp; Search,  Various Applications.   Submitting to JAISCR - a great advantage for the authorsWhy?   Fair and thorough peer review (at least three referees are required for the acceptance of each article),  Fast and efficient publication process,  Polishing the structure and technical format of each submission,  Open access (all articles published in JAISCR are open access - freely available on Sciendo platform),  Permanence (because of the open access form, permanent accessibility is assured),  High visibility within the field (the author's work is freely accessible to a global audience. In addition, articles are available through Sciendo),  Promotion of the published papers in the scientific community.   Archiving  Sciendo archives the contents of this journal in Portico - digital long-term preservation service of scholarly books, journals and collections.  Plagiarism Policy  The editorial board is participating in a growing community of Similarity Check System's users in order to ensure that the content published is original and trustworthy. Similarity Check is a medium that allows for comprehensive manuscripts screening, aimed to eliminate plagiarism and provide a high standard and quality peer-review process. 