1. Usama Fayyad,Gregory Piatetsky-Shapiro,Padhraic Smyth (1996). The KDD process for extracting useful knowledge from volumes of data. Communications of the ACM, 39(11), 27-34.
2. Alex Freitas,Simon Lavington (2000). Mining Very Large Databases with Parallel Processing. Mining Very Large Databases with Parallel Processing
3. I Foster,C Kesselman (1999). The Grid: Blueprint for a New Computing Infrastructure. The Grid: Blueprint for a New Computing Infrastructure
4. Thomas Dietterich (2000). An Experimental Comparison of Three Methods for Constructing Ensembles of Decision Trees: Bagging, Boosting, and Randomization. Machine Learning, 40(2), 139-157.
5. Hillol Kargupta,Philip Chan,Vipin Kumar,Zoran Obradovic (2000). Distributed and parallel knowledge discovery (workshop session) (title only). Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining, 534.
6. R,J Shafer (1996). Parallel mining of association rules. proc. IEEE Transactions on Knowledge and Data Engineering, 8, 962-969.
7. L-M Aouad,N-A Le-Khac,M-T Kechadi (2010). Performance study of a distributed apriori-like frequent itemsets mining technique. Knowledge Data Systems, 23, 55-72.
8. Lamine Aouad,Nhien An-Lekhac,Tahar Kechadi (2009). Grid-Based Approaches for Distributed Data Mining Applications. Journal of Algorithms & Computational Technology, 3(4), 517-534.
9. Nhien Le Khac,Lamine Aouad,M-T Kechadi (2010). Toward Distributed Knowledge Discovery on Grid Systems. Advanced Information and Knowledge Processing, 213-243.
10. Eshref Januzaj,Hans-Peter Kriegel,Martin Pfeifle (2004). DBDC: Density Based Distributed Clustering. Lecture Notes in Computer Science, 88-105.
11. N-A Le-Khac,L-M Aouad,M-T Kechadi (2007). A new approach for distributed density based clustering on grid platform. Data Management. Data, Data Everywhere, 4587, 247-258.
12. Lamine Aouad,Nhien-An Le-Khac,Tahar Kechadi (2007). Lightweight Clustering Technique for Distributed Data Mining Applications. Lecture Notes in Computer Science, 120-134.
13. Lamine Aouad,Nhien-An Le-Khac,Tahar Kechadi (2007). Lightweight Clustering Technique for Distributed Data Mining Applications. Lecture Notes in Computer Science, 120-134.
14. Jiawei Han,Micheline Kamber,Jian Pei (2006). Advanced Pattern Mining. Data Mining, 279-325.
15. Jean-Francois Laloux,Nhien-An Le-Khac,M-T Kechadi (2011). Efficient Distributed Approach for Density-Based Clustering. 2011 IEEE 20th International Workshops on Enabling Technologies: Infrastructure for Collaborative Enterprises, 145-150.
16. M Bertolotto,S Di Martino,F Ferrucci,T Kechadi (2007). Towards a framework for mining and analysing spatio‐temporal datasets. International Journal of Geographical Information Science, 21(8), 895-906.
17. Philip Chan,Salvatore Stolfo (1995). A Comparative Evaluation of Voting and Meta-learning on Partitioned Data. Machine Learning Proceedings 1995, 90-98.
18. C Reeves (1993). Modern heuristic techniques for combinatorial problems. Modern heuristic techniques for combinatorial problems
19. Lamine Aouad,Nhien-An Le-Khac,Tahar Kechadi (2009). Performance study of distributed Apriori-like frequent itemsets mining. Knowledge and Information Systems, 23(1), 55-72.
20. Inderjit Dhillon,Dharmendra Modha (1999). A Data-Clustering Algorithm on Distributed Memory Multiprocessors. Lecture Notes in Computer Science, 245-260.
21. M Ester,H Kriegel,J Sander,X Xu (1996). A density-based algorithm for discovering clusters in large spatial databases with noise. proc. KDD96, 226-231.
22. Ashwani Garg,Ashish Mangla,Neelima Gupta,Vasudha Bhatnagar (2006). PBIRCH: A Scalable Parallel Clustering algorithm for Incremental Data. 2006 10th International Database Engineering and Applications Symposium (IDEAS'06), 315-316.
23. H Geng,X Deng (2005). A new clustering algorithm using message passing and its applications in analyzing microarray data. proc. ICMLA '05 Proceedings of the Fourth International Conference on Machine Learning and Applications, 145-150.
24. Inderjit Dhillon,Dharmendra Modha (2000). A Data-Clustering Algorithm on Distributed Memory Multiprocessors. Lecture Notes in Computer Science, 245-260.
25. Xiaowei Xu,Jochen Jäger,Hans-Peter Kriegel (1999). A Fast Parallel Clustering Algorithm for Large Spatial Databases. Data Mining and Knowledge Discovery, 3(3), 263-290.
26. Nhien-An Le-Khac,Martin Bue,Michael Whelan,M Kechadi (2010). A Clustering-Based Data Reduction for Very Large Spatio-Temporal Datasets. Lecture Notes in Computer Science, 43-54.
27. J Fadili,M Melkemi,A Elmoataz (2004). Nonconvex onion-peeling using a shape hull algorithm. Pattern Recognition Letters, 25, 14-15.
28. A Chaudhuri,B Chaudhuri,S Parui (1997). A Novel Approach to Computation of the Shape of a Dot Pattern and Extraction of Its Perceptual Border. Computer Vision and Image Understanding, 68(3), 257-275.
29. Mahmoud Melkemi,Mourad Djebali (2000). Computing the shape of a planar points set. Pattern Recognition, 33(9), 1423-1436.
30. H Edelsbrunner,D Kirkpatrick,R Seidel (1983). On the shape of a set of points in the plane. IEEE Transactions on Information Theory, 29(4), 551-559.
31. A Moreira,M Santos (2007). CONCAVE HULL: A K-NEAREST NEIGHBOURS APPROACH FOR THE COMPUTATION OF THE REGION OCCUPIED BY A SET OF POINTS. Proceedings of the Second International Conference on Computer Graphics Theory and Applications
32. Matt Duckham,Lars Kulik,Mike Worboys,Antony Galton (2008). Efficient generation of simple polygons for characterizing the shape of a set of points in the plane. Pattern Recognition, 41(10), 3224-3236.
33. Tian Zhang,Raghu Ramakrishnan,Miron Livny (1996). BIRCH. Proceedings of the 1996 ACM SIGMOD international conference on Management of data - SIGMOD '96, 25, 103-114.
34. Sudipto Guha,Rajeev Rastogi,Kyuseok Shim (2001). Cure: an efficient clustering algorithm for large databases. Information Systems, 26(1), 35-58.
