Heuristic method for searches on large data-sets organised using network models

References

• Altingovde, I.S., Demir, E., Can, F., & Ulusoy, O. (2008). Incremental cluster-based retrieval using compressed cluster-skipping inverted files. ACM Transactions on Information Systems, 26(3), 15:1–15:36.
   Web of Science ®Google Scholar
• Ansari, N., & Hou, E. (1997). Computational intelligence for optimization. Amsterdam: Kluwer Academic Publisher.
   Google Scholar
• Bordogna, G., & Paso, G. (2012). A quality driven hierarchical data divisive soft clustering for information retrieval. Knowledge-Based Systems, 26, 9–19.
   Web of Science ®Google Scholar
• Dalby, A., Nourse, J.G., Hounshell, W.D., Gushurst, A.K.I., Grier, D.L., Leland, B.A., & Laufer, J. (1992). Description of several chemical structure file formats used by computer programs developed at Molecular Design Limited. Journal of Chemical Information and Computer Sciences, 32(3), 244–255.
   Google Scholar
• Delaney, J.S. (2004). Aequeous solubility data for 1144 low molecular weight compounds. Journal of Chemical Information and Computer Sciences, 44, 1000–1005.
   PubMedGoogle Scholar
• Duda, R.O., Hart, P.E., & Stork, D.G. (2000). Pattern classification (2nd ed.). New York, NY: Wiley-Interscience.
   Google Scholar
• Flower, D.R. (1998). On the properties of bit string-based measures of chemical similarity. Journal of Chemical Information and Computer Sciences, 38, 379–386.
   Google Scholar
• Fritzke, B. (1995). A growing neural gas network learns topologies. Advances in Neural Information Processing Systems, 7, 625–632.
   Google Scholar
• Geman, S., & Geman, D. (1984). Stochastic relaxation, gibbs distributions, and the bayesian restoration of images. IEEE Transactions on Pattern Analysis and Machine Intelligence, 6(6), 721–741.
   PubMed Web of Science ®Google Scholar
• Gilks, W., Richardson, S., & Spiegelhalter, D. (1996). Markov chain Monte Carlo in practice: Interdisciplinary statistics. London: Chapman & Hall.
   Google Scholar
• Hastings, W.K. (1970). Monte Carlo sampling methods using Markov chains and their applications. Biometrika, 57(1), 97–109.
   Web of Science ®Google Scholar
• Kazius, J., McGuire, R., & Bursi, R. (2005). Derivation and validation of toxicophores for mutagenicity prediction. Journal of Medical Chemistry, 48, 312–320.
   PubMed Web of Science ®Google Scholar
• Kirkpatrick, S., Gelatt, C.D., & Vecchi, M.P. (1983). Optimization by simulated annealing. Science, 220(4598), 671–680.
   PubMed Web of Science ®Google Scholar
• Kohonen, T., Schroeder, M.R., & Huang, T.S. (Eds.). (2001). Self-organizing maps (3rd ed.). Secaucus, NJ: Springer-Verlag.
   Google Scholar
• Lipkus, A.H. (1999). A proof of the triangle inequality for the Tanimoto distance. Journal of Mathematical Chemistry, 26, 263–265.
   Web of Science ®Google Scholar
• Liu, X., & Croft, W.B. (2004). Cluster-based retrieval using language models. In Proceedings of the 27th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR ’04) (pp. 186–193). New York, NY: ACM.
   Google Scholar
• Manning, C.D., Raghavan, P., & Schtze, H. (2008). Introduction to information retrieval. New York, NY: Cambridge University Press.
   Google Scholar
• Munk Jrgensen, A., Langgrd, M., Gundertofte, K., & Pedersen, J. (2005). A fragment-weighted key-based similarity measure for use in structural clustering and virtual screening. QSAR & Combinatorial Science, 25(3), 221–234.
   Google Scholar
• Powell, G. (2005). Beginning database design. Wrox Beginning Guides. New york, NY: Wiley.
   Google Scholar
• Riesen, K. (2009). Classification and clustering of vector space embedded graphs (Ph.D. thesis). Bern University, Bern (Switzerland).
   Google Scholar
• Riesen, K., Neuhaus, M., & Bunke, H. (2007). Graph embedding in vector spaces by means of prototype selection. In F. Escolano and M. Vento (Eds.), Graph-Based Representation in Pattern Recognition, GbPRP (pp. 383–393). Berlin: Springer.
   Google Scholar
• Salton, G. (1991). Developments in automatic text retrieval. Science, 253, 974–979.
   PubMed Web of Science ®Google Scholar
• Wang, J., Hou, T., & Xu, X. (2009). Aqueous solubility prediction based on weighted atom type counts and solvent accessible surface areas. Journal of Chemical Information and Modeling, 49(3), 571–581.
   PubMed Web of Science ®Google Scholar
• Weininger, D. (1990). SMILES. 3. DEPICT. Graphical depiction of chemical structures. Journal of Chemical Information and Computer Sciences, 30(3), 237–243.
   Google Scholar
• Willett, P., Barnard, J.M., & Downs, G.M. (1998). Chemical similarity searching. Journal of Chemical Information and Computer Sciences, 38(6), 983–996.
   Google Scholar
• Xue, L., Godden, J.W., Stahura, F.L., & Bajorath, J. (2003). Profile scaling increases the similarity search performance of molecular fingerprints containing numerical descriptors and structural keys. Journal of Chemical Information and Computer Sciences, 43(4), 1218–1225.
   PubMedGoogle Scholar
• Zadegan, S.M.R., Mirzaie, M., & Sadoughi, F. (2013). Ranked k-medoids: A fast and accurate rank-based partitioning algorithm for clustering large data-sets. Knowledge-Based Systems, 39, 133–143.
   Web of Science ®Google Scholar