65
Views
4
CrossRef citations to date
0
Altmetric
Articles

Ontology computation for graph spaces focus on partial vertex pairs

, ORCID Icon, &
Pages 153-163 | Received 22 Apr 2016, Accepted 06 Jun 2016, Published online: 24 Jun 2016

References

  • A. Argyriou, C.A. Micchelli, and M. Pontil, When is there a representer theorem? vector vs. matrix regularizers, J. Mach. Learn. Res. 10 (2009), pp. 2507–2529.
  • N. Craswell and D. Hawking, Overview of the TREC 2003 web track, in Proceedings of the twelfth text retrieval conference, NIST Special Publication, Gaithersburg, Maryland, 2003, pp.78–92.
  • F. Dinuzzo, M. Neve, G. De Nicolao, and U.P. Gianazza, On the representer theorem and equivalent degrees of freedom of SVR, J. Mach. Learn. Res. 8 (2007), pp. 2467–2495.
  • L. Exl, C. Abert, N.J. Mauser, T. Schrefl, H.P. Stimming, and D. Suess, FFT-based Kronecker product approximation to micromagnetic long-range interactions, Math. Models Methods Appl. Sci. 24 (2014), pp. 1877–1901.
  • Y. Gao, M.R. Farahani, and W. Gao, Ontology optimization tactics via distance calculating, Appl. Math. Nonlinear Sci. 1 (2016), pp. 154–169.
  • W. Gao and T.W. Xu, Stability analysis for ontology similarity computation, Abstr. Appl. Anal. 2013 (2013), 9p.
  • W. Gao, L. Yan, and L. Liang, Piecewise function approximation and vertex partitioning schemes for multi-dividing ontology algorithm in AUC criterion setting (I), Int. J. Comput. Appl. Technol. 50 (2014), pp. 226–231.
  • W. Gao and L.L. Zhu, Gradient learning algorithms for ontology computing, Comput. Intell. Neurosci. 2014 (2014), 12p.
  • W. Gao, L.L. Zhu, and K.Y. Wang, Ontology sparse vector learning algorithm for ontology similarity measuring and ontology mapping via ADAL technology, Int. J. Bifurcat. Chaos 25 (2015), 12p.
  • A. Hristoskova, V. Sakkalis, and G. Zacharioudakis, Ontology-driven monitoring of patient’s vital signs enabling personalized medical detection and alert, Sensors 14 (2014), pp. 1598–1628.
  • M. Ivanovic and Z. Budimac, An overview of ontologies and data resources in medical domains, Eexp. Res. Appl. 41 (2014), pp. 5158–15166.
  • P.K. Jha and J.D.H. Smith, Cycle Kronecker products that are representable as optimal circulants, Discrete Appl. Math. 181 (2015), pp. 130–138.
  • M.A. Kabir, J. Han, and J. Yu, User-centric social context information management: an ontology-based approach and platform, Pers. Ubiquit. Comput. 18 (2014), pp. 1061–1083.
  • S. Koehler, S.C. Doelken, and C.J. Mungall, The human phenotype ontology project: linking molecular biology and disease through phenotype data, Nucleic Acids Res. 42 (2014), pp. 966–974.
  • M. Lan, Y.J. Ren, J. Xu, and W. Gao, Ontology similarity computation using k-partite ranking method, J. Comput. Appl. 32 (2012), pp. 1094–1096.
  • S.C. Lopez, F.A. Muntaner-Batle, and M. Rius-Font, Magic coverings and the Kronecker product, Utilitas Math. 95 (2014), pp. 73–84.
  • S.V. Lototsky, Simple spectral bounds for sums of certain Kronecker products, Linear Algebra Appl. 469 (2015), pp. 114–129.
  • C.D. Martin and C.F. Van Loan, Shifted Kronecker product systems, SIAM J. Matrix Anal. A. 29 (2006), pp. 184–198.
  • I. Pak and G. Panova, Unimodality via Kronecker products, J. Algebr. Comb. 40 (2014), pp. 1103–1120.
  • J.M. Przydzial, B. Bhhatarai, and A. Koleti, GPCR ontology: development and application of a G protein-coupled receptor pharmacology knowledge framework, Bioinformatics 29 (2013), pp. 3211–3219.
  • H.Z. Zhang, and J. Zhang, Regularized learning in Banach spaces as an optimization problem: representer theorems, J. Global Optim. 54 (2012), pp. 235–250.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.