Multi-agent adaptive boosting on semi-supervised water supply clusters

The division of a water supply network (WSN) into isolated supply clusters aims at improving the management of the whole system. This paper deals with the application of spectral clustering to achieve this aim. A semi-supervised approach can take into account the graph structure of a network and incorporate the corresponding hydraulic constraints and the other available vector information from the WSN. Several of the disadvantages of these methodologies stem from the largeness of the most WSN and the associated computational complexity. To solve these problems, we propose subsampling graph data to run successive weak clusters and build a single robust cluster configuration. The resulting methodology has been tested in a real network and can be used to successfully partition large WSNs.

[1]  Ulrike von Luxburg,et al.  A tutorial on spectral clustering , 2007, Stat. Comput..

[2]  Robert E. Schapire,et al.  The strength of weak learnability , 1990, Mach. Learn..

[3]  Christos Faloutsos,et al.  Sampling from large graphs , 2006, KDD '06.

[4]  Dipti Srinivasan,et al.  An Introduction to Multi-Agent Systems , 2010 .

[5]  Idel Montalvo,et al.  Division of Water Supply Systems into District Metered Areas Using a Multi-agent Based Approach , 2009, ICSOFT.

[6]  Nizar Grira,et al.  Unsupervised and Semi-supervised Clustering : a Brief Survey ∗ , 2004 .

[7]  Antonio Manuel,et al.  Improving water network management by efficient division into supply clusters , 2011 .

[8]  Yi Liu,et al.  SemiBoost: Boosting for Semi-Supervised Learning , 2009, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[9]  Michael I. Jordan,et al.  On Spectral Clustering: Analysis and an algorithm , 2001, NIPS.

[10]  Vipin Kumar,et al.  Introduction to Data Mining, (First Edition) , 2005 .

[11]  Yuji Matsumoto,et al.  An Application of Boosting to Graph Classification , 2004, NIPS.

[12]  Hans-Peter Kriegel,et al.  Representative Subgraph Sampling using Markov Chain Monte Carlo Methods , 2008 .

[13]  Y. Shoham.  Introduction to Multi-Agent Systems , 2002 .

[14]  Andreas Stafylopatis,et al.  A clustering method based on boosting , 2004, Pattern Recognit. Lett..

[15]  Eric D. Kolaczyk,et al.  Statistical Analysis of Network Data: Methods and Models , 2009 .

[16]  Charu C. Aggarwal,et al.  Graph Clustering , 2010, Encyclopedia of Machine Learning and Data Mining.

[17]  Yoav Freund,et al.  A decision-theoretic generalization of on-line learning and an application to boosting , 1995, EuroCOLT.

[18]  P. Rousseeuw.  Silhouettes: a graphical aid to the interpretation and validation of cluster analysis , 1987 .

[19]  Aristides Gionis,et al.  Mining Large Networks with Subgraph Counting , 2008, 2008 Eighth IEEE International Conference on Data Mining.

[20]  Satu Elisa Schaeffer,et al.  Graph Clustering , 2017, Encyclopedia of Machine Learning and Data Mining.

[21]  Daniel T. Larose,et al.  Discovering Knowledge in Data: An Introduction to Data Mining , 2005 .

[22]  Ling Huang,et al.  Fast approximate spectral clustering , 2009, KDD.

[23]  Taku Kudo,et al.  Clustering graphs by weighted substructure mining , 2006, ICML.

[24]  N. Abreu.  Old and new results on algebraic connectivity of graphs , 2007 .

[25]  Michael Wooldridge,et al.  Introduction to multiagent systems , 2001 .

[26]  Benjamin Auffarth.  Spectral Graph Clustering , 2007 .

[27]  Robert Tibshirani,et al.  The Elements of Statistical Learning: Data Mining, Inference, and Prediction, 2nd Edition , 2001, Springer Series in Statistics.

[28]  Jitendra Malik,et al.  Normalized cuts and image segmentation , 1997, Proceedings of IEEE Computer Society Conference on Computer Vision and Pattern Recognition.

[29]  O Hunaidi.  Economic Comparison of Periodic Acoustic Surveys and DMA- based Leakage Management Strategies , 2005 .

[30]  Thomas G. Dietterich.  Multiple Classifier Systems , 2000, Lecture Notes in Computer Science.

[31]  Jitendra Malik,et al.  Spectral grouping using the Nystrom method , 2004, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[32]  Victor H. Alcocer-Yamanaka,et al.  Graph Theory Based Algorithms for Water Distribution Network Sectorization Projects , 2008 .