Please use this identifier to cite or link to this item:
http://hdl.handle.net/10397/1282
DC Field | Value | Language |
---|---|---|
dc.contributor | Department of Civil and Environmental Engineering | - |
dc.creator | Chau, KW | - |
dc.date.accessioned | 2014-12-11T08:27:55Z | - |
dc.date.available | 2014-12-11T08:27:55Z | - |
dc.identifier.isbn | 978-3-540-36667-6 | - |
dc.identifier.uri | http://hdl.handle.net/10397/1282 | - |
dc.language.iso | en | en_US |
dc.publisher | Springer | en_US |
dc.relation.ispartofseries | Lecture notes in computer science ; v. 4099 | - |
dc.rights | © Springer-Verlag Berlin Heidelberg 2006. The original publication is available at http://www.springerlink.com. | en_US |
dc.subject | Particle swarm optimization | en_US |
dc.subject | Construction litigation outcome | en_US |
dc.subject | Artificial intelligence technologies | en_US |
dc.subject | Algorithms | en_US |
dc.subject | Backpropagation | en_US |
dc.subject | Artificial neural networks | en_US |
dc.subject | Decision making | en_US |
dc.subject | Cost effectiveness | en_US |
dc.title | A split-step PSO algorithm in predicting construction litigation outcome | en_US |
dc.type | Book Chapter | en_US |
dc.description.otherinformation | Series: Lecture notes in computer science | en_US |
dc.identifier.doi | 10.1007/11801603_163 | - |
dcterms.abstract | Owing to the highly complicated nature and the escalating cost involved in construction claims, it is highly desirable for the parties to a dispute to know with some certainty how the case would be resolved if it were taken to court. The use of artificial neural networks can be a cost-effective technique to help to predict the outcome of construction claims, on the basis of characteristics of cases and the corresponding past court decisions. This paper presents the application of a split-step particle swarm optimization (PSO) model for training perceptrons to predict the outcome of construction claims in Hong Kong. The advantages of global search capability of PSO algorithm in the first step and local fast convergence of Levenberg-Marquardt algorithm in the second step are combined together. The results demonstrate that, when compared with the benchmark backward propagation algorithm and the conventional PSO algorithm, it attains a higher accuracy in a much shorter time. | - |
dcterms.accessRights | open access | en_US |
dcterms.bibliographicCitation | In Q Yang & G Webb (Eds.), PRICAI 2006 : trends in artificial intelligence : 9th Pacific Rim International Conference on Artificial Intelligence, Guilin, China, August 7-11, 2006 : proceedings, p. 1211-1215. Berlin: Springer, 2006 | - |
dcterms.issued | 2006 | - |
dc.identifier.isi | WOS:000240091500163 | - |
dc.identifier.scopus | 2-s2.0-33749565014 | - |
dc.relation.ispartofbook | PRICAI 2006 : trends in artificial intelligence : 9th Pacific Rim International Conference on Artificial Intelligence, Guilin, China, August 7-11, 2006 : proceedings | - |
dc.relation.conference | Pacific Rim International Conference on Artificial Intelligence [PRICAI] | - |
dc.publisher.place | Berlin | en_US |
dc.identifier.rosgroupid | r28101 | - |
dc.description.ros | 2005-2006 > Academic research: refereed > Publication in refereed journal | - |
dc.description.oa | Accepted Manuscript | en_US |
dc.identifier.FolderNumber | OA_IR/PIRA | en_US |
dc.description.pubStatus | Published | en_US |
dc.description.oaCategory | Green (AAM) | en_US |
Appears in Collections: | Book Chapter |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
LNAI16.pdf | Pre-published version | 63.86 kB | Adobe PDF | View/Open |
Page views
162
Last Week
1
1
Last month
Citations as of Dec 22, 2024
Downloads
200
Citations as of Dec 22, 2024
SCOPUSTM
Citations
1
Last Week
0
0
Last month
0
0
Citations as of Dec 19, 2024
WEB OF SCIENCETM
Citations
2
Last Week
0
0
Last month
0
0
Citations as of Dec 19, 2024
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.