{"id":{"repo_id":"greenwich","oai_identifier":"oai:gala.gre.ac.uk:6351"},"canonical_url":"https://search.dev.ndltd.org/etd/greenwich/oai:gala.gre.ac.uk:6351","repository":{"repo_id":"greenwich","name":"University of Greenwich","base_url":"https://gala.gre.ac.uk/cgi/oai2"},"display":{"title":"Using CBR to improve the usability of numerical models","abstract":"In this thesis we show that CBR systems can be constructed from numerical models, so as to improve their usability. It is shown that CBR models may be queried in a flexible manner, and that the user may formulate queries consisting of constraints over both “input” and “output” variables of the numerical model. It is also shown that the constraints may be formulated using either nominal or continuous variables. A generalization of the CBR retrieval process to include constraints over unified “input-output” space is formulated as a framework for the method. The method is illustrated with practical engineering models: the pneumatic conveyor problem and the projectile problem. Comparisons are made on usability of CBR and numerical models for specific problems. It is shown that CBR models can answer questions difficult or impossible to formulate using numerical models, and that CBR models can be faster. The thesis also addresses a latent problem with the general method, which is of importance generally. This is to do with interpolation over nominal values in unified space. A novel method is proposed for interpolation over nominal values, termed Generalised Shepard Nearest Neighbour method (GSNN). GSNN can utilise distance metrics defined on the solution space of a CBR system. The properties and advantages of GSNN are examined in the thesis. A comparison is made with other CBR retrieval methods, using several examples, including the travel domain case base. It is shown that GSNN can out-perform conventional nearest neighbour methods. It is shown that GSNN has advantages in that it can find solutions not in the case base and it can find solutions not in the retrieval set. It is also shown that the performance of GSNN can be improved further by using it in conjunction with a diversity algorithm. The merit of using GSNN as a case selection component is examined, and it is shown that it can give good results in sparse case bases. Finally the thesis concludes with a survey of numerical models where CBR construction can be useful, and where benefits can be expected.","abstract_html":"In this thesis we show that CBR systems can be constructed from numerical models, so as to improve their usability. It is shown that CBR models may be queried in a flexible manner, and that the user may formulate queries consisting of constraints over both “input” and “output” variables of the numerical model. It is also shown that the constraints may be formulated using either nominal or continuous variables. A generalization of the CBR retrieval process to include constraints over unified “input-output” space is formulated as a framework for the method. The method is illustrated with practical engineering models: the pneumatic conveyor problem and the projectile problem. Comparisons are made on usability of CBR and numerical models for specific problems. It is shown that CBR models can answer questions difficult or impossible to formulate using numerical models, and that CBR models can be faster. The thesis also addresses a latent problem with the general method, which is of importance generally. This is to do with interpolation over nominal values in unified space. A novel method is proposed for interpolation over nominal values, termed Generalised Shepard Nearest Neighbour method (GSNN). GSNN can utilise distance metrics defined on the solution space of a CBR system. The properties and advantages of GSNN are examined in the thesis. A comparison is made with other CBR retrieval methods, using several examples, including the travel domain case base. It is shown that GSNN can out-perform conventional nearest neighbour methods. It is shown that GSNN has advantages in that it can find solutions not in the case base and it can find solutions not in the retrieval set. It is also shown that the performance of GSNN can be improved further by using it in conjunction with a diversity algorithm. The merit of using GSNN as a case selection component is examined, and it is shown that it can give good results in sparse case bases. Finally the thesis concludes with a survey of numerical models where CBR construction can be useful, and where benefits can be expected.","abstract_has_math":false,"creators":["Woon, Fei Ling"],"institution":"University of Greenwich","degree_name":"phd","degree_level":"doctoral","degree_discipline":null,"degree_department":null,"school":null,"contributors":[],"advisors":["Knight, Brian","Petridis, Miltiadis"],"committee_chairs":[],"committee_members":[],"year":2005,"date_issued":"2005-10","date_published":"2005-10","updated_at":"2026-07-24T02:25:39Z","subjects":["QA Mathematics"],"languages":["en"],"rights":[],"rights_urls":[],"identifier_entries":[]},"links":{"outbound_url":null,"outbound_label":null,"outbound_source":null},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.advisor","label":"Advisor","values":["Knight, Brian","Petridis, Miltiadis"]},{"key":"dc:creator","label":"Author","values":["Woon, Fei Ling"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2005-10"]},{"key":"dc:date.issued","label":"Date","values":["2005-10"]},{"key":"dc:publisher.commercial","label":"Dc Publisher Commercial","values":["University of Greenwich,"]},{"key":"dc:publisher.department","label":"Dc Publisher Department","values":["School of Computing and Mathematical Sciences"]},{"key":"dc:publisher.institution","label":"Dc Publisher Institution","values":["University of Greenwich"]},{"key":"dc:relation.isreferencedby","label":"Dc Relation Isreferencedby","values":["https://gala.gre.ac.uk/id/eprint/6351/"]},{"key":"dc:type","label":"Dc Type","values":["Thesis"]},{"key":"dc:type.qualificationlevel","label":"Dc Type Qualificationlevel","values":["doctoral"]},{"key":"dc:type.qualificationname","label":"Dc Type Qualificationname","values":["phd"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["QA Mathematics"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language","label":"Dc Language","values":["en"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.uri","label":"Identifier URI","values":["https://gala.gre.ac.uk/id/eprint/6351/4/Fei%20Ling%20Woon%202005%20-%20Redacted.pdf"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["In this thesis we show that CBR systems can be constructed from numerical models, so as to improve their usability. It is shown that CBR models may be queried in a flexible manner, and that the user may formulate queries consisting of constraints over both “input” and “output” variables of the numerical model. It is also shown that the constraints may be formulated using either nominal or continuous variables. A generalization of the CBR retrieval process to include constraints over unified “input-output” space is formulated as a framework for the method. The method is illustrated with practical engineering models: the pneumatic conveyor problem and the projectile problem. Comparisons are made on usability of CBR and numerical models for specific problems. It is shown that CBR models can answer questions difficult or impossible to formulate using numerical models, and that CBR models can be faster. The thesis also addresses a latent problem with the general method, which is of importance generally. This is to do with interpolation over nominal values in unified space. A novel method is proposed for interpolation over nominal values, termed Generalised Shepard Nearest Neighbour method (GSNN). GSNN can utilise distance metrics defined on the solution space of a CBR system. The properties and advantages of GSNN are examined in the thesis. A comparison is made with other CBR retrieval methods, using several examples, including the travel domain case base. It is shown that GSNN can out-perform conventional nearest neighbour methods. It is shown that GSNN has advantages in that it can find solutions not in the case base and it can find solutions not in the retrieval set. It is also shown that the performance of GSNN can be improved further by using it in conjunction with a diversity algorithm. The merit of using GSNN as a case selection component is examined, and it is shown that it can give good results in sparse case bases. Finally the thesis concludes with a survey of numerical models where CBR construction can be useful, and where benefits can be expected."]},{"key":"dc:format","label":"Dc Format","values":["application/pdf"]},{"key":"dc:title","label":"Title","values":["Using CBR to improve the usability of numerical models"]}]}],"canonical_facts":{"dc:contributor.advisor":["Knight, Brian","Petridis, Miltiadis"],"dc:creator":["Woon, Fei Ling"],"dc:date":["2005-10"],"dc:date.issued":["2005-10"],"dc:description.abstract":["In this thesis we show that CBR systems can be constructed from numerical models, so as to improve their usability. It is shown that CBR models may be queried in a flexible manner, and that the user may formulate queries consisting of constraints over both “input” and “output” variables of the numerical model. It is also shown that the constraints may be formulated using either nominal or continuous variables. A generalization of the CBR retrieval process to include constraints over unified “input-output” space is formulated as a framework for the method. The method is illustrated with practical engineering models: the pneumatic conveyor problem and the projectile problem. Comparisons are made on usability of CBR and numerical models for specific problems. It is shown that CBR models can answer questions difficult or impossible to formulate using numerical models, and that CBR models can be faster. The thesis also addresses a latent problem with the general method, which is of importance generally. This is to do with interpolation over nominal values in unified space. A novel method is proposed for interpolation over nominal values, termed Generalised Shepard Nearest Neighbour method (GSNN). GSNN can utilise distance metrics defined on the solution space of a CBR system. The properties and advantages of GSNN are examined in the thesis. A comparison is made with other CBR retrieval methods, using several examples, including the travel domain case base. It is shown that GSNN can out-perform conventional nearest neighbour methods. It is shown that GSNN has advantages in that it can find solutions not in the case base and it can find solutions not in the retrieval set. It is also shown that the performance of GSNN can be improved further by using it in conjunction with a diversity algorithm. The merit of using GSNN as a case selection component is examined, and it is shown that it can give good results in sparse case bases. Finally the thesis concludes with a survey of numerical models where CBR construction can be useful, and where benefits can be expected."],"dc:format":["application/pdf"],"dc:identifier.uri":["https://gala.gre.ac.uk/id/eprint/6351/4/Fei%20Ling%20Woon%202005%20-%20Redacted.pdf"],"dc:language":["en"],"dc:publisher.commercial":["University of Greenwich,"],"dc:publisher.department":["School of Computing and Mathematical Sciences"],"dc:publisher.institution":["University of Greenwich"],"dc:relation.isreferencedby":["https://gala.gre.ac.uk/id/eprint/6351/"],"dc:subject":["QA Mathematics"],"dc:title":["Using CBR to improve the usability of numerical models"],"dc:type":["Thesis"],"dc:type.qualificationlevel":["doctoral"],"dc:type.qualificationname":["phd"]},"updated_at":"2026-07-24T02:25:39Z"}