EVIDENCE FROM AN IC PACKAGING FOUNDRY BY USING A TWO-PHASE CLUSTERING METHODOLOGY

REFERENCES

• Ahmad , K. , Vrusias , B. L. and Ledford , A. 2001 . Choosing feature sets for training and testing self-organizing maps: a case study . Neural Computing & Applications , 10 : 56 – 66 .
   Web of Science ®Google Scholar
• Balakrishnan , P. V. , Cooper , M. C. , Jacob , V. S. and Lewis , P. A. 1996 . Comparative performance of the FSCL neural net and k-means algorithm for market segmentation . European Journal of Operational Research , 93 : 346 – 357 .
   Web of Science ®Google Scholar
• Canetta , L. , Cheikhrouhou , N. and Glardon , R. 2005 . Applying two-stage SOM-based clustering approaches to industrial data analysis . Production Planning & Control , 16 : 774 – 784 .
   Web of Science ®Google Scholar
• Davies , D. L. and Bouldin , D. W. 1979 . A cluster separation measure . IEEE Transactions on Pattern Analysis and Machine Intelligence , 1 : 224 – 227 .
   PubMed Web of Science ®Google Scholar
• Forina , M. , Oliveros , C. C. , Casolino , C. and Casale , M. 2004 . Minimum spanning trees: ordering edges to identify clustering structure . Analytica Chimica Acta , 515 : 43 – 53 .
   Web of Science ®Google Scholar
• Grabmeier , J. and Rudolph , A. 2002 . Techniques of cluster algorithms in data mining . Data Mining and Knowledge Discovery , 6 : 303 – 360 .
   Web of Science ®Google Scholar
• Guha , S. , Rastogi , R. and Shim , K. 2000 . ROCK: a robust clustering algorithm for categorical attributes . Information Systems , 25 : 345 – 366 .
   Web of Science ®Google Scholar
• Guha , S. , Rastogi , R. and Shim , K. 2001 . CURE: an efficient clustering algorithm for large databases . Information Systems , 26 : 35 – 58 .
   Web of Science ®Google Scholar
• Jain , A. K. , Murty , M. N. and Flynn , P. J. 1999 . Data clustering: a review . ACM Computer Survey , 31 : 264 – 323 .
   Web of Science ®Google Scholar
• Jain , A. K. and Dubes , R. C. 1988 . Algorithms for Clustering Data NJ : Prentice Hall, Upper Saddle River .
   Google Scholar
• Jiang , M. F. , Tseng , S. S. and Su , C. M. 2001 . Two-phase clustering process for outliers detection . Pattern Recognition Letters , 22 : 691 – 700 .
   Web of Science ®Google Scholar
• Karypis , G. , Han , E. H. and Kumar , V. 1999 . CHAMELEON: a hierarchical clustering algorithm using dynamic modeling . IEEE Computer , 32 : 68 – 75 .
   Web of Science ®Google Scholar
• Kaufman , L. and Rousseeuw , P. J. 1990 . Finding Groups in Data: an Introduction to Cluster Analysis New York, NY : John Wiley & Sons .
   Google Scholar
• Kohonen , T. 1985 . The self-organization map . Proceedings of IEEE , 73 : 1551 – 1558 .
   Google Scholar
• Kohonen , T. 1995 . Self-Organizing Maps Berlin, , Germany : Springer-Verlag .
   Google Scholar
• Kuo , R. J. , Ho , L. M. and Hu , c. M. 2002 . Integration of self-organizing feature map and k-means algorithm for market segmentation . Computers & Operations Research , 29 : 1475 – 1493 .
   Web of Science ®Google Scholar
• Laszlo , M. and Mukherjee , S. 2005 . Minimum spanning tree partitioning algorithm for microaggregation . IEEE Transactions on Knowledge and Data Engineering , 17 : 902 – 911 .
   Web of Science ®Google Scholar
• Luo , F. , Khan , L. , Bastani , F. B. , Yen , I. L. and Zhou , J. 2004 . A dynamically growing self-organizing tree (DGSOT) for hierarchical clustering gene expression profiles . Bioinformatics , 20 : 2605 – 2617 .
   PubMed Web of Science ®Google Scholar
• MacQueen , J. 1967 . “ Some methods for classification and analysis of multivariate observations ” . In Proceedings of 5th Berkeley Symposium on Mathematical Statistics and Probability 281 – 297 . Berkeley, CA Jun. 21-Jul. 18, 1965 and Dec. 27, 1965-Jan. 7, 1966
   Google Scholar
• Ng , R. and Han , J. 1994 . “ Efficient and effective clustering method for spatial data mining ” . In Proceedings of International Conference on Very Large Data Base 144 – 155 . Santiago, Chile Sep. 12–15
   Google Scholar
• Pölzlbauer , G. , Dittenbach , M. and Rauber , A. 2006 . Advanced visualization of self-organizing maps with vector fields . Neural Networks , 19 : 911 – 922 .
   PubMed Web of Science ®Google Scholar
• Vesanto , J. and Alhoniemi , E. 2000 . Clustering of the self-organizing map . IEEE Transactions on Neural Networks , 11 : 586 – 600 .
   PubMed Web of Science ®Google Scholar
• Xu , Y. , Olman , V. and Xu , D. 2001 . Minimum spanning tree for gene expression data clustering . Genome Informatics , 12 : 24 – 33 .
   PubMedGoogle Scholar
• Xu , Y. , Olman , V. and Xu , D. 2002 . Clustering gene expression data using a graph-theoretic approach: an application of minimum spanning tree . Bioinformatics , 18 : 536 – 545 .
   PubMed Web of Science ®Google Scholar
• Zahn , C. T. 1971 . Graph-theoretical methods for detecting and describing gestalt clusters . IEEE Transactions on Computers , C-20 : 68 – 86 .
   Web of Science ®Google Scholar
• Zhang , T. , Ramakrishnan , R. and Livny , M. 1996 . “ BIRCH: an efficient data clustering method for very large databases ” . In Proceedings of International Conference on Management of Data 103 – 114 . Montreal, , Canada Jun. 4–6
   Google Scholar