討論

在演化式分類演算法中，透過各種不同的資料集做測試，在解析度不變的狀 況下，平行化的演算化分類法可以得到最佳的運算效率。但是在解析度變動的狀 況下，卻反而效率不佳。經過猜測，因為第一個分類工作的 Data Decomposition 部份，需要不斷的使用相同的函數而導致效率不佳的結果，因此如何將第一個分 類工作有效的使用 Data Decomposition 方法來加以平行化，是未來研究很好的議 題。

在平行化的部份，雖然 Open-MP 在開發上與其它撰寫多執行緖程式的方 法，是相對的簡單，但在程式設計者仍對於原單核心的程式，進行謹慎的評估與 分析，並在 Open-MP 的指令及參數上，必需仔細調校，否則可能導致無法加速，

甚至更費時的後果，Open-MP 仍在持續改版中，且多核心電腦的普及，相信未 來 Open-MP 在撰寫上，將更加方便簡單。

參考文獻

[1] David Olson, Yong Shi, 2008,資料探勘，魏志平譯，鄭滄洋譯，美商麥格羅．

希爾國際股份有限公司，台灣分公司。

[2] 吳東霖，2006，平行運算應用於最小平方有限元素法模擬二維及三維流場，

中原大學，碩士論文

[3] 吳秉璋，2009，以多核心處理器實現一個在密集性資料上具有良好效能的探 勘演算法，中華大學，碩士論文

[4] 芮雍能，2005，整合平行計算與生物演算法的技術應用於整體最佳化問題之 研究，國立暨南大學，碩士論文

[5] 羅宇傑，2006，格網運算環境於序列型樣探勘之設計與實作，樹德科技大學，

碩士論文。

[6] Peter Baer Galvin and Greg Gagne, “Operating System Concepts 6th edition”.

John Wiley & Sons, Inc, 2003.

[7] Gabriele Jost, Ruud van der Pas, “Using Open-MP: portable shared memory parallel programming”. England: The MIT Press Cambridge, 2007.

[8] Thomas Jablin, Dan Upton,David August, Kim Hazelwood, and Scott Mahlke,

“Multicore Compilation Strategies and Challenges”, IEEE Signal Processing Magazine, pp. 55-63, November, 2009.

[9] Shameem Akhter, Jason Roberts, “Multi-Core Programming: Increasing Performance through Software Multi-threading”, Intel Press, 2006.

[10] J. B. MacQueen, “Some Methods for classification and Analysis of Multivariate Observations”, 5-th Berkeley Symposium on Mathematical Statistics and Probability, pp281-297, 1967.

[11] J. C. Bezdek, “Pattern Recognition with Fuzzy Objective Function Algorithms”, New York: Plenum Press, 1981.

[12] Sungjin Park, Fredric M. Ham , Christopher G. Lowrie, “Discrimination of infrasound events using parallel neural network classification banks”, Nonlinear Analysis , 63 , e859 – e865 , 2005.

[13] Rhonda D. Phillips, Layne T. Watson, Randolph H. Wynne, “Hybrid image classification and parameter selection using a shared memory parallel algorithm”, Computers & Geosciences, 33, 875–897, 2007.

[14] Massimo Coppola, “High-performance data mining with skeleton-based structured parallel programming”, Parallel Computing, 28, 793–813, 2002.

[15] J. Ramírez, S. Dormido-Canto, J. Vega, JET-EFDA Contributors, “Parallelization of automatic classification systems based on support vector machines:

Comparison and application to JET database”, Fusion Engineering and Design, FUSION-5025, No. of Pages3, 2009.

[16] Michael Connor and Piyush Kumar, “Fast Construction of k-Nearest Neighbor Graphs for Point Clouds”, IEEE Transactions on Visualization And Computer Graphics, vol. 16, no. 4, July/August 2010.

[17] Mohammad Saniee Abadeh, Jafar Habibi, Zeynab Barzegar, Muna Sergi, “A parallel genetic local search algorithm for intrusion detection in computer networks”, Engineering Applications of Artificial Intelligence, 20, 1058–1069, 2007.

[18] Frank, A. & Asuncion, A. (2010). UCI Machine Learning Repository [http://archive.ics.uci.edu/ml]. Irvine, CA: University of California, School of Information and Computer Science.

[19] S. Haykin, “Neural Networks: A Comprehensive Foundation” Prentice Hall, 1999.

[20] R. Andrews, J. Diederich, and A. Tickle, “A Survey and Critique of Techniques

For Extracting Rules For Trained Artificial Neural Network”, Knowledge Based Systems, 8(6):373-389, 1995

[21] R. Agrawal, R. Srikant, “Fast algorithms for mining association rules”, Proc.

20th Intl. Conference on Very Large Databases, 487-499, 1994.

[22] Wenmin Li; Jiawei Han; Jian Pei, “CMAR: accurate and efficient classification based on multiple class-association rules”, Data Mining, 2001. ICDM 2001, Proceedings IEEE International Conference on 29 Nov.-2 Dec. 2001.

[23] M. Hearst. Trends & Controversies: “Support Vector Machines”, IEEE Intelligent Systems, 13(4):18-28, 1998.

[24] K. Bennett and C. Campbell, “Support Vector Machines: Hype or Hallelujah”, SIGKDD Explorations, U.K., 1995.

[25] C. J. C. Burges, “A Tutorial on Support Vector Machines for Pattern Recognition”, Data Mining and Knowledge Discovery, 2(2):121-167, 1998.

[26] T. M. Cover and P. E. Hart, “Nearest Neighbor Pattern Classification”

Knowledge Based Systems, 8(6):373-389, 1995.

[27] S. Cost and S. Salzberg, “A Weighted Nearest Neighbor Algorithm for Learning with Symbolic Features”, Machine Learning, 10:57-78,1993

[28] P. Domingos and M. Pazzani, “On the Optimality of the Simple Bayesian Classifier Under Zero-One Loss”, Machine Learning, 29(2-3):103-130, 1997.

[29] D. Heckerman, ”Bayesian Networks for Data Mining”, Data Mining and Knowledge Discovery, 1(1):79-119, 1997.

[30] Fogel, D.B., “On the philosophical differences between evolutionary algorithms and genetic algorithms”, In: Fogel, D.B. and Atmar, W., Editors, 1993. Proc. of the Second Annual Conference on Evolutionary Programming, Evolutionary Programming Society, La Jolla, CA, pp. 23–29.

[31] Fogel, D.B, “Asymptotic convergence properties of genetic algorithms and evolutionary programming”, Cybern. Syst. 25 3, pp. 389–407, 1994

[32] P.K. Sahoo, “Exergoeconomic analysis and optimization of a cogeneration system using evolutionary programming”, Appl Therm Eng 28 (2008), pp.

1580–1588

[33] Holland J.H., “Adaptation in natural and artificial system”, Ann Arbor, The University of Michigan Press, 1975.

-