Export file:

Format

  • RIS(for EndNote,Reference Manager,ProCite)
  • BibTex
  • Text

Content

  • Citation Only
  • Citation and Abstract

Multiple-instance learning for text categorization based on semantic representation

1. Shanghai Key Laboratory of Multidimensional Information Processing Department of Computer Science and Technology East China Normal University, Shanghai, 200062, China;
2. Beijing Electro-Mechanical Engineering Institute Beijing, 100074, China

The mate selection plays a key role in natural evolution process. Although a variety of mating strategies have been proposed in the community of evolutionary computation, the importance of mate selection has been ignored. In this paper, we propose a clustering based mate selection (CMS) strategy for evolutionary algorithms (EAs). In CMS, the population is partitioned into clusters and only the solutions in the same cluster are chosen for offspring reproduction. Instead of doing a whole new clustering process in each EA generation, the clustering iteration process is combined with the evolution iteration process. The combination of clustering and evolving processes benefits EAs by saving the cost to discover the population structure. To demonstrate this idea, a CMS utilizing the k-means clustering method is proposed and applied to a state-of-the-art EA. The experimental results show that the CMS strategy is promising to improve the performance of the EA.
  Figure/Table
  Supplementary
  Article Metrics

Keywords Evolutionary algorithm; mate selection; clustering

Citation: Jinyuan Zhang, Aimin Zhou, Guixu Zhang, Hu Zhang. Multiple-instance learning for text categorization based on semantic representation. Big Data and Information Analytics, 2017, 2(1): 77-86. doi: 10.3934/bdia.2017010

References

  • [1] T. Back, D. B. Fogel and Z. Michalewicz, Handbook of Evolutionary Computation, Oxford University Press, 1997.
  • [2] K. Deb and D. E. Goldberg, An investigation of niche and species formation in genetic function optimization, in Proceedings of the 3rd International Conference on Genetic Algorithms. Morgan Kaufmann Publishers Inc., 1989, 42-50.
  • [3] L. J. Eshelman and J. D. Schaffer, Preventing premature convergence in genetic algorithms by preventing incest, in International Conference on Genetic Algorithms, 1991, 115-122.
  • [4] C. M. Fernandes and A. C. Rosa, Evolutionary algorithms with dissortative mating on static and dynamic environments, Advances in Evolutionary Algorithms, 2008, 181-206.
  • [5] S. F. Galán, O. J. Mengshoel and R. Pinter, A novel mating approach for genetic algorithms, Evolutionary Computation, 21(2013), 197-229.
  • [6] A. Gog, C. Chira, D. Dumitrescu and D. Zaharie, Analysis of some mating and collaboration strategies in evolutionary algorithms, in 10th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, IEEE, 2008, 538-542.
  • [7] K. S. Goh, A. Lim and B. Rodrigues, Sexual selection for genetic algorithms, Artificial Intelligence Review, 19(2003), 123-152.
  • [8] T. Hastie, R. Tibshirani and J. Friedman, The Elements of Statistical Learning:Data Mining, Inference, and Prediction, Second edition. Springer Series in Statistics. Springer, New York, 2009.
  • [9] Y. Jin, Surrogate-assisted evolutionary computation:Recent advances and future challenges, Swarm and Evolutionary Computation, 1(2011), 61-70.
  • [10] P. Larranaga and J. A. Lozano, Estimation of Distribution Algorithms:A New Tool for Evolutionary Computation, Kluwer Academic Publishers, 2002.
  • [11] J. B. MacQueen, Some methods for classification and analysis of multivariate observations, in Proceedings of 5th Berkeley Symposium on Mathematical Statistics and Probability, Ed. University of California Press, (1967), 281-297.
  • [12] G. Ochoa, C. Mädler-Kron, R. Rodriguez and K. Jaffe, Assortative mating in genetic algorithms for dynamic problems, in Applications of Evolutionary Computing, Springer, 2005, 617-622.
  • [13] T. S. Quirino, Improving Search in Genetic Algorithms Through Instinct-Based Mating Strategies, Ph.D. dissertation, The University of Miami, 2012.
  • [14] T. Quirino, M. Kubat and N. J. Bryan, Instinct-based mating in genetic algorithms applied to the tuning of 1-nn classifiers, IEEE Transactions on Knowledge and Data Engineering, 22(2010), 1724-1737.
  • [15] J. Sanchez-Velazco and J. A. Bullinaria, Sexual selection with competitive/co-operative operators for genetic algorithms, in Neural Networks and Computational Intelligence(NCI). ACTA Press, 2003, 191-196.
  • [16] R. Sivaraj and T. Ravichandran, A review of selection methods in genetic algorithm, International Journal of Engineering Science and Technology (IJEST), 3(2011), 3792-3797.
  • [17] P. N. Suganthan, N. Hansen, J. J. Liang, K. Deb, Y. P. Chen, A. Auger and S. Tiwari, Problem Definitions and Evaluation Criteria for the cec 2005 Special Session on Real-Parameter Optimization, Tech. rep., Nanyang Technological University, Singapore and Kanpur Genetic Algorithms 369 Laboratory, ⅡT Kanpur, 2005.
  • [18] C.-K. Ting, S.-T. Li and C. Lee, On the harmonious mating strategy through tabu search, Information Sciences, 156(2003), 189-214.
  • [19] S. Wagner and M. Affenzeller, Sexualga:Gender-specific selection for genetic algorithms, in Proceedings of the 9th World Multi-Conference on Systemics, Cybernetics and Informatics (WMSCI), 4(2005), 76-81.
  • [20] R. Wang, P. J. Fleming and R. C.Purshousea, General framework for localised multi-objective evolutionary algorithms, Information Sciences, 258(2014), 29-53.
  • [21] Y. Wang, Z. Cai and Q. Zhang, Differential evolution with composite trial vector generation strategies and control parameters, IEEE Transactions on Evolutionary Computation, 15(2011), 55-66.

 

Reader Comments

your name: *   your email: *  

Copyright Info: 2017, Aimin Zhou, et al., licensee AIMS Press. This is an open access article distributed under the terms of the Creative Commons Attribution Licese (http://creativecommons.org/licenses/by/4.0)

Download full text in PDF

Export Citation

Copyright © AIMS Press All Rights Reserved