Access the full text.
Sign up today, get DeepDyve free for 14 days.
P Berkhin (2006)
Grouping multidimensional data
Yiu-ming Cheung (2003)
k*-Means: A new generalized k-means clustering algorithmPattern Recognit. Lett., 24
M. Bilenko, Sugato Basu, R. Mooney (2004)
Integrating constraints and metric learning in semi-supervised clusteringProceedings of the twenty-first international conference on Machine learning
C. Alexander (2005)
The nature of order book 3: a vision of a living world
M. Su, Ta-Kang Liu, Hsiao-Te Chang (2002)
Improving the Self-Organizing Feature Map Algorithm Using an Efficient Initialization Scheme, 5
I Sommerville (2004)
Software engineering
J. Kogan, Charles Nicholas, M. Teboulle (2006)
Grouping Multidimensional Data - Recent Advances in Clustering
D. Lea (1998)
Design Patterns for Avionics Control Systems
Daniel Barbará, Yi Li, Julia Couto (2002)
COOLCAT: an entropy-based algorithm for categorical clustering
S. Sonnenburg, M. Braun, Cheng Ong, Samy Bengio, L. Bottou, G. Holmes, Yann LeCun, K. Müller, Fernando Pereira, C. Rasmussen, Gunnar Rätsch, B. Scholkopf, Alex Smola, Pascal Vincent, J. Weston, R. Williamson (2007)
The Need for Open Source Software in Machine LearningJ. Mach. Learn. Res., 8
C. Ding, Xiaofeng He (2004)
K-means clustering via principal component analysisProceedings of the twenty-first international conference on Machine learning
J. Holt, Simon Perry, M. Brownsword (2016)
What is a Pattern
P. Berkhin (2006)
A Survey of Clustering Data Mining Techniques
D. Steinley (2006)
K-means clustering: a half-century synthesis.The British journal of mathematical and statistical psychology, 59 Pt 1
(2004)
BIC: component found in X-Means, 2. PCA: component found in Ding and He ANDERSON-DARLING, component found in Hammerly and Elkan (2003), and 4. NONE: if no component is used
For Measure Distance " we identified four components
J. Coplien, Neil Harrison (2004)
Organizational Patterns of Agile Software Development
M. Adams, J. Coplien, Robert Gamoke, R. Hanmer, F. Keeve, K. Nicodemus (1996)
Fault-tolerant telecommunication system patterns
IH Witten, E Frank (2005)
Data mining: practical machine learning tools and techniques
Jiawei Han, M. Kamber (2000)
Data Mining: Concepts and Techniques
M Zaki, N De, F Gao, P Palmerini, N Parimi, J Pathuri, B Phoophakdee, J Urban (2005)
Constraint-based mining and inductive databases. European workshop on inductive databases and constraint based mining
C. Alexander (2005)
The nature of order book 4: the luminous ground
NH Siddique, BP Amavasai, A Ikuta (2007)
Special issue on hybrid techniques in AIArtif Intell Rev, 27
E. Xing, A. Ng, Michael Jordan, Stuart Russell (2002)
Distance Metric Learning with Application to Clustering with Side-Information
Christopher Alexander (1979)
The Timeless Way of Building
P. Zezula, G. Amato, Vlastislav Dohnal, Michal Batko (2005)
Similarity Search: The Metric Space Approach (Advances in Database Systems)
C. Alexander (2002)
A Vision Of A Living World
(2004)
and 4. ADJUST DISTANCE TO CONSTRAINTS: component found in MPCK-Means
A. Likas, N. Vlassis, J. Verbeek (2003)
The global k-means clustering algorithmPattern Recognit., 36
N. Drossos, Athanassios Papagelis, Dimitris Kalles (2000)
Decision Tree Toolkit: A Component-Based Library of Decision Tree Algorithms
M Adams, J Coplien, R Gamoke, R Hammer, F Keeve, K Nicodemus (1998)
The pattern handbook: techniques, strategies, and applications
J. Hartigan, M. Wong (1979)
A k-means clustering algorithm
N. Siddique, B. Amavasai, A. Ikuta (2007)
Editorial: Hybrid Techniques in AIArtificial Intelligence Review, 27
Constraint Mining, Jean-François Boulicaut, L. Raedt, H. Mannila (2006)
Constraint-Based Mining and Inductive Databases, European Workshop on Inductive Databases and Constraint Based Mining, Hinterzarten, Germany, March 11-13, 2004, Revised Selected Papers, 3848
C Alexander (2005)
The nature of order book 1: the phenomenon of life
Boris Delibasic, Kathrin Kirchner, Johannes Ruhland (2007)
A Pattern Based Data Mining Approach
B Delibasic, K Kirchner, J Ruhland (2008)
Data analysis, machine learning and applications
Greg Hamerly, C. Elkan (2003)
Learning the k in k-means
C. Alexander (2005)
The nature of order book 2: the process of creating life
I. Sommerville (2004)
Software Engineering (7th Edition)
Ingo Mierswa, M. Wurst, R. Klinkenberg, Martin Scholz, T. Euler (2006)
YALE: rapid prototyping for complex data mining tasks
D. Pelleg, A. Moore (2000)
X-means: Extending K-means with Efficient Estimation of the Number of Clusters
Sugato Basu, M. Bilenko, R. Mooney (2004)
A probabilistic framework for semi-supervised clusteringProceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining
D. Zighed, J. Komorowski, J. Zytkow (2001)
Principles of Data Mining and Knowledge Discovery, 2168
Tiffany Winn, P. Calder (2002)
Is This a Pattern?IEEE Softw., 19
S. Hong (1997)
Data miningFuture Gener. Comput. Syst., 13
W. Tracz (1990)
Where does reuse start?ACM SIGSOFT Softw. Eng. Notes, 15
David Arthur, Sergei Vassilvitskii (2007)
k-means++: the advantages of careful seeding
E. Gamma, Richard Helm, Ralph Johnson, J. Vlissides (1994)
Design patterns: elements of reuseable object-oriented software
(1983)
Reusable software engineering: concepts and research directions
Gary Yen (2010)
Self-Organizing Maps
Mohammed Zaki, Nilanjana De, Feng Gao, P. Palmerini, Nagender Parimi, Jeevan Pathuri, Benjarath Pupacdi, Joe Urban (2004)
Generic Pattern Mining Via Data Mining Template Library
RANGE: component found in K-means, and X-means, and 2. MAP: component found in Kohonen SOM
P. Bradley, U. Fayyad (1998)
Refining Initial Points for K-Means Clustering
Kristin Bennett, P. Bradley, A. Demiriz (2000)
Constrained K-Means Clustering
J. Vlissides, J. Coplien, N. Kerth (1995)
Pattern languages of program design
Clustering algorithms are well-established and widely used for solving data-mining tasks. Every clustering algorithm is composed of several solutions for specific sub-problems in the clustering process. These solutions are linked together in a clustering algorithm, and they define the process and the structure of the algorithm. Frequently, many of these solutions occur in more than one clustering algorithm. Mostly, new clustering algorithms include frequently occurring solutions to typical sub-problems from clustering, as well as from other machine-learning algorithms. The problem is that these solutions are usually integrated in their algorithms, and that original algorithms are not designed to share solutions to sub-problems outside the original algorithm easily. We propose a way of designing cluster algorithms and to improve existing ones, based on reusable components. Reusable components are well-documented, frequently occurring solutions to specific sub-problems in a specific area. Thus we identify reusable components, first, as solutions to characteristic sub-problems in partitioning cluster algorithms, and, further, identify a generic structure for the design of partitioning cluster algorithms. We analyze some partitioning algorithms (K-means, X-means, MPCK-means, and Kohonen SOM), and identify reusable components in them. We give examples of how new cluster algorithms can be designed based on them.
Artificial Intelligence Review – Springer Journals
Published: Oct 20, 2009
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.