分子挖掘

分子探勘（Molecule mining）為使用分子的数据挖掘。由於分子可由分子圖表示，這與圖形挖掘和結構化數據挖掘密切相關。主要問題是如何在區分數據實例時表示分子。其中一種方法是化學相似性度量，这在化學信息學領域具有悠久的傳統。

計算化學相似性的典型方法是使用化學指紋，但這会导致丟失有關分子拓撲的基礎信息。挖掘分子圖直接避免了這個問題。反向QSAR問題也適用於矢量映射問題。

 編碼(分子i,分子j\neq i) 

 核心方法 
 邊緣化圖形核心H. Kashima, K. Tsuda, A. Inokuchi, Marginalized Kernels Between Labeled Graphs, The 20th International Conference on Machine Learning (ICML2003), 2003. PDF
 最優分配核心H. Fröhlich, J. K. Wegner, A. Zell, Optimal Assignment Kernels For Attributed Molecular Graphs, The 22nd International Conference on Machine Learning (ICML 2005), Omnipress, Madison, WI, USA, 2005, 225-232. PDFH. Fröhlich, J. K. Wegner, A. Zell, Kernel Functions for Attributed Molecular Graphs - A New Similarity Based Approach To ADME Prediction in Classification and Regression, QSAR Comb. Sci., 2006, 25, 317-326. H. Fröhlich, J. K. Wegner, A. Zell, Assignment Kernels For Chemical Compounds, International Joint Conference on Neural Networks 2005 (IJCNN'05), 2005, 913-918. CiteSeer
 藥效核心P. Mahe, L. Ralaivola, V. Stoven, J. Vert, The pharmacophore kernel for virtual screening with support vector machines, J Chem Inf Model, 2006, 46, 2003-2014. 
 C++(and R)执行 结合
 標記圖之間的邊緣化圖形核心
 邊緣化核心的擴展
 谷本核(Tanimoto kernels)
 基於樹形圖的圖形內核
 基於用於分子3D結構的藥效核心

 最大值共同圖形方法(Maximum Common Graph methods) 
 MCS-HSCSJ. K. Wegner, H. Fröhlich, H. Mielenz, A. Zell, Data and Graph Mining in Chemical Space for ADME and Activity Data Sets, QSAR Comb. Sci., 2006, 25, 205-220.  (單MCS最高得分普通子結構（HSCS）排名策略)
 小分子子图檢測器（SMSD）S. A. Rahman, M. Bashton, G. L. Holliday, R. Schrader and J. M. Thornton, Small Molecule Subgraph Detector (SMSD) toolkit, Journal of Cheminformatics 2009, 1:12. -是一個基於Java的軟件庫，用於計算小分子之間的最大共同子圖（MCS）。這將有助於我們找到兩個分子之間的相似性/距離。 MCS也用於通過擊打分子來篩選藥物化合物，其分享共同的子圖（子結構）。

 編碼（分子i） 

 分子查詢方法 
 WarmrR. D. King, A. Srinivasan, L. Dehaspe, Wamr: a data mining tool for chemical data, J. Comput.-Aid. Mol. Des., 2001, 15, 173-181. L. Dehaspe, H. Toivonen, King, Finding frequent substructures in chemical compounds, 4th International Conference on Knowledge Discovery and Data Mining, AAAI Press., 1998, 30-36.
 AGMA. Inokuchi, T. Washio, T. Okada, H. Motoda, Applying the Apriori-based Graph Mining Method to Mutagenesis Data Analysis, Journal of Computer Aided Chemistry, 2001, 2, 87-92.A. Inokuchi, T. Washio, K. Nishimura, H. Motoda, A Fast Algorithm for Mining Frequent Connected Subgraphs, IBM Research, Tokyo Research Laboratory, 2002.
 PolyFARMA. Clare, R. D. King, Data mining the yeast genome in a lazy functional language, Practical Aspects of Declarative Languages (PADL2003), 2003.
 FSGM. Kuramochi, G. Karypis, An Efficient Algorithm for Discovering Frequent Subgraphs, IEEE Transactions on Knowledge and Data Engineering, 2004, 16(9), 1038-1051.M. Deshpande, M. Kuramochi, N. Wale, G. Karypis, Frequent Substructure-Based Approaches for Classifying Chemical Compounds, IEEE Transactions on Knowledge and Data Engineering, 2005, 17(8), 1036-1050.
 MolFeaC. Helma, T. Cramer, S. Kramer, L. de Raedt, Data Mining and Machine Learning Techniques for the Identification of Mutagenicity Inducing Substructures and Structure Activity Relationships of Noncongeneric Compounds, J. Chem. Inf. Comput. Sci., 2004, 44, 1402-1411. 
 MoFa/MoSST. Meinl, C. Borgelt, M. R. Berthold, Discriminative Closed Fragment Mining and Perfect Extensions in MoFa, Proceedings of the Second Starting AI Researchers Symposium (STAIRS 2004), 2004.T. Meinl, C. Borgelt, M. R. Berthold, M. Philippsen, Mining Fragments with Fuzzy Chains in Molecular Databases, Second International Workshop on Mining Graphs, Trees and Sequences (MGTS2004), 2004.T. Meinl, M. R. Berthold, Hybrid Fragment Mining with MoFa and FSG, Proceedings of the 2004 IEEE Conference on Systems, Man & Cybernetics (SMC2004), 2004.
 GastonS. Nijssen, J. N. Kok. Frequent Graph Mining and its Application to Molecular Databases, Proceedings of the 2004 IEEE Conference on Systems, Man & Cybernetics (SMC2004), 2004.
 LAZARC. Helma, Predictive Toxicology, CRC Press, 2005.
 ParMolM. Wörlein, Extension and parallelization of a graph-mining-algorithm, Friedrich-Alexander-Universität, 2006. PDF (包括 MoFa, FFSM, gSpan 和 Gaston)
 optimized gSpanK. Jahn, S. Kramer, Optimizing gSpan for Molecular Datasets, Proceedings of the Third International Workshop on Mining Graphs, Trees and Sequences (MGTS-2005), 2005.X. Yan, J. Han, gSpan: Graph-Based Substructure Pattern Mining, Proceedings of the 2002 IEEE International Conference on Data Mining (ICDM 2002), IEEE Computer Society, 2002, 721-724.
 SMIREPA. Karwath, L. D. Raedt, SMIREP: predicting chemical activity from SMILES, J Chem Inf Model, 2006, 46, 2432-2444. 
 DMaxH. Ando, L. Dehaspe, W. Luyten, E. Craenenbroeck, H. Vandecasteele, L. Meervelt, Discovering H-Bonding Rules in Crystals with Inductive Logic Programming, Mol Pharm, 2006, 3, 665-674 . 
 SAm/AIm/RHCP. Mazzatorta, L. Tran, B. Schilter, M. Grigorov, Integration of Structure-Activity Relationship and Artificial Intelligence Systems To Improve in Silico Prediction of Ames Test Mutagenicity, J. Chem. Inf. Model., 2006, ASAP alert. 
 AFGen<ref name="afgen06">N. Wale, G. Karypis. Comparison of Descriptor Spaces for Chemical Compound Retrieval and Classification, ICDM, '2006'', 678-689.</ref>
 gRedA. Gago Alonso, J.E. Medina Pagola, J.A. Carrasco-Ochoa and J.F. Martínez-Trinidad Mining Connected Subgraph Mining Reducing the Number of Candidates, In Proc. of ECML--PKDD, pp. 365–376, 2008.
 G-HashXiaohong Wang, Jun Huan , Aaron Smalter, Gerald Lushington, Application of Kernel Functions for Accurate Similarity Search in Large Chemical Databases , in BMC Bioinformatics Vol. 11 (Suppl 3):S8 2010.

 基於神經網絡特殊架構的方法 
 BPZ
 ChemNet
 CCS
 MolNet
 Graph machines

 参见 
 分子查询语言
 化學圖論

 参考文献 

 进一步阅读 
 Schölkopf, B., K. Tsuda and J. P. Vert: Kernel Methods in Computational Biology, MIT Press, Cambridge, MA, 2004.
 R.O. Duda, P.E. Hart, D.G. Stork, Pattern Classification, John Wiley & Sons, 2001. 
 Gusfield, D., Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology, Cambridge University Press, 1997。 
 R. Todeschini, V. Consonni, Handbook of Molecular Descriptors, Wiley-VCH, 2000'''. 

 参见 
 定量构效关系
 ADME
 分配系数

 外部链接 
 小分子子图檢測器(SMSD)  - 是一個基於Java的軟件庫，用於計算小分子之間的最大共同子圖（MCS）。
 2007年第五屆國際挖掘與學習研討會 
 2006年概览 
 分子開採（基礎化學專家系統）
 ParMol 和 碩士論文文檔 - Java - 開源 - 分佈式挖掘 - 基準算法庫
 TU慕尼黑 - 克萊默集團
 分子採礦（高級化學專家系統）
 DMax化學助理 -商业软件
 AFGen  -用於生成基於片段的描述符的軟件
Category:化学信息学
Category:计算化学
Category:数据挖掘