Please use this identifier to cite or link to this item:
Title: A split-step PSO algorithm in predicting construction litigation outcome
Authors: Chau, KW 
Keywords: Particle swarm optimization
Construction litigation outcome
Artificial intelligence technologies
Artificial neural networks
Decision making
Cost effectiveness
Issue Date: 2006
Publisher: Springer Berlin / Heidelberg
Source: Lecture notes in artificial intelligence, 2006, v. 4099, p. 1211-1215 How to cite?
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.
ISBN: 978-3-540-36667-6
DOI: 10.1007/11801603_163
Rights: © Springer-Verlag Berlin Heidelberg 2006. The original publication is available at
Appears in Collections:Book Chapter

Files in This Item:
File Description SizeFormat 
LNAI16.pdfPre-published version63.86 kBAdobe PDFView/Open
View full-text via PolyU eLinks SFX Query
Show full item record


Last Week
Last month
Citations as of May 24, 2016

Page view(s)

Last Week
Last month
Checked on May 29, 2016


Checked on May 29, 2016

Google ScholarTM



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.