| 期刊論文| 1. | Madeira, S. C.、Oliveira, A. L.(2004)。Biclustering algorithms for biological data analysis:a survey。IEEE/ACM Transactions on Computational Biology and Bioinformatics，1(1)，24-45。   | | 2. | Hartigan, J. A.(1972)。Direct Clustering of a Data Matrix。J. Am. Statistical Assoc. (JASA)，67(337)，123-129。 | | 3. | Segal, E.、Taskar, B.、Gasch, A.、Friedman, N.、Koller, D.(2001)。Rich Probabilistic Models for Gene Expression。Bioinformatics，17，243-252。 | | 4. | Sheng, Q.、Moreau, Y.、De Moor, B.(2003)。Biclustering Microarray Data by Gibbs Sampling。Bioinformatics，19，196-205。 | | 5. | Jermaine, C.(2005)。Finding the Most Interesting Correlations in a Database:How Hard Can it Be?。INFORM. SYST，30，21-46。 | | 6. | Rice, M. D.、Siff, M.(2003)。Clusters, Concepts, and Pseudometrics。Electronic Notes in Theoretical Computer Science，40，1-4。 | | 7. | Park, Jong-Soo、Chen, Ming-Syan、Yu, Philips S.(1997)。Using a hash-based method with transaction trimming for mining association rules。IEEE Transactions on Knowledge and Data Engineering，9(5)，813-825。 | | 8. | Agarwal, R. C.、Aggarwal, C. C.、Prasad, V. V. V.(2001)。A tree projection algorithm for generation of frequent itemsets。Journal of Parallel and Distributed Computing，61(3)，350-371。 | 會議論文| 1. | Szpankowski, Park, G.(2005)。Analysis of Biclusters with Applications to gene Expression Data。Conference on Analysis of Algorithms，267-274。 | | 2. | Savasere, A.、Omiecinski, E.、Navathe, S.(1995)。An efficient algorithm for mining association rules in large databases。21st International Conference on Very Large Data Bases。Zurich, Switzerland。432-443。 | | 3. | Burdick, D.、Calimlim, M.、Gehrke, J.(2001)。MAFIA: a maximal frequent itemset algorithm for transactional databases。The 17th International Conference on Data Engineering。Heidelberg。443-452。 | | 4. | Gouda, K.、Zaki, M. J.(2000)。Efficiently mining maximal frequent itemsets。IEEE International Conference on Data Mining。San Jose, USA。163-170。 | | 5. | Zou, Q.、Chu, W. W.、Lu, B.(2002)。SmartMiner: a depth first algorithm guided by tail information for mining maximal frequent itemsets。IEEE International Conference on Data Mining。Maebashi City, Japan。570-577。 | | 6. | Agrawal, R.、Srikant, R.(1994)。Fast algorithms for mining association rules in large database。The 20th International Conference on Very Large Data Bases。Morgan Kaufmann Publishers Inc.。478-499。 | 研究報告| 1. | Tibshirani, R.、Hastie, T.、Eisen, M.、Ross, D.、Botstein, D.、Brown, P.(1999)。Clustering Methods for the Analysis of DNA Microarray Data, technical report。Dept. of Health Research and Policy, Dept. of Genetics, and Dept. of Biochemestry, Stanford Univ.。 | 其他| 1. | 生物晶片是台灣生物科技的明星產業，http://www.ncku.edu.tw/~cbst/biochip.htm。 延伸查詢 | | 2. | Software for Associations Discovery Home Page，http://www.kdnuggets.com/ software/associations.html。 | |