Please use this identifier to cite or link to this item:
http://hdl.handle.net/1893/15782
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Li, Jingpeng | en_UK |
dc.contributor.author | Burke, Edmund | en_UK |
dc.contributor.author | Qu, Rong | en_UK |
dc.date.accessioned | 2018-02-18T01:07:33Z | - |
dc.date.available | 2018-02-18T01:07:33Z | - |
dc.date.issued | 2011-03 | en_UK |
dc.identifier.uri | http://hdl.handle.net/1893/15782 | - |
dc.description.abstract | 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. | en_UK |
dc.language.iso | en | en_UK |
dc.publisher | Elsevier | en_UK |
dc.relation | Li J, Burke E & Qu R (2011) Integrating neural networks and logistic regression to underpin hyper-heuristic search. Knowledge-Based Systems, 24 (2), pp. 322-330. https://doi.org/10.1016/j.knosys.2010.10.004 | en_UK |
dc.rights | The publisher does not allow this work to be made publicly available in this Repository. Please use the Request a Copy feature at the foot of the Repository record to request a copy directly from the author. You can only request a copy if you wish to use this work for your own research or private study. | en_UK |
dc.rights.uri | http://www.rioxx.net/licenses/under-embargo-all-rights-reserved | en_UK |
dc.subject | Hyper-heuristic | en_UK |
dc.subject | Data mining | en_UK |
dc.subject | Educational timetabling | en_UK |
dc.subject | Neural network | en_UK |
dc.subject | Logistic regression | en_UK |
dc.title | Integrating neural networks and logistic regression to underpin hyper-heuristic search | en_UK |
dc.type | Journal Article | en_UK |
dc.rights.embargodate | 3000-01-01 | en_UK |
dc.rights.embargoreason | [Integrating neural networks and logistic regression to underpin hyper-heuristic s.pdf] The publisher does not allow this work to be made publicly available in this Repository therefore there is an embargo on the full text of the work. | en_UK |
dc.identifier.doi | 10.1016/j.knosys.2010.10.004 | en_UK |
dc.citation.jtitle | Knowledge-Based Systems | en_UK |
dc.citation.issn | 0950-7051 | en_UK |
dc.citation.volume | 24 | en_UK |
dc.citation.issue | 2 | en_UK |
dc.citation.spage | 322 | en_UK |
dc.citation.epage | 330 | en_UK |
dc.citation.publicationstatus | Published | en_UK |
dc.citation.peerreviewed | Refereed | en_UK |
dc.type.status | VoR - Version of Record | en_UK |
dc.author.email | e.k.burke@stir.ac.uk | en_UK |
dc.contributor.affiliation | Computing Science and Mathematics - Division | en_UK |
dc.contributor.affiliation | Computing Science and Mathematics - Division | en_UK |
dc.contributor.affiliation | University of Nottingham | en_UK |
dc.identifier.isi | WOS:000287287500012 | en_UK |
dc.identifier.scopusid | 2-s2.0-78650814963 | en_UK |
dc.identifier.wtid | 694353 | en_UK |
dc.contributor.orcid | 0000-0002-6758-0084 | en_UK |
dcterms.dateAccepted | 2011-03-31 | en_UK |
dc.date.filedepositdate | 2013-07-04 | en_UK |
rioxxterms.type | Journal Article/Review | en_UK |
rioxxterms.version | VoR | en_UK |
local.rioxx.author | Li, Jingpeng|0000-0002-6758-0084 | en_UK |
local.rioxx.author | Burke, Edmund| | en_UK |
local.rioxx.author | Qu, Rong| | en_UK |
local.rioxx.project | Internal Project|University of Stirling|https://isni.org/isni/0000000122484331 | en_UK |
local.rioxx.freetoreaddate | 3000-01-01 | en_UK |
local.rioxx.licence | http://www.rioxx.net/licenses/under-embargo-all-rights-reserved|| | en_UK |
local.rioxx.filename | Integrating neural networks and logistic regression to underpin hyper-heuristic s.pdf | en_UK |
local.rioxx.filecount | 1 | en_UK |
local.rioxx.source | 0950-7051 | en_UK |
Appears in Collections: | Computing Science and Mathematics Journal Articles |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Integrating neural networks and logistic regression to underpin hyper-heuristic s.pdf | Fulltext - Published Version | 264.29 kB | Adobe PDF | Under Embargo until 3000-01-01 Request a copy |
This item is protected by original copyright |
Items in the Repository are protected by copyright, with all rights reserved, unless otherwise indicated.
The metadata of the records in the Repository are available under the CC0 public domain dedication: No Rights Reserved https://creativecommons.org/publicdomain/zero/1.0/
If you believe that any material held in STORRE infringes copyright, please contact library@stir.ac.uk providing details and we will remove the Work from public display in STORRE and investigate your claim.