Enhancing Clustering Technique with Knowledge-based System to Plan the Social Infrastructure Services

Hesham A. Salman, Lamiaa Fattouh Ibrahim, Zaki Fayed

2013

Abstract

This article present new algorithm for clustering data in the presence of obstacles. In real world, there exist many physical obstacles such as rivers, lakes, highways and mountains..., and their presence may affect the result of clustering significantly. In this paper, we study the problem of clustering in the presence of obstacles to solve location of public service facilities. Each facility must serve minimum pre-specified level of demand. The objective is to minimize the distance travelled by users to reach the facilities this means also to maximize the accessibility to facilities. To achieve this objective we developed CKB-WSP algorithm (Clustering using Knowledge-Based Systems and Weighted Short Path). This algorithm is Density-based clustering algorithm using Dijkstra algorithm to calculate obstructed short path distance where the clustering distance represents a weighted shortest path. The weights are associated with intersection node and represent the population number. Each type of social facility(schools, fire stations, hospitals, mosque, church…) own many constraints such as surface area and number of people to be served, maximum distance, available location to locate these services. All these constraints is stored in the Knowledge-Based system. Comparisons with other clustering methods are presented showing the advantages of the CKB-WSP algorithm introduced in this paper.

References

  1. Agrawal, R., Gehrke, J., Gunopulos, D., Raghavan,P., (1998). Automatic subspace clustering of high dimensional data for data mining application. In Proc. 1998 ACM-SIGMOD Int. Conf. Management of Data (SIGMOD'98).
  2. Ankerst, M., Breunig, M., kriegel, H. and Sander, J., (1999). OPTICS: Ordering points to identify the clustering structure. In Proc. 1999 ACM-SIGMOD Int. Conf. Management of data ( SIGMOD'96).
  3. Bigotte, J. F., Antunes, A. P., Social Infrastructure Planning: A Location Model and Solution Methods, Computer-Aided Civil and Infrastructure Engineering 22 (2007) 570-583.
  4. Bradly, P., Fayyad, U., and Reina, C., (1998). Scaling clustering algorithms to large databases. In proc. 1998 Int. Conf. Knoweldge Discovery and Data mining.
  5. Ceselli, A.,&Righini,G. (2005),A branch-and-price algorithm for the capacitated p-median problem, Networks, 45(3), 125-42.
  6. Cornuejols, G., Nemhauser, G. L. &Wolsey, L. A. (1990), The uncapacitated facility location problem, in P.B. Mirchandani and R. L. Francis (eds.), Discrete Location Theory, JohnWiley & Sons, New York, pp. 119-71.
  7. Diaz, J. A. & Fernandez, E. (2006), Hybrid scatter search and path relinking for the capacitated p-median problem, European Journal of Operational Research, 169(2), 570- 85.
  8. Ester, M., Kriegel, H., Sander, J. and Xu, X., (1996). A density based algorithm for discovering clusters in large spatial databases. In Proc. 1996 Inc. Conf. Knowledge discovery and Data mining (KDD'96).
  9. Guha, S., Rastogi, R., and Shim, K. (1998). Cure : An efficient clustering algorithm for large databases. In Proc. 1998 ACM-SIGMOD Int. Conf. Management of Data (SIGMOD'98).
  10. Han, J., and Kamber, M., Data Mining Concepts and Techniques, Elsevier, 2011.
  11. Han, J., Kamber, M., and Tung, A., (2001). Spatial Clustering Methods in data mining: A Survey, Geographic Data Mining and Knowledge Discovery.
  12. Ibrahim, L. F., (2011) Enhancing Clustering Network Planning Algorithm in the Presence of Obstacles, KDIR International Conference on Knowledge Discovery and Information Retrieval, KDIR is part of IC3K, the International Joint Conference on Knowledge Discovery, Knowledge Engineering and Knowledge Management, Paris, France 26- 29 October 2011.
  13. Kohonen, T.,(1982). Self organized formation of topologically correct feature map. Biological Cybernetics.
  14. Lorena, L. A.N.&Senne, E. L. F. (2004), A column generation approach to capacitated p-median problems, Computers and Operations Research, 31(6), 863-76.
  15. Mirchandani, P. B. (1990), The p-median problem and generalizations, in P. B. Mirchandani and R. L. Francis, (eds.), Discrete Location Theory, John Wiley & Sons, New York, pp. 55-117.
  16. Nanopoulosl, A., Theodoridis , Y., Manolopoulos, Y., (2001). C2P: Clustering based on Closest Pairs. Proceedings of the 27th International Conference on Very Large Data Bases, p.331-340, September 11-14.
  17. Sheikholeslami, G., Chatterjee, S. and Zhang, A., (1998). Wave Cluster : A multi- resolution clustering approach for very large spatial databases. In Proc. 1997 Int. Conf. Very Large Data Bases ( VLDB'97).
  18. Tan, P., Steinback, M., and Kumar, V., (2006). Introduction to Data Mining. Addison Wesley.
  19. Yiu, M., Mamoulis, N. (2004). Clustering Objects on a Spatial Network. SIGMOD Conference p 443-454.
  20. Zhang, T., Ramakrishnan, R., and Livny, M., (1996). BIRCH: an efficient data clustering method for very large.
Download


Paper Citation


in Harvard Style

A. Salman H., Fattouh Ibrahim L. and Fayed Z. (2013). Enhancing Clustering Technique with Knowledge-based System to Plan the Social Infrastructure Services . In Proceedings of the 5th International Conference on Agents and Artificial Intelligence - Volume 2: ICAART, ISBN 978-989-8565-39-6, pages 401-408. DOI: 10.5220/0004391504010408


in Bibtex Style

@conference{icaart13,
author={Hesham A. Salman and Lamiaa Fattouh Ibrahim and Zaki Fayed},
title={Enhancing Clustering Technique with Knowledge-based System to Plan the Social Infrastructure Services},
booktitle={Proceedings of the 5th International Conference on Agents and Artificial Intelligence - Volume 2: ICAART,},
year={2013},
pages={401-408},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0004391504010408},
isbn={978-989-8565-39-6},
}


in EndNote Style

TY - CONF
JO - Proceedings of the 5th International Conference on Agents and Artificial Intelligence - Volume 2: ICAART,
TI - Enhancing Clustering Technique with Knowledge-based System to Plan the Social Infrastructure Services
SN - 978-989-8565-39-6
AU - A. Salman H.
AU - Fattouh Ibrahim L.
AU - Fayed Z.
PY - 2013
SP - 401
EP - 408
DO - 10.5220/0004391504010408