Integrating neural networks and logistic regression to underpin hyper-heuristic search

被引:22
作者
Li, Jingpeng [1 ]
Burke, Edmund K. [1 ]
Qu, Rong [1 ]
机构
[1] Univ Nottingham, Sch Comp Sci, Nottingham NG8 1BB, England
基金
英国工程与自然科学研究理事会;
关键词
Hyper-heuristic; Data mining; Educational timetabling; Neural network; Logistic regression; TIMETABLING PROBLEMS; DISTRIBUTION ALGORITHM; SPACE; GRAPH; DISCOVERY;
D O I
10.1016/j.knosys.2010.10.004
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
A hyper-heuristic often represents a heuristic search method that operates over a space of heuristic rules. It can be thought of as a high level search methodology to choose lower level heuristics. Nearly 200 papers on hyper-heuristics have recently appeared in the literature. A common theme in this body of literature is an attempt to solve the problems in hand in the following way: at each decision point, first employ the chosen heuristic(s) to generate a solution, then calculate the objective value of the solution by taking into account all the constraints involved. However, empirical studies from our previous research have revealed that, under many circumstances, there is no need to carry out this costly 2-stage determination and evaluation at all times. This is because many problems in the real world are highly constrained with the characteristic that the regions of feasible solutions are rather scattered and small. Motivated by this observation and with the aim of making the hyper-heuristic search more efficient and more effective, this paper investigates two fundamentally different data mining techniques, namely artificial neural networks and binary logistic regression. By learning from examples, these techniques are able to find global patterns hidden in large data sets and achieve the goal of appropriately classifying the data. With the trained classification rules or estimated parameters, the performance (i.e. the worth of acceptance or rejection) of a resulting solution during the hyper-heuristic search can be predicted without the need to undertake the computationally expensive 2-stage of determination and calculation. We evaluate our approaches on the solutions (i.e. the sequences of heuristic rules) generated by a graph-based hyper-heuristic proposed for exam timetabling problems. Time complexity analysis demonstrates that the neural network and the logistic regression method can speed up the search significantly. We believe that our work sheds light on the development of more advanced knowledge-based decision support systems. (C) 2010 Elsevier B.V. All rights reserved.
引用
收藏
页码:322 / 330
页数:9
相关论文
共 40 条
[1]  
Agresti A., 2019, An introduction to categorical data analysis, V3rd
[2]   An estimation of distribution algorithm with intelligent local search for rule-based nurse rostering [J].
Aickelin, U. ;
Burke, E. K. ;
Li, J. .
JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2007, 58 (12) :1574-1585
[3]   An estimation of distribution algorithm for nurse scheduling [J].
Aickelin, Uwe ;
Li, Jingpeng .
ANNALS OF OPERATIONS RESEARCH, 2007, 155 (01) :289-309
[4]  
Aldrich J, 1997, STAT SCI, V12, P162
[5]  
[Anonymous], 1998, NEURAL NETWORKS
[6]  
Bozdogan H., 2004, Statistical Data Mining and Knowledge Discovery
[7]  
Burke E., 2003, Handbook of Metaheuristicspages, P457, DOI DOI 10.1007/0-306-48056-5_16
[8]  
Burke E.K., 2004, HDB GRAPH THEORY, P445
[9]   A graph-based hyper-heuristic for educational timetabling problems [J].
Burke, Edmund K. ;
McCollum, Barry ;
Meisels, Amnon ;
Petrovic, Sanja ;
Qu, Rong .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2007, 176 (01) :177-192
[10]  
Burke EK, 2010, INT SER OPER RES MAN, V146, P449, DOI 10.1007/978-1-4419-1665-5_15