Li Yan
School of Engineer, Honghe University, Mengzi, 661100, People`s Republic of China
Junsheng Li
School of Engineer, Honghe University, Mengzi, 661100, People`s Republic of China
Wei Gao
School of Information Science and Technology, Yunnan Normal University, Kunming, 650500, People`s Republic of China
ABSTRACT
Classification algorithm is classical learning problem in computer science. Hypergraph, as a knowledge representation model, has widely used in finance, biology and information science. In this study, we extend some graph vertex classification analysis results to hypergraph. Specifically, we use the cut size of the classification to derive data-dependent bounds on the fraction of mistaken predictions for hypergraph vertex classification algorithm.
PDF References Citation
How to cite this article
Li Yan, Junsheng Li and Wei Gao, 2013. Notes on Vertex Classification Problem in Hypergraph Setting. Information Technology Journal, 12: 3309-3314.
DOI: 10.3923/itj.2013.3309.3314
URL: https://scialert.net/abstract/?doi=itj.2013.3309.3314
DOI: 10.3923/itj.2013.3309.3314
URL: https://scialert.net/abstract/?doi=itj.2013.3309.3314
REFERENCES
- Derbeko, P., R. El-Yaniv and R. Meir, 2004. Explicit learning curves for transduction and application to clustering and compression algorithms. J. Artif. Intell. Res., 22: 117-142.
Direct Link - Gao, W., Y. Gao and L. Liang, 2013. Diffusion and harmonic analysis on hypergraph and application in ontology similarity measure and ontology mapping. J. Chem. Pharmaceut. Res., 5: 592-598.
Direct Link - Gao, W. and L. Liang, 2011. Ontology concept similarity computation based on regularization framework of hypergraph. Microelectron. Comput., 5: 15-17.
Direct Link - Hanneke, S., 2006. An analysis of graph cut size for transductive learning. Proceedings of the 23rd International Conference on Machine Learning, June 25-29, 2006, Pittsburgh, PA., USA., pp: 393-399.
CrossRef - Jia, Z.Y. and W. Gao, 2013. Analysis for kernel method hypergraph vertex classification semi-supervised learning algorithm. J. Yunnan Normal Univ. (Nat. Sci. Edn.), 1: 46-49.
Direct Link - Karger, D.R., 1999. Random sampling in cut, flow and network design problems. Math. Oper. Res., 24: 383-413.
CrossRef - Wang, Y.Y., Z.Y. Jia and W. Gao, 2013. Generalization bound analysis for classification algorithm under semi-supervised hypergraph normalization laplacian dimension reduction. J. Nantong Univ. (Nat. Sci. Edn.), 2: 57-61.
Direct Link