參考文獻 |
[1] 陳桂慧,民89,WWW代理伺服器的部分快取置換策略,元智大學電機與資訊工程研究所碩士論文。
[2] 江巧雯,民90,長時間序列叢集化之研究,元智大學資訊管理研究所碩士論文。
[3] 許毅嘉,民90,關聯法則應用於代理伺服器上之快取置換機制,國立中興大學資訊科學研究所碩士論文。
[4] 黃毓莉,民90,行動商務中快取機制之研究,國立交通大學資訊管理研究所碩士論文。
[5] 黃安賜,民90,階層式代理伺服器以不同階層為基礎之動態雜湊負載平衡機制,元智大學資訊工程學系碩士論文。
[6] 王敏傑,民91,一個針對快取以使用者行為為基礎之預先擷取機制,國立交通大學資訊管理研究所碩士論文。
[7] 林育臣,民91,群聚技術之研究,朝陽科技大學資訊管理研究所碩士論文。
[8] 陸津華,民92,挖掘高獲利性關聯規則之研究,私立東海大學資訊工程與科學研究所碩士論文。
[9] 蘇宇威,民92,利用資料探勘方法建立自動化代理伺服器預載排程,銘傳大學資訊管理研究所碩士論文。
[10] 黃汝棋,民92,考慮文件資訊價值之快取置換策略,朝陽科技大學資訊管理研究所碩士論文。
[11] 白典正,民92,一個以內容為基礎的代理伺服器演算法,國立中央大學資訊管理研究所碩士論文。
[12] 中央大學電子計算機中心:http://www.cc.ncu.ed.tw/
[13] Squid代理伺服器:http://www.squid-cache.org/
[14] Net Beans網頁http://www.netbeans.org/
[15] 尹相志,民92,SQL 2000 Analysis Service資料採礦服務,維科圖書有限公司。
[16] 經濟部技術處產業電子化指標與標準研究計畫/資策會ACI-FIND
[17] Cherkasova, L. (1998). “Improving WWW Proxies Performance with Greedy-Dual Size-Frequency Caching Policy,” HP Computer Systems Laboratory.
[18] Cooley, R., B. Mobasher, and J. Srivastava (1997). “Web Mining: Information and Pattern Discovery on the World Wide Web,” Proceedings of the 9th IEEE International Conference on Tools with Artificial Intelligence.
[19] Ester, M., H. P. Kriegel, J. Sander and X. Xu (1996). “Density-Based Algorithm for Discovering Clusters in Large Spatial Databases with Noise,” Proceedings of the 1996 International Conference Knowledge Discovery and Data Mining, 226-231.
[20] Evangelos, P. M. and C. E. Chronaki (1998). “A Top-10 Approach to Prefetching on the Web,” Processings of the INET’98 Geneva, Swizerland, 276-290.
[21] Guha, S., R. Rastogi, and K. Shim (1998). “CURE: An Efficient Clustering Algorithm for Large Databases,” Proceedings of the 1998 ACM-SIGMOD International Conference Management of Data (SIGMOD’98), 73-84.
[22] Guha, S., R. Rastogi, and K. Shim (1999). “ROCK: A Robust Clustering Algorithm for Categorical Attribute,” Proceedings of the 1999 International Conference Data Engineering (ICDE’99), 512-521.
[23] Park, J. S., M. S. Chen, and P. Yu (1995). “An Efficient Hash-Based Algorithm for Data Mining Association Rules,” Proceedings of ACM SIGMOD, 175-186.
[24] Lorenzetti, P., L. Rizzo, and L. Vicisano (2000). “Replacement Policies for A Proxy Cache,” IEEE / ACM Transaction on Networking, 8 (2), 158-170.
[25] Swaminathan, N. and S.V. Raghavan (2000). “Intelligent Prefetch in WWW Using Client Behavior Characterization,” International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems, 13-19.
[26] Agrawal, R., and R. Srikant (1994). “Fast Algorithms for Mining Association Rules,” Proceedings of the 20th International Conference on Very Large Databases.
[27] Schechter, S., M. Krishnan, and M. D. Smith (1998). “Using Path Predict HTTP Request,” Proceedings of the 7th International World Wide Web Conference.
[28] Seung Won Shin, Byeong Hag Seong, and Daeyeon Park (2000). “Improving World-Wide-Web Performance Using Domain-Top Approach to Prefetching,” Proceedings of the 4th International Conference/Exhibition on High Performance Computing in the Asia-Pacific Region, 2, 738-746.
[29] Spiliopoulou, M., and L. C. Faulstich (1998). “WUM: A Tool for Web Utilization Analysis,” In EDBT Workshop WebDB'98.
[30] Wang W., Yang and R. Muntz (1997). “STING: A Statistical Information grid Approach to Spatial Data Mining,” Proceedings of the 1997 International Conference Very Large Data Bases (VLDB’97), 186-195.
[31] Witten, I. H. and E. Frank (2000). Data Mining, Morgan Kaufmann Publishers., San Francisco |