Higher accuracy and lower run time: efficient mutation analysis using non‐redundant mutation operators

Publisher： John Wiley & Sons Inc

E-ISSN： 1099-1689|25|5-7|490-507

ISSN： 0960-0833

Source： SOFTWARE TESTING, VERIFICATION & RELIABILITY (ELECTRONIC), Vol.25, Iss.5-7, 2015-08, pp. : 490-507

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Mining non-redundant time-gap sequential patterns

By Yen Show-Jane   Lee Yue-Shi  

Applied Intelligence, Vol. 39, Iss. 4, 2013-12 ,pp. : 727-738

Springer Publishing Company

Access to resources Recommend Favorite

Mining minimal non-redundant association rules using frequent itemsets lattice

By Vo Bay   Le Bac  

International Journal of Intelligent Systems Technologies and Applications, Vol. 10, Iss. 1, 2011-01 ,pp. : 92-106

Inderscience Publishers

Access to resources Recommend Favorite

Non-redundant data clustering

By Gondek David   Hofmann Thomas  

Knowledge and Information Systems, Vol. 12, Iss. 1, 2007-05 ,pp. : 1-24

Springer Publishing Company

Access to resources Recommend Favorite

Mining Non-Redundant Association Rules

By Zaki Mohammed  

Data Mining and Knowledge Discovery, Vol. 9, Iss. 3, 2004-11 ,pp. : 223-248

Springer Publishing Company

Access to resources Recommend Favorite

Crossover and mutation operators for grammar-guided genetic programming

By Couchet Jorge   Manrique Daniel   Ríos Juan   Rodríguez-Patón Alfonso  

Soft Computing, Vol. 11, Iss. 10, 2007-08 ,pp. : 943-955

Springer Publishing Company

Access to resources Recommend Favorite