Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/1280
PIRA download icon_1.1View/Download Full Text
DC FieldValueLanguage
dc.contributorDepartment of Civil and Environmental Engineering-
dc.creatorChau, KW-
dc.date.accessioned2014-12-11T08:24:06Z-
dc.date.available2014-12-11T08:24:06Z-
dc.identifier.isbn978-3-540-46481-5-
dc.identifier.urihttp://hdl.handle.net/10397/1280-
dc.language.isoenen_US
dc.publisherSpringeren_US
dc.relation.ispartofseriesLecture notes in computer science ; v. 4233-
dc.rights© Springer-Verlag Berlin Heidelberg 2006. The original publication is available at http://www.springerlink.com.en_US
dc.subjectParticle swarm optimizationen_US
dc.subjectConstruction litigation outcomeen_US
dc.subjectArtificial intelligence technologiesen_US
dc.subjectAlgorithmsen_US
dc.subjectBackpropagationen_US
dc.subjectArtificial neural networksen_US
dc.subjectCost effectivenessen_US
dc.subjectMathematical modelsen_US
dc.subjectConvergence of numerical methodsen_US
dc.subjectDecision makingen_US
dc.titlePrediction of construction litigation outcome using a split-step PSO algorithmen_US
dc.typeBook Chapteren_US
dc.identifier.doi10.1007/11893257_120-
dcterms.abstractThe nature of construction claims is highly complicated and the cost involved is high. It will be advantageous if the parties to a dispute may know with some certainty how the case would be resolved if it were taken to court. The recent advancements in artificial neural networks may render 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. In this paper, a split-step particle swarm optimization (PSO) model is applied to train perceptrons in order to predict the outcome of construction claims in Hong Kong. It combines the advantages of global search capability of PSO algorithm in the first step and the local convergence of back-propagation algorithm in the second step. It is shown that, through a real application case, its performance is much better than the benchmark backward propagation algorithm and the conventional PSO algorithm.-
dcterms.accessRightsopen accessen_US
dcterms.bibliographicCitationIn I King, J Wang, LW Chan & DL Wang (Eds.), Neural information processing : 13th international conference, ICONIP 2006, Hong Kong, China, October 3-6, 2006 : proceedings, p. 1101-1107. Berlin: Springer, 2006-
dcterms.issued2006-
dc.identifier.isiWOS:000241753100120-
dc.identifier.scopus2-s2.0-33750739743-
dc.relation.ispartofbookNeural information processing : 13th international conference, ICONIP 2006, Hong Kong, China, October 3-6, 2006 : proceedings-
dc.relation.conferenceInternational Conference on Neural Information Processing [ICONIP]-
dc.publisher.placeBerlinen_US
dc.identifier.rosgroupidr32663-
dc.description.ros2006-2007 > Academic research: refereed > Publication in refereed journal-
dc.description.oaAccepted Manuscripten_US
dc.identifier.FolderNumberOA_IR/PIRAen_US
dc.description.pubStatusPublisheden_US
dc.description.oaCategoryGreen (AAM)en_US
Appears in Collections:Book Chapter
Files in This Item:
File Description SizeFormat 
LNCS10.pdfPre-published version50.81 kBAdobe PDFView/Open
Open Access Information
Status open access
File Version Final Accepted Manuscript
Access
View full-text via PolyU eLinks SFX Query
Show simple item record

Page views

187
Last Week
0
Last month
Citations as of Dec 22, 2024

Downloads

174
Citations as of Dec 22, 2024

SCOPUSTM   
Citations

4
Last Week
0
Last month
0
Citations as of Dec 19, 2024

WEB OF SCIENCETM
Citations

3
Last Week
0
Last month
0
Citations as of Dec 26, 2024

Google ScholarTM

Check

Altmetric


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