113
Views
33
CrossRef citations to date
0
Altmetric
Original Articles

Analysis of k-partite ranking algorithm in area under the receiver operating characteristic curve criterion

&
Pages 1527-1547 | Received 09 Aug 2015, Accepted 09 Mar 2017, Published online: 10 May 2017

References

  • G. Adomavicius and J. Zhang, Classification, ranking, and top-k stability of recommendation algorithms, INFORMS. J. Comput. 28(1) (2016), pp. 129–147. doi: 10.1287/ijoc.2015.0662
  • S. Agarwal, Learning to rank on graphs, Mach. Learn. 81 (2010), pp. 333–357. doi: 10.1007/s10994-010-5185-8
  • S. Agarwal, T. Graepal, R. Herbrich, S. Har-Peled, and D. Roth, Generalization bounds for the area under the ROC curve, J. Mach. Learn. Res. 6 (2005), pp. 393–425.
  • S. Agarwal and P. Niyogi, Generalization bounds for ranking algorithms via algorithmic stability, J. Mach. Learn. Res. 10 (2009), pp. 441–474.
  • A. Bouzeghoub and A. Elbyed, Ontology mapping for web-based educational systems interoperability, Interoperab. Bus. Inf. Syst. 1(1) (2006), pp. 73–84.
  • F. Cucker and S. Smale, On the mathematical foundations of learning, Bull. Amer. Math. Soc. 39 (2001), pp. 1–49. doi: 10.1090/S0273-0979-01-00923-5
  • F. Cucker and D.X. Zhou, Learning Theory: An Approximation Theory Viewpoint, Cambridge University Press, Cambridge, Mass, USA, 2007.
  • L. Devroye, Exponential inequalities in nonparametric estimation, Nonparametric functional estimation and related topics, NATO ASI Series, Kluwer Academic Publishers, 1991, pp. 31–44.
  • L. Devroye, GyörfiL., and G. Lugosi, A Probabilistic Theory of Pattern Recognition, Springer-Verlag, New York, 1996.
  • J. Duchi, L. Mackey, and M.I. Jordan, The asymptotics of ranking algorithms, Ann. Stat. 4 (2013), pp. 2292–2323. doi: 10.1214/13-AOS1142
  • F. Fonseca, M. Egenhofer, C. Davis, and G. Camara, Semantic granularity in ontology-driven geographic information systems, AMAI Ann. Math. Artif. Intell. 36(1–2) (2002), pp. 121–151. doi: 10.1023/A:1015808104769
  • Y. Freund, R. Iyer, R. Schapire, and Y. Singer, An efficient boosting algorithm for combining preferences, J. Mach. Learn. Res. 4 (2003), pp. 933–969.
  • W. Gao and T.W. Xu, Stability analysis of learning algorithms for ontology similarity computation, Abstr. Appl. Anal., 2013, Art. ID 174802, 9 pp.
  • W. Gao and D.X. Zhou, Convergence of spectral clustering with a general similarity function, Sci. China Math. 42 (2012), pp. 985–994.
  • W. Gao and L.L. Zhu, Gradient learning algorithms for ontology computing, Comput. Intell. Neurosci., 2014, Art. ID 438291, 12 pp.
  • B. Hu, S. Dasmahapatra, P. Lewis, and N. Shadbolt, Ontology-based medical image annotation with description logics, in 15th IEEE International Conference on Tools with Artificial Intelligence, California, Sacramento, USA, 2003, pp. 77–82.
  • K. Jarvelin and J. Kekalainen, IR Evaluation methods for retrieving highly relevant documents, in Proceedings of the 23rd Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, 2000, pp. 41–48.
  • P. Lambrix and A. Edberg, Evaluation of ontology tools in bioinformatics, In Paci Symposium on Biocomputing, IEEE Computer Society Press, New York, 2003, pp. 529–600.
  • N. Lasierra, A. Alesanco, and J. Garcia, Designing an architecture for monitoring patients at home: ontologies and web services for clinical and technical management integration, IEEE. J. Biomed. Health. Inform. 18(3) (2014), pp. 896–906. doi: 10.1109/JBHI.2013.2283268
  • Z. Li, H.S. Guo, Y.S. Yuan, and L.B. Sun, Ontology representation of online shopping customers knowledge in enterprise information, Appl. Mech. Mater. 483 (2014), pp. 603–606.
  • C. McDiarmid, On the method of bounded differences, in Surveys in Combinatorics 1989, Cambridge University Press, Cambridge, Mass, USA, 1989, pp. 148–188.
  • Y.L. Ma, L. Liu, K. Lu, B.H. Jin, and X.J. Liu, A graph derivation based approach for measuring and comparing structural semantics of ontologies, IEEE Trans. Knowl. Data Eng. 26(5) (2014), pp. 1039–1052. doi: 10.1109/TKDE.2013.120
  • P. Mork and P. Bernstein, Adapting a generic match algorithm to align ontologies of human anatomy, in 20th International Conference on Data Engineering, IEEE Computer Society Press, New York, 2004, pp. 787–790.
  • N. Nguyen and R. Caruana, Improving classification with pairwise constraints: a margin-based approach, Mach. Learn. Knowl. Discov. Databases 5212 (2008), pp. 113–124.
  • T. Pizzuti, G. Mirabelli, M.A. Sanz-Bobi, and F. Gomez-Gonzalez, Food Track & Trace ontology for helping the food traceability control, J. Food Eng. 120(1) (2014), pp. 17–30. doi: 10.1016/j.jfoodeng.2013.07.017
  • C. Rudin, C. Cortes, M. Mohri, and R.E. Schapire, Margin-based ranking meets boosting in the middle, in Proceedings of the 18th Annual Conference on Learning Theory, Lecture Notes in Computer Science, Vol. 3559, 2005, pp. 63–78.
  • C. Rudin and R.E. Schapire, Margin-based ranking and an equivalence between AdaBoost and RankBoost, J. Mach. Learn. Res. 10 (2009), pp. 2193–2232.
  • R. Santodomingo, S. Rohjans, M. Uslar, J.A. Rodriguez-Mondejar, and M.A. Sanz-Bobi, Ontology matching system for future energy smart grids, Eng. Appl. Artif. Intell. 32 (2014), pp. 242–257. doi: 10.1016/j.engappai.2014.02.005
  • S. Smale and D.X. Zhou, Geometry on probability spaces, Constr. Approx. 30 (2009), pp. 311–323. doi: 10.1007/s00365-009-9070-2
  • V. Vapnik, Estimation of Dependences Based on Empirical Data, Springer-Verlag, New York, 1982.
  • J. Xu, S. Napel, H. Greenspan, C. Beaulieu, N. Agrawal, and D. Rubin, Quantifying the margin sharpness of lesions on radiological images for content-based image retrieval, Med. Phys. 39 (2012), pp. 5405–5418. doi: 10.1118/1.4739507
  • Y. Yue, T. Finley, F. Radlinski, and T. Joachims, A support vector method for optimizing average precision, in Proceedings of the 30th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, 2007, pp. 271–278.
  • H. Zeng and Y.M. Cheung, Semi-supervised maximum margin clustering with pairwise constraints, IEEE Trans. Knowl. Data Eng. 24 (2012), pp. 926–939. doi: 10.1109/TKDE.2011.68
  • D.X. Zhou, The covering number in learning theory, J. Complex. 18 (2002), pp. 739–767. doi: 10.1006/jcom.2002.0635
  • D.X. Zhou, Capacity of reproducing kernel spaces in learning theory, IEEE Trans. Inf. Theory 49 (2003), pp. 1743–1752. doi: 10.1109/TIT.2003.813564

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.