Abstract
In recent years, Genetic Algorithms (GAs) have shown promising results in the domain of data mining. However, unreasonably long running times due to the high computational cost associated with fitness evaluations dissuades the use of GAs for knowledge discovery. In this paper we propose an enhanced genetic algorithm for automated rule mining. The proposed approach supplements the GA with an entropy based probabilistic initialization such that the initial population has more relevant and informative attributes. Further, the GA is augmented with a memory to store fitness scores. The suggested additions have a twofold advantage. Firstly, it lessens the candidate rules’ search space making the search more effective to evolve better fit rules in lesser number of generations. Secondly, it reduces number of total fitness evaluations required giving rise to a gain in running time. The enhanced GA has been employed to datasets from UCI machine learning repository and has shown encouraging results.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Alatas, B., Akin, E.: An Efficient Genetic Algorithm for Automated Mining of both Positive and Negative Quantitative Association Rules. Soft Computing – A Fusion of Foundations, Methodologies and Application 10, 230–237 (2005)
Balamurugan, A., Pramala, R., Rajaram.: Feature Selection for Large Scale Data by Combining Class Association Rule Mining and Information Gain: a Hybrid Approach. Internetworking Indonesia Journal 1, 17–20 (2009)
Dash, M., Liu, H.: Feature Selection for Classification. Intelligent Data Analysis: An International Journal 3, 131–156 (1997)
Dash, M., Choi, K., Scheuermann, P., Liu, H.: Feature Selection for Clustering-A Filter Solution. In: Proceedings of IEEE Second International Conference on Data Mining, pp. 115–122. IEEE Press, New York (2002)
Dhar, V., Chou, D., Provost, F.: Discovering Interesting Patterns for Investment Decision Making with GLOWER- A Genetic Learner Overlaid With Entropy Reduction. Data Mining and Knowledge Discovery 4, 251–280 (2000)
Freitas, A.A.: Data Mining and Knowledge Discovery with Evolutionary Algorithm. Natural Computing Series. Springer, New York (2002)
Freitas, A.A.: A survey of Evolutionary Algorithms for Data Mining and Knowledge Discovery. In: Advances in Evolutionary Computation Theory and Applications, pp. 819–845. Springer, New York (2003)
Gantovnik, V.B., Anderson-Cook, C.M., Gurdal, Z., Watson, L.T.: A Genetic Algorithm with Memory for Mixed Discrete–Continuous Design Optimization. Computers and Structures 81, 2003–2009 (2003)
Goldberg, D.E.: Genetic Algorithms in Search, Optimization and Machine Learning. Addison-Wesley Publishing Company Inc., New York (1989)
Kohavi, R., John, G.H.: Wrappers for Feature Subset Selection. Artificial Intelligence 97, 273–324 (1997)
Liu, J.J., Kwok, J.T.Y.: An Extended Genetic Rule Induction Algorithm. In: Proceeding of the Congress on Evolutionary Computation (CEC 2000), pp. 458–463. IEEE Press, La Jolla (2000)
Louis, S.J., Li, G.: Augmenting Genetic Algorithms with Memory to Solve Salesman Problems. In: Proceedings of the Joint Conference on Information Sciences, pp. 108–111. Duke University Press (1997)
MartĂn-Bautista, M.J., Vila, M.-A.: Applying Genetic Algorithms to the Feature Selection Problem in Information Retrieval. In: Andreasen, T., Christiansen, H., Larsen, H.L. (eds.) FQAS 1998. LNCS (LNAI), vol. 1495, pp. 272–281. Springer, Heidelberg (1998)
Noda, E., Freitas, A.A., Lopes, H.S.: Discovering Interesting Prediction Rules with a Genetic Algorithm. In: Proc. Congress on Evolutionary Computation (CEC), Washington, pp. 1322–1329 (1999)
Saroj, S., Bharadwaj, K.K.: A Parallel Genetic Algorithm Approach for Automated Discovery of Censored Production Rules. In: Proc. IASTED Int. Conf. on Artificial Intelligence and Application, pp. 435–441. ACTA Press, Innsbruck (2007)
Saroj, S., Bhardwaj, K.K.: Discovery of Exceptions: A Step towards Perfection. In: Third International Conference on Network and System Security, Gold Coast, Australia, pp. 540–545 (2009)
Subbotin, S., Oleynik, A.: Entropy Based Evolutionary Search for Feature Selection. In: 9th International Conference the Experience of Designing and Application of CAD System in Microelectronic, Polyana, Ukraine, pp. 442–443 (2007)
Tan, F., Fu, X., Zhang, Y., Bourgeois, A.G.: A Genetic Algorithm-Based Method for Feature Subset Selection. Soft Computing 12, 111–120 (2008)
Yang, S.: Associative memory scheme for genetic algorithms in dynamic environments. In: Rothlauf, F., Branke, J., Cagnoni, S., Costa, E., Cotta, C., Drechsler, R., Lutton, E., Machado, P., Moore, J.H., Romero, J., Smith, G.D., Squillero, G., Takagi, H. (eds.) EvoWorkshops 2006. LNCS, vol. 3907, pp. 788–799. Springer, Heidelberg (2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Saroj, Kapila, Kumar, D., Kanika (2011). A Genetic Algorithm with Entropy Based Probabilistic Initialization and Memory for Automated Rule Mining. In: Meghanathan, N., Kaushik, B.K., Nagamalai, D. (eds) Advances in Computer Science and Information Technology. CCSIT 2011. Communications in Computer and Information Science, vol 131. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-17857-3_60
Download citation
DOI: https://doi.org/10.1007/978-3-642-17857-3_60
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-17856-6
Online ISBN: 978-3-642-17857-3
eBook Packages: Computer ScienceComputer Science (R0)