Mining of Chemical Data
Given a set of chemical compounds, chemical data mining is to characterize the compounds present in the data set and apply a variety of mining methods to discover relationships between the compounds and their biological and chemical activities.
In 1969, Hansch  introduced quantitative structure-activity relationship (QSAR) analysis which attempts to correlate physicochemical or structural properties of compounds with biological and chemical activities. These physicochemical and structural properties are determined empirically or by computational methods. QSAR prefers vectorial mappings of compounds, which are usually coded by existing physicochemical and structural fingerprints. Dehaspe et al.  applied inductive logic programming to predict chemical carcinogenicity by mining frequent substructures in chemical datasets, which identifies new structural fingerprints so that QSAR could build comprehensive analytical models.
- 2.Chang C-C, Lin C-J. LIBSVM: a library for support vector machines. 2001. Software available at http://www.csie.ntu.edu.tw/~cjlin/libsvm
- 3.Dehaspe L, Toivonen H, King R. Finding frequent substructures in chemical compounds. In: Proceedings of the 4th International Conference on Knowledge Discovery and Data Mining; 1998. p. 30–6.Google Scholar
- 5.Fröhlich H, Wegner J, Sieker F, Zell A. Optimal assignment kernels for attributed molecular graphs. In: Proceedings of the 22nd International Conference on Machine Learning; 2005. p. 225–32.Google Scholar
- 7.Kashima H, Tsuda K, Inokuchi A. Marginalized kernels between labeled graphs. In: Proceedings of the 20th International Conference on Machine Learning; 2003. p. 321–28.Google Scholar
- 8.Kramer S, Raedt L, Helma C. Molecular feature mining in HIV data. In: Proceedings of the 7th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining; 2001. p. 136–43.Google Scholar
- 9.Yan X, Yu PS, Han J. Graph indexing: a frequent structure-based approach. In: Proceedings of the ACM SIGMOD International Conference on Management of Data; 2004. p. 335–46.Google Scholar