Computational & Technology Resources
an online resource for computational,
engineering & technology publications |
|
Civil-Comp Proceedings
ISSN 1759-3433 CCP: 94
PROCEEDINGS OF THE SEVENTH INTERNATIONAL CONFERENCE ON ENGINEERING COMPUTATIONAL TECHNOLOGY Edited by:
Paper 22
Water Supply Clusters based on a Boosting Semi-Supervised Learning Methodology M. Herrera, J. Izquierdo, R. Pérez-García and I. Montalvo
Institute for Multidisciplinary Mathematics, Universidad Politécnica de Valencia, Spain , "Water Supply Clusters based on a Boosting Semi-Supervised Learning Methodology", in , (Editors), "Proceedings of the Seventh International Conference on Engineering Computational Technology", Civil-Comp Press, Stirlingshire, UK, Paper 22, 2010. doi:10.4203/ccp.94.22
Keywords: clustering, graph theory, kernel methods, multi-agent systems, water supply networks.
Summary
Division of water supply networks (WSN) into isolated supply clusters is used in
the majority of the big cities around the world and aims at improving the
management of the whole system. This working philosophy follows a divide and
conquer strategy that splits the large highly interconnected distribution network into
smaller networks, virtually independent, each of them supplied by a prefixed
number of sources. Looking for leaks, detecting water distribution anomalies or
carrying out reliability plans, are instances of the aspects that can be technically
improved by this reduction of the inspection area [1].
In this paper we propose gathering graphical information and supply constraints by a semi-supervised spectral clustering algorithm as an adequate solution to achieve this partition [2]. Spectral clustering produces high-quality cluster configurations on small data sets but has some difficulties in large-scale problems. To approach a solution we propose resampling representative subgraphs of the network. This boosting process is based on multi-agent simulations [1] of virus propagation behavior to obtain a final subgraph of the "infected nodes". Next, we build iteratively semi-supervised supply cluster partitions on them. After each individualized solution we reweight the data to obtain the next sample in an adaptive way. This reweighting method links with the proposed sampling methodology through their relation with the variation of a specific parameter. In addition, a measure of clustering validity, such as the silhouette of each node, becomes very important during the whole process and until the final establishment of the clustering configuration by an adaptive voting procedure. The proposal, tested in a real-world network, allows us to conclude that the methodology developed , which uses both graphical and vectorial information, is robust and is able to partition large size WSNs. References
purchase the full-text of this paper (price £20)
go to the previous paper |
|