Please wait, while we are loading the content...
| Content Provider | IEEE Xplore Digital Library |
|---|---|
| Author | Liu, Y. Khu, S.T. |
| Copyright Year | 2007 |
| Description | Author affiliation: Exeter Univ., Exeter (Liu, Y.; Khu, S.T.) |
| Abstract | Genetic algorithms (GAs) and multi-objective genetic algorithms (MOGAs) have proven to be successful in calibrating numerical models. The limitation of using GAs and MOGAs is their expensive computational requirement. The calibration process usually needs to run the numerical model and evaluate the objective function thousands of times before converging to an acceptable solution and generating a sufficiently accurate Pareto set. However, in real world applications, there is simply not enough time and resources to perform such a huge number of model runs. In this study, a computational framework, known as GA-kNN, is presented for solving computationally expensive calibration problems. The concept of GA-kNN will be demonstrated via one novel approximate model using k-Nearest Neighbour classifier. This study also investigates Pareto ranks estimation using kNN classifier as a way to speed up multi-objective genetic algorithm search, namely NSGA-II-kNN. The approximation model is performed in predicting the form of Pareto ranks instead of running the simulation models and ranking current population. This approach can substantially reduce the number of model evaluations on computational expensive problems without compromising the good search capabilities of NSGA-II. The simulation results suggest that the proposed optimisation frameworks are able to achieve good solutions as well as provide considerable savings of the numerical model calls compared to traditional GA and NSGA-II optimisation frameworks. |
| Starting Page | 1073 |
| Ending Page | 1078 |
| File Size | 226898 |
| Page Count | 6 |
| File Format | |
| ISBN | 9781424413799 |
| ISSN | 10987576 |
| DOI | 10.1109/IJCNN.2007.4371107 |
| Language | English |
| Publisher | Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
| Publisher Date | 2007-08-12 |
| Publisher Place | USA |
| Access Restriction | Subscribed |
| Rights Holder | Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
| Subject Keyword | Calibration Numerical models Computational modeling Optimization methods Genetic algorithms Predictive models Time factors Hydrodynamics Neural networks Computer simulation |
| Content Type | Text |
| Resource Type | Article |
National Digital Library of India (NDLI) is a virtual repository of learning resources which is not just a repository with search/browse facilities but provides a host of services for the learner community. It is sponsored and mentored by Ministry of Education, Government of India, through its National Mission on Education through Information and Communication Technology (NMEICT). Filtered and federated searching is employed to facilitate focused searching so that learners can find the right resource with least effort and in minimum time. NDLI provides user group-specific services such as Examination Preparatory for School and College students and job aspirants. Services for Researchers and general learners are also provided. NDLI is designed to hold content of any language and provides interface support for 10 most widely used Indian languages. It is built to provide support for all academic levels including researchers and life-long learners, all disciplines, all popular forms of access devices and differently-abled learners. It is designed to enable people to learn and prepare from best practices from all over the world and to facilitate researchers to perform inter-linked exploration from multiple sources. It is developed, operated and maintained from Indian Institute of Technology Kharagpur.
Learn more about this project from here.
NDLI is a conglomeration of freely available or institutionally contributed or donated or publisher managed contents. Almost all these contents are hosted and accessed from respective sources. The responsibility for authenticity, relevance, completeness, accuracy, reliability and suitability of these contents rests with the respective organization and NDLI has no responsibility or liability for these. Every effort is made to keep the NDLI portal up and running smoothly unless there are some unavoidable technical issues.
Ministry of Education, through its National Mission on Education through Information and Communication Technology (NMEICT), has sponsored and funded the National Digital Library of India (NDLI) project.
| Sl. | Authority | Responsibilities | Communication Details |
|---|---|---|---|
| 1 | Ministry of Education (GoI), Department of Higher Education |
Sanctioning Authority | https://www.education.gov.in/ict-initiatives |
| 2 | Indian Institute of Technology Kharagpur | Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project | https://www.iitkgp.ac.in |
| 3 | National Digital Library of India Office, Indian Institute of Technology Kharagpur | The administrative and infrastructural headquarters of the project | Dr. B. Sutradhar bsutra@ndl.gov.in |
| 4 | Project PI / Joint PI | Principal Investigator and Joint Principal Investigators of the project |
Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon |
| 5 | Website/Portal (Helpdesk) | Queries regarding NDLI and its services | support@ndl.gov.in |
| 6 | Contents and Copyright Issues | Queries related to content curation and copyright issues | content@ndl.gov.in |
| 7 | National Digital Library of India Club (NDLI Club) | Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach | clubsupport@ndl.gov.in |
| 8 | Digital Preservation Centre (DPC) | Assistance with digitizing and archiving copyright-free printed books | dpc@ndl.gov.in |
| 9 | IDR Setup or Support | Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops | idr@ndl.gov.in |
|
Loading...
|