1.顏憶茹，張淳智，”物流管理”，華泰書局，民國87年6月
2.張有恒，”物流管理”，華泰書局，民國87年9月
3.顏嘉宏，2000，區位-途程問題啟發式解法之研究，大葉大學工業工程研究所碩士論文4.胡鐸清，1995，銀行分行經營管理實務，財團法人金融人員研究訓練中心
5.王賢能，1997，影響台灣地區綜合證卷商分公司設立地點之區位因素研究，大葉大學事業經營研究所碩士論文。6.林俊良，1997，我國銀行業增設分行之探討，中正大學國際經濟研究所碩士論文7.李國正，2000，公共設施區位之合理配置，交通大學交通運輸研究所碩士論文8.莊智雄，2002，救災圈域劃設決策支援系統之研究，朝陽科技大學，建築及都市設計研究所碩士論文9.黃彥文，1999，資料探勘之應用-會員消費特徵之發掘，屏東科技大學，資訊管理系碩士論文10.http://info.ntu.edu.tw/alumni/show_issue.asp?Issue=12&Content=7
11.王展昭，2002，色彩資訊用於彩色影像聚類之研究，中華大學，資訊工程學系碩士班碩士論文12.陳明仁，2002，權重MinMax彩色影像量化法之改進，國立交通大學，資訊科學學系碩士論文13.黃琮盛，2000，以個人消費行為預測信用卡詐欺事件之研究，中央大學，資訊管理研究所碩士論文14.江峰俊，2000，半導體製程之分類式資料探勘，國立台灣科技大學，電機工程系碩士論文15.陶如蘭，2002，以關聯回饋從事影像內容檢索， 國立臺灣大學，資訊工程學研究所碩士論文16.陳奕學，2002，空間資料叢集演算法之設計， 義守大學，資訊工程學系碩士論文17.蔡明憲，2002，以混合式資料探勘技術強化客戶保留之工作， 國立台灣科技大學，電子工程系碩士論文18.Aikens , C.H., Facility location models for distribution planning, European Journal of Operational Research,22,pp.263-279,1999
19.M. Koksalan, H. Sural, and O. Kirca, A location distribution application for a beer company, European Journal of Operational Research,80,pp.16-24,1995
20.E. Iakovou, C.M. Ip, C. Douligeris, and A. Korde, Optimal location and capacity of emergency cleanup equipment for oil spill response, European Journal of Operational Research,96,pp.72-80,1997
21.A.J. Swerse ,and L.S. Thakur, A integer programming model for locating vehicle emissions testing stations, Management Science,41,No.6, March 1995
22.Jian Pei, Jiawei Han, Runying Mao, 2000, ”CLOSET: An Efficient Algorithm for Mining Frequent Closed Itemsets”, Proceedings of the ACM SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery.
23.Zijian Zheng, Ron Kohavi, Llew Mason, 2001, ”Real World Performance of Association Rule Algorithms”, Proceedings of the Seventh ACM SIGKDD International Conference on Knowledge Discovery and Data Mining.
24.Bing Liu, Wynne Hsu and Yiming Ma School of Computing National University, 1999, ” Mining Association Rules with Multiple Minimum Supports”, Proceedings of the International Conference on Knowledge Discovery and Data Mining.
25.http://www.104poll.com.tw/Columan/Columan0719.asp#1
26.Qiang Ding, Qin Ding and William Perrizo, Decision Tree Classification of Spatial Data Streams Using Peano Count Trees, Proceedings of ACM Symposium on Applied Computing (SAC’02), Madrid, Spain, March 2002, pp. 413-417.
27.T. L. Jason Wang, Ma Qicheng, Dennis Shasha, and H. Cathy Wu. “Application of Neural Networks to Biological Data Mining: A Case Study in Protein Sequence Classification”, The Sixth ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, pp. 305-309, August 20-23, 2000 Boston, MA, USA.
28.Qicheng Ma and Jason T. L. Wang Recognizing Promoters in DNA using Bayesian Neural Networks , IASTED International Conference of Artificial Intelligence and Soft Computing , pp. 301--305, August, 9-12, 1999, Honolulu, HI USA.
29.Jiawei Han, Micheline Kamber, Data Mining concepts and techniques
30.黃仁傑，2001，使用資料探勘技術以有效輔助資料搜尋，中原大學，資訊管理研究所碩士論文31.林煌仁，2000，應用叢聚及基因法則之影像資料庫系統索引及搜尋策略，國立中正大學，資訊工程研究所碩士論文32.V.G. Laria, R. Griffiths, G. Winstanley ,Application of A Clustering Algorithm to Recover Topic Content in an Unstructured Text-Based Environment, http://www.tzi.de/grp/i3/ws-ecai98/papers.html
33.V. Estivill-Castro and M. E. Houle, Robust distance-based clustering with applications to spatial data mining, Algorithm (special issue on algorithms for geographical information), to appear October 25,1999
34.Ananthakrishnan, K.S., ‘A Comparison of Modified K-Means (MKM) and NN Based Real Time Adaptive Clustering Algorithms for Articulatory Space Codebook Formation’, in Proceedings of the Fourth International Conference on Spoken Language Processing, Philadelphia, 3-6 October 1996, ICSPL 96, 1249-1252
35.陳垂呈，2001，應用布林運算快速分群化交易項目，TANET(台灣區網際網路研討會)
36.饒仁達，2000，一種新的分群方法，國立台灣海洋大學，電機工程學系碩士論文37.P.S. Bradley and U.M. Fayyad, “Refining Initial Points for K-Means Clustering “, Proceedings of the Fifteenth International Conference on Machine Learning ICML98, pages 91-99. Morgan Kaufmann, San Francisco, 1998
38.張金華，2000，適用於資料挖掘的屬性挑選與快速k-means組群化演算法，逢甲大學，資訊工程研究所碩士論文39.K. Alsabti, S. Ranka, V. Singh, An Efficient K-Means Clustering Algorithm, PPS/SPDP Workshop on High performance Data Mining,1997
40.K. Alsabti, S. Ranka, V. Singh, An Efficient Space-Partitioning Based Algorithm for the K-Means Clustering, 1997
41.劉聰仁，1999，輻射基底函數網路學習效率之改良研究(On The Improvement of Radial Basis Function Neural Network Training Efficiency)，行政院國家科學委員會專題研究計畫成果報告，中華民國八十八年，NSC 88-2213-E-328-001-。
42.陳彥傑、宋國城，以碎形為基礎的臺灣地形分區，環境與世界，vol.3，pp.1-15，民國88年11月43.魏志平、張勳騰、李彥賢，通信資料探勘：目標行銷之應用(Telecommunications Data Mining for Target Marketing)， 電腦學刑，vol.12 No.4， PP.60-74，民國89年12月
44.鍾文杰，2000，整合自組織映射圖網路與遺傳演算法為輔之K-Means於顧客關係管理中，國立台北科技大學，生產系統工程與管理研究所碩士論文45.葉士良，2000，模糊分類系統之設計，淡江大學，電機工程學系碩士論文46.D. Boley, M. Gini, R. Gross, E.H. Han, K. Hastings, G. Karypis, V. Kumar, B. Mobasher and J. Moore, Partitioning-Based Clustering for Web Document Categorization , Decision Support Systems Journal, 1999
47.P. Bellot and M. El-Beze, A clustering method for information retrieval, Technical Report IR-0199. Laboratoire d’Informatique d’Avignon, France, 1999
48.Inderjit S. Dhillon and Dharmendra S. Modha, “A Data-clustering Algorithm on Distributed Memory Multiprocessors,” Proceedings of Large-scale Parallel KDD Systems Workshop, ACM SIGKDD, August 15-18, 1999 (also appears Large-Scale Parallel Data Mining, Lecture Notes in Artificial Intelligence, Volume 1759, pp. 245-260, 2000)
49.Tian Zhang, Raghu Ramakrishnan, Miron Livny , BIRCH: an efficient data clustering method for very large databases, Proceedings of the 1996 ACM SIGMOD international conference on Management of data , pp. 103-114,1996
50.M. M. Breunig, H.-P. Kriegel, J. Sander, “Fast Hierarchical Clustering Based on Compressed Data and OPTICS”, Proc. of 4th European Conference on Principles of Data Mining and Knowledge Discovery (PKDD 2000), Lyon, France, Lecture Notes in Computer Science (LNAI 1910), pp. 232-242, Springer Verlag, 2000
51.R. Unrau, O. Krieger, B. Gamsa, M. Stumm, Hierarchical clustering：A structure for scalable multiprocessor operating system design, Journal of Supercomputing, will appear 1995
52.W. Wang, Yang, R. Muntz. STING: A Statistical Information Grid Approach to Spatial Data Mining. VLDB 1997
53.Schikuta. Grid clustering: An efficient hierarchical clustering method for very large data sets. Proc. of the Int. Conf. on Pattern Recognition. 1996:101-105. CRPC-TR93358
54.R. Agrawal, J. Gehrke, D. Gunopulos, P. Raghavan. Automatic Subspace Clustering of High Dimensional Data for Data Mining Applications. SIGMOD 1998: 94-105
55.G. Sheikholeslami, S. Chatterjee, and A. Zhang. WaveCluster: A Multi-Resolution Clustering Approach for Very Large Spatial Databases. 24th International Conference on Very Large Data Bases, New York City. 1998
56.M. Ester, H-P. Kriegel, J. Sander and X. Xu. A Density-Based Algorithm for Discovering Clusters in Large Spatial Databases with Noise. Proc. of the Second International Conference on Knowledge Discovery and Data Mining, Portland, Oregon. 1996. AAAI Press
57.M. Ankerst, M. M. Breunig, H-P. Kriegel J. Sander. OPTICS: Ordering Points To Identify the Clustering Structure. SIGMOD 1999
58.Hinneburg and D.A. Keim. An efficient approach to clustering in large multimedia databases with noise. In proc. 1998 Int. Conf. Knowledge Discovery and Data Mining(KDD’98), pages 58-65, New York, Aug.1998
59.M. Ester, Kriegel H.-P., Sander J., Xu X.: Density-Connected Sets and their Application for Trend Detection in Spatial Databases, Proc. 3rd Int. Conf. on Knowledge Discovery and Data Mining (KDD’97), Newport Beach, CA, pp. 10-151997
60.Tom M. Mitchell, MACHINE LEARNING, The McGraw-Hill Companies, Inc., 1997
61.王秀瑩，1999，咖啡連鎖店市場區隔及其消費行為之研究，國立東華大學，企業管理學系碩士班碩士論文62.林麗玲，2002，我國網路咖啡業競爭策略之研究，實踐大學，企業管理研究所碩士論文63.楊淑惠，2002，網路書店消費行為研究，國立交通大學，經營管理研究所，碩士論文