In order to represent the semantics and concepts better, the ontology, as an efficient model, has penetrated into all research areas of the computer science and information technology. In recent years, the ontology framework has also been applied to biology, chemistry, pharmaceutics, geography, and other fields, and it has attracted much attention from the researchers. Multi-dividing ontology algorithm is one of the popular learning approaches for ontology applications in which the vertex set and sample data are divided into several parts. In this paper, we introduce a new ontology optimization scheming by means of representer theorem and kernel function, and the method is a kind of linear programming. Four experiments are designed for the application of ontology algorithms in different fields to test the effectiveness by comparing the implement data.
Franco-ContrerasJ. and CoatrieuxG., Robust watermarking of relational databases with ontology-guided distortion control, IEEE Transactions on Information Forensics and Security10(9) (2015), 1939–1952.
LeeD.H. and LeeH., Heejung Construction of holistic fuzzy cognitive maps using ontology matching method, Expert Systems With Applications42(14) (2015), 5954–5962.
4.
MissikoffM., SmithF. and TaglinoF., Ontology building and maintenance in collaborative virtual environments, Concurrency and Computation-practice & Experience27(11) (2015), 2796–2817.
5.
MustaphaN.B., AufaureM.A., ZghalH.B. and GhezalaH.B., Query-driven approach of contextual ontology module learning using web snippets, Journal of Intelligent Information Systems45(1) (2015), 61–94.
6.
AshrafJ., HussainO.K. and HussainF.K., Making sense from Big RDF Data: OUSAF for measuring ontology usage, Software-practice & Experience45(8) (2015), 1051–1071.
7.
OngsriS.L. and RoddickJ.F., Incorporating ontology-based semantics into conceptual modelling, Information Systems52 (2015), 1–20.
8.
SorokineA., SchlicherB.G., WardR.C., WrightM.C., KruseK.L., BhaduriB. and SlepoyA., An interactive ontologydriven information system for simulating background radiation and generating scenarios for testing special nuclear materials detection algorithms, Engineering Applications of Artificial Intelligence43 (2015), 157–165.
9.
GrozaT., KohlerS., MoldenhauerD., VasilevskyN., BaynamG., ZemojtelT., SchrimlL.M., KibbeW.A., SchofieldP.N., BeckT., VasantD., BrookesA.J., ZanklA., WashingtonN.L., MungallC.J., LewisS.E., HaendelM.A., ParkinsonH. and RobinsonP.H., The human phenotype ontology: Semantic unification of common and rare disease, American Journal of Human Genetics97(1) (2015), 111–124.
10.
CannataroM., GuzziP.H. and MilanoM., GoD: An R-package based on ontologies for prioritization of genes with respect to diseases, Journal of Computational Science9 (2015), 7–13.
11.
WangY.Y., GaoW., ZhangY.G. and GaoY., Ontology similarity computation use ranking learning method, The 3rd International Conference on Computational Intelligence and Industrial Application, Wuhan, China, 2010, pp. 20–22.
12.
HuangX., XuT.W., GaoW. and JiaZ.Y., Ontology similarity measure and ontology mapping via fast ranking method, International Journal of Applied Physics and Mathematics1(1) (2011), 54–59.
13.
GaoW. and LiangL., Ontology similarity measure by optimizing NDCG measure and application in physics education, Future Communication, Computing, Control and Management142 (2011), 415–421.
14.
GaoW., GaoY. and LiangL., Diffusion and harmonic analysis on hypergraph and application in ontology similarity measure and ontology mapping, Journal of Chemical and Pharmaceutical Research5(9) (2013), 592–598.
15.
GaoW. and XuT.W., Stability analysis of learning algorithms for ontology similarity computation, Abstract and Applied Analysis (2013), 9. Art. ID 174802. http://dx.doi.org/10.1155/2013-174802
16.
GaoW., GaoY. and ZhangY.G., Strong and weak stability of k-partite ranking algorithms, Information-An International Interdisciplinary Journal15(11A) (2012), 4585–4590.
17.
GaoW. and ZhuL.L., Gradient learning algorithms for ontology computing, Computational Intelligence and Neuroscience201412. Article ID 438291. http://dx.doi.org/10.1155/2014-438291
18.
GuiraoJ.L.G. and LuoA.C.J., New trends in nonlinear dynamics and chaoticity, Nonlinear Dynam84 (2016), 1–2.
19.
MaldonadoM., PradaJ. and SenosiainM.J., On linear operators and bases on Köthe spaces, Appl Math Nonl Sc1(2) (2016), 617–624.
20.
GaoW., GuiraoJ.L.G. and WuH.L., Two tight independent set conditions for fractional (g, f, m)-deleted graphs systems, Qual Theory Dyn Syst. In press.
21.
GaoW., GuoY. and WangK.Y., Ontology algorithm using singular value decomposition and applied in multidisciplinary, Cluster Comput19(4) (2016), 2201–2210.
22.
GaoW. and WangW.F., The eccentric connectivity polynomial of two classes of nanotubes, Chaos, Solitons Fract89 (2016), 290–294.
VeatchH.M., Approximate linear programming for networks: Average cost bounds, Computers & Operations Research63 (2015), 32–45.
25.
BorghettiA., NapolitanoF. and NucciC.A., Volt/var optimization of unbalanced distribution feeders via mixed integer linear programming, International Journal of Electrical Power & Energy Systems72 (2015), 40–47.
26.
SoyluB., Heuristic approaches for biobjective mixed 0-1 integer linear programming problems, European Journal of Operational Reserch245(3) (2015), 690–703.
27.
DalpassoM. and LanciaG., Estimating the strength of poker hands by integer linear programming techniques, Central European Journal of Operations Research23(3) (2015), 625–640.
28.
VeerapenN., OchoaG., HarmanM. and BurkeE.K., An integer linear programming approach to the single and bi-objective next release problem, Information and Software Technology65 (2015), 1–13.
29.
DinuzzoF., NeveM., De NicolaoG. and GianazzaU.P., On the representer theorem and equivalent degrees of freedom of SVR, Journal of Machine Learning Research8 (2007), 2467–2495.
30.
ArgyriouA., MicchelliC.A. and PontilM., When is there a representer theorem? vector versus matrix regularizers, Journal of Machine Learning Research10 (2009), 2507–2529.
31.
ZhangH.Z. and ZhangJ., Regularized learning in Banach spaces as an optimization problem: Representer theorems, Journal of Global Optimization54(2) (2012), 235–250.
32.
ScholkopfB., HerbrichR. and SmolaA.J., A generalized representer theorem, In Proceedings of the 14th Annual Conference on Computational Learning Theory and 5th European Conference on Computational Learning Theory, COLT 01/Euro-COLT 01, Springer-Verlag, London, UK, 2001, pp. 416–426.
33.
CastroM.H., MenegattoV.A. and PeronA.P., Integral operators generated by mercer-like kernels on topological spaces, Colloquium Mathematicum126(1) (2012), 125–138.
34.
JordaoT. and MenegattoV.A., Reproducing properties of differentiable mercer-like kernels on the sphere, Numerical Functional Analysis and Optimizaton33(10) (2012), 1221–1243.
35.
SteinwartI. and ScovelC., Mercer’s theorem on general domains: On the interaction between measures, kernels, and RKHSs, Constructive Approximation35(3) (2012), 363–417.
36.
FerreiraJ.C. and MenegattoV.A., Reproducing properties of differentiable Mercer-like kernels, Mathematische Nachrichten285(8-9) (2012), 959–973.
37.
FigueraC., Barquero-PerezO., Rojo-AlvarezJ.L., Martinez-RamonM., Guerrero-CuriesesA. and CaamanoA.J., Spectrally adapted Mercer kernels for support vector nonuniform interpolation, Signal Processing94 (2014), 421–433.
38.
BourrierA., PerronninF., GribonvalR., PerezP. and JegouH., Explicit embeddings for nearest neighbor search with Mercer kernels, Journal of Mathematical Imaging and Vision52(3) (2015), 459–468.
39.
CraswellN. and HawkingD., Overview of the TREC web track, In proceedings of the Twelfth Text Retrieval Conference, Gaithersburg, Maryland, NIST Special Publication, 2003, pp. 78–92.
40.
GaoW. and LanM.H., Ontology mapping algorithm based on ranking learning method, Microelectronics and Computer28(9) (2011), 59–61.
41.
GaoY. and GaoW., Ontology similarity measure and ontology mapping via learning optimization similarity function, International Journal of Machine Learning and Computing2(2) (2012), 107–112.
