Magazine et Edition

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Volume 4 (2014): Edition 4 (October 2014)

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

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

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

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

Volume 3 (2013): Edition 3 (July 2013)

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

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

Détails du magazine
Format
Magazine
eISSN
2449-6499
Première publication
30 Dec 2014
Période de publication
4 fois par an
Langues
Anglais

Chercher

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

Détails du magazine
Format
Magazine
eISSN
2449-6499
Première publication
30 Dec 2014
Période de publication
4 fois par an
Langues
Anglais

Chercher

5 Articles
access type Accès libre

Feature Selection Using Particle Swarm Optimization in Text Categorization

Publié en ligne: 29 Oct 2015
Pages: 231 - 238

Résumé

Abstract

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.

access type Accès libre

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

Publié en ligne: 29 Oct 2015
Pages: 239 - 245

Résumé

Abstract

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.

access type Accès libre

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

Publié en ligne: 29 Oct 2015
Pages: 247 - 255

Résumé

Abstract

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.

access type Accès libre

ABM with Behavioral Bias and Applications in Simulating China Stock Market

Publié en ligne: 29 Oct 2015
Pages: 257 - 270

Résumé

Abstract

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.

access type Accès libre

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

Publié en ligne: 29 Oct 2015
Pages: 271 - 282

Résumé

Abstract

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.

5 Articles
access type Accès libre

Feature Selection Using Particle Swarm Optimization in Text Categorization

Publié en ligne: 29 Oct 2015
Pages: 231 - 238

Résumé

Abstract

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.

access type Accès libre

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

Publié en ligne: 29 Oct 2015
Pages: 239 - 245

Résumé

Abstract

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.

access type Accès libre

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

Publié en ligne: 29 Oct 2015
Pages: 247 - 255

Résumé

Abstract

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.

access type Accès libre

ABM with Behavioral Bias and Applications in Simulating China Stock Market

Publié en ligne: 29 Oct 2015
Pages: 257 - 270

Résumé

Abstract

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.

access type Accès libre

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

Publié en ligne: 29 Oct 2015
Pages: 271 - 282

Résumé

Abstract

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.

Planifiez votre conférence à distance avec Sciendo