Reusable components for partitioning clustering algorithms

Artificial Intelligence Review

Volumn 32, Issue 1-4, 2009, Pages 59-75

  Delibašić, Boris ^a   Kirchner, Kathrin ^b   Ruhland, Johannes ^b   Jovanović, Miloš ^a   Vukićević, Milan ^a  

^a UNIVERSITY OF BELGRADE   (Serbia)

^b FRIEDRICH SCHILLER UNIVERSITY JENA   (Germany)

Author keywords

Cluster algorithm; Generic; K means; Kohonen SOM; MPCK means; Partitioning clustering; Reusable component; X means

Indexed keywords

CLUSTER ALGORITHMS; K-MEANS; KOHONEN; REUSABLE COMPONENTS; X-MEANS;

CLUSTER ANALYSIS; LEARNING ALGORITHMS; STRENGTH OF MATERIALS;

CLUSTERING ALGORITHMS;

EID: 75149150690     PISSN: 02692821     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10462-009-9133-6     Document Type: Article

References (40)

1. Adams M, Coplien J, Gamoke R, Hammer R, Keeve F, Nicodemus K (1998) Fault-tolerant telecommunication system patterns. In: Rising L (eds) The pattern handbook: techniques, strategies, and applications. Cambridge University Press, New York, pp 189-202
2. Alexander C (1979) The timeless way of building. Oxford University Press, New York
3. Alexander C (2005a) The nature of order book 1: the phenomenon of life. The Center for Environmental Structure, Berkeley, CA
4. Alexander C. (2005b) The nature of order book 2: the process of creating life. The Center for Environmental Structure, Berkeley, CA
5. Alexander C. (2005c) The nature of order book 3: a vision of a living world. The Center for Environmental Structure, Berkeley, CA
6. Alexander C. (2005d) The nature of order book 4: the luminous ground. The Center for Environmental Structure, Berkeley, CA
7. Arthur D, Vassilvitskii S (2007) K-Means++: the advantages of careful seeding. In: Proceedings of the eighteenth annual ACM-SIAM symposium on discrete algorithms, Society for Industrial and Applied Mathematics, New Orleans, Louisiana, pp 1027-1035
8. Barbara D, Couto J, Li Y (2001) COOLCAT: An entropy-based algorithm for categorical clustering. In: Proceedings of the eleventh international conference on information and knowledge management, pp 582-589
9. Basu S, Bilenko M, Mooney RJ (2004) A probabilistic framework for semi-supervised clustering. In: Proceedings of ACM SIGKDD, Seattle, WA, pp 59-68
10. Bennett KP, Bradley PS, Demiriz A (2000) Constrained k-means clustering. Microsoft Research. Available via DIALOG. ftp://ftp.research.microsoft.com/pub/ tr/tr-2000-65.ps Accessed 9 Apr 2009
11. Berkhin P (2006) A survey of clustering data mining techniques. In: Kogan J, Nicholas C, Teboulle M (eds) Grouping multidimensional data. Springer, Berlin-Heidelberg, pp 25-71
12. Bilenko M, Basu S, Mooney RJ (2004) Integrating constraints and metric learning in semi-supervised clustering. In: Proceedings of the twenty-first international conference on machine learning, Banff, Canada, pp 81-88
13. Bradley PS, Fayyad UM (1998) Refining initial points for k-means clustering. In: Proceedings of the fifteenth international conference on machine learning, Morgan Kaufmann Publishers Inc., San Francisco, CA, pp 91-99
14. YM Cheung 2003 k*-Means: a new generalized k-means clustering algorithm Pattern Recog Lett 24 2883 2893 1073.68734 10.1016/S0167-8655(03) 00146-6 (Pubitemid 37027808)
15. Coplien JO, Harrison NB (2005) Organizational patterns of agile software development. Prentice-Hall PTR, Upper Saddle River, NJ
16. Coplien JO, Schmidt DC (1995) Pattern languages of program design. Addison-Wesley Professional, Reading, MA
17. Delibasic B, Kirchner K, Ruhland J et al (2008) A pattern-based data mining approach. In: Preisach C, Burckhardt H, Schmidt-Thieme L (eds) Data analysis, machine learning and applications. Springer, Berlin/Heidelberg, pp 327-334
18. Ding C, He X (2004) K-means clustering via principal component analysis. In: Proceedings of the twenty-first international conference on machine learning, ACM, New York, NY, p 29
19. Drossos N, Papagelis A, Kalles D (2000) Decision tree toolkit: a component-based library of decision tree algorithms. In: Zighed DZ, Komorowski J, Zytkow J (eds) Principles of data mining and knowledge discovery. Springer, Berlin/Heidelberg, pp 121-150
20. Freeman P (1983) Reusable software engineering: concepts and research directions. In: Workshop on reusability in programming, ITT Programming, Stratford, Connecticut, pp 2-16
21. Gamma E, Helm R, Johnson R, Vlissides JM (1995) Design patterns: elements of reusable object-oriented software. Addison-Wesley, Reading, MA
22. Hammerly G, Elkan C (2003) Learning the k in k-means. In: Proceedings of the seventeenth annual conference on neural information processing systems, pp 281-288
23. Han J, Kamber M (2006) Data mining: concepts and techniques, 2nd edn. Morgan Kaufmann Publishers, San Francisco
24. JA Hartigan MA Wong 1979 A k-means clustering algorithm Appl Stat 28 100 108 0447.62062 10.2307/2346830
25. Kohonen T (2001) Self-organizing maps. Springer, Berlin
26. Lea D (1994) Design patterns for avionics control systems. Available via DIALOG. http://gee.cs.oswego.edu/dl/acs/acs.pdf. Accessed 9 Apr 2009
27. A Likas N Vlassis JJ Verbeek 2002 The global k-means clustering algorithm Pattern Recog 36 451 461
28. Mierswa I, Wurst M, Klinkenberg R, Scholz M, Euler T (2006) YALE: rapid prototyping for complex data mining tasks. In: Proceedings of the 12th ACM SIGKDD international conference on knowledge discovery and data mining, ACM, New York, pp 935-940
29. Pelleg D, Moore A (2000) X-means: extending k-means with efficient estimation of the number of clusters. In: Proceedings of the seventeenth international conference on machine learning, Morgan Kaufmann, San Francisco, pp 727-734
30. NH Siddique BP Amavasai A Ikuta 2007 Special issue on hybrid techniques in AI Artif Intell Rev 27 71 201 10.1007/s10462-008-9088-z
31. Sommerville I (2004) Software engineering. Pearson, Boston
32. S Sonnenburg ML Braun CS Ong S Bengio L Bottou G Holmes Y LeCun KR Müller F Pereira CE Rasmussen G Rätsch B Schölkopf A Smola P Vincent J Weston RC Williamson 2007 The need for open source software in machine learning J Mach Learn Resour 8 2443 2466
33. D Steinley 2006 K-means clustering: a half-century synthesis British J Math Stat Psychol 59 1 34 10.1348/000711005X48266 2242281 (Pubitemid 43904225)
34. MC Su TK Liu HT Chang 2002 Improving the self-organizing feature map algorithm using an efficient initialization scheme Tamkang J Sci Eng 5 35 48
35. W Tracz 1990 Where does reuse start ACM SIGSOFT Softw Eng Notes 15 42 46 10.1145/382296.382702
36. T Winn P Calder 2002 Is this a pattern? IEEE Softw 19 (1 59 66 10.1109/52.976942 (Pubitemid 34069371)
37. Witten IH, Frank E (2005) Data mining: practical machine learning tools and techniques, 2nd edn. Morgan Kaufmann, San Francisco
38. EP Xing AY Ng MI Jordan S Russell 2003 Distance metric learning with application to clustering with side-information Adv Neural Inf Syst 15 521 528
39. Zaki M, De N, Gao F, Palmerini P, Parimi N, Pathuri J, Phoophakdee B, Urban J (2005) Generic pattern mining via data mining template library. In: Boulicaut JF, De Raedt L, Mannila H (eds) Constraint-based mining and inductive databases. European workshop on inductive databases and constraint based mining. Springer, Berlin/Heidelberg, pp 362-379
40. Zezula P, Amato G, Dohnal V, Batko M (2006) Similarity search: the metric space approach (Advances in database systems). Springer, New York